A Fair and Abuse-Free Contract Signing Protocol from Boneh-Boyen Signature

Heidarvand, Somayeh; Villar, Jorge L.

doi:10.1007/978-3-642-22633-5_9

Cited by 6 publications

(9 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…and Villar et el. [5], [14] we can say that RSA is compatible with some contract signing mechanisms used today and that gives us confidence in our research. We mainly focused on the different cryptographic primitives used rather than the protocols or their efficiency.…”

Section: Related Worksupporting

confidence: 58%

“…[12] used partial signature scheme with a variant of Boneh-Boyen which is also fair, abuse-free and optimistic but applicable only for two signers. Juan et el.,Wang et el.,Gao et el.,Li et el., Chen et el., Villar et el., [1], [5], [8], [11], [13], [14], [12] have successfully proven existence of abuse-freeness and therefore we can say that contract signing protocols can be be abuse-free. Juan et el., Barbara et el., Sjouke et el.,Li et el.,Villar et el, [1], [8], [7], [9], [13], [12] in their articles used Private contract signature objects which have limitations either concerning with properties or number of signers, therefore Private Contract signature may not be a solution for us.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

http://www.mecs-press.org/ijitcs/ijitcs-v9-n5/v9n5-1.html

Rangavajjula¹,

Claverie²

2017

IJITCS

View full text Add to dashboard Cite

Abstract-Multi-party contract signing (MPCS) is a way for signers to agree on a predetermined contract by exchanging their signature. This matter has become crucial with the growing number of communications. In this paper, we focus mainly on studying the state of the art protocols and more specifically the cryptography involved. We identify the major advances in MPCS, highlight a few gaps with the current protocols and propose an algorithm for contract signing to be abusefree, optimistic for many signers in industrial standards.

show abstract

Section: Related Worksupporting

confidence: 58%

Section: Related Workmentioning

confidence: 99%

http://www.mecs-press.org/ijitcs/ijitcs-v9-n5/v9n5-1.html

Rangavajjula¹,

Claverie²

2017

IJITCS

View full text Add to dashboard Cite

show abstract

“…The protocol execution requires an interaction of 7 rounds, 14 modular exponentiations and approximately 1350 bytes of data exchanged. Using Diffie-Hellman assumptions, Heidarvand and Villar [19] suggested a contract-signing protocol using a variant of the Boneh-Boyen [20] signature scheme. In this protocol, the signer, A, first reveals only a partial signature to B.…”

Section: Related Workmentioning

confidence: 99%

“…The performance of the proposed contract-signing protocol is analysed. Then, the protocol performance is compared with that of other related protocols including the scheme based on an 'RSA multi-signature', proposed by Wang [16], Asokan et al's [ 15] schemes which is based on a 'verifiable escrow', and the protocol suggested by Heidarvand and Villar [19] which uses the 'Boneh-Boyen's signature'. For performance comparison purposes, the number of rounds, computational and communication costs in the commit-contact and reveal-contract sub-protocols are used as efficiency indicators.…”

Section: Performance Of the Proposed Protocolmentioning

confidence: 99%

Efficient abuse‐free fair contract‐signing protocol based on an ordinary crisp commitment scheme

Al-Saggaf

Ghouti

2015

IET Information Security

View full text Add to dashboard Cite

A mathematical framework for conventional commitment schemes is proposed. Digital contract-signing protocols represent an important application of the proposed framework, where usually two mistrusted parties wish to exchange their commitments in a fair way. Building on a variant of the proposed framework, an efficient contract-signing protocol over the Internet is developed. The latter protocol is 'optimistic, fairness and abuse-free'. Detailed security and performance analyses are provided. The performance analysis reveals an important computational aspect of the proposed protocol which requires only 'four rounds' to complete unlike existing protocols. Moreover, the communication and computational costs are relatively small. Given these theoretical and practical features, the proposed contract-signing protocol is not only of theoretical interest, but it also enjoys practical merits which make it very suitable for electronic transactions requiring online signature exchange.

show abstract

“…Since then, extensive research on the issue [5,6,[9][10][11][12][13][16][17][18][19][20][21] have been conducted. An optimistic fair exchange protocol consists of a signer, a verifier, and a semi-trusted third party named "arbitrator".…”

Section: Related Workmentioning

confidence: 99%

Perfect Ambiguous Optimistic Fair Exchange

Wang

Susilo

2012

Information and Communications Security

View full text Add to dashboard Cite

Abstract. Protocol for fair exchange of digital signatures is essential in many applications including contract signing, electronic commerce, or even peer-to-peer file sharing. In such a protocol, two parties, Alice and Bob, would like to exchange digital signatures on some messages in a fair way. It is known that a trusted arbitrator is necessary in the realization of such a protocol. We identify that in some scenarios, it is required that prior to the completion of the protocol, no observer should be able to tell whether Alice and Bob are conducting such an exchange. Consider the following scenario in which Apple engages Intel in an exchange protocol to sign a contract that terminates their OEM agreement. The information would be of value to a third party (such as the stock broker, or other OEM companies). If the protocol transcript can serve as an evidence that such a communication is in progress, any observer of this communication, including the employees of both companies, would be tempted to capture the transcript and sell it to outsiders. We introduce a new notion called perfect ambiguous optimistic fair exchange (PAOFE), which is particularly suitable to the above scenario. PAOFE fulfils all traditional requirements of cryptographic fair exchange of digital signatures and, in addition, guarantees that the communication transcript cannot be used as a proof to convince others that the protocol is in progress. Specifically, we formalize the notion of PAOFE and present a rigorous security model in the multi-user setting under the chosen-key attack. We also present a generic construction of PAOFE from existing cryptographic primitives and prove that our proposal is secure with respect to our definition in the standard model.

show abstract

A Fair and Abuse-Free Contract Signing Protocol from Boneh-Boyen Signature

Cited by 6 publications

References 30 publications

http://www.mecs-press.org/ijitcs/ijitcs-v9-n5/v9n5-1.html

http://www.mecs-press.org/ijitcs/ijitcs-v9-n5/v9n5-1.html

Efficient abuse‐free fair contract‐signing protocol based on an ordinary crisp commitment scheme

Perfect Ambiguous Optimistic Fair Exchange

Contact Info

Product

Resources

About