## CryptoDB

### Paper: 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 Search ePrint Search Google Slides CRYPTO 2022 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
##### 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
}