From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs. (Extended abstract)

DOI10.1007/BFB0055734MaRDI QIDQ4249336zbMATH OpenFDO

Authors Moni Naor, Omer Reingold

Publication date 7 March 2000

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

Full work available at URL https://doi.org/10.1007/BFB0055734

zbMATH Keywords

authenticationidentificationmessage authentication codeprivate-key encryptionpseudo-random functionsstandard protocolsunpredictable functions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Pseudorandom functions: three decades later
• XOR MACs: New methods for message authentication using finite pseudorandom functions
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• Secure message authentication against related-key attack
• Synthesizers and their application to the parallel construction of pseudo-random functions

Cited in

(11)

• Efficient non-repudiation multicast source authentication schemes.
• Pseudorandomness of Camellia-like scheme
• The Hash Function Family LAKE
• Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
• XOR MACs: New methods for message authentication using finite pseudorandom functions
• Pseudorandom functions: three decades later
• Analysis of Multivariate Hash Functions
• Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function
• Minicrypt primitives with algebraic structure and applications
• On the security of multivariate hash functions
• Quantum unpredictability

This page was built for publication: From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs. (Extended abstract)

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