Skip to Main content Skip to Navigation
Conference papers

Legally Fair Contract Signing Without Keystones

Abstract : In two-party computation, achieving both fairness and guaranteed output delivery is well known to be impossible. Despite this limitation , many approaches provide solutions of practical interest by weakening somewhat the fairness requirement. Such approaches fall roughly in three categories: " gradual release " schemes assume that the aggrieved party can eventually reconstruct the missing information; " optimistic schemes " assume a trusted third party arbitrator that can restore fairness in case of litigation; and " concurrent " or " legally fair " schemes in which a breach of fairness is compensated by the aggrieved party having a digitally signed cheque from the other party (called the keystone). In this paper we describe and analyse a new contract signing paradigm that doesn't require keystones to achieve legal fairness, and give a concrete construction based on Schnorr signatures which is compatible with standard Schnorr signatures and provably secure.
Document type :
Conference papers
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/hal-01377993
Contributor : David Pointcheval <>
Submitted on : Saturday, October 8, 2016 - 12:01:09 PM
Last modification on : Tuesday, December 8, 2020 - 10:14:01 AM
Long-term archiving on: : Monday, January 9, 2017 - 12:20:55 PM

File

363.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Houda Ferradi, Rémi Géraud, Diana Maimut, David Naccache, David Pointcheval. Legally Fair Contract Signing Without Keystones. ACNS 2016 - 14th International Conference Applied Cryptography and Network Security, Jun 2016, Guildford, United Kingdom. pp.175 - 190, ⟨10.1007/978-3-319-39555-5_10⟩. ⟨hal-01377993⟩

Share

Metrics

Record views

278

Files downloads

578