Logo image
A synchronous multi-party contract signing protocol improving lower bound of steps
Conference proceeding

A synchronous multi-party contract signing protocol improving lower bound of steps

Jianying Zhou, Jose A. Onieva and Javier Lopez
Security and privacy in dynamic environments : proceedings of the IFIP TC-11 21st International Information Security Conference (SEC 2006), 22-24 May 2006, Karlstad, Sweden, Vol.201, pp.221-232
International Federation for Information Processing
01/01/2006

Abstract

Computer Science Computer Science, Information Systems Computer Science, Software Engineering Computer Science, Theory & Methods Science & Technology Technology
Contract signing is a fundamental service in doing business. The Internet has facilitated the electronic commerce, and it is necessary to find appropriate mechanisms for contract signing in the digital world. A number of two-party contract signing protocols have been proposed with various features. Nevertheless, in some applications, a contract may need to be signed by multiple parties. Less research has been done on multi-party contract signing. In this paper, we propose a new synchronous multi-party contract signing protocol that, with n parties, it reaches a lower bound of 3(n - 1) steps in the all-honest case and 4n - 2 steps in the worst case (i.e., all parties contact the trusted third party). This is so far the most efficient synchronous multi-party contract signing protocol in terms of the number of messages required. We further consider the additional features like timeliness and abuse-freeness in the improved version.
url
https://doi.org/10.1007/0-387-33406-8_19View
Published (Version of record) Open

Metrics

1 Record Views

Details

Logo image