Witness indistinguishable and witness hiding protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Cryptographic primitives based on hard learning problems
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
On the Composition of Zero-Knowledge Proof Systems
SIAM Journal on Computing
SIAM Journal on Computing
Efficient noise-tolerant learning from statistical queries
Journal of the ACM (JACM)
Some optimal inapproximability results
Journal of the ACM (JACM)
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
SIAM Journal on Computing
Identification Protocols Secure against Reset Attacks
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Secure Human Identification Protocols
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Noise-tolerant learning, the parity problem, and the statistical query model
Journal of the ACM (JACM)
Does Parallel Repetition Lower the Error in Computationally Sound Protocols?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Hardness amplification of weakly verifiable puzzles
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Authenticating pervasive devices with human protocols
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Universally composable and forward-secure RFID authentication and authenticated key exchange
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Semantic security for the McEliece cryptosystem without random oracles
Designs, Codes and Cryptography
How to Encrypt with the LPN Problem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Good Variants of HB + Are Hard to Find
Financial Cryptography and Data Security
A study on secure RFID mutual authentication scheme in pervasive computing environment
Computer Communications
Unclonable Lightweight Authentication Scheme
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
On the Security of HB# against a Man-in-the-Middle Attack
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient RFID authentication protocols based on pseudorandom sequence generators
Designs, Codes and Cryptography
Universally Composable RFID Identification and Authentication Protocols
ACM Transactions on Information and System Security (TISSEC)
On cryptography with auxiliary input
Proceedings of the forty-first annual ACM symposium on Theory of computing
A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
HB - MAC: Improving the Random - HB# Authentication Protocol
TrustBus '09 Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business
RFID privacy: relation between two notions, minimal condition, and efficient construction
Proceedings of the 16th ACM conference on Computer and communications security
Anonymizer-Enabled Security and Privacy for RFID
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Key issues of RFID reader network system
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
RFID survivability quantification and attack modeling
Proceedings of the third ACM conference on Wireless network security
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
HB#: increasing the security and efficiency of HB+
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
PUF-HB: a tamper-resilient HB based authentication protocol
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
A graphical PIN authentication mechanism with applications to smart cards and low-cost devices
WISTP'08 Proceedings of the 2nd IFIP WG 11.2 international conference on Information security theory and practices: smart devices, convergence and next generation networks
SEAS: a secure and efficient anonymity scheme for low-cost RFID tags
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Secure and private search protocols for RFID systems
Information Systems Frontiers
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
Tree-based HB protocols for privacy-preserving authentication of RFID tags
Journal of Computer Security - 2010 Workshop on RFID Security (RFIDSec'10 Asia)
Efficient authentication from hard learning problems
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
On two RFID privacy notions and their relations
ACM Transactions on Information and System Security (TISSEC)
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient shared-key authentication scheme from any weak pseudorandom function
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Security problems of systems of extremely weak devices
Annales UMCS, Informatica - Security Systems
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Towards provable security for ubiquitous applications
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Security threat mitigation trends in low-cost RFID systems
DPM'09/SETOP'09 Proceedings of the 4th international workshop, and Second international conference on Data Privacy Management and Autonomous Spontaneous Security
Location-aware and safer cards: enhancing RFID security and privacy via location sensing
Proceedings of the fifth ACM conference on Security and Privacy in Wireless and Mobile Networks
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Message authentication, revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
GHB#: a provably secure HB-like lightweight authentication protocol
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Concurrency and Computation: Practice & Experience
Lapin: an efficient authentication protocol based on Ring-LPN
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
Survivability Enhancing Techniques for RFID Systems
International Journal of Handheld Computing Research
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
Juels andWeis (building on prior work of Hopper and Blum) propose and analyze two shared-key authentication protocols - HB and HB+ - whose extremely low computational cost makes them attractive for low-cost devices such as radio-frequency identification (RFID) tags. Security of these protocols is based on the conjectured hardness of the “learning parity with noise” (LPN) problem: the HB protocol is proven secure against a passive (eavesdropping) adversary, while the HB+ protocol is proven secure against active attacks. Juels and Weis prove security of these protocols only for the case of sequential executions, and explicitly leave open the question of whether security holds also in the case of parallel or concurrent executions. In addition to guaranteeing security against a stronger class of adversaries, a positive answer to this question would allow the HB+ protocol to be parallelized, thereby substantially reducing its round complexity. Adapting a recent result by Regev, we answer the aforementioned question in the affirmative and prove security of the HB and HB+ protocols under parallel/concurrent executions. We also give what we believe to be substantially simpler security proofs for these protocols which are more complete in that they explicitly address the dependence of the soundness error on the number of iterations.