@inproceedings{3238,
  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},
  author       = {Kiltz, Eike and Pietrzak, Krzysztof Z and Cash, David and Jain, Abhishek and Venturi, Daniele},
  location     = {Tallinn, Estonia},
  pages        = {7 -- 26},
  publisher    = {Springer},
  title        = {{Efficient authentication from hard learning problems}},
  doi          = {10.1007/978-3-642-20465-4_3},
  volume       = {6632},
  year         = {2011},
}