Improving efficiency of an ‘on the fly' identification scheme by perfecting zero-knowledgeness

Authors:
Bagus Santoso;Kazuo Ohta;Kazuo Sakiyama;Goichiro Hanaoka
Affiliations:
National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan;The University of Electro-Communications, Tokyo, Japan;The University of Electro-Communications, Tokyo, Japan;National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan
Venue:
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Year:
2010

Citing 11
Cited 1

Demonstrating possession of a discrete logarithm without revealing it

Proceedings on Advances in cryptology---CRYPTO '86
Efficient zero-knowledge identification schemes for smart cards

The Computer Journal - Special issue on safety and security parallel computation
An interactive identification scheme based on discrete logarithms and factoring

Journal of Cryptology - Eurocrypt '90
On the fly signatures based on factoring

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Efficient Identification and Signatures for Smart Cards

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the Length of Cryptographic Hash-Values Used in Identification Schemes

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
The Composite Discrete Logarithm and Secure Authentication

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Coupon Recalculation for the GPS Authentication Scheme

CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Self-certified public keys

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Public key cryptography and RFID tags

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology

Tightly-Secure signatures from lossy identification schemes

EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new methodology for constructing an efficient identification scheme, and based on it, we propose a lightweight identification scheme whose computational and storage costs are sufficiently low even for cheap devices such as RFID tags. First, we point out that the efficiency of a scheme with statistical zero-knowledgeness can be significantly improved by enhancing its zero-knowledgeness to perfect zero-knowledge. Then, we apply this technique to the Girault-Poupard-Stern (GPS) scheme which has been standardized by ISO/IEC. The resulting scheme shows a perfect balance between communication cost, storage cost, and circuit size (computational cost), which are crucial factors for implementation on RFID tags. Compared to GPS, the communication and storage costs are reduced, while the computational cost is kept sufficiently low so that it is implementable on a circuit nearly as small as GPS. Under standard parameters, the prover's response is shortened 80 bits from 275 bits to 195 bits and in application using coupons, storage for one coupon is also reduced 80 bits, whereas the circuit size is estimated to be larger by only 328 gates. Hence, we believe that the new scheme is a perfect solution for fast authentication of RFID tags.