Detail

The Communication Complexity of Oblivious Transfer

Oblivious transfer (OT) is a simple, yet powerful, cryptographic primitive. It was introduced by Rabin in the 80s and, since then, it has become a well-established primitive in cryptography. It has numerous applications, and it is known to be complete for multiparty computation.

One of the most important efficiency measures for an OT scheme is its communication complexity. In this talk, we will present new results regarding the communication complexity of OT. We will provide answers for the following questions: Can we build an OT scheme with optimal communication? If so, can we prove security under which hardness assumptions? And what is the strongest level of security we can achieve?

This talk is based on joint works with Zvika Brakerski, Nico Döttling, Sihang Pu and Akshayaram Srinivasan.