A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on 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)
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
PRESENT: An Ultra-Lightweight Block Cipher
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Good Variants of HB + Are Hard to Find
Financial Cryptography and Data Security
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
Untraceability of RFID protocols
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
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
Information confinement, privacy, and security in RFID systems
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Demo: the ff hardware prototype for privacy-preserving RFID authentication
Proceedings of the 18th ACM conference on Computer and communications security
| Hi-index | 0.00 |
This paper investigates a new family of RFID protocols called F f that grew out of a proposal made at ESORICS 2007. This family has the property of having highly efficient implementations and simultaneously providing some security arguments which shares some features with the HB protocol family. In this work, we exhibit links between the F f protocol and the LPN problem, and demonstrate two attacks against the F f family of protocols which run with a time complexity of about 252 and 238 respectively against the instance proposed by the designers that has a 512-bit secret key. Our two attacks have the nice property that they only require interactions with the tag alone and does not involve the reader.