Abstract
We propose a new efficient protocol, which allows a pair of potentially mistrusting parties to exchange digital signatures over the Internet in a fair way, such that after the protocol is running, either each party obtains the other’s signature, or neither of them does. The protocol relies on an off-line Trusted Third Party (TTP), which does not take part in the exchange unless any of the parties behaves improperly or other faults occur. Efficiency of the protocol is achieved by using a cryptographic primitive, called confirmable signatures (or designated confirmer signatures in its original proposal [9]). We recommend using a new efficient confirmable signature scheme in the proposed fair exchange protocol. This scheme combines the family of discrete logarithm (DL) based signature algorithms and a zero-knowledge (ZK) proof on the equality of two DLs. The protocol has a practical level of performance: only a moderate number of communication rounds and ordinary signatures are required. The security of the protocol can be established from that of the underlying signature algorithms and that of the ZK proof used.
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
Asokan, A., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In Proceedings of 4th ACM Conference on Computer and Communications Security, Zurich, Switzerland, (1997) 6–17
Asokan, A., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. In Advances in Cryptology-EUROCRYPT’ 98, LNCS 1403, Springer-Verlag, (1998) 591–606
Bao, F.: An efficient verifiable encryption scheme for encryption of discrete logarithms. To appear in CARDIS’ 98
Bao, F., Deng, R., Mao, W.: Efficient and practical fair exchange protocols with off-line TTP. In Proceedings of 1998 IEEE Symposium on Security and Privacy, Oakland, California, IEEE Computer Press, (1998) 77–85
Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.: A fair protocol for signing contracts. IEEE Transactions on Information Theory. 36(1) (1990) 40–46
Boyd, C., Foo, E.: Off-line fair payment protocols using convertible signatures. ASIACRYPT’ 98 (these proceedings)
Boyar, J., Chaum, D., Damgård, I., Pedersen, T.: Convertible undeniable signatures. In Advances in Cryptology-CRYPTO’ 90, LNCS 537, Springer-Verlag, (1991) 189–205
Chaum, D.: Zero-knowledge undeniable signatures. In Advances in Cryptology-EUROCRYPT’ 90, LNCS 473, Springer-Verlag, (1991) 458–464
Chaum, D.: Designated confirmer signatures. In Advances in Cryptology-EUROCRYPT’ 94, LNCS 950, Springer-Verlag, (1994) 86–91
Cleve, R.: Controlled gradual disclosure schemes for random bits and their applications. In Advances in Cryptology-CRYPTO’ 89, LNCS 435, pages. Springer-Verlag, (1990) 572–588
Cox, B., Tygar, J., Sirbu, M.: NetBill security and transaction protocol. In Proceedings of First USENIX Workshop on Electronic Commerce, (1995) 77–88
Damgård, I.: Practical and provably secure release of a secret and exchange of signatures. In Advances in Cryptology-EUROCRYPT’ 93, LNCS 765, Springer-Verlag, (1994) 201–207
Deng, R., Gong, L., Lazar, A., Wang, W.: Practical protocol for certified electronic mail. Journal of Network and Systems Management. 4(3) (1996) 279–297
ElGamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory. 31(4) (1985) 469–472
Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. CACM. 28(6) (1985) 637–647
U.S. Department of Commerce/National Institute of Standards and Technology, Digital Signature Standard. Federal Information Processing Standard Publication (FIPS PUB) 186, May 1994.
Franklin, M., Reiter, M.: Fair exchange with a semi-trusted third party. In Proceedings of 4th ACM Conference on Computer and Communications Security, Zurich, Switzerland, (1997) 1–5
Guillou, L., Quisquater, J.: A paradoxical identity-based signature scheme resulting from zero-knowledge. In Advances in Cryptology-CRYPTO’ 88, LNCS 403, Springer-Verlag, (1990) 216–231
Luby, M., Micali, S., Rackoff, C.: How to simultaneously exchange a secret bit by flipping symmetricall-based coin. In Proceedings of the 24th IEEE Symposium on the Foundations of Computer Science (FOCS), (1983) 11–22
Mao, W.: Verifiable escrowed Signature. In Proceedings of Second Australasian Conference on Information Security and Privacy, LNCS 1270, Springer-Verlag, (1997) 240–248
Michels, M., Stadler, M.: Efficient convertible undeniable signature schemes. In the Proceedings of the 4th Annual Workshop on Selected Areas in Cryptography (SAC’ 97), (1997)
Michels, M., Stadler, M.: Generic constructions for secure and efficient confirmer signatures. In Advances in Cryptology-EUROCRYPT’ 98, LNCS 1403, Springer-Verlag, Berlin, (1998) 406–421
Okamoto, T.: Designated confirmer signatures and public-key encryption are equivalent. In Advances in Cryptology-CRYPTO’ 94, LNCS 839, Springer-Verlag, (1994) 61–74
Okamoto, T., Ohta, K.: How to simultaneously exchange secrets by general assumption. In Proceedings of 2nd ACM Conference on Computer and Communications Security, (1994) 184–192
Okamoto, T., Uchiyama, S.: A new public-key cryptosystem as secure as factoring. In Advances in Cryptology-EUROCRYPT’ 98, LNCS 1403, Springer-Verlag, Berlin, (1998) 308–318
Rabin, M., Transaction protection by beacons. Aiken Computation Lab. Harverd University Cambridge, MA, Tech. Rep. (1981) 29–81
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM. 21 (1978) 294–299
Schnorr, C.: Efficient identification and signatures for smart-cards. In Advances in Cryptology-EUROCRYPT’ 89, LNCS 435, Springer-Verlag, (1990) 239–252
Stadler, M.: Publicly verifiable secret sharing. In Advances in Cryptology-EUROCRYPT’ 96, LNCS 1070, Springer-Verlag, (1996) 190–199
Tedric, T.: Fair exchange of secrets. In Advances in Cryptology-CRYPTO’ 84, LNCS 196, Springer-Verlag, (1985) 434–438
Zhou, J., Gollmann, D.: A fair non-repudiation protocol. In Proceedings of the 1996 IEEE Symposium on Security and Privacy, Oakland, California, IEEE Computer Press, (1996) 55–61
Zhou, J., Gollmann, D.: An efficient non-repudiation protocol. In Proceedings of 10th IEEE Computer Security Foundations Workshop, Rockport, Massachusetts, (1997) 126–132
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
Chen, L. (1998). Efficient Fair Exchange with Verifiable Confirmation of 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_23
Download citation
DOI: https://doi.org/10.1007/3-540-49649-1_23
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