Bootstrapping Obfuscators via Fast Pseudorandom Functions

DOI10.1007/978-3-662-45608-8_9MaRDI QIDQ2936606zbMATH OpenOpenAlexFDO

Authors Benny Applebaum

Publication date 6 January 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-45608-8_9

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On obfuscation with random oracles
• Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
• On the correlation intractability of obfuscated pseudorandom functions
• scientific article; zbMATH DE number 3919629
• Indistinguishability obfuscation with non-trivial efficiency
• An ultrafast cryptographically secure pseudorandom number generator
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Indistinguishability obfuscation: from approximate to exact
• Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation
• Bootstrapping for approximate homomorphic encryption

Cited in

(19)

• The pseudorandom oracle model and ideal obfuscation
• Succinct garbling schemes from functional encryption through a local simulation paradigm
• Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
• Fast pseudorandom functions based on expander graphs
• Delegating RAM computations with adaptive soundness and privacy
• Lattice-based SNARGs and their application to more efficient obfuscation
• Garbled circuits as randomized encodings of functions: a primer
• Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
• Obfuscating circuits via composite-order graded encoding
• Obfuscating pseudorandom functions is post-quantum complete
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
• Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
• Pseudorandom functions: three decades later
• Pseudorandom obfuscation and applications
• Secure Obfuscation in a Weak Multilinear Map Model
• Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
• On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input
• A new approach to garbled circuits
• Adaptively secure garbled circuits from one-way functions

This page was built for publication: Bootstrapping Obfuscators via Fast Pseudorandom Functions

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