---
res:
  bibo_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 (MIM) attacks. A MAC
    implies such a (two-round) protocol. © 2011 International Association for Cryptologic
    Research@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Eike
      foaf_name: Kiltz, Eike
      foaf_surname: Kiltz
  - foaf_Person:
      foaf_givenName: Krzysztof Z
      foaf_name: Pietrzak, Krzysztof Z
      foaf_surname: Pietrzak
      foaf_workInfoHomepage: http://www.librecat.org/personId=3E04A7AA-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-9139-1654
  - foaf_Person:
      foaf_givenName: David
      foaf_name: Cash, David
      foaf_surname: Cash
  - foaf_Person:
      foaf_givenName: Abhishek
      foaf_name: Jain, Abhishek
      foaf_surname: Jain
  - foaf_Person:
      foaf_givenName: Daniele
      foaf_name: Venturi, Daniele
      foaf_surname: Venturi
  bibo_doi: 10.1007/978-3-642-20465-4_3
  bibo_volume: 6632
  dct_date: 2011^xs_gYear
  dct_language: eng
  dct_publisher: Springer@
  dct_title: Efficient authentication from hard learning problems@
...