Efficient authentication from hard learning problems LNCS Kiltz, Eike Pietrzak, Krzysztof Z ; https://orcid.org/0000-0002-9139-1654 Cash, David Jain, Abhishek Venturi, Daniele 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 Hopper and Blum in 2001 - until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle (MIM) attacks. A MAC implies such a (two-round) protocol. © 2011 International Association for Cryptologic Research Springer 2011 info:eu-repo/semantics/conferenceObject doc-type:ConferenceObject ConferenceObject http://purl.org/coar/resource_type/c_5794 https://research-explorer.ista.ac.at/record/3238 Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. Efficient authentication from hard learning problems. In: Vol 6632. Springer; 2011:7-26. doi:<a href="https://doi.org/10.1007/978-3-642-20465-4_3">10.1007/978-3-642-20465-4_3</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-20465-4_3 info:eu-repo/semantics/closedAccess