Stateless evaluation of pseudorandom functions: Security beyond the birthday barrier

DOI10.1007/3-540-48405-1_17MaRDI QIDQ4941860zbMATH OpenFDO

Authors M. Bellare, Oded Goldreich, Hugo Krawczyk

Publication date 19 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48405-1_17

zbMATH Keywords

encryption schemesintegrityMAC schemespseudorandom functionspseudorandomnesssecurity

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• How to build pseudorandom functions from public random permutations
• The sum of CBC MACs is a secure PRF
• XOR MACs: New methods for message authentication using finite pseudorandom functions
• Indifferentiability beyond the birthday bound for the xor of two public random permutations
• Pseudorandom functions: three decades later

Cited in

(13)

• Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
• Bernoulli numbers and the probability of a birthday surprise
• Hardness-preserving reductions via cuckoo hashing
• Improved security analysis for nonce-based enhanced hash-then-mask MACs
• Concrete security characterizations of PRFs and PRPs: Reductions and applications
• One-key compression function based MAC with security beyond birthday bound
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• A Proof of Security in O(2 n ) for the Benes Scheme
• A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
• scientific article; zbMATH DE number 1942434 (Why is no real title available?)
• Multilane HMAC— Security beyond the Birthday Limit
• Luby-Rackoff backwards with more users and more security
• Alternative security models for a pseudorandom function

This page was built for publication: Stateless evaluation of pseudorandom functions: Security beyond the birthday barrier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941860)