Journal
JOURNAL OF CRYPTOLOGY
Volume 23, Issue 3, Pages 402-421Publisher
SPRINGER
DOI: 10.1007/s00145-010-9061-2
Keywords
Authentication protocols; RFID; Learning parity with noise
Categories
Funding
- NSF CyberTrust [0627306, 0447075, 0729171]
- Direct For Computer & Info Scie & Enginr
- Division Of Computer and Network Systems [0447075] Funding Source: National Science Foundation
- Direct For Computer & Info Scie & Enginr
- Division Of Computer and Network Systems [0627306] Funding Source: National Science Foundation
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [0729171] Funding Source: National Science Foundation
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [0747294] Funding Source: National Science Foundation
Ask authors/readers for more resources
Hopper and Blum (Asiacrypt 2001) and Juels and Weis (Crypto 2005) recently proposed two shared-key authentication protocols-HB and HB+, respectively-whose extremely low computational cost makes 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. The HB protocol is proven secure against a passive (eavesdropping) adversary, while the HB+ protocol is proven secure against active attacks.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
