<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Efficient authentication from hard learning problems</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LNCS</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Eike</namePart>
  <namePart type="family">Kiltz</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Krzysztof Z</namePart>
  <namePart type="family">Pietrzak</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">3E04A7AA-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-9139-1654</description></name>
<name type="personal">
  <namePart type="given">David</namePart>
  <namePart type="family">Cash</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Abhishek</namePart>
  <namePart type="family">Jain</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Daniele</namePart>
  <namePart type="family">Venturi</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>









<name type="conference">
  <namePart>EUROCRYPT: Theory and Applications of Cryptographic Techniques</namePart>
</name>






<abstract lang="eng">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</abstract>

<originInfo><publisher>Springer</publisher><dateIssued encoding="w3cdtf">2011</dateIssued><place><placeTerm type="text">Tallinn, Estonia</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><identifier type="doi">10.1007/978-3-642-20465-4_3</identifier>
<part><detail type="volume"><number>6632</number></detail><extent unit="pages">7 - 26</extent>
</part>
</relatedItem>
<relatedItem type="Supplementary material">
  <location>     <url>https://research-explorer.ista.ac.at/record/1187</url>  </location>
</relatedItem>
<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<mla>Kiltz, Eike, et al. &lt;i&gt;Efficient Authentication from Hard Learning Problems&lt;/i&gt;. Vol. 6632, Springer, 2011, pp. 7–26, doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-20465-4_3&quot;&gt;10.1007/978-3-642-20465-4_3&lt;/a&gt;.</mla>
<apa>Kiltz, E., Pietrzak, K. Z., Cash, D., Jain, A., &amp;#38; Venturi, D. (2011). Efficient authentication from hard learning problems (Vol. 6632, pp. 7–26). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia: Springer. &lt;a href=&quot;https://doi.org/10.1007/978-3-642-20465-4_3&quot;&gt;https://doi.org/10.1007/978-3-642-20465-4_3&lt;/a&gt;</apa>
<ista>Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. 2011. Efficient authentication from hard learning problems. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 6632, 7–26.</ista>
<short>E. Kiltz, K.Z. Pietrzak, D. Cash, A. Jain, D. Venturi, in:, Springer, 2011, pp. 7–26.</short>
<chicago>Kiltz, Eike, Krzysztof Z Pietrzak, David Cash, Abhishek Jain, and Daniele Venturi. “Efficient Authentication from Hard Learning Problems,” 6632:7–26. Springer, 2011. &lt;a href=&quot;https://doi.org/10.1007/978-3-642-20465-4_3&quot;&gt;https://doi.org/10.1007/978-3-642-20465-4_3&lt;/a&gt;.</chicago>
<ieee>E. Kiltz, K. Z. Pietrzak, D. Cash, A. Jain, and D. Venturi, “Efficient authentication from hard learning problems,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, 2011, vol. 6632, pp. 7–26.</ieee>
<ama>Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. Efficient authentication from hard learning problems. In: Vol 6632. Springer; 2011:7-26. doi:&lt;a href=&quot;https://doi.org/10.1007/978-3-642-20465-4_3&quot;&gt;10.1007/978-3-642-20465-4_3&lt;/a&gt;</ama>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>3238</recordIdentifier><recordCreationDate encoding="w3cdtf">2018-12-11T12:02:11Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2025-04-15T08:32:11Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
