Abstract
Many authentication tokens, most notably smart cards, cannot implement conventional digital signature algorithms for performance reasons. Simple solutions involving symmetric cryptography put the global shared secret in every verification device. We propose a more robust solution using Multiple Parallel Keys: use n symmetric keys to authenticate, and give each verification device only one of them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bellare, M., Canetti, R., Karwczyk, H.: Keying Hash Functions for Message Authentication. In: CRYPTO 1996. LNCS, vol. 1109, pp. 1–15. Springer, Heidelberg (1996)
National Bureau of Standards, NBS FIPS PUB 46, Data Encryption Standard, National Bureau of Standards, U.S. Department of Commerce (January 1977)
Schneier, B.: Applied Cryptography, 2nd edn. John Wiley & Sons, Chichester (1996)
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
Kelsey, J., Schneier, B. (2000). Secure Authentication with Multiple Parallel Keys. 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_13
Download citation
DOI: https://doi.org/10.1007/10721064_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67923-3
Online ISBN: 978-3-540-44534-0
eBook Packages: Springer Book Archive