Abstract
In this paper we consider a new and efficient optimistic nonrepudiation protocol. In a non-repudiation protocol, during which Alice wants to transmit a message to Bob, Alice has to send a non-repudiation of origin evidence to Bob (attesting that Alice is at the origin of the transmitted message), and Bob has to send a non-repudiation of receipt evidence to Alice (attesting Bob’s receipt of the message). Classical solutions propose to use a trusted third party to help realizing the exchange without giving any significant advantage to one of the two parties. In an optimistic protocol, the trusted third party intervenes only in case of problems during the communication between Alice and Bob. Classically, in a situation where an error occurs, evidences that have been digitally signed by the TTP are issued. Although these evidences are distinct from those produced by Alice and Bob in a faultless case, they have the same value in case of a dispute. In this paper we propose a protocol where the TTP produces the same evidences that Alice and Bob should have produced in a faultless protocol execution (this prevents, after a succesful protocol execution, to determine whether the TTP was involved or not).
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. Fairness in Electronic Commerce. PhD thesis, University of Waterloo, May 1998.
N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In T. Matsumoto, editor, 4th ACM Conference on Computer and Communications Security, pages 6, 8–17, Zurich, Switzerland, Apr. 1997. ACM Press.
N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. In Advances in Cryptology: Proceedings of Eurocrypt’98, volume 1403 of Lecture Notes in Computer Science, pages 591–606. Springer-Verlag, 1998.
F. Bao, R. H. Deng, and W. Mao. Efficient and practical fair exchange protocols with off-line TTP. In IEEE Symposium on Security and Privacy, May 1998.
C. Boyd and E. Foo. Off-line fair payment protocols using convertible signatures. Lecture Notes in Computer Science, 1514:271–285, 1998.
C. Boyd and P. Kearney. Exploring fair exchange protocols using specification animation. In The Third International Workshop on Information Security-ISW2000, Lecture Notes in Computer Science, Australia, Dec. 2000. Springer-Verlag.
D. Chaum. Designated confirmer signatures. In A. D. Santis, editor, Advances in Cryptology: Proceedings of Eurocrypt’94, volume 950 of Lecture Notes in Computer Science, pages 86–91. Springer-Verlag, 1995, 9–12 May 1994.
L. Chen. Efficient fair exchange with verifiable confirmation of signatures. Lecture Notes in Computer Science, 1514:286–299, 1998.
M. Girault. Self-certified public keys. In Advances in Cryptology: Proceedings of EuroCrypt’91, volume 547 of Lecture Notes in Computer Science, pages 490–497. Springer-Verlag, 1991.
S. Kremer and O. Markowitch. Optimistic non-repudiable information exchange. In J. Biemond, editor, 21st Symp. on Information Theory in the Benelux, pages 139–146, Wassenaar (NL), May 25–26 2000. Werkgemeenschap Informatie-en Communicatietheorie, Enschede (NL).
O. Markowitch and S. Saeednia. Optimistic fair-exchange with transparent signature recovery. In 5th International Conference, Financial Cryptography 2001, Lecture Notes in Computer Science. Springer-Verlag, 2001.
S. Micali. Certified E-mail with invisible post offices. Available from author; an invited presentation at the RSA ’97 conference, 1997.
G. Poupard and J. Stern. Security analysis of a practical “on the fly” authentication and signature generation. In Advances in Cryptology: Proceedings of Eurocrypt’ 98, volume 1403 of Lecture Notes in Computer Science, pages 422–436. Springer-Verlag, 1998.
N. Zhang and Q. Shi. Achieving non-repudiation of receipt. The Computer Journal, 39(10):844–853, 1996.
J. Zhou, R. Deng, and F. Bao. Evolution of fair non-repudiation with TTP. In ACISP: Information Security and Privacy: Australasian Conference, volume 1587 of Lecture Notes in Computer Science, pages 258–269. Springer-Verlag, 1999.
J. Zhou and D. Gollmann. A fair non-repudiation protocol. In IEEE Symposium on Security and Privacy, Research in Security and Privacy, pages 55–61, Oakland, CA, May 1996. IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Security Press.
J. Zhou and D. Gollmann. An efficient non-repudiation protocol. In PCSFW: Proceedings of The 10th Computer Security Foundations Workshop. IEEE Computer Society Press, 1997.
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
Markowitch, O., Kremer, S. (2001). An Optimistic Non-repudiation Protocol with Transparent Trusted Third Party. In: Davida, G.I., Frankel, Y. (eds) Information Security. ISC 2001. Lecture Notes in Computer Science, vol 2200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45439-X_25
Download citation
DOI: https://doi.org/10.1007/3-540-45439-X_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42662-2
Online ISBN: 978-3-540-45439-7
eBook Packages: Springer Book Archive