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 Transactions on Fundamentals of Electronics Communications and Computer Sciences

An Approximate Scheme of Oblivious Transfer with Probabilistic Receipt

Shoichi Hirose, Susumu Yoshida

Published Jan 1, 2004• 0 citations
OpenAlex

Related papers

Effective Oblivious Transfer Using a Probabilistic Encryption

Alexander Frolov

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

A Proposal for Device Independent Probabilistic Quantum Oblivious Transfer

Jyotirmoy Basak, Kaushik Chakraborty, Arpita Maitra +1 more

Lecture notes in computer science•Jan 1, 2022•2 citations

Improvement of Camenisch-Neven-Shelat Oblivious Transfer Scheme.

Zhengjun Cao, Hanyue Cao

Abstract. In 2007, Camenisch, Neven and Shelat proposed an adaptive oblivious transfer (OT) in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other. In this paper, we show that the scheme has a drawback that the sender can only serve a single receiver only once. The drawback results from the deterministic encryption used. To fix it, we suggest to replace the deterministic encryption with a probabilistic encryption. The OT scheme adopts the paradigm of “encryption and proof of knowledge ” in order to force the sender to keep the consistency of the transferred messages. We remark that the paradigm is unnecessary. In most reasonable applications of OT, the transferred messages must be recognizable for the receiver or the sender is willing to disclose some messages to the receiver. This property has been explicitly specified in the earlier works by Rabin, Even, Goldreich and Lempel.

International journal of network security•Jan 1, 2013•0 citations

Distributed Oblivious Transfer with Adaptive Queries

Shuxian Jiang, Hongda Li, Bao Li

We study Distributed Oblivious Transfer(DOT) scheme in the adaptive version, which means the receiver should ask threshold number of servers to retrieve each secret, and the receiver could adaptively determine which secret would be retrieved and which servers to query. This protocol has both advantages of DOT and adaptive OT, thus inherently has good broad uses. Our first attempt to build such scheme follows the present DOT scheme and considers the semi-honest parties. The second protocol strengthens the security of the first one. It prevents potential malicious behaviors of servers, therefore it is a verifiable distributed oblivious transfer scheme with adaptive queries.

•Apr 1, 2010•1 citation

On the Feasibility of Extending Oblivious Transfer

Yehuda Lindell, Hila Zarosim

Lecture notes in computer science•Jan 1, 2013•19 citations

On the Feasibility of Extending Oblivious Transfer

Yehuda Lindell, Hila Zarosim

Journal of Cryptology•Dec 4, 2017•2 citations
Abstract. In 2007, Camenisch, Neven and Shelat proposed an adaptive oblivious transfer (OT) in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other. In this paper, we show that the scheme has a drawback that the sender can only serve a single receiver only once. The drawback results from the deterministic encryption used. To fix it, we suggest to replace the deterministic encryption with a probabilistic encryption. The OT scheme adopts the paradigm of “encryption and proof of knowledge ” in order to force the sender to keep the consistency of the transferred messages. We remark that the paradigm is unnecessary. In most reasonable applications of OT, the transferred messages must be recognizable for the receiver or the sender is willing to disclose some messages to the receiver. This property has been explicitly specified in the earlier works by Rabin, Even, Goldreich and Lempel.
We study Distributed Oblivious Transfer(DOT) scheme in the adaptive version, which means the receiver should ask threshold number of servers to retrieve each secret, and the receiver could adaptively determine which secret would be retrieved and which servers to query. This protocol has both advantages of DOT and adaptive OT, thus inherently has good broad uses. Our first attempt to build such scheme follows the present DOT scheme and considers the semi-honest parties. The second protocol strengthens the security of the first one. It prevents potential malicious behaviors of servers, therefore it is a verifiable distributed oblivious transfer scheme with adaptive queries.