A pre-computable signature scheme with efficient verification for RFID

Authors:
Fuchun Guo;Yi Mu;Willy Susilo;Vijay Varadharajan
Affiliations:
Centre for Computer and Information Security Research, School of Computer Science and Software Engineering, University of Wollongong, Wollongong, Australia;Centre for Computer and Information Security Research, School of Computer Science and Software Engineering, University of Wollongong, Wollongong, Australia;Centre for Computer and Information Security Research, School of Computer Science and Software Engineering, University of Wollongong, Wollongong, Australia;Information and Networked Systems Security Research, Department of Computing, Faculty of Science, Macquarie University, Sydney, Australia
Venue:
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Year:
2012

Citing 18
Cited 0

On-line/off-line digital signatures

CRYPTO '89 Proceedings on Advances in cryptology
Improved Online/Offline Signature Schemes

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups

Journal of Cryptology
Mutual authentication in RFID: security and privacy

Proceedings of the 2008 ACM symposium on Information, computer and communications security
The Uber-Assumption Family

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
A low-resource public-key identification scheme for RFID tags and sensor nodes

Proceedings of the second ACM conference on Wireless network security
Divisible On-Line/Off-Line Signatures

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Practical Short Signature Batch Verification

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
ECC Is Ready for RFID --- A Proof in Silicon

Selected Areas in Cryptography
Design of a RFID case-based resource management system for warehouse operations

Expert Systems with Applications: An International Journal
Server(prover/signer)-aided verification of identity proofs and signatures

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Batch pairing delegation

IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
On privacy models for RFID

ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
A low-power RFID integrated circuits for intelligent healthcare systems

IEEE Transactions on Information Technology in Biomedicine
Server-aided signatures verification secure against collusion attack

Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Discrete-Log-Based signatures may not be equivalent to discrete log

ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Server-Aided verification: theory and practice

ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Minimalist cryptography for low-cost RFID tags (extended abstract)

SCN'04 Proceedings of the 4th international conference on Security in Communication Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Passive RFID tags have limited rewritable memory for data storage and limited computation power, which pose difficulties to implement security protection on RFID tags. It has been shown that strong security and privacy protections for RFID require utilizing public-key cryptography. Unfortunately, the implementation of public key cryptography is infeasible in low-cost passive tags. With this issue in mind, in this work, we propose a pre-computable signature scheme with a very efficient signature verification algorithm for RFID applications. Our signature scheme is provably secure under the DDH assumption and a variant of q-SDH assumption. With pre-computations, no exponentiation is required in our signature verification. Our research shows that it is feasible for low-cost RFID tags to verify signatures with the basic modular multiplication only (if they have a small amount of writable memory).