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

IEICE technical report. Information theory

Gradually releasable commitment schemes and their applications

Taiichi Saito, Shigenori Uchiyama, Hikaru Morita

Published Mar 15, 2001• 0 citations
OpenAlex

Related papers

Controlled Gradual Disclosure Schemes for Random Bits and Their Applications

Richard Cleve

Springer eBooks•Nov 8, 2007•87 citations

Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Lecture notes in computer science•Jan 1, 2000•87 citations

Fair Secure Two-Party Computation Extended Abstract

Benny Pinkas B

Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any substantial advantage by terminating the protocol prematurely. The transformation adds additional steps before and after the execution of the original protocol, but does not change it otherwise, and does not use a trusted third party. It is based on the use of gradual release timed commitments, which are a new variant of timed commitments, and on a novel use of blind signatures for verifying that the committed values are correct. 1

•Jan 1, 2003•2 citations

Efficient Non-Malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Journal of Cryptology•Apr 28, 2009•10 citations

How to simultaneously exchange secrets by general assumptions

Tatsuaki Okamoto, Kazuo Ohta

The simultaneous secret exchange protocol is the key tool for contract signing protocols and certified mail protocols. This paper proposes efficient simultaneous secret exchange protocols (or gradual secret releasing protocols) that are based on general assumptions such as the existence of one-way permutations and one-way functions, while the existing efficient simultaneous secret exchange protocols are based on more constrained assumptions such as specific number theoretic problems and the existence of oblivious transfer primitives (or trap-door one-way permutations). Moreover, while the existing simultaneous secret exchange protocols have an additional requirement that the underlying commit (encryption) function is “ideal”, the above-mentioned “general assumptions” are provably sufficient for our schemes. Therefore, our protocols are provably secure under the general assumptions. In addition, our protocols are at least as efficient as the existing practical protocols, when efficient one-way permutations and one-way functions are used.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Jan 1, 1994•69 citations

Efficient Non-malleable Commitment Schemes

Marc Fischlin, Roger Fischlin

Journal of Cryptology•May 12, 2009•25 citations
Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any substantial advantage by terminating the protocol prematurely. The transformation adds additional steps before and after the execution of the original protocol, but does not change it otherwise, and does not use a trusted third party. It is based on the use of gradual release timed commitments, which are a new variant of timed commitments, and on a novel use of blind signatures for verifying that the committed values are correct. 1
The simultaneous secret exchange protocol is the key tool for contract signing protocols and certified mail protocols. This paper proposes efficient simultaneous secret exchange protocols (or gradual secret releasing protocols) that are based on general assumptions such as the existence of one-way permutations and one-way functions, while the existing efficient simultaneous secret exchange protocols are based on more constrained assumptions such as specific number theoretic problems and the existence of oblivious transfer primitives (or trap-door one-way permutations). Moreover, while the existing simultaneous secret exchange protocols have an additional requirement that the underlying commit (encryption) function is “ideal”, the above-mentioned “general assumptions” are provably sufficient for our schemes. Therefore, our protocols are provably secure under the general assumptions. In addition, our protocols are at least as efficient as the existing practical protocols, when efficient one-way permutations and one-way functions are used.