Lower bounds on black-box constructions of pseudorandom functions
From MaRDI portal
Cites work
- Breaking RSA may not be equivalent to factoring. (Extended abstract)
- Efficient Identity-Based Encryption Without Random Oracles
- Limits of provable security from standard assumptions
- Lower bounds on the efficiency of generic cryptographic constructions
- Notions of black-box reductions, revisited
- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
- On the complexity of constructing pseudorandom functions (especially when they don't exist)
- On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators
- On the impossibility of three-move blind signature schemes
- Separation Results on the “One-More” Computational Problems
- Structural lower bounds on black-box constructions of pseudorandom functions
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Theory of Cryptography
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
This page was built for publication: Lower bounds on black-box constructions of pseudorandom functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443207)