Parallel and concurrent security of the HB and HB^+ protocols
\textit{N. Hopper} and \textit{M. Blum} [Secure human identification protocols. Advances in cryptology -- ASIACRYPT 2001. 7th international conference on the theory and application of cryptology and information security, Gold Coast, Australia. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2248, 52--66 (2001; Zbl 1062.94549)] and \textit{A. Juels} and \textit{S. A. Weis} [Authenticating pervasive devices with human protocols. Advances in cryptology -- CRYPTO 2005. 25th annual international cryptology conference, Santa Barbara, CA, USA 2005. Proceedings. Berlin: Springer. Lecture Notes in Computer Science 3621, 293--308 (2005; Zbl 1145.94470)] proposed the shared-key authentication protocols \(HB\) and \(HB^+\), respectively. Their extremely low computational cost make them attractive for low-cost devices such as radio-frequency identification (RFID) tags. The security of these protocols is based on the conjectured hardness of the ``learning parity with noise (LPN) problem, which is equivalent to the problem of decoding random binary linear codes. In this paper, the \(HB\) protocol is proven secure against a passive (eavesdropping) adversary and the \(HB^+\) protocol is proven secure against active attacks.
- : Increasing the Security and Efficiency of
- A Parallel Repetition Theorem
- An Algorithm for Solving the LPN Problem and Its Application to Security Evaluation of the HB Protocols for RFID Authentication
- An Improved LPN Algorithm
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Authenticating Pervasive Devices with Human Protocols
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
- Definitions and properties of zero-knowledge proof systems
- Efficient noise-tolerant learning from statistical queries
- Good Variants of HB + Are Hard to Find
- HB-MP: a further step in the HB-family of lightweight authentication protocols
- scientific article; zbMATH DE number 3167429 (Why is no real title available?)
- scientific article; zbMATH DE number 5485477 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 1088909 (Why is no real title available?)
- scientific article; zbMATH DE number 2081058 (Why is no real title available?)
- Improved asymptotic bounds for error-correcting codes
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- On the Composition of Zero-Knowledge Proof Systems
- On the inherent intractability of certain coding problems (Corresp.)
- On Yao's XOR-lemma
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Parallel and Concurrent Security of the HB and HB + Protocols
- Public-key cryptosystems from the worst-case shortest vector problem
- Some optimal inapproximability results
- Theory of Cryptography
- Efficient authentication from hard learning problems
- A protocol for provably secure authentication of a tiny entity to a high performance computing one
- Towards efficient LPN-based symmetric encryption
- Extended 3-party ACCE and application to LoRaWAN 1.1
- Solving the learning parity with noise's open question
- On solving LPN using BKW and variants, Implementation and analysis
- Two-round man-in-the-middle security from LPN
- Cryptography from learning parity with noise
- How to Encrypt with the LPN Problem
- An Improved LPN Algorithm
- Parallel and Concurrent Security of the HB and HB + Protocols
- On the Security of HB# against a Man-in-the-Middle Attack
- Good Variants of HB + Are Hard to Find
- Trusted-HB: A Low-Cost Version of HB^+ Secure Against Man-in-the-Middle Attacks
- Two attacks against the \(F _{f }\) RFID protocol
- On the security proof of an authentication protocol from Eurocrypt 2011
- Algebraic analysis on \(\text{HB}^\#\) authentication protocol
- 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
- Concrete Security for Entity Recognition: The Jane Doe Protocol
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
- Statistically sender-private OT from LPN and derandomization
- The hardness of LPN over any integer ring and field for PCG applications
- \(k\)-SUM in the sparse regime: complexity and applications
- HB-MP: a further step in the HB-family of lightweight authentication protocols
This page was built for publication: Parallel and concurrent security of the HB and \(HB^{+}\) protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962225)
