Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Fair Exchange of Secrets (extended abstract)

Tom Tedrick

Published Aug 12, 2007• 11 citations
Publisher
DOI
10.1007/3-540-39568-7_34

Related papers

Timed Fair Exchange of Standard Signatures: [Extended Abstract].

Juan A. Garay, Carl B. Pomerance

Financial Cryptography•Jan 1, 2003•31 citations

A New Fair Exchange of Secrets by Oblivious Transfer Protocol

Yongju Yi, Sangchoon Kim, Young-gip Kim +1 more

한국통신학회 학술대회 및 강연회•May 1, 2000•0 citations

Optimally-Fair Multi-party Exchange Without Trusted Parties

Ivo Maffei, Andrew William Roscoe

Abstract We present a multi-party exchange protocol that achieves optimal partial fairness even in the presence of a dishonest majority. We demonstrate how this protocol can be applied to any type of multi-party exchange scenario where the network topology is complete. When combined with standard secure multi-party computation techniques, our protocol enables SMPC with partial fairness when a dishonest majority is involved. Fairness optimality is proven in an abstract model which applies to all protocols based on the concept of concealing the point when the secrets are exchanged. Our protocol improves known results via the use of timed-release encryption and commutative blinding.

Lecture notes in computer science•Jan 1, 2024•1 citation

Rational Secret Sharing, Revisited

Steven Gordon, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2006•187 citations

Purely Rational Secret Sharing (Extended Abstract)

Silvio M. Micali, Abhi A. Shelat

Lecture notes in computer science•Jan 1, 2009•44 citations

Optimally-Fair Exchange of Secrets via Delay Encryption and Commutative Blinding

Ivo Maffei, Andrew William Roscoe

Abstract We propose a new fair exchange protocol that takes advantage of delay encryption and commutative encryption to achieve optimal partial fairness among all protocols involving one-way messages. Our protocol consists of 3 setup messages and $$2N+1$$ 2 N + 1 exchange messages and it is fair against covert adversaries with probability $$1- \frac{1}{2N}$$ 1 - 1 2 N . We prove that this is optimal up to shortening the setup phase which is notably more efficient than existing protocols.

Lecture notes in computer science•Nov 30, 2023•3 citations
Abstract We present a multi-party exchange protocol that achieves optimal partial fairness even in the presence of a dishonest majority. We demonstrate how this protocol can be applied to any type of multi-party exchange scenario where the network topology is complete. When combined with standard secure multi-party computation techniques, our protocol enables SMPC with partial fairness when a dishonest majority is involved. Fairness optimality is proven in an abstract model which applies to all protocols based on the concept of concealing the point when the secrets are exchanged. Our protocol improves known results via the use of timed-release encryption and commutative blinding.
Abstract We propose a new fair exchange protocol that takes advantage of delay encryption and commutative encryption to achieve optimal partial fairness among all protocols involving one-way messages. Our protocol consists of 3 setup messages and 2N+12N+12N+1 2 N + 1 exchange messages and it is fair against covert adversaries with probability 1−12N1- \frac{1}{2N}1−2N1​ 1 - 1 2 N . We prove that this is optimal up to shortening the setup phase which is notably more efficient than existing protocols.