Abstract
This paper focuses on protocols for human/smartcard interaction which allow the user to authorise individual smartcard transactions, whilst not sacrificing useability or security.
In the past, protocols for secure transactions have traded off useability against security whereas the protocols presented here are designed so that they tradeoff security against hardware complexity and always give high useability. Our protocols utilise some of the concepts and assumptions present in sessional authentication, but also make improvements to this model.
We do not propose the use of biometrics for authentication. Biometrics are viewed with apprehension by many users since they are irrevocable.
Chapter PDF
References
Anderson, 1993] Anderson, R. (1993). Why cryptosystems fail. In ACM 1st Conference — Computer and Communications Security.
Bluetooth (1999). Bluetooth Specification V1.0 A. Available at http://www.bluetooth.com.
J.-P. B. (1994). The esprit project cafe. In ESORICS ‘84 Proceedings, pages 217–230. Springer-Verlag.
Fiat, A. and Shamir, A. (1987). How to prove yourself: Practical solutions to identificationand signature problems. In Odlyzko, A., editor, Advances in Cryptology, Proc. of Crypto ‘86(Lecture Notes in Computer Science 263), pages 186–194. Springer-Verlag. SantaBarbara, California, U. S. A., August 11–15.
Galvin, J., McCloghrie, K., and Davin, J. (1991). Secure management of SNMP networks. In Proceedings of IFIP Integrated Network Management Symposium.
Goldreich, O., Goldwasser, S., and Micali, S. (1986). How to construct random functions. Journal of ACM, 33 (4): 792–807.
Guillou, L. and Quisquater, J.-J. (1988). A practical zero-knowledge protocol fitted tosecurity microprocessor minimizing bothtransmission and memory. In Günther, C. G., editor, Advances in Cryptology, Proc. of Eurocrypt ‘88(Lecture Notes in Computer Science 330), pages 123128. Springer-Verlag. Davos, Switzerland.
Kahn, D. (1967). The Codebreakers. MacMillan Publishing Co., New York.
Klein, D. V. (1990). `foiling the cracker’: A survery of, and implications to, password security. In Proceedings of the USENIX UNIX Security Workshop, pages 5–14.
nikkei, 1998] nikkei (1998). NIKKEI Digital Money Systems.
nikkei, 1999] nikkei (1999). NIKKEI Digital Money Systems.
Shand, M. and Vuillemin, J. (1993). Fast implementations of RSA cryptography. In Proceedings 11th Symposium on Computer Arithmetic, pages 252–259.
Tsudik, 1992] Tsudik, G. (1992). Message authentication with one-way hash functions. In IEEE Infocom.
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
Ebringer, T., Zheng, Y., Thorne, P. (2000). Parasitic Authentication. 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_18
Download citation
DOI: https://doi.org/10.1007/978-0-387-35528-3_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6526-7
Online ISBN: 978-0-387-35528-3
eBook Packages: Springer Book Archive