The pseudorandom oracle model and ideal obfuscation

DOI10.1007/978-3-031-38551-3_8MaRDI QIDQ6149607zbMATH OpenOpenAlexFDO

Authors Aayush Jain, Huijia Lin, Ji Luo, Daniel Wichs

Publication date 6 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-38551-3_8

zbMATH Keywords

hash functionspseudorandom function

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Replacing a random oracle: full domain hash from indistinguishability obfuscation
• A unified approach to idealized model separations via indistinguishability obfuscation
• On best-possible obfuscation
• On Best-Possible Obfuscation
• On obfuscation with random oracles

Cites work

• Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
• Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation
• Bootstrapping Obfuscators via Fast Pseudorandom Functions
• Can we access a database both locally and privately?
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Chosen-Ciphertext Secure Fully Homomorphic Encryption
• Collusion-resistant functional encryption for RAMs
• Compactness vs collusion resistance in functional encryption
• Cryptography and Coding
• From cryptomania to obfustopia through secret-key functional encryption
• From selective to adaptive security in functional encryption
• Function-revealing encryption (definitions and constructions)
• Functional Encryption for Turing Machines
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to run Turing machines on encrypted data
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• Implementing resettable UC-functionalities with untrusted tamper-proof hardware-tokens
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Indistinguishability obfuscation from compact functional encryption
• Indistinguishability obfuscation from functional encryption
• Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
• Indistinguishability obfuscation from well-founded assumptions
• Indistinguishability obfuscation with non-trivial efficiency
• Obfuscation for evasive functions
• Obfuscation of probabilistic circuits and applications
• Obfustopia built on secret-key functional encryption
• On Best-Possible Obfuscation
• On obfuscation with random oracles
• On strong simulation and composable point obfuscation
• On the achievability of simulation-based security for functional encryption
• On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
• On the plausibility of fully homomorphic encryption for RAMs
• Program obfuscation with leaky hardware
• Public-coin differing-inputs obfuscation and its applications
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Relations Among Complexity Measures
• Robust transforming combiners from indistinguishability obfuscation to functional encryption
• Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
• Single-key to multi-key functional encryption with polynomial loss
• Theory of Cryptography
• To label, or not to label (in generic groups)

Cited in

(4)

• Lower-bounds on public-key operations in PIR
• Pseudorandom obfuscation and applications
• Bounded collusion-resistant registered functional encryption for circuits
• Obfuscating pseudorandom functions is post-quantum complete

This page was built for publication: The pseudorandom oracle model and ideal obfuscation

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