On obfuscation with random oracles

DOI10.1007/978-3-662-46497-7_18MaRDI QIDQ5261687zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Yael Tauman Kalai, Omer Paneth

Publication date 6 July 2015

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46497-7_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
• scientific article; zbMATH DE number 1842483
• On the impossibility of approximate obfuscation and applications to resettable cryptography
• On best-possible obfuscation
• On the (im)possibility of obfuscating programs

Cited in

(23)

• Impossibility of simulation secure functional encryption even with random oracles
• Impossibility of order-revealing encryption in idealized models
• New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
• On constructing one-way permutations from indistinguishability obfuscation
• Impossibility of VBB obfuscation with ideal constant-degree graded encodings
• On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
• On constructing one-way permutations from indistinguishability obfuscation
• On statistically secure obfuscation with approximate correctness
• Bootstrapping Obfuscators via Fast Pseudorandom Functions
• Limits on the power of indistinguishability obfuscation and functional encryption
• On Best-Possible Obfuscation
• scientific article; zbMATH DE number 1107669 (Why is no real title available?)
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Combining Encryption and Proof of Knowledge in the Random Oracle Model
• Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
• On Removing Graded Encodings from Functional Encryption
• Structure-preserving compilers from new notions of obfuscations
• The pseudorandom oracle model and ideal obfuscation
• On the (im)plausibility of public-key quantum money from collision-resistant hash functions
• Black-box uselessness: composing separations in cryptography
• Lower bounds on inner-product functional encryption from all-or-nothing encryption primitives
• A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
• Lower bounds on the overhead of indistinguishability obfuscation

This page was built for publication: On obfuscation with random oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261687)