From non-adaptive to adaptive pseudorandom functions
From MaRDI portal
Publication:2344050
DOI10.1007/s00145-013-9169-2zbMath1314.94056OpenAlexW2080488508MaRDI QIDQ2344050
Publication date: 12 May 2015
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-013-9169-2
Related Items (2)
Fast Pseudorandom Functions Based on Expander Graphs ⋮ Hardness-preserving reductions via cuckoo hashing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Universal classes of hash functions
- Synthesizers and their application to the parallel construction of pseudo-random functions
- A note on negligible functions
- Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs
- From Non-adaptive to Adaptive Pseudorandom Functions
- Message Authentication, Revisited
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Equivalence of Uniform Key Agreement and Composition Insecurity
- Composition Implies Adaptive Security in Minicrypt
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
- A Pseudorandom Generator from any One-way Function
- Foundations of Cryptography
- Foundations of Cryptography
- Hardness Preserving Reductions via Cuckoo Hashing
- Advances in Cryptology - EUROCRYPT 2004
- A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
- Composition Does Not Imply Adaptive Security
- Theory of Cryptography
This page was built for publication: From non-adaptive to adaptive pseudorandom functions
