Abstract
In this paper we show how fair exchange of digital signatures can be made possible without a separate verifiable encryption. This means that the fair exchange protocol can be established based on an existing signature algorithm without modification, except that the users need to get a ticket from an off-line trusted third party to enable the fair exchange. The trusted third party is needed to make a judgment only when there is a dispute. Explicit protocols based on different digital signature algorithms are proposed.
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
N. Asokan, V. Shoup, M. Waidner, “Optimistic fair exchange of digital signatures (extended abstract)”, Advances in Cryptology-Eurocrypt’98, K. Nyberg(Ed.), LNCS 1403, Springer-Verlag, 1998, pp.591–606.
I.B. Damgard, “Practical and provably secure release of a secret and exchange of signatures”, Advances in Cryptology-Eurocrypt’93, T. Helleseth (ed.), LNCS 765, Springer-Verlag, 1994, pp.200–217.
C. Boyd and E. Foo, “Off-line fair payment protocol usingcon vertible signatures”, Advances in Cryptology-Asiacrypt’98, LNCS 1514, Springer-Verlag, 1998.
T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory, Vol. IT-31, No.4, 1985, pp.469–472.
FIPS PUB 186, “Digital signature standard”, available on-line at http://bilbo.isu.edu/security/isl/fips186.html.
M.K. Franklin and M.K. Reiter, “Verifiable signature sharing”, Advances in Cryptology — Eurocrypt’95, L.C. Guillou, J.J. Quisquater (eds.), LNCS 921, Springer-Verlag, 1995, pp.50–63.
M.K. Franklin and M.K. Reiter, “Fair exchange with a semi-trusted third party”, in Proceedings of the 4th ACM Conference on Computer and Communication Security, April 1997, pp.1–5.
R. Gennaro, H. Krawczyk, and T. Rabin, “RSA-based undeniable signatures”, Advances in Cryptology — Crypto’97, B.S. Kaliski Jr. (Ed.), LNCS 1294, Springer-Verlag, 1997, pp.132–149.
W. Mao, “Publicly verifiable partial key escrow”, Information and Communications Security, Proceedings, Y. Han, T. Okamoto, S. Qing(Eds.), LNCS 1334, Springer-Verlag1997, pp.409–413.
W. Mao, “Verifiable escrowed signature”, Information Security and Privacy, LNCS1270, Springer-Verlag, 1997, pp.240–248.
T. Okamoto and K. Ohta, “How to simultaneously exchange secrets by general assumption”, in Proceedings of the 2nd ACM Conference on Computer and Communications Security, 1994, pp.184–192.
C.P. Schnorr, “Efficient signature generation for smart cards”, Journal of Cryptology, Vol.4, No.3, 1991, pp.161–174.
M. Stadler, “Publicly verifiable secret sharing”, Advances in Cryptology— Eurocrypt’ 96, U. Maurer (ed.), LNCS 1070, Springer-Verlag, 1996, pp.190–199.
M. Stadler, Cryptographic Protocols for Revocable Privacy, Ph.D. thesis, Swiss Federal Institute of Technology, Zürich 1996.
J. Zhou and D. Gollman, “A fair non-repudiation protocol”, in Proceedings of the 1996 IEEE Symposium on Security and Privacy, Oakland, CA, 1996, IEEE Computer Press, pp.55–61.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, CK., Varadharajan, V. (2001). Fair Exchange of Digital Signatures with Offline Trusted Third Party. In: Qing, S., Okamoto, T., Zhou, J. (eds) Information and Communications Security. ICICS 2001. Lecture Notes in Computer Science, vol 2229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45600-7_52
Download citation
DOI: https://doi.org/10.1007/3-540-45600-7_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42880-0
Online ISBN: 978-3-540-45600-1
eBook Packages: Springer Book Archive