Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography

DOI10.1007/978-3-540-89255-7_11zbMath1206.94081OpenAlexW2129611357MaRDI QIDQ3600371

Ueli M. Maurer, Stefano Tessaro

Publication date: 10 February 2009

Published in: Advances in Cryptology - ASIACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_11

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

General linear group action on tensors: a candidate for post-quantum cryptography ⋮ Two-Round Man-in-the-Middle Security from LPN ⋮ From non-adaptive to adaptive pseudorandom functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal classes of hash functions
• Synthesizers and their application to the parallel construction of pseudo-random functions
• Complete characterization of security notions for probabilistic private-key encryption
• Keying Hash Functions for Message Authentication
• A Pseudorandom Generator from any One-way Function
• Advances in Cryptology - EUROCRYPT 2004
• A Simple Variant of the Merkle-Damgård Scheme with a Permutation
• Boosting Merkle-Damgård Hashing for Message Authentication
• A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
• Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
• Security of NMAC and HMAC Based on Non-malleability
• New Proofs for NMAC and HMAC: Security Without Collision-Resistance
• The security of the cipher block chaining message authentication code