<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Lapin: An efficient authentication protocol based on ring-LPN</dc:title>
   	<dc:title>LNCS</dc:title>
   	<dc:creator>Heyse, Stefan</dc:creator>
   	<dc:creator>Kiltz, Eike</dc:creator>
   	<dc:creator>Lyubashevsky, Vadim</dc:creator>
   	<dc:creator>Paar, Christof</dc:creator>
   	<dc:creator>Pietrzak, Krzysztof Z ; https://orcid.org/0000-0002-9139-1654</dc:creator>
   	<dc:description>We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices.

Performance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt’11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES.
</dc:description>
   	<dc:publisher>Springer</dc:publisher>
   	<dc:date>2012</dc:date>
   	<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
   	<dc:type>doc-type:conferenceObject</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_5794</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/2049</dc:identifier>
   	<dc:source>Heyse S, Kiltz E, Lyubashevsky V, Paar C, Pietrzak KZ. Lapin: An efficient authentication protocol based on ring-LPN. In: &lt;i&gt; Conference Proceedings FSE 2012&lt;/i&gt;. Vol 7549. Springer; 2012:346-365. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-34047-5_20&quot;&gt;10.1007/978-3-642-34047-5_20&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-34047-5_20</dc:relation>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
