Parallel and concurrent security of the HB and \(HB^{+}\) protocols
From MaRDI portal
Publication:5962225
DOI10.1007/s00145-010-9061-2zbMath1201.94090OpenAlexW2068189841MaRDI QIDQ5962225
No author found.
Publication date: 21 September 2010
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-010-9061-2
Related Items (11)
On solving LPN using BKW and variants, Implementation and analysis ⋮ Cryptography from Learning Parity with Noise ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Efficient authentication from hard learning problems ⋮ How to Encrypt with the LPN Problem ⋮ Solving the learning parity with noise's open question ⋮ Two-Round Man-in-the-Middle Security from LPN ⋮ Parallel and concurrent security of the HB and \(HB^{+}\) protocols ⋮ A protocol for provably secure authentication of a tiny entity to a high performance computing one ⋮ : Increasing the Security and Efficiency of ⋮ Towards efficient LPN-based symmetric encryption
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- HB-MP: a further step in the HB-family of lightweight authentication protocols
- Definitions and properties of zero-knowledge proof systems
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- On Yao’s XOR-Lemma
- Efficient noise-tolerant learning from statistical queries
- An Improved LPN Algorithm
- Parallel and Concurrent Security of the HB and HB + Protocols
- Good Variants of HB + Are Hard to Find
- On the inherent intractability of certain coding problems (Corresp.)
- A Parallel Repetition Theorem
- Improved asymptotic bounds for error-correcting codes
- Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
- On the Composition of Zero-Knowledge Proof Systems
- Public-key cryptosystems from the worst-case shortest vector problem
- Some optimal inapproximability results
- 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
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Theory of Cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- Parallel and concurrent security of the HB and \(HB^{+}\) protocols
This page was built for publication: Parallel and concurrent security of the HB and \(HB^{+}\) protocols
