Statistical Security in Two-Party Computation Revisited

ePrint Report: Statistical Security in Two-Party Computation Revisited

Saikrishna Badrinarayanan, Sikhar Patranabis, Pratik Sarkar

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 …

computation eprint report party security