Oblivious transfer with adaptive queries

Moni Naor, Benny Pinkas

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

140 Scopus citations


We provide protocols for the following two-party problem: One party, the sender, has N values and the other party, the receiver, would like to learn k of them, deciding which ones in an adaptive manner (i.e. the ith value may depend on the first i−1 values). The sender does not want the receiver to obtain more than k values. This is a variant of the well known Oblivious Transfer (OT) problem and has applications in protecting privacy in various settings. We present efficient protocols for the problem that require an O(N) computation in the preprocessing stage and fixed computation (independent of k) for each new value the receiver obtains. The on-line computation involves roughly log N invocations of a 1-out-2 OT protocol. The protocols are based on a new primitive, sum consistent synthesizers.

Original languageEnglish
Title of host publicationAdvances in Cryptology – CRYPTO 1999 - 19th Annual International Cryptology Conference, Proceedings
EditorsMichael Wiener
PublisherSpringer Verlag
Number of pages18
ISBN (Print)3540663479, 9783540663478
StatePublished - 1999
Externally publishedYes
Event19th Annual International Cryptology Conference, CRYPTO 1999 - Santa Barbara, United States
Duration: 15 Aug 199919 Aug 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference19th Annual International Cryptology Conference, CRYPTO 1999
Country/TerritoryUnited States
CitySanta Barbara

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1999.


Dive into the research topics of 'Oblivious transfer with adaptive queries'. Together they form a unique fingerprint.

Cite this