Name
Abstract | ||
|---|---|---|
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 studied model for concurrently secure MPC in the plain model. We obtain the following results:Three-round concurrent MPC with SPS security against Byzantine adversaries, assuming sub-exponentially secure DDH and LWE.Two-round concurrent MPC with SPS security against Byzantine adversaries for input-less randomized functionalities, assuming sub-exponentially secure indistinguishability obfuscation and DDH. In particular, this class includes sampling functionalities that allow parties to jointly sample a secure common reference string for cryptographic applications. |
Year | Venue | DocType |
|---|---|---|
2017 | IACR Cryptology ePrint Archive | Conference |
Volume | Citations | PageRank |
2017 | 3 | 0.38 |
References | Authors | |
25 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Saikrishna Badrinarayanan | 1 | 63 | 11.17 |
| Vipul Goyal | 2 | 2859 | 129.53 |
| Abhishek Jain | 3 | 879 | 48.25 |
| Dakshita Khurana | 4 | 57 | 11.60 |
| Amit Sahai | 5 | 13566 | 545.52 |