Paper 2022/1190

Statistical Security in Two-Party Computation Revisited

Saikrishna Badrinarayanan, Snap
Sikhar Patranabis, IBM Research Labs, India
Pratik Sarkar, Boston University

We present a new framework for building round-optimal one-sided statistically secure two party computation (2PC) protocols in the plain model. We demonstrate that a relatively weak notion of oblivious transfer (OT), namely a three round elementary oblivious transfer $\textsf{eOT}$ with statistical receiver privacy, along with a non-interactive commitment scheme suffices to build a one-sided statistically secure two party computation protocol with black-box simulation. Our framework enables the first instantiations of round-optimal one-sided statistically secure 2PC protocols from the CDH assumption and certain families of isogeny-based assumptions. As part of our compiler, we introduce the following new one-sided statistically secure primitives in the pre-processing model that might also be of independent interest: 1. Three round statistically sender private random-OT where only the last OT message depends on the receiver's choice bit and the sender receives random outputs generated by the protocol. 2. Four round delayed-input statistically sender private conditional disclosure of secrets where the first two rounds of the protocol are independent of the inputs of the parties. The above primitives are directly constructed from $\textsf{eOT}$ and hence we obtain their instantiations from the same set of assumptions as our 2PC.

Available format(s)
Cryptographic protocols
Publication info
Published by the IACR in TCC 2022
2PC Statistical Security Isogeny Oblivious Transfer MPC Secure Computation
Contact author(s)
bsaikrishna7393 @ gmail com
sikharpatranabis @ gmail com
pratik93 @ bu edu
2022-09-09: approved
2022-09-09: received
See all versions
Short URL
Creative Commons Attribution


      author = {Saikrishna Badrinarayanan and Sikhar Patranabis and Pratik Sarkar},
      title = {Statistical Security in Two-Party Computation Revisited},
      howpublished = {Cryptology ePrint Archive, Paper 2022/1190},
      year = {2022},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.