Cryptology ePrint Archive: Report 2009/444

Secure and Efficient HB-CM Entity Authentication Protocol

Zhijun Li and Guang Gong and Zhiguang Qin

Abstract: The simple, computationally efficient LPN-based HB-like entity authentication protocols have attracted a great deal of attention in the past few years due to the broad application prospect in low-cost pervasive devices. At present, the most efficient protocol is HB$^\#$, which is proven to resist the GRS attack under the conjecture that it is secure in the DET-model. In this paper, we introduce an innovative HB-CM$^-$ protocol, which significantly reduces the storage requirement while maintaining the same level of communication cost. We develop the concept of equivalence class, and present HB-CM$^-$ reductionist proof that overcomes an inherent limitation in the HB$^\#$ security proof. In fact, HB$^\#$ is only provably resistant to partial instances of GRS attack, while we prove that HB-CM$^-$ can prevent the full GRS attack except one trivial case. In addition, we propose a new noise mode for all HB-like protocols in order to thwart the latest OOV man-in-the-middle attack, which can effectively compromise all current HB-like protocols with the basic Bernoulli nose mode. The HB-CM$^-$ protocol along with the proposed noise mode constitutes our final protocol: HB-CM.

Category / Keywords: cryptographic protocols / LPN, HB, HB-CM, RFID Authentication Protocol

Publication Info: ---

Date: received 10 Sep 2009, last revised 13 Sep 2009

Contact author: leezj at engmail uwaterloo ca

Available format(s): PDF | BibTeX Citation

Note: ---

Version: 20090914:043014 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]