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

Journal of Systems and Software

Oblivious transfer with timed-release receiver’s privacy

Xu Ma, Lingling Xu, Fangguo Zhang

Published Nov 22, 2010• 16 citations
Publisher
DOI
10.1016/j.jss.2010.11.886

Related papers

Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy

Bingsheng Zhang

Lecture notes in computer science•Jan 1, 2011•9 citations

Conditional Oblivious Transfer and Timed-Release Encryption

Giovanni Di Crescenzo, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan

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

Oblivious Transfers and Privacy Amplification

Gilles Brassard A, Claude Crépeau, Stefan Wolf

Journal of Cryptology•Mar 5, 2003•61 citations

Oblivious Transfers and Privacy Amplification

Gilles Brassard A, Claude Crépeau

Lecture notes in computer science•Jan 1, 1997•35 citations

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

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

Lecture notes in computer science•Jan 1, 2021•8 citations

Oblivious Transfer Protocols Based on Commutative Encryption

Jen-Chieh Hsu, Raylin Tso, Yu‐Chi Chen +1 more

Oblivious transfer (OT) protocol is a fundamental building block of cryptography and can be applied widely in many fields. A secure oblivious transfer protocol is supposed to ensure the privacy of both senders and receivers. The privacy of receivers means that the information being selected by receivers would never be revealed to senders. On the other hand, the privacy of senders means that receivers have no further information except for the one that has been selected. In this case, senders are able to deceive receivers by sending same messages. Likewise, in existing 1-out-of-n OT protocols, malicious senders can make all the n messages the same, so that receivers will always get the specific one assigned by senders. This indicates that privacy of receivers wouldnt work under the 1-out-of-n OT protocol. To prevent this kind of attack, this paper provides a general framework on how to design a secure OT protocol based on commutative and ciphertext equality test and take RSA as an example to explain how the protocol is processed.

IFIP International Conference on New Technologies, Mobility and Security (NTMS)•Feb 1, 2018•4 citations
Oblivious transfer (OT) protocol is a fundamental building block of cryptography and can be applied widely in many fields. A secure oblivious transfer protocol is supposed to ensure the privacy of both senders and receivers. The privacy of receivers means that the information being selected by receivers would never be revealed to senders. On the other hand, the privacy of senders means that receivers have no further information except for the one that has been selected. In this case, senders are able to deceive receivers by sending same messages. Likewise, in existing 1-out-of-n OT protocols, malicious senders can make all the n messages the same, so that receivers will always get the specific one assigned by senders. This indicates that privacy of receivers wouldnt work under the 1-out-of-n OT protocol. To prevent this kind of attack, this paper provides a general framework on how to design a secure OT protocol based on commutative and ciphertext equality test and take RSA as an example to explain how the protocol is processed.