How to construct random functions
Journal of the ACM (JACM)
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
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
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
The blocker tag: selective blocking of RFID tags for consumer privacy
Proceedings of the 10th ACM conference on Computer and communications security
RFID Privacy: An Overview of Problems and Proposed Solutions
IEEE Security and Privacy
Universally composable and forward-secure RFID authentication and authenticated key exchange
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Defining Strong Privacy for RFID
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
Mutual authentication in RFID: security and privacy
Proceedings of the 2008 ACM symposium on Information, computer and communications security
The Grain Family of Stream Ciphers
New Stream Cipher Designs
New Stream Cipher Designs
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
A New Formal Proof Model for RFID Location Privacy
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
A note on universal composable zero-knowledge in the common reference string model
Theoretical Computer Science
Universally Composable RFID Identification and Authentication Protocols
ACM Transactions on Information and System Security (TISSEC)
A note on the feasibility of generalised universal composability†
Mathematical Structures in Computer Science
Efficient zero-knowledge identification schemes which respect privacy
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
An efficient forward private RFID protocol
Proceedings of the 16th ACM conference on Computer and communications security
RFID privacy: relation between two notions, minimal condition, and efficient construction
Proceedings of the 16th ACM conference on Computer and communications security
Universally composable security with global setup
TCC'07 Proceedings of the 4th conference on Theory of cryptography
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
RFID security: tradeoffs between security and efficiency
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
New privacy results on synchronized RFID authentication protocols against tag tracing
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Authenticating pervasive devices with human protocols
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
RFID security and privacy: a research survey
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Formal RFID security and privacy frameworks are fundamental to the design and analysis of robust RFID systems. In this paper, we develop a new definitional framework for RFID privacy in a rigorous and precise manner. Our framework is based on a zero-knowledge ZK formulation [The Foundations of Cryptography, Cambridge Univ. Press, Cambridge, 2001; ACM Symposium on Theory of Computing, 1985, pp. 291--304] and incorporates the notions of adaptive completeness and mutual authentication. We provide meticulous justification of the new framework and contrast it with existing ones in the literature. In particular, we prove that our framework is strictly stronger than the ind-privacy model in International Conference on Pervasive Computing and Communications, 2007, which answers an open question posed in International Conference on Pervasive Computing and Communications, 2007, for developing stronger RFID privacy models. We also clarify certain confusions and rectify several defects in the existing frameworks. Finally, based on the protocol in Conference on Computer and Communications Security, 2009, we propose an efficient RFID mutual authentication protocol and analyze its security and privacy. The methodology used in our analysis can also be applied to analyze other RFID protocols within the new framework.