Paper 2014/562 Original: eprint.iacr.org/2014/562 ↗

hHB: a Harder HB+ Protocol

Ka Ahmad Khoureich
Abstract

In 2005, Juels and Weis proposed HB+, a perfectly adapted authentication protocol for resource-constrained devices such as RFID tags. The HB+ protocol is based on the Learning Parity with Noise (LPN) problem and is proven secure against active adversaries. Since a man-in-the-middle attack on HB+ due to Gilbert et al. was published, many proposals have been made to improve the HB+ protocol. But none of these was formally proven secure against general man-in-the-middle adversaries. In this paper we present a solution to make the HB+ protocol resistant to general man-in-the-middle adversaries without exceeding the computational and storage capabilities of the RFID tag.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2015-10-30: last updated
2014-07-18: published
Short URL
https://ia.cr/2014/562
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2014/562,
      author = {Ka Ahmad Khoureich},
      title = {hHB: a Harder HB+ Protocol},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/562},
      year = {2014},
      url = {https://eprint.iacr.org/2014/562}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.