Advertisement
Published in:
2011 | OriginalPaper | Chapter
Efficient Authentication from Hard Learning Problems
Authors : Eike Kiltz, Krzysztof Pietrzak, David Cash, Abhishek Jain, Daniele Venturi
Published in: Advances in Cryptology – EUROCRYPT 2011
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.