Good Variants of HB + Are Hard to Find

DOI10.1007/978-3-540-85230-8_12zbMath1175.94079OpenAlexW1516563360MaRDI QIDQ3603007

Henri Gilbert, Yannick Seurin, Matthew J. B. Robshaw

Publication date: 12 February 2009

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85230-8_12

zbMATH Keywords

authenticationRFID tagsLPNHB\(^{ + }\)

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Non-interactive secure computation of inner-product from LPN and LWE ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Efficient authentication from hard learning problems ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ How to Encrypt with the LPN Problem ⋮ On the Security of HB# against a Man-in-the-Middle Attack ⋮ Parallel and concurrent security of the HB and \(HB^{+}\) protocols ⋮ : Increasing the Security and Efficiency of

Cites Work

• Unnamed Item
• Unnamed Item
• On the fly authentication and signature schemes based on groups of unknown order
• HB-MP: a further step in the HB-family of lightweight authentication protocols
• PRESENT: An Ultra-Lightweight Block Cipher
• An Improved LPN Algorithm
• Parallel and Concurrent Security of the HB and HB +  Protocols
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Public Key Cryptography and RFID Tags
• Authenticating Pervasive Devices with Human Protocols
• An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
• : Increasing the Security and Efficiency of

This page was built for publication: Good Variants of HB +  Are Hard to Find