Parallel and Concurrent Security of the HB and HB + Protocols

DOI10.1007/11761679_6zbMath1140.94352OpenAlexW2130389396MaRDI QIDQ3593090

Ji Sun Shin, Jonathan N. Katz

Publication date: 24 September 2007

Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11761679_6

Mathematics Subject Classification ID

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

Related Items

Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN ⋮ A non-heuristic approach to time-space tradeoffs and optimizations for BKW ⋮ Efficient authentication from hard learning problems ⋮ Quantum search-to-decision reduction for the LWE problem ⋮ How to Encrypt with the LPN Problem ⋮ On Privacy Models for RFID ⋮ CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN ⋮ On the Security of HB# against a Man-in-the-Middle Attack ⋮ Good Variants of HB +  Are Hard to Find ⋮ An improved algorithm for learning sparse parities in the presence of noise ⋮ 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 ⋮ A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model ⋮ Semantic security for the McEliece cryptosystem without random oracles ⋮ Efficient RFID authentication protocols based on pseudorandom sequence generators ⋮ Solving LPN using covering codes ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Cryptography with constant input locality ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Definitions and properties of zero-knowledge proof systems
• On Yao’s XOR-Lemma
• Efficient noise-tolerant learning from statistical queries
• New directions in cryptography
• On the inherent intractability of certain coding problems (Corresp.)
• A Parallel Repetition Theorem
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• On the Composition of Zero-Knowledge Proof Systems
• Some optimal inapproximability results
• Authenticating Pervasive Devices with Human Protocols
• Theory of Cryptography
• Noise-tolerant learning, the parity problem, and the statistical query model
• On lattices, learning with errors, random linear codes, and cryptography