Constructing Optimistic Multi-party Contract Signing Protocols

Barbara Kordy; Saša Radomirović

doi:10.1109/CSF.2012.23

Constructing Optimistic Multi-party Contract Signing Protocols

Barbara Kordy, Saša Radomirović

Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Citations (Scopus)

201 Downloads (Pure)

Abstract

We give an explicit, general construction for optimistic multi-party contract signing protocols. Our construction converts a sequence over any finite set of signers into a protocol specification for the signers. The inevitable trusted third party's role specification and computations are independent of the signer's role specification. This permits a wide variety of protocols to be handled equally by the trusted third party. We give tight conditions under which the resulting protocols satisfy fairness and timeliness. We provide examples of several classes of protocols and we discuss lower bounds for the complexity of fair protocols, both in terms of bandwidth and minimum number of messages. Our results highlight the connection between optimistic fair contract signing protocols and the combinatorial problem of constructing sequences which contain all permutations of a set as subsequences. This connection is stronger than was previously realized.

Original language	English
Title of host publication	2012 IEEE 25th Computer Security Foundations Symposium, CSF 2012
Subtitle of host publication	Proceedings
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	215-229
Number of pages	15
ISBN (Print)	9780769547183
DOIs	https://doi.org/10.1109/CSF.2012.23
Publication status	Published - 2012
Event	25th IEEE Computer Security Foundations Symposium - Cambridge, United States Duration: 25 Jun 2012 → 27 Jun 2012 http://csf2012.seas.harvard.edu/ (Link to Conference website)

Conference

Conference	25th IEEE Computer Security Foundations Symposium
Abbreviated title	CSF 2012
Country/Territory	United States
City	Cambridge
Period	25/06/12 → 27/06/12
Internet address	http://csf2012.seas.harvard.edu/ (Link to Conference website)

ASJC Scopus subject areas

Software

Access to Document

10.1109/CSF.2012.23

Author Accepted Manuscript
© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Accepted author manuscript, 233 KB

Cite this

@inproceedings{7990d60aaefe495696a921e343c7157b,

title = "Constructing Optimistic Multi-party Contract Signing Protocols",

abstract = "We give an explicit, general construction for optimistic multi-party contract signing protocols. Our construction converts a sequence over any finite set of signers into a protocol specification for the signers. The inevitable trusted third party's role specification and computations are independent of the signer's role specification. This permits a wide variety of protocols to be handled equally by the trusted third party. We give tight conditions under which the resulting protocols satisfy fairness and timeliness. We provide examples of several classes of protocols and we discuss lower bounds for the complexity of fair protocols, both in terms of bandwidth and minimum number of messages. Our results highlight the connection between optimistic fair contract signing protocols and the combinatorial problem of constructing sequences which contain all permutations of a set as subsequences. This connection is stronger than was previously realized.",

author = "Barbara Kordy and Sa{\v s}a Radomirovi{\'c}",

note = "Barbara Kordy was supported by the National Research Fund, Luxembourg (C08/IS/26).; 25th IEEE Computer Security Foundations Symposium, CSF 2012 ; Conference date: 25-06-2012 Through 27-06-2012",

year = "2012",

doi = "10.1109/CSF.2012.23",

language = "English",

isbn = "9780769547183",

pages = "215--229",

booktitle = "2012 IEEE 25th Computer Security Foundations Symposium, CSF 2012",

publisher = "Institute of Electrical and Electronics Engineers",

url = "http://csf2012.seas.harvard.edu/",

}

Kordy, B & Radomirović, S 2012, Constructing Optimistic Multi-party Contract Signing Protocols. in 2012 IEEE 25th Computer Security Foundations Symposium, CSF 2012 : Proceedings. Institute of Electrical and Electronics Engineers, Piscataway, pp. 215-229, 25th IEEE Computer Security Foundations Symposium, Cambridge, Massachusetts, United States, 25/06/12. https://doi.org/10.1109/CSF.2012.23

TY - GEN

T1 - Constructing Optimistic Multi-party Contract Signing Protocols

AU - Kordy, Barbara

AU - Radomirović, Saša

N1 - Barbara Kordy was supported by the National Research Fund, Luxembourg (C08/IS/26).

PY - 2012

Y1 - 2012

N2 - We give an explicit, general construction for optimistic multi-party contract signing protocols. Our construction converts a sequence over any finite set of signers into a protocol specification for the signers. The inevitable trusted third party's role specification and computations are independent of the signer's role specification. This permits a wide variety of protocols to be handled equally by the trusted third party. We give tight conditions under which the resulting protocols satisfy fairness and timeliness. We provide examples of several classes of protocols and we discuss lower bounds for the complexity of fair protocols, both in terms of bandwidth and minimum number of messages. Our results highlight the connection between optimistic fair contract signing protocols and the combinatorial problem of constructing sequences which contain all permutations of a set as subsequences. This connection is stronger than was previously realized.

AB - We give an explicit, general construction for optimistic multi-party contract signing protocols. Our construction converts a sequence over any finite set of signers into a protocol specification for the signers. The inevitable trusted third party's role specification and computations are independent of the signer's role specification. This permits a wide variety of protocols to be handled equally by the trusted third party. We give tight conditions under which the resulting protocols satisfy fairness and timeliness. We provide examples of several classes of protocols and we discuss lower bounds for the complexity of fair protocols, both in terms of bandwidth and minimum number of messages. Our results highlight the connection between optimistic fair contract signing protocols and the combinatorial problem of constructing sequences which contain all permutations of a set as subsequences. This connection is stronger than was previously realized.

UR - http://www.scopus.com/inward/record.url?scp=84866952388&partnerID=8YFLogxK

U2 - 10.1109/CSF.2012.23

DO - 10.1109/CSF.2012.23

M3 - Conference contribution

AN - SCOPUS:84866952388

SN - 9780769547183

SP - 215

EP - 229

BT - 2012 IEEE 25th Computer Security Foundations Symposium, CSF 2012

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 25th IEEE Computer Security Foundations Symposium

Y2 - 25 June 2012 through 27 June 2012

ER -

Constructing Optimistic Multi-party Contract Signing Protocols

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this