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

Practical Adaptive Oblivious Transfer from Simple Assumptions

Matthew Green, Susan Hohenberger

Published Jan 1, 2011• 44 citations
Publisher
DOI
10.1007/978-3-642-19571-6_21

Related papers

Adaptive Oblivious Transfer with Access Control from Lattice Assumptions

Benoît Libert, San Ling, Fabrice Mouhartem +2 more

Lecture notes in computer science•Jan 1, 2017•22 citations

Adaptive oblivious transfer with access control from lattice assumptions

Benoît Libert, San Ling, Fabrice Mouhartem +2 more

Theoretical Computer Science•Sep 8, 2021•3 citations

Efficient Adaptive Oblivious Transfer Without q-type Assumptions in UC Framework

Vandana Guleria, Ratna Dutta

Lecture notes in computer science•Jan 1, 2015•1 citation

Simple Adaptive Oblivious Transfer without Random Oracle

Kaoru Kurosawa, Ryo Nojima

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

Adaptive Oblivious Transfer and Generalizations

Olivier Blazy, Céline Chevalier, Paul Germouty

•Jan 1, 2016•0 citations

Simple Adaptive Oblivious Transfer Without Random Oracle.

Kaoru Kurosawa, Ryo Nojima

Abstract. Adaptive oblivious transfer (adaptive OT) schemes have wide applications such as oblivious database searches, secure multiparty computation and etc. It is a two-party protocol which simulates an ideal world such that the sender sends M1, · · · , Mn to the trusted third party (TTP) first, and then the receiver receives Mσi from TTP adaptively for i = 1, 2, · · · k. In the standard model, however, the fully simulatable schemes known so far had to rely on dynamic assumptions such as q-strong DH assumption, q-PDDH assumption and q-hidden LRSW assumption. This paper shows two fully simulatable adaptive OT schemes which do not rely on dynamic assumptions in the standard model. Our first scheme holds under the DDH assumption and our second scheme holds under the Paillier’s decisional Nth residuosity assumption, respectively.

•Jan 1, 2009•0 citations
Abstract. Adaptive oblivious transfer (adaptive OT) schemes have wide applications such as oblivious database searches, secure multiparty computation and etc. It is a two-party protocol which simulates an ideal world such that the sender sends M1, · · · , Mn to the trusted third party (TTP) first, and then the receiver receives Mσi from TTP adaptively for i = 1, 2, · · · k. In the standard model, however, the fully simulatable schemes known so far had to rely on dynamic assumptions such as q-strong DH assumption, q-PDDH assumption and q-hidden LRSW assumption. This paper shows two fully simulatable adaptive OT schemes which do not rely on dynamic assumptions in the standard model. Our first scheme holds under the DDH assumption and our second scheme holds under the Paillier’s decisional Nth residuosity assumption, respectively.