Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function

DOI10.1007/11941378_22zbMATH Open1175.94116OpenAlexW1540130658MaRDI QIDQ5458285FDOQ5458285

Authors: Ryo Nojima, Kazukuni Kobara, Hideki Imai 

Publication date: 11 April 2008

Published in: Progress in Cryptology - INDOCRYPT 2006 (Search for Journal in Brave)

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

Recommendations

• Man-in-the-middle secure authentication schemes from LPN and weak PRFs
• Shared authentication token secure against replay and weak key attacks
• A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
• scientific article; zbMATH DE number 1302852
• Keying hash functions for message authentication

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited In (2)

• Efficient amplification of the security of weak pseudo-random function generators
• Shared authentication token secure against replay and weak key attacks

This page was built for publication: Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function

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