International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Tight Bounds on the Randomness Complexity of Secure Multiparty Computation

Authors:
Vipul Goyal , CMU and NTT Research
Yuval Ishai , Technion
Yifan Song , Carnegie Mellon University
Download:
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2022
Abstract: We revisit the question of minimizing the randomness complexity of protocols for secure multiparty computation (MPC) in the setting of perfect information-theoretic security. Kushilevitz and Mansour (SIAM J. Discret. Math., 1997) studied the case of n-party semi-honest MPC for the XOR function with security threshold t
Video from CRYPTO 2022
BibTeX
@inproceedings{crypto-2022-32166,
  title={Tight Bounds on the Randomness Complexity of Secure Multiparty Computation},
  publisher={Springer-Verlag},
  author={Vipul Goyal and Yuval Ishai and Yifan Song},
  year=2022
}