Impossibility of simulation secure functional encryption even with random oracles
From MaRDI portal
Publication:1629443
DOI10.1007/978-3-030-03807-6_24zbMath1443.94041OpenAlexW2572299204MaRDI QIDQ1629443
Brent Waters, Shashank Agrawal, Venkata Koppula
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_24
Related Items (5)
Impossibility of simulation secure functional encryption even with random oracles ⋮ Multi-authority ABE for non-monotonic access structures ⋮ Functional encryption against probabilistic queries: definition, construction and applications ⋮ Multi-input quadratic functional encryption: stronger security, broader functionality ⋮ Verifiable functional encryption using Intel SGX
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Impossibility of simulation secure functional encryption even with random oracles
- Computationally private randomizing polynomials and their applications
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
- Indistinguishability Obfuscation with Non-trivial Efficiency
- Functional Encryption: New Perspectives and Lower Bounds
- On the Achievability of Simulation-Based Security for Functional Encryption
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Simulation-Based Secure Functional Encryption in the Random Oracle Model
- Identity-Based Cryptosystems and Signature Schemes
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Functional Encryption: Definitions and Challenges
- The random oracle methodology, revisited
- From Cryptomania to Obfustopia Through Secret-Key Functional Encryption
- Indistinguishability Obfuscation from Compact Functional Encryption
- Conjunctive, Subset, and Range Queries on Encrypted Data
- Indistinguishability Obfuscation from Functional Encryption
- On Obfuscation with Random Oracles
- Fuzzy Identity-Based Encryption
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- Attribute-based encryption for circuits
- Reusable garbled circuits and succinct functional encryption
- On Removing Graded Encodings from Functional Encryption
This page was built for publication: Impossibility of simulation secure functional encryption even with random oracles
