Abstract
The advance of smart card technology will enable ubiquity (wide distribution) of services, due to increased portability and security provided by the devices. In this work we demonstrate that in the ubiquitous environment certain architectural considerations are needed to assure secure and fast services. Specifically, we demonstrate problems that may arise when employing a service that combines “cryptographic integrity calculation” together with its counterpart “cryptographic integrity verification” (due to operational requirements and possible symmetries) when the underlying technology is based on efficient symmetric ciphers (rather than public-key). We suggest a general architectural solution which assures that both calculations and verifications (or checks) are performed correctly and securely. Examples of the services above include: distributed notaries, distributed time-stamping etc.
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.
References
Abadi, M., Burrows, M., Kaufman, C., Lampson, B.: Authentication and Delegation with Smart-Cards. DEC Systems Research Center 67 (October 1990)
Canetti, R.: Towards realizing random oracles: Hash functions which hide all partial information. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 455–469. Springer, Heidelberg (1997)
Canetti, R., Micciancio, D., Reingold, O.: Perfectly one-way probabilistic hash functions. In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing (STOC 1998), pp. 131–140 (1998)
Chaum, D., Van Antwerpen, H.: Undeniable signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 212–216. Springer, Heidelberg (1990)
Chaum, D.: Zero-knowledge undeniable signatures. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 458–464. Springer, Heidelberg (1991)
Davida, G., Matt, B.: Arbitration in tamper proof devices. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 216–222. Springer, Heidelberg (1988)
Desmedt, Y.G., Quisquater, J.-J.: Public-key systems based on the difficulty of tampering. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 111–117. Springer, Heidelberg (1987)
Security requirements for cryptographic modules (FIPS PUB 140-1). Technical Report FIPS 140-1, National Institute of Standards and Technology, Gaithers- burg, MD (1994)
Secure Hash Standard (FIPS PUB 180-1). Technical Report FIPS 180-1, National Institute of Standards and Technology, Gaithersburg, MD (1995)
Frankel, Y., Gemmell, P., Yung, M.: Witness Based Cryptographic ProgramChecking and Robust Function Sharing. In: Proceedings of the Twenty eighth Annual ACM Symposium on the Theory of Computing (STOC 96), pp. 499–508 (1996)
Haber, S., Stornetta, W.S.: How to Time-Stamp a Digital Document. Journal of Cryptography 3(2), 99–112 (1991)
Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS 28(2), 270–299 (1984)
Rivest, R.: The MD5 Message Digest Algorithm. IETF RFC 1321 (April 1992)
Yee, B.: Using Secure Coprocessors, Ph. D. thesis, Carnagie Mellon University, Computer Science Tech. Report CMU-CS-94-149 (May 1994)
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
Frankel, Y., Yung, M. (2000). How to Say “YES” with Smart Cards. 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_18
Download citation
DOI: https://doi.org/10.1007/10721064_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67923-3
Online ISBN: 978-3-540-44534-0
eBook Packages: Springer Book Archive