Publication Type

Journal Article

Version

acceptedVersion

Publication Date

9-2016

Abstract

We introduce the concept of optimistic fair exchange of distributed signatures (OFEDS) which allows two groups of parties to fairly exchange digital signatures. Specifically, an authorized set of parties from each group can jointly take part in the protocol on behalf of the affiliated group to fulfill obligation, and a semi-trusted arbitrator will intervene in the protocol only when there are disputes between two sides. Our OFEDS extends the functionality of optimistic fair exchange of threshold signatures to a more generic case. We formalize the security model of OFEDS, in which besides the standard security requirements for existing optimistic fair exchange protocols, robustness is incorporated so that OFEDS can be successfully performed even when there exist some dishonest signers. We propose a non-interactive construction of OFEDS based on the well-established Computational Diffie-Hellman (CDH) assumption. Our proposal shows that there exists CDH-based OFEDS for any general monotone access structure. Theoretical and experimental analyses demonstrate our OFEDS construction has reasonable efficiency for real applications.

Keywords

Optimistic fair exchange, Distributed signature, Secret sharing, Monotone span program, Verifiably encrypted signatures

Discipline

Information Security

Research Areas

Cybersecurity

Publication

Future Generation Computer Systems

Volume

62

First Page

29

Last Page

39

ISSN

0167-739X

Identifier

10.1016/j.future.2016.03.012

Publisher

Elsevier

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1016/j.future.2016.03.012

Download

Share

COinS