Black-box uselessness: composing separations in cryptography
From MaRDI portal
Cites work
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Coin flipping of any constant bias implies one-way functions
- Combiners for backdoored random oracles
- Cryptographic hashing from strong one-way functions (or: one-way product functions and their applications)
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- Impossibility of simulation secure functional encryption even with random oracles
- Limits on the power of garbling techniques for public-key encryption
- Limits on the power of indistinguishability obfuscation and functional encryption
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Lower bounds on assumptions behind indistinguishability obfuscation
- Lower bounds on obfuscation from all-or-nothing encryption primitives
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Notions of black-box reductions, revisited
- On obfuscation with random oracles
- On Removing Graded Encodings from Functional Encryption
- On statistically secure obfuscation with approximate correctness
- On the power of hierarchical identity-based encryption
- On the power of nonuniformity in proofs of security
- Theory of Cryptography
- Time-lock puzzles in the random oracle model
- When does functional encryption imply obfuscation?
Cited in
(1)
This page was built for publication: Black-box uselessness: composing separations in cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229336)
