Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result

By David Chaum, Ivan Bjerre Damgård, J. V. D. Graaf. 1987

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Ari Juels
2. Eli Ben-Sasson
3. Dan Boneh
4. Markus Jakobsson
5. Rafail M. Ostrovsky
6. Serge Fehr
7. Zuzana Beerliová-Trubíniová
8. Martin Hirt

Citations in the corpus

• On the Capacity of Secure Distributed Matrix Multiplication (2018, background): “Some previous works include secure two-party computation [1] which proposed using one-way functions to achieve security, and secure multi-party computation [2], [3] to name a few.”
• Perfectly-Secure MPC with Linear Communication Complexity (2008, background): “The first generic solutions presented in [GMW87, CDvdG87 , GHY87] (based on cryptographic intractability assumptions) and later [BGW88, CCD88, RB89, Bea91b] (with informationtheoretic security) are rather inefficient and thus of theoretical interest mainly.”
• Mix and Match: Secure Function Evaluation via Ciphertexts (2000, methodology): “While drawing on table-based approaches to secure function evaluation, and particularly on the frameworks presented in [12,22], mix and match offers robustness without the use of VSS on input values or sharing of intermediate values.”
• Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority (2012, background): “The problem of MPC was initially introduced by Yao [23], with the first generic solutions presented in [17,9].”