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

Lecture notes in computer science

Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer

Geoffroy Couteau, Bill Roscoe, Peter Y. A. Ryan

Published Jan 1, 2021• 8 citations
Publisher
DOI
10.1007/978-3-030-90567-5_17

Related papers

Conditional Oblivious Transfer and Timed-Release Encryption

Giovanni Di Crescenzo, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan

Lecture notes in computer science•Jan 1, 1999•109 citations

Effective Oblivious Transfer Using a Probabilistic Encryption

Alexander Frolov

Advances in intelligent and soft computing•Jul 11, 2012•1 citation

Efficient Fair Secure Two-Party Computation

Ou Ruan, Zhou Jing, Minghui Zheng +1 more

Yao first introduced a constant-round protocol for secure two-party computation (2PC) withstanding semi-honest adversaries by using a tool called "garbled circuit". Later, many protocols based on garbled circuit approach have been presented, most of which discussed malicious adversaries and efficiency about 2PC. However, there only have a few protocols dealing with the fundamental property of fairness for Yao's garbled circuit approach, in which one involved a trusted third party and the others are very expensive. In the paper, we propose' an efficient Yao's garbled circuit protocol for fair secure 2PC based on ElGamal encryption, Pedersen commitment, Cachin et al.'s verifiable oblivious transfer and Ou-Ruan et al.'s gradual release homomorphic timed commitment. The protocol achieves two advantages: it doesn't need the third party and it is more efficient than other fair secure Yao's protocols.

IEEE Asia-Pacific Services Computing Conference (APSCC)•Dec 1, 2012•5 citations

Partial Fairness in Secure Two-Party Computation

Steven Gordon, Jonathan I. Katz

Journal of Cryptology•Sep 14, 2010•35 citations

Partial Fairness in Secure Two-Party Computation

Steven Gordon, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2010•74 citations

Timed-release oblivious transfer

Lingling Xu, Fangguo Zhang, Shaohua Tang

We study a variant of oblivious transfer, we called timed-release oblivious transfer that permits a sender to restrict when each receiver may open his chosen messages, without learning anything about the receiver's message choices. To achieve this functionality, we import a time server into the protocol that broadcasts a time token periodically and needs neither to interact with the sender nor the receiver. In our generic construction for the protocol, a primitive called verifiably ID-based encrypted blind signature is introduced as a basic building block. We also present a concrete scheme for the protocol's generic construction. Copyright © 2013 John Wiley & Sons, Ltd.

Security and Communication Networks•Aug 28, 2013•9 citations
Yao first introduced a constant-round protocol for secure two-party computation (2PC) withstanding semi-honest adversaries by using a tool called "garbled circuit". Later, many protocols based on garbled circuit approach have been presented, most of which discussed malicious adversaries and efficiency about 2PC. However, there only have a few protocols dealing with the fundamental property of fairness for Yao's garbled circuit approach, in which one involved a trusted third party and the others are very expensive. In the paper, we propose' an efficient Yao's garbled circuit protocol for fair secure 2PC based on ElGamal encryption, Pedersen commitment, Cachin et al.'s verifiable oblivious transfer and Ou-Ruan et al.'s gradual release homomorphic timed commitment. The protocol achieves two advantages: it doesn't need the third party and it is more efficient than other fair secure Yao's protocols.
We study a variant of oblivious transfer, we called timed-release oblivious transfer that permits a sender to restrict when each receiver may open his chosen messages, without learning anything about the receiver's message choices. To achieve this functionality, we import a time server into the protocol that broadcasts a time token periodically and needs neither to interact with the sender nor the receiver. In our generic construction for the protocol, a primitive called verifiably ID-based encrypted blind signature is introduced as a basic building block. We also present a concrete scheme for the protocol's generic construction. Copyright © 2013 John Wiley & Sons, Ltd.