Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Solving Underdefined Systems of Multivariate Quadratic Equations
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Noise-tolerant learning, the parity problem, and the statistical query model
Journal of the ACM (JACM)
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
Attacks on CKK Family of RFID Authentication Protocols
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
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
Privacy Protection for RFID with Hidden Subset Identifiers
Pervasive '08 Proceedings of the 6th International Conference on Pervasive Computing
More on the Security of Linear RFID Authentication Protocols
Selected Areas in Cryptography
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
Extending match-on-card to local biometric identification
BioID_MultiComm'09 Proceedings of the 2009 joint COST 2101 and 2102 international conference on Biometric ID management and multimodal communication
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
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
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
On the inherent intractability of certain coding problems (Corresp.)
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We present an authentication scheme designed for tiny and strictly constrained devices like RFID-tags. Authentication is based on the symmetric key shared between a tag and a reader. While a tag needs to perform only simple operations in order to authenticate: to pick n/2+b random values and then to compute XORs of some values, a reader needs to try 2b possible values to check if a tag replied correctly (b is small). At the same time eavesdropping adversary after r executions of the protocol needs to solve a system of rk-multivariate quadratic equations over GF(2) with nk+rb variables. We present a security discussion of proposed solutions.