an:06839573
Zbl 1386.94096
Kiltz, Eike; Pietrzak, Krzysztof; Venturi, Daniele; Cash, David; Jain, Abhishek
Efficient authentication from hard learning problems
EN
J. Cryptology 30, No. 4, 1238-1275 (2017).
00373733
2017
j
94A62
authentication protocols; message authentication; hard learning problems
Summary: We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work -- starting with the HB protocol of \textit{N. J. Hopper} and \textit{M. Blum} in 2001 [Asiacrypt 2001, Lect. Notes Comput. Sci. 2248, 52--66 (2001; Zbl 1062.94549)] -- until now, it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle attacks. A MAC implies such a (two-round) protocol.
A preliminary version appeared in [Eurocrypt 2011, Lect. Notes Comput. Sci. 6632, 7--26 (2011; Zbl 1281.94083)].
Zbl 1062.94549; Zbl 1281.94083