scientific article; zbMATH DE number 1302852

zbMATH Open0931.94047MaRDI QIDQ4249336FDOQ4249336

Authors: Moni Naor, Omer Reingold 

Publication date: 7 March 2000

Title of this publication is not available (Why is that?)

Recommendations

• Pseudorandom functions: three decades later
• scientific article; zbMATH DE number 1030978
• 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

zbMATH Keywords

identificationauthenticationprivate-key encryptionmessage authentication codepseudo-random functionsstandard protocolsunpredictable functions

Mathematics Subject Classification ID

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

Cited In (10)

• The Hash Function Family LAKE
• On the security of multivariate hash functions
• Minicrypt primitives with algebraic structure and applications
• Analysis of Multivariate Hash Functions
• Title not available (Why is that?)
• Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function
• Efficient non-repudiation multicast source authentication schemes.
• Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
• Pseudorandom functions: three decades later
• Pseudorandomness of Camellia-like scheme

This page was built for publication:

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