Reconstructing Algebraic Functions from Mixed Data
SIAM Journal on Computing
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Polynomial Reconstruction Based Cryptography
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Privacy and security in library RFID: issues, practices, and architectures
Proceedings of the 11th ACM conference on Computer and communications security
RFID privacy issues and technical challenges
Communications of the ACM - Special issue: RFID
Defining Strong Privacy for RFID
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
List decoding and property testing of error-correcting codes
List decoding and property testing of error-correcting codes
Mutual authentication in RFID: security and privacy
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Efficient zero-knowledge identification schemes which respect privacy
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Traceable privacy of recent provably-secure RFID protocols
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Strongly universal hashing and identification codes via channels
IEEE Transactions on Information Theory
Cryptographic Hardness Based on the Decoding of Reed–Solomon Codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Consider a device that wants to communicate with another device (for instance a contactless one). We focus on how to withstand privacy threats in such a situation, and we here describe how to query the device and then identify it, with a new identification protocol solution. The interrogation step uses the concept of identification codes introduced by Ahlswede and Dueck. We show that this probabilistic coding scheme indeed protects the device against an eavesdropper who wants to track it. In particular, when using a special class of identification codes due to Moulin and Koetter that are based on Reed-Solomon codes, we directly depend on the hardness of a cryptographic assumption known as the Polynomial Reconstruction problem. We analyse the security and privacy properties of our proposal in the privacy model for contactless devices introduced by Vaudenay at ASIACRYPT 2007. We finally explain how to apply our scheme with very low-cost devices.