Welcome to the resource topic for 2017/1156
Title:
Two-Round Multiparty Secure Computation from Minimal Assumptions
Authors: Sanjam Garg, Akshayaram Srinivasan
Abstract:We provide new two-round multiparty secure computation (MPC) protocols assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure against semi-honest adversaries (in the plain model) then so is our two-round MPC protocol. Similarly, if the assumed two-round OT protocol is secure against malicious adversaries (in the common random/reference string model) then so is our two-round MPC protocol. Previously, two-round MPC protocols were only known under relatively stronger computational assumptions. Finally, we provide several extensions.
ePrint: https://eprint.iacr.org/2017/1156
Talk: https://www.youtube.com/watch?v=1TqbvN-_id4
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .