Lecture notes in computer science

Efficient Fair Exchange with Verifiable Confirmation of Signatures

Liqun Chen

Published Jan 1, 1998• 57 citations

Publisher

DOI: 10.1007/3-540-49649-1_23

Related papers

Fair exchange protocol of signatures based on aggregate signatures

Zuhua Shao

Computer CommunicationsJan 2, 200821 citations

Accumulable optimistic fair exchange from verifiably encrypted homomorphic signatures

Jae Hong Seo, Keita Emura, Keita Xagawa +1 more

International Journal of Information SecurityMar 22, 20178 citations

Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures

Jae Hong Seo, Keita Emura, Keita Xagawa +1 more

Lecture notes in computer scienceJan 1, 20151 citation

Efficient verifiable encryption (and fair exchange) of digital signatures

Giuseppe Ateniese

A fair exchange protocol allows two users to exchange items so that either each user gets the other's item or neither user does. In [2], verifiable encryption is introduced as a primitive that can be used to build extremely efficient fair exchange protocols where the items exchanged represent digital signatures. Such protocols may be used to digitally sign contracts.

ACM SIGSAC Conference on Computer and Communications Security (CCS)Nov 1, 1999161 citations

Group-oriented fair exchange of signatures

Qiong Huang, Duncan S. Wong, Willy Susilo

Information SciencesApr 13, 201119 citations

Optimistic Fair Exchange with Transparent Signature Recovery

Olivier Markowitch, Shahrokh Saeednia

Lecture notes in computer scienceJan 1, 200262 citations