Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

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

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).

Dates and versions

hal-00864299 , version 1 (20-09-2013)

Identifiers

Cite

Vadim Lyubashevsky, Daniel Masny. Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs. CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013, Aug 2013, Santa Barbara, United States. pp.308-325, ⟨10.1007/978-3-642-40084-1_18⟩. ⟨hal-00864299⟩
107 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More