Impossibility of simulation secure functional encryption even with random oracles
From MaRDI portal
Recommendations
- Simulation-based secure functional encryption in the random oracle model
- On the achievability of simulation-based security for functional encryption
- On the power of rewinding simulators in functional encryption
- Functional encryption: new perspectives and lower bounds
- Limits on the Usefulness of Random Oracles
Cites work
- Attribute-based encryption for circuits
- Computationally private randomizing polynomials and their applications
- Conjunctive, Subset, and Range Queries on Encrypted Data
- From cryptomania to obfustopia through secret-key functional encryption
- Functional encryption with bounded collusions via multi-party computation
- Functional encryption: definitions and challenges
- Functional encryption: new perspectives and lower bounds
- Fuzzy Identity-Based Encryption
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Impossibility of simulation secure functional encryption even with random oracles
- Indistinguishability obfuscation from compact functional encryption
- Indistinguishability obfuscation from functional encryption
- Indistinguishability obfuscation with non-trivial efficiency
- Lower bounds on assumptions behind indistinguishability obfuscation
- On obfuscation with random oracles
- On Removing Graded Encodings from Functional Encryption
- On the achievability of simulation-based security for functional encryption
- On the communication complexity of secure function evaluation with long output
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Reusable garbled circuits and succinct functional encryption
- Simulation-based secure functional encryption in the random oracle model
- The random oracle methodology, revisited.
Cited in
(13)- Impossibility of simulation secure functional encryption even with random oracles
- Impossibility results for lattice-based functional encryption schemes
- On the power of rewinding simulators in functional encryption
- Verifiable functional encryption using Intel SGX
- On the achievability of simulation-based security for functional encryption
- Simulation-based secure functional encryption in the random oracle model
- Encryption Simulatability Reconsidered
- There is no safe pairing function over an arbitrary structure
- 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
- How to make any computational secret sharing scheme adaptively secure
- Black-box uselessness: composing separations in cryptography
This page was built for publication: Impossibility of simulation secure functional encryption even with random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1629443)
