Cryptology ePrint Archive: Report 2021/1433

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds

Arka Rai Choudhuri and Michele Ciampi and Vipul Goyal and Abhishek Jain and Rafail Ostrovsky

Abstract: Oblivious transfer (OT) is a foundational primitive within cryptography owing to its connection with secure computation. One of the oldest constructions of oblivious transfer was from certified trapdoor permutations (TDPs). However several decades later, we do not know if a similar construction can be obtained from TDPs in general.

In this work, we study the problem of constructing round optimal oblivious transfer from trapdoor permutations. In particular, we obtain the following new results (in the plain model) relying on TDPs in a black-box manner:

1) Three-round oblivious transfer protocol that guarantees indistinguishability-security against malicious senders (and semi-honest receivers). 2) Four-round oblivious transfer protocol secure against malicious adversaries with black-box simulation-based security. By combining our second result with an already known compiler we obtain the first round-optimal 2-party computation protocol that relies in a black-box way on TDPs. A key technical tool underlying our results is a new primitive we call dual witness encryption (DWE) that may be of independent interest.

Category / Keywords: foundations / Two-Party Computation, Trapdoor Permutations, Oblivious Transfer

Original Publication (with minor differences): IACR-TCC-2021

Date: received 25 Oct 2021

Contact author: achoud at cs jhu edu, michele ciampi at ed ac uk, goyal at cs cmu edu, abhishek at cs jhu edu, rafail at cs ucla edu

Available format(s): PDF | BibTeX Citation

Version: 20211026:065839 (All versions of this report)

Short URL: ia.cr/2021/1433


[ Cryptology ePrint archive ]