Journal of Cryptology

, Volume 18, Issue 1, pp 1–35 | Cite as

Computationally Secure Oblivious Transfer

  • Moni NaorEmail author
  • Benny PinkasEmail author


We describe new computationally secure protocols of 1-out-of-N oblivious transfer, k-out-of-N oblivious transfer, and oblivious transfer with adaptive queries. The protocols are very efficient compared with solutions based on generic two-party computation or on information-theoretic security. The 1-out-of-N oblivious transfer protocol requires only log N executions of a 1-out-of-2 oblivious transfer protocol. The k-out-of-N protocol is considerably more efficient than k repetitions of 1-out-of-N oblivious transfer, as is the construction for oblivious transfer with adaptive queries. The efficiency of the new oblivious transfer protocols makes them useful for many applications. A direct corollary of the 1-out-of-N oblivious transfer protocol is an efficient transformation of any Private Information Retrieval protocol to a Symmetric PIR protocol.

Cryptography Privacy preserving computation Secure function evaluation Oblivious transfer 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2004

Authors and Affiliations

  1. 1.Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100Israel
  2. 2.HP Labs, 5 Vaughn Drive, Princeton, NJ 08540USA

Personalised recommendations