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 | |
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 |
|
ASJC Scopus subject areas
- Software