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

Adaptively Secure Oblivious Transfer

Donald Beaver

Published Jan 1, 1998• 14 citations
Publisher
DOI
10.1007/3-540-49649-1_24

Related papers

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

Yehuda Lindell, Hila Zarosim

Journal of Cryptology•Jul 27, 2010•20 citations

Efficient and Round-Optimal Oblivious Transfer and Commitment with Adaptive Security

Ran Canetti, Pratik Sarkar, Xiao Shaun Wang

Lecture notes in computer science•Jan 1, 2020•18 citations

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

Yehuda Lindell, Hila Zarosim

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

Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer

Juan A. Garay, Daniel Wichs, Hong-Sheng Zhou

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

Computationally Secure Oblivious Transfer

Moni Naor, Benny Pinkas B

Journal of Cryptology•Oct 21, 2004•181 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
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.