Abstract
Garay et alter [9] prove that for the multi-party contract signing with n participants, at least n rounds are necessary. To date, the best solution is Baum-Waidner’s scheme [6], with t+2 rounds (where t is the number of dishonest signatories, so with t=n–1, the number of rounds is n+1). Here, we propose an optimal solution with exactly n rounds. On the other hand, Pfitzmann et alter [10] state that “there is no asynchronous optimistic contract signing scheme with three messages in the optimistic case”. However, it seems that Ferrer et alter [7] invalidate the previous theorem with a counterexample, presenting an asynchronous protocol with only three messages. In this paper, we clarify this apparent contradiction.
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
Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: 4th ACM Conference on Computer and Communications Security, pp. 7–17 (1997)
Asokan, N., Shoup, V., Waidner, M.: Asynchronous Protocols for Optimistic Fair Exchange. In: IEEE Symposium on Research in Security and Privacy, pp. 86–99 (1998)
Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for multi-party fair exchange. Research Report RZ 2892 (#90840), IBM Research (1996)
Asokan, N., Baum-Waidner, B., Schunter, M., Waidner, M.: Optimistic synchronous multi-party contract signing. Research Report RZ 3089, IBM Research Division (1998)
Baum-Waidner, B., Waidner, M.: Optimistic asynchronous multi-party contract signing. Research Report RZ 3078, IBM Research Division (1998)
Baum-Weidner, B., Waidner, M.: Round-optimal and abuse-free multi-party contract signing. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 524–535. Springer, Heidelberg (2000)
Ferrer, J.L., Payeras, M., Huguet, L.: Efficient Optimistic N-Party Contract Signing Protocol. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol. 2200, pp. 394–407. Springer, Heidelberg (2001)
Garay, J.A., Jakobsson, M., MacKenzie, P.: Abuse-Free Optimistic Contract Signing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 449–466. Springer, Heidelberg (1999)
Garay, J.A., MacKenzie, P.: Abuse-Free Multi-party Contract Signing. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 151–165. Springer, Heidelberg (1999)
Pfitzmann, B., Schunter, M., Waidner, M.: Optimal Efficiency of Optimistic Contract Signing. In: PODC 1998, pp. 113–122 (1998)
Rivest, R., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM 21, 120–126 (1978)
Zhou, J., Deng, R., Bao, F.: Some Remarks on a Fair Exchange Protocol. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 46–57. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferrer-Gomila, J.L., Payeras-Capellà, M., Huguet-Rotger, L. (2004). Optimality in Asynchronous Contract Signing Protocols. In: Katsikas, S., Lopez, J., Pernul, G. (eds) Trust and Privacy in Digital Business. TrustBus 2004. Lecture Notes in Computer Science, vol 3184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30079-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-30079-3_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22919-3
Online ISBN: 978-3-540-30079-3
eBook Packages: Springer Book Archive