Cryptology ePrint Archive: Report 2016/363

Legally Fair Contract Signing Without Keystones

Houda Ferradi, Rémi Géraud, Diana Maimut,, David Naccache, and David Pointcheval

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.

Category / Keywords: public-key cryptography /

Date: received 8 Apr 2016

Contact author: houda ferradi at ens fr

Available format(s): PDF | BibTeX Citation

Version: 20160411:144055 (All versions of this report)

Short URL: ia.cr/2016/363

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]