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 attacks. A MAC implies such a (two-round) protocol.
Efficient Authentication from Hard Learning Problems / Kiltz, Eike; Pietrzak, Krzysztof; Venturi, Daniele; Cash, David; Jain, Abhishek. - In: JOURNAL OF CRYPTOLOGY. - ISSN 0933-2790. - 2017, 30:4(2017), pp. 1238-1275. [10.1007/s00145-016-9247-3]
Efficient Authentication from Hard Learning Problems
Venturi, Daniele;
2017-01-01
Abstract
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 attacks. A MAC implies such a (two-round) protocol.| File | Dimensione | Formato | |
|---|---|---|---|
|
EC11.pdf
Open Access dal 01/11/2018
Descrizione: Full version
Tipologia:
Post-print referato (Refereed author’s manuscript)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
504.84 kB
Formato
Adobe PDF
|
504.84 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
