Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2017, PT III, pp. 275-303, 2017.
We study the feasibility of two-message protocols for secure two-party computation in the plain model, for functionalities that deliver output to one party, with security against malicious parties. Since known impossibility results rule out polynomial-time simulation in this setting, we consider the common relaxation of allowing super-pol...More
Full Text (Upload PDF)
PPT (Upload PPT)