Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
35
click to vote
STOC
2005
ACM
favorite
Email
discuss
report
107
views
Algorithms
»
more
STOC 2005
»
On obfuscating point functions
14 years 11 months ago
Download
eprint.iacr.org
We study the problem of obfuscation in the context of point functions (also known as delta functions). A point function is a Boolean function that assumes the value 1 at exactly one point. Our main results are as follows:
Hoeteck Wee
Real-time Traffic
Algorithms
|
Point Function
|
Point Functions
|
STOC 2005
|
claim paper
Related Content
»
Obfuscating Point Functions with Multibit Output
»
On the Impossibility of Obfuscation with Auxiliary Input
»
Obfuscation of Hyperplane Membership
»
Collusion Resistant Obfuscation and Functional Reencryption
»
Securely Obfuscating Reencryption
»
Slicing Aided Design of Obfuscating Transforms
»
Metricsbased Evaluation of Slicing Obfuscations
»
On BestPossible Obfuscation
»
Specifying Imperative Data Obfuscations
more »
Post Info
More Details (n/a)
Added
03 Dec 2009
Updated
03 Dec 2009
Type
Conference
Year
2005
Where
STOC
Authors
Hoeteck Wee
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision