Secure Multiparty Computation and Secret Sharing

530 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.

Data Encoding for Byzantine-Resilient Distributed Optimization (2019, methodology): “This is a standard method in Shamir secret sharing scheme [49] that is widely used in information-theoretically secure MPC protocols [50] to provide privacy of users’ data.”
Lifting Private Information Retrieval from Two to any Number of Messages (2018, background): “A T -threshold linear secret sharing scheme [16] can be transformed into the following one-shot scheme.”
Randomized Iterative Methods for Linear Systems: Momentum, Inexactness and Gossip (2019, methodology): “In practice, this might be achieved using secure multiparty protocols [26], causing the overall network bandwidth to slightly increase compared to the usual implementation of standard gossip algorithm.”
SoK: General Purpose Compilers for Secure Multi-Party Computation (2019, background): “CCD [31] rely on secret-sharing schemes supporting strong multiplication [40], [33], [29], [41] rather than on public-key primitives.”
Staircase codes for secret sharing with optimal communication and read overheads (2015, unknown): “, [8]–[10] and references within.”