Parallel and concurrent security of the HB and HB^+ protocols

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
HB-MP: a further step in the HB-family of lightweight authentication protocols
Public-key cryptosystems from the worst-case shortest vector problem
On lattices, learning with errors, random linear codes, and cryptography
Some optimal inapproximability results
An Improved LPN Algorithm
On the inherent intractability of certain coding problems (Corresp.)
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
On the Composition of Zero-Knowledge Proof Systems
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
Parallel and concurrent security of the HB and \(HB^{+}\) protocols
Definitions and properties of zero-knowledge proof systems
Efficient noise-tolerant learning from statistical queries
A Parallel Repetition Theorem
Noise-tolerant learning, the parity problem, and the statistical query model
On Yao’s XOR-Lemma
Theory of Cryptography
Improved asymptotic bounds for error-correcting codes
List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
Parallel and Concurrent Security of the HB and HB + Protocols
Good Variants of HB + Are Hard to Find

Cited In (14)

Two-Round Man-in-the-Middle Security from LPN
The hardness of LPN over any integer ring and field for PCG applications
How to Encrypt with the LPN Problem
On solving LPN using BKW and variants, Implementation and analysis
Towards efficient LPN-based symmetric encryption
: Increasing the Security and Efficiency of
Solving the learning parity with noise's open question
Parallel and concurrent security of the HB and \(HB^{+}\) protocols
Statistically sender-private OT from LPN and derandomization
A protocol for provably secure authentication of a tiny entity to a high performance computing one
\(k\)-SUM in the sparse regime: complexity and applications
Efficient authentication from hard learning problems
Cryptography from Learning Parity with Noise
Parallel and Concurrent Security of the HB and HB + Protocols

Uses Software

HB-MP

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)