Abstract
We address the challenging issue of authenticating a (very) low-cost IC card in a (very) short period of time with public key techniques. Such a need is growing, e.g. in public transport area, where the requirements are very tight, due to a contactless interface and a very short transaction time. Zero-knowledge discrete-logarithm-based authentication schemes with “use and throw coupons” (i.e. commitments which are precomputed, stored in the card and used only once) are well suited to this problem, but state of the art provides coupons which are still too large in many applications (namely 85–90 bits, by Girault and Stern [GS94]).
In this paper, we first observe that the [GS94] paradigm allows to derive a better bound than the one above (about 64 bits), but turns out to be too restrictive, as it only considers off-line attackers (those who perform exhaustive trials prior to the authentication process). This leads us to propose a more realistic environment, in which both off-line and on-line attacks can take place. Then we show that the length of the coupons can nonetheless be still significantly decreased (down to 32 bits!), just by assuming that both time and computational power of the enemy are limited during authentication process. Combined with self-certification or elliptic curve techniques, this allows us to store more than 200 coupons in the IC card, if (only) 1 Kbyte of the E2PROM memory is occupied by the whole cryptographic material.
Chapter PDF
Similar content being viewed by others
Keywords
References
V. Boyko, M. Peinado and R. Venkatesan. Speeding up Discrete Log and Factoring Based Schemes via Precompu¬tations. In Advances in Cryptology — EUROCRYPT’98, LNCS 1403, Springer-Verlag, pages 221–235, 1998.
S. Even, O. Goldreich and S. Micah. On-line/Off-line Digital Signatures. In Advances in Cryptology — CRYPTO’89, LNCS 435, Springer-Verlag, pages 263–277, 1991.
M. Girault. Self-Certified Public Keys. In Advances in Cryptology — EUROCRYPT’91, LNCS 547, Springer-Verlag, pages 490–497, 1991.
M. Girault and J. Stern. On the Length of Cryptographic Hash-Values Used in Identification Schemes. In Advances in Cryptology — CRYPTO’94, LNCS 839, Springer-Verlag, pages 202–215, 1994.
L.C. Guillou and J.J. Quisquater. A Practical Zero Knowledge Protocol Fitted to Security Microprocessors Minimizing both Transmission and Memory. In Advances in Cryptology — EUROCRYPT’88, LNCS 330, Springer-Verlag, pages 123–128, 1988.
D. M’Raihi and D. Naccache. Couponing Scheme Reduces Computational Power Requirements. In Proceedings of Cardtech’94, pages 99–104, 1994.
P. Nguyen and J. Stern. The Hardness of the Hidden Subset Sum Problem and its Cryptographic Applications. In Advances in Cryptology–CRYPTO’99, LNCS 1666, Springer-Verlag, pages 31–46, 1999.
H. Ong and C.P. Schnorr. Fast Signature Generation with a Fiat-Shamir-like Scheme. In Advances in Cryptology - EUROCRYPT’90, LNCS 473, Springer-Verlag, pages 432¬440, 1991.
D. Pointcheval. The Composite Discrete Logarithm and Secure Authentication. In Proceedings of the 2000 Inter¬national Workshop on Practice and Theory in Public Key Cryptography (PKC 2000), LNCS 1751, Springer-Verlag, pages 113–128, 2000.
G. Poupard and J. Stern. A practical and Provably Se¬cure Design for “On the Fly” Authentication and Signa¬ture Generation. In Advances in Cryptology–EURO¬CRYPT’98, LNCS 1403, Springer-Verlag, pages 422–436, 1998.
G. Poupard and J. Stern. On the Fly Signatures Based on Factoring. In Proceedings of the 6th ACM Conference on Computer and Communications Security, pages 37–45, ACM Press, 1999.
R.L. Rivest, A. Shamir and L. Adleman. A Method for Obtaining Digital Signature Schemes. In CACM, Vol. 21, n° 2, pages 120–126, Feb. 1978.
P.J.N. de Rooij. On the Security of the Schnorr Scheme Using Preprocessing. In Advances in Cryptology–EU¬ROCRYPT’91, LNCS 547, Springer-Verlag, pages 71–80, 1991.
P.J.N. de Rooij. On Schnorr’s Preprocessing for Signatures Schemes. In Journal of Cryptology, Vol. 10, n° 1, pages 1¬16, 1997.
C.P. Schnorr. Efficient Identification and Signature by Smart Cards. In Advances in Cryptology — CRYPTO’89, LNCS 435, Springer-Verlag, pages 239–251, 1990.
C.P. Schnorr. Efficient Signature Generation by Smart Cards. In Journal of Cryptology, Vol. 4, n° 3, pages 161¬–174, 1991.
C.P. Schnorr. Fast Precomputation for Discrete Logarithm Cryptosystems. In CRYPTO’99, rump session, 1999.
J. Stern. On the Fly Signatures. In RSA Conference 2000 Proceedings, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Girault, M. (2000). Low-Size Coupons for Low-Cost IC Cards. In: Domingo-Ferrer, J., Chan, D., Watson, A. (eds) Smart Card Research and Advanced Applications. IFIP — The International Federation for Information Processing, vol 52. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35528-3_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-35528-3_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6526-7
Online ISBN: 978-0-387-35528-3
eBook Packages: Springer Book Archive