Welcome to the resource topic for 2018/180
Title:
Two-Round Multiparty Secure Computation Minimizing Public Key Operations
Authors: Sanjam Garg, Peihan Miao, Akshayaram Srinivasan
Abstract:We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only (a fixed) \mathsf{poly}(n,\lambda) invocations of a two-round oblivious transfer protocol (which use expensive public-key operations) and \mathsf{poly}(\lambda, |C|) cheaper one-way function calls, where \lambda is the security parameter, n is the number of parties, and C is the circuit being computed. All previously known two-round multiparty secure computation protocols required \mathsf{poly}(\lambda,|C|) expensive public-key operations.
ePrint: https://eprint.iacr.org/2018/180
Talk: https://www.youtube.com/watch?v=VD_6mKnmRjg
Slides: https://crypto.iacr.org/2018/slides/28789.pdf
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 .