Abstract
We propose a new protocol allowing the exchange of an item against a signature while assuring fairness. The proposed protocol, based on the Girault-Poupard-Stern signature scheme (a variation of the Schnorr scheme), assumes the existence of a trusted third party that, except in the setup phase, is involved in the protocol only when one of the parties does not follow the designated protocol or some technical problem occurs during the execution of the protocol. The interesting feature of the protocol is the low communication and computational charges required by the parties. Moreover, in case of problems during the main protocol, the trusted third party can derive the same digital signature as the one transmitted in a faultless case, rather than an affidavit or an official certificate.
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. Fairness in Electronic Commerce. PhD thesis, University of Waterloo, May 1998.
N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. Research Report RZ 2858 (#90806), IBM Research, Sept. 1996.
N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In T. Matsumoto, editor, Proceedings of the fourh ACM Conference on Computer and Communications Security, pages 6, 8–17, Zurich, Switzerland, Apr. 1997. ACM Press.
N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 86–99, May 1998.
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.
D. Boneh and M. Naor. Timed commitments. In Advances in Cryptology: Proceedings of Crypto 2000, volume 880 of Lecture Notes in Computer Science, pages 236–254. Springer-Verlag, 2000.
C. Boyd and E. Foo. Off-line fair payment protocols using convertible signatures. Lecture Notes in Computer Science, 514:271–285, 1998.
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.
T. Coffey and P. Saidha. Non-repudiation with mandatory proof of receipt. ACM-CCR: Computer Communication Review, 26, 1996.
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.
Y. Han. Investigation of non-repudiation protocols. In ACISP: Information Security and Privacy: Australasian Conference, volume 172 of Lecture Notes in Computer Science, pages 38–47. Springer-Verlag, 1996.
S. Micali. Certified E-mail with invisible post offices. Available from author; an invited presentation at the RSA’97 conference, 1997.
B. Pfitzmann, M. Schunter, and M. Waidner. Optimal efficiency of optimistic contract signing. In PODC: 17th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 113–122, 1998.
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 403 of Lecture Notes in Computer Science, pages 422–436. Springer-Verlag, 1998.
C.P. Schnorr. Efficient identification and signatures for smart cards. In Advances in Cryptology: Proceedings of Crypto’89, pages 239–252, Berlin, Aug. 1990. Springer.
M. Schunter. Optimistic Fair Exchange. PhD thesis, Technische Fakultät der Universität des Saarlandes, Saarbrücken, Oct. 2000.
P. Syverson. Weakly secret bit commitment: Applications to lotteries and fair exchange. In Proceedings of the 1998 IEEE Computer Security Foundations Workshop (CSFW11), pages 2–13, june 1998.
T. Tedrick. How to exchange half a bit. In D. Chaum, editor, Advances in Cryptology: Proceedings of Crypto’83, pages 147–151, New York, 1984. Plenum Press.
T. Tedrick. Fair exchange of secrets. In G. R. Blakley and D. C. Chaum, editors, Advances in Cryptology: Proceedings of Crypto’84, volume 196 of Lecture Notes in Computer Science, pages 434–438. Springer-Verlag, 1985.
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 Proceedings of The 10th Computer Security Foundations Workshop, pages 126–132. IEEE Computer Society Press, June 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Markowitch, O., Saeednia, S. (2002). Optimistic Fair Exchange with Transparent Signature Recovery. In: Syverson, P. (eds) Financial Cryptography. FC 2001. Lecture Notes in Computer Science, vol 2339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46088-8_26
Download citation
DOI: https://doi.org/10.1007/3-540-46088-8_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44079-6
Online ISBN: 978-3-540-46088-6
eBook Packages: Springer Book Archive