Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs

Vadim Lyubashevsky 1 Daniel Masny 2
1 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : We show how to construct, from any weak pseudorandom function, a 3-round symmetric-key authentication protocol that is secure against man-in-the-middle attacks. The construction is very efficient, requiring both the secret key and communication size to be only 3n bits long and involving only one call to the weak-PRF. Our techniques also extend to certain classes of randomized weak-PRFs, chiefly among which are those based on the classical LPN problem and its more efficient variants such as Toeplitz-LPN and Ring-LPN. Building an efficient man-in-the-middle secure authentication scheme from any weak-PRF resolves a problem left open by Dodis et al. (Eurocrypt 2012), while building a man-in-the-middle secure scheme based on any variant of the LPN problem solves the main open question in a long line of research aimed at constructing a practical light-weight authentication scheme based on learning problems, which began with the work of Hopper and Blum (Asiacrypt 2001).
Type de document :
Communication dans un congrès
Canetti, Ran and Garay, Juan A. CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013, Aug 2013, Santa Barbara, United States. Springer, 8043, pp.308-325, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-40084-1_18〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00864299
Contributeur : Vadim Lyubashevsky <>
Soumis le : vendredi 20 septembre 2013 - 17:27:22
Dernière modification le : vendredi 25 mai 2018 - 12:02:05

Lien texte intégral

Identifiants

Collections

Citation

Vadim Lyubashevsky, Daniel Masny. Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. Canetti, Ran and Garay, Juan A. CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013, Aug 2013, Santa Barbara, United States. Springer, 8043, pp.308-325, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-40084-1_18〉. 〈hal-00864299〉

Partager

Métriques

Consultations de la notice

182