Computationally secure oblivious transfer

Moni Naor, Benny Pinkas

Research output: Contribution to journalArticlepeer-review

137 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)1-35
Number of pages35
JournalJournal of Cryptology
Volume18
Issue number1
DOIs
StatePublished - Dec 2005
Externally publishedYes

Bibliographical note

HP Labs, 5 Vaughn Drive, Princeton, NJ 08540USA

Keywords

  • Cryptography
  • Oblivious transfer
  • Privacy preserving computation
  • Secure function evaluation

Fingerprint

Dive into the research topics of 'Computationally secure oblivious transfer'. Together they form a unique fingerprint.

Cite this