2014 · 99 citations · 21 references
ComputingComputer ScienceMathematicsAlgorithmsArtificial IntelligenceCryptographyComputability TheoryCryptographic ComplexityHash FunctionsComputational SecurityHardnessOne-way FunctionsSecurity Proofs
A function f is extractable if it is possible to algorithmically "extract," from any adversarial program that outputs a value y in the image of f; a preimage of y. When combined with hardness properties such as one-wayness or collision-resistance, extractability has proven to be a powerful tool. However, so far, extractability has not been explicitly shown. Instead, it has only been considered as a non-standard knowledge assumption on certain functions.
21
Oded Goldreich, Silvio Micali, Avi Wigderson · 1987 · 3.5K citations
How to construct random functions
Oded Goldreich, Shafi Goldwasser, Silvio Micali · Journal of the ACM · 1986 · 2.1K citations · Full text
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
Sanjam Garg, Craig Gentry, Shai Halevi et al. · 2013 · 1.1K citations
How to use indistinguishability obfuscation
Amit Sahai, Brent Waters · 2014 · 625 citations