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
HB^+^+: a Lightweight Authentication Protocol Secure against Some Attacks
SECPERU '06 Proceedings of the Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing
HB-MP: A further step in the HB-family of lightweight authentication protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Good Variants of HB + Are Hard to Find
Financial Cryptography and Data 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
Authenticating pervasive devices with human protocols
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Parallel and concurrent security of the HB and HB+ protocols
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Trusted-HB: A Low-Cost Version of HB Secure Against Man-in-the-Middle Attacks
IEEE Transactions on Information Theory
HB - MAC: Improving the Random - HB# Authentication Protocol
TrustBus '09 Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business
Anonymizer-Enabled Security and Privacy for RFID
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Lightweight privacy preserving authentication for RFID using a stream cipher
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Tree-based HB protocols for privacy-preserving authentication of RFID tags
Journal of Computer Security - 2010 Workshop on RFID Security (RFIDSec'10 Asia)
Securing low-cost RFID systems: An unconditionally secure approach
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
Practical attacks on HB and HB+ protocols
WISTP'11 Proceedings of the 5th IFIP WG 11.2 international conference on Information security theory and practice: security and privacy of mobile devices in wireless communication
A formal approach to distance-bounding RFID protocols
ISC'11 Proceedings of the 14th international conference on Information security
Security problems of systems of extremely weak devices
Annales UMCS, Informatica - Security Systems
The cryptographic power of random selection
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
BUPLE: securing passive RFID communication through physical layer enhancements
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
GHB#: a provably secure HB-like lightweight authentication protocol
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Lapin: an efficient authentication protocol based on Ring-LPN
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
A secure and private RFID authentication protocol under SLPN problem
NSS'12 Proceedings of the 6th international conference on Network and System Security
Hidden bits approach for authentication in RFID systems
RFIDSec'12 Proceedings of the 8th international conference on Radio Frequency Identification: security and privacy issues
Revisiting lightweight authentication protocols based on hard learning problems
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Hi-index | 0.00 |
At EuroCrypt '08, Gilbert, Robshaw and Seurin proposed HB# to improve on HB + in terms of transmission cost and security against man-in-the-middle attacks. Although the security of HB# is formally proven against a certain class of man-in-the-middle adversaries, it is only conjectured for the general case. In this paper, we present a general man-in-the-middle attack against HB# and Random -HB#, which can also be applied to all anterior HB-like protocols, that recovers the shared secret in 225 or 220 authentication rounds for HB# and 234 or 228 for Random -HB#, depending on the parameter set. We further show that the asymptotic complexity of our attack is polynomial under some conditions on the parameter set which are met on one of those proposed in [8].