Legally Fair Contract Signing Without Keystones - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Legally Fair Contract Signing Without Keystones


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.
Fichier principal
Vignette du fichier
363.pdf (554.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01377993 , version 1 (08-10-2016)



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⟩
101 View
176 Download



Gmail Facebook X LinkedIn More