International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Two-Round Multiparty Secure Computation Minimizing Public Key Operations

Authors:
Sanjam Garg
Peihan Miao
Akshayaram Srinivasan
Download:
DOI: 10.1007/978-3-319-96878-0_10
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2018
Abstract: We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only (a fixed) $$\mathsf {poly}(n,\lambda )$$ poly(n,λ) invocations of a two-round oblivious transfer protocol (which use expensive public-key operations) and $$\mathsf {poly}(\lambda , |C|)$$ poly(λ,|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|)$$ poly(λ,|C|) expensive public-key operations.
Video from CRYPTO 2018
Video provided under Creative Commons / CC BY 3.0
BibTeX
@inproceedings{crypto-2018-28789,
  title={Two-Round Multiparty Secure Computation Minimizing Public Key Operations},
  booktitle={Advances in Cryptology – CRYPTO 2018},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={10993},
  pages={273-301},
  doi={10.1007/978-3-319-96878-0_10},
  author={Sanjam Garg and Peihan Miao and Akshayaram Srinivasan},
  year=2018
}