Revisiting lightweight authentication protocols based on hard learning problems


At the 2011 Eurocrypt, Kiltz et al., in their best paper price awarded paper, proposed an ultra-lightweight authentication protocol, called <i>AUTH</i>. This new protocol is supported by a delegated security proof, against passive and active attacks, based on the conjectured hardness of the Learning Parity with Noise (LPN) problem. However, <i>AUTH</i> has… (More)
DOI: 10.1145/2462096.2462118


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics