Abstract
An exchange or payment protocol is considered fair if neither of the two parties exchanging items or payment at any time during the protocol has a significant advantage over the other entity. Fairness is an important property for electronic commerce. This paper identifies a design framework based on existing fair protocols which use offine trusted third parties, but with convertible signatures as the underlying mechanism. We show that in principle any convertible signature scheme can be used to design a fair payment protocol. A specific protocol is detailed based on RSA undeniable signatures which is more efficient than other similar fair payment schemes. Furthermore, in this protocol the final signature obtained is always an ordinary RSA signature.
Sponsored by Commonwealth Bank and the Australian Research Council
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
N. Asokan, Victor Shoup, and Michael Waidner. Optimistic Fair Exchange of Digital Signatures. In Advances in Cryptology-Proceedings of EUROCRYPT’ 98, pages 591–606, Espoo Finland, May 1998. Springer-Verlag.
Feng Bao, Robert H. Deng, and Wenbo Mao. Eficient and Practical Fair Exchange Protocols with Off-line TTP. In Proceedings of the 1998 IEEE Symposium on Security and Privacy, 1998.
Joan Boyar, David Chaum, and Ivan Dåmgard. Convertible Undeniable Signatures. In Advances in Cryptology-Proceedings of CRYPTO’ 90, pages 189–205. Springer-Verlag, 1991.
David Chaum. Designated Confirmer Signatures. In Advances in Cryptology-Proceedings of EUROCRYPT’ 94, pages 86–91, Perugia Italy, May 1994. Springer-Verlag.
David Chaum and Hans van Antwerpen. Undeniable Signatures. In Advances in Cryptology-Proceedings of CRYPTO’ 89, pages 212–216, 1989.
Ivan Damgård and Torben Pedersen. New Convertible Undeniable Signature Schemes. In Advances in Cryptology-Proceedings of EUROCRYPT’ 96, pages 372–386, Berlin Heidelberg, 1996. Springer-Verlag.
T. ElGamal. A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In IEEE Transactions on Information Theory, volume IT-31(4), pages 637–647, 1985.
Matthew K. Franklin and Michael K. Reiter. Fair Exchange with a Semirusted Third Party. In Proceedings of the 4th ACM Conference on Computer and Communications Security, April 1997.
Ravi Ganesan and Yacov Yacobi. A Secure Joint Signature and Key Exchange System. Technical report, Bellcore Technical Memorandum, 1994.
Rosario Gennaro, Hugo Krawczyk, and Tal Rabin. RSA-Based Undeniable Signatures. In Advances in Cryptology-Proceedings of CRYPTO’ 97, pages 132–149. Springer-Verlag, 1997.
L. C. Guillou and J. J. Quisquater. A Paradoxical Identity-Based Signature Scheme Resulting from Zero Knowledge. In Advances in Cryptology-CRYPTO’ 88, pages 216–231. Springer-Verlag, 1988.
Wenbo Mao. Publicly Verifiable Partial Key Escrow. In ACISP’97, pages 240–248. Springer-Verlag, 1997.
Markus Michels, Holger Petersen, and Patrick Horster. Breaking and Repairing a Convertible Undeniable Signature Scheme. In Proceedings of the 3rd ACM Conference on Computers and Communications Security, pages 148–152, New Delhi, 1996. ACM Press.
Markus Michels and Markus Stadler. Efficient Convertible Undeniable Signature Schemes. In SAC’ 97, 1997.
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, pages 184–192, 1994.
Tatsuaki Okamoto. Designated Confirmer Signatures and Public Key Encryption are Equivalent. In Advances in Cryptology-Proceedings of CRYPTO’ 94, pages 61–74, Santa Barbara California, August 1994. Springer-Verlag.
Markus Stadler. Publicly Verifiable Secret Sharing. In Advances in Cryptology-Proceedings of EUROCRYPT’ 96, pages 190–199, Berlin Heidelberg, 1996. Springer-Verlag.
Jianying Zhou and Dieter Gollman. A Fair Non-repudiation Protocol. In Proceedings of the 1996 IEEE Symposium on Security and Privacy, pages 55–61, Oakland, CA, 1996. IEEE Computer Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boyd, C., Foo, E. (1998). Off-line Fair Payment Protocols using Convertible Signatures. In: Ohta, K., Pei, D. (eds) Advances in Cryptology — ASIACRYPT’98. ASIACRYPT 1998. Lecture Notes in Computer Science, vol 1514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49649-1_22
Download citation
DOI: https://doi.org/10.1007/3-540-49649-1_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65109-3
Online ISBN: 978-3-540-49649-6
eBook Packages: Springer Book Archive