Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority

196 citations recorded by the source corpus.

How researchers see this paper

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

Prio: Private, Robust, and Scalable Computation of Aggregate Statistics (2017, background): “Prior many-verifier protocols require relatively expensive public-key primitives [1] or require an amount of server-to-server traffic that grows linearly in the size of the circuit for the Valid function [10].”
Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments (2002, background): “Proofs of membership in a distributed setting have also been introduced in [3] under the name of network zero-knowledge proofs.”
Universally Composable Two-Party and Multi-party Secure Computation (unknown): “, [34, 40, 1, 42, 9]), the security requirements of a given task (i.”
Advances in Cryptology — ASIACRYPT 2002 (2002, methodology): “This notation has been introduced in [3].”
Perfectly-Secure MPC with Linear Communication Complexity (2008, methodology): “Using hyper-invertible matrices and some techniques from [ Bea91a , HMP00,”
Sharemind: A Framework for Fast Privacy-Preserving Computations (2008, background): “Further details and standard results can be found in the manuscripts [3,11,7,8].”
Efficient Secure Computation with Garbled Circuits (2011, background): “In fact, fairness can be ensured in the multi-party setting in the case when a majority of the parties are guaranteed to remain honest [3, 16, 49].”