Abstract
Unconditional security techniques may represent an advantageous alternative to computational security techniques for smart card systems providing authentication or message authentication when the number of authentications needed during the lifetime of each key is limited. In this paper we propose simple algorithms based on modulo 2 scalar products among binary vectors which are easy to implement in so-called synchronous cards, require a reasonable amount of secret key bits (typically 10 to 20 bits per authentication), and provide provably secure authentication and message authentication. Applications mainly include low cost prepaid cards for telephone, parking meters, transportation, automatic vending machines, etc.
The authentication and message authentication techniques presented in this paper are subject to a France Télécom patent.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory IT-22, 644–654 (1976)
Digital Signature Standard. FIPS 186, US Department of Commerce/NIST (1994)
Simmons, G.J.: A survey of Information Authentication. In: Simmons, G.J. (ed.) Contemporary Cryptology, The science of information integrity. IEEE Press, New York (1992)
Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656–715 (1949)
Maurer, U.M.: A provably-secure strongly-randomized cipher. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 361–373. Springer, Heidelberg (1991)
Lamport, L.: Constructing Digital Signatures from One-Way Functions, Technical Report SRI intl. CSL-98 (1979)
Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218–238. Springer, Heidelberg (1990)
Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 129–139. Springer, Heidelberg (1994)
Wegman, M.N., Carter, J.L.: Universal hash functions. JCSS 18(2), 143–154
Desmedt, Y.G.: Unconditionally secure authentication schemes and practical and theoretical consequences. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 42–55. Springer, Heidelberg (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilbert, H. (2000). Techniques for Low Cost Authentication and Message Authentication. In: Quisquater, JJ., Schneier, B. (eds) Smart Card Research and Applications. CARDIS 1998. Lecture Notes in Computer Science, vol 1820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721064_16
Download citation
DOI: https://doi.org/10.1007/10721064_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67923-3
Online ISBN: 978-3-540-44534-0
eBook Packages: Springer Book Archive