Optimistic Fair Exchange based on Publicly Verifiable Secret Sharing
Avoine, Gildas; Vaudenay, Serge
2004

Files

Abstract

In this paper we propose an optimistic two-party fair exchange protocol which does not rely on a centralized trusted third party. Instead, the fairness of the protocol relies on the honesty of part of the neighbor participants. This new concept, which is based on a generic verifiable secret sharing scheme, is particularly relevant in networks where centralized authority can neither be used on-line nor off-line.

Details

Title Optimistic Fair Exchange based on Publicly Verifiable Secret Sharing
Author(s) Avoine, Gildas ; Vaudenay, Serge
Published in Information Security and Privacy. ACISP 2004
Series Lecture Notes in Computer Science, 3108
Pages 74-85
Conference Information Security and Privacy: 9th Australasian Conference, ACISP 2004, Sydney, Australia, July 13-15, 2004
Date 2004
Keywords
DOI https://doi.org/10.1007/978-3-540-27800-9_7
Other identifier(s) DAR: 5441
View record in Web of Science
Laboratories LASEC
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LASEC - Security and Cryptography Laboratory
Scientific production and competences > I&C - School of Computer and Communication Sciences > MICS - Mobile Information & Communication Systems
Scientific production and competences > MICS - Mobile Information & Communication Systems
Peer-reviewed publications
Conference Papers
Work produced at EPFL
Published
Record creation date 2007-01-19

PDF