HB-MP: A further step in the HB-family of lightweight authentication protocols

Munilla, Jorge; Peinado, Alberto

doi:10.1016/j.comnet.2007.01.011

Cited by 125 publications

(52 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On the one hand, researchers have attempted to design multiple HBlike protocols with MIM security [8,11,25,13] without or only partial security proofs. Otherwise, provably MIM-secure constructions all in fact provide a full message-authentication code (MAC) secure under LPN or Field LPN [20,10,15].…”

Section: Introductionmentioning

confidence: 99%

Two-Round Man-in-the-Middle Security from LPN

Cash

Kiltz

Tessaro

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Secret-key authentication protocols have recently received a considerable amount of attention, and a long line of research has been devoted to devising efficient protocols with security based on the hardness of the learning-parity with noise (LPN) problem, with the goal of achieving low communication and round complexities, as well as highest possible security guarantees. In this paper, we construct 2-round authentication protocols that are secure against sequential man-in-the-middle (MIM) attacks with tight reductions to LPN, Field-LPN, or other problems. The best prior protocols had either loose reductions and required 3 rounds (Lyubashevsky and Masny, CRYPTO'13) or had a much larger key (Kiltz et al., EURO-CRYPT'11 and Dodis et al., EUROCRYPT'12). Our constructions follow from a new generic deterministic and round-preserving transformation enhancing actively-secure protocols of a special form to be sequentially MIM-secure while only adding a limited amount of key material and computation.

show abstract

Section: Introductionmentioning

confidence: 99%

Two-Round Man-in-the-Middle Security from LPN

Cash

Kiltz

Tessaro

2015

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…However, HB + was shown vulnerable to manin-the-middle attacks [28]. Several variants were proposed [12,21,47] but all of them suffer from the same vulnerability [29]. A new variant HB # was proposed by Gilbert, Robshaw and Seurin [30] to improve the transmission cost of the protocol and its securtiy against man-in-the-middle attacks but an attack was also found in this variant [49].…”

Section: Introductionmentioning

confidence: 99%

HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

Duc

Vaudenay

2013

Progress in Cryptology – AFRICACRYPT 2013

View full text Add to dashboard Cite

Abstract. We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with Noise problem (LPN) and the decisional minimum distance problem. We show that the resulting cryptosystem achieves indistinguishability under chosen plaintext attacks (IND-CPA security). Using the FujisakiOkamoto generic construction, HELEN achieves IND-CCA security in the random oracle model. Our cryptosystem looks like the Alekhnovich cryptosystem. However, we carefully study its complexity and we further propose concrete optimized parameters.

show abstract

“…In particular, Gilbert et al [14] showed that HB + can be broken by a MIM attack. Several variants HB ++ [9], HB * [11], HB-MP [24] were proposed to prevent the particular attack from [14], but all of them were later shown to be insecure [15]. In [16], a variant HB # was presented which provably resists the particular attack from [14], but was shown susceptible to a more general MIM attack [25].…”

Section: Introductionmentioning

confidence: 99%

Efficient Authentication from Hard Learning Problems

Kiltz

Pietrzak

Cash

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We construct efficient authentication protocols and messageauthentication 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.

show abstract

HB-MP: A further step in the HB-family of lightweight authentication protocols

Cited by 125 publications

References 4 publications

Two-Round Man-in-the-Middle Security from LPN

Two-Round Man-in-the-Middle Security from LPN

HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

Efficient Authentication from Hard Learning Problems

Contact Info

Product

Resources

About