Round Optimal Concurrent MPC via Strong Simulation
IACR Cryptology ePrint Archive, Volume 2017, 2017.
In this paper, we study the round complexity of concurrently secure multi-party computation (MPC) with super-polynomial simulation (SPS) in the plain model. In the plain model, there are known explicit attacks that show that concurrently secure MPC with polynomial simulation is impossible to achieve; SPS security is the most widely studie...More
Full Text (Upload PDF)
PPT (Upload PPT)