The pseudorandom oracle model and ideal obfuscation
From MaRDI portal
Publication:6149607
DOI10.1007/978-3-031-38551-3_8OpenAlexW4385654127MaRDI QIDQ6149607
Huijia Lin, Aayush Jain, J. 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
Cites Work
- Unnamed Item
- Can we access a database both locally and privately?
- Function-revealing encryption (definitions and constructions)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- On the plausibility of fully homomorphic encryption for RAMs
- Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously
- Functional Encryption for Turing Machines
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- On the Achievability of Simulation-Based Security for Functional Encryption
- How to Run Turing Machines on Encrypted Data
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Program Obfuscation with Leaky Hardware
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Single-Key to Multi-Key Functional Encryption with Polynomial Loss
- Compactness vs Collusion Resistance in Functional Encryption
- From Selective to Adaptive Security in Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- On Strong Simulation and Composable Point Obfuscation
- On Best-Possible Obfuscation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Relations Among Complexity Measures
- Indistinguishability Obfuscation from Functional Encryption
- Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens
- How to use indistinguishability obfuscation
- On Obfuscation with Random Oracles
- Obfuscation of Probabilistic Circuits and Applications
- Public-Coin Differing-Inputs Obfuscation and Its Applications
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Chosen-Ciphertext Secure Fully Homomorphic Encryption
- Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption
- Obfuscation for Evasive Functions
- Cryptography and Coding
- Theory of Cryptography
- Obfustopia built on secret-key functional encryption
- On the optimal succinctness and efficiency of functional encryption and attribute-based encryption
- Indistinguishability obfuscation from well-founded assumptions
- Collusion-resistant functional encryption for RAMs
- Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation
- To label, or not to label (in generic groups)
This page was built for publication: The pseudorandom oracle model and ideal obfuscation
