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
Cite
CITATION STYLE
Goyal, V., Ishai, Y., & Song, Y. (2022). Tight Bounds on the Randomness Complexity of Secure Multiparty Computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13510 LNCS, pp. 483–513). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-15985-5_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
