Semi-Homomorphic Encryption and Multiparty Computation

By Rikke Bendlin, Ivan Bjerre Damgård, Claudio Orlandi, Sarah Zakarias. IACR Cryptology ePrint Archive, 2011

435 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/1db2265e3ce510fee6d4d9b39c135bddb4040949

How researchers see this paper

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

In Artificial Intelligence

1. David E. Evans
2. Marcel Keller
3. Yehuda Lindell
4. Mike Rosulek
5. Vladimir Kolesnikov
6. Peter Scholl
7. Jonathan Katz
8. Thomas Schneider

In Computational Theory and Mathematics

1. Marcel Keller
2. David E. Evans
3. Yehuda Lindell
4. Mike Rosulek
5. Peter Scholl
6. Vladimir Kolesnikov
7. Daniel E. Escudero
8. Abhi Shelat

Citations in the corpus

• SPD Z 2 k : Efficient MPC mod 2 k for Dishonest Majority (2018, background): “However, in a recent line of work [2,9], it was observed that we can push the use of public-key tools into a preprocessing phase, where one does not need to know the inputs or even the function to be computed.”
• A Pragmatic Introduction to Secure Multi-Party Computation (2019, methodology): “The Bendlin-Damgård-Orlandi-Zakarias (BDOZ or BeDOZa) technique (Bendlin et al., 2011) incorporates information-theoretic MACs into the secret shares.”
• Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries (2013, methodology): “These include protocols that require exponentiations for every gate in the circuit [28,16] (these can be reasonable for small circuits but not large ones with tens or hundreds of thousands of gates), protocols that use the “cut and choose” technique on garbled circuits [20,21,29,25], and more [27,14”
• SoK: General Purpose Compilers for Secure Multi-Party Computation (2019, methodology): “SCALE implements a two-phase protocol which offloads all public-key operations to an offline pre-processing phase, generates three types of shared randomness to use during protocol execution, and executes an optimized hybrid protocol based on previous work [18], [46], [103].”
• MP-SPDZ: A Versatile Framework for Multi-Party Computation (2020, background): “[12]) and therefore does not scale as well with the number of parties as HighGear.”
• Billion-Gate Secure Computation with Malicious Adversaries (2012, background): “In addition to these original ideas, practical concerns involving large circuits and parallelization will be addressed.”
• Fast, Privacy Preserving Linear Regression over Distributed Datasets based on Pre-Distributed Data (2015, methodology): “One possibility for obtaining security against malicious adversaries is to use the compute with MACs approach [6, 11, 10] to protect the shared values from being manipulated by a malicious adversary.”
• SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority (2018, neutral): “Over the integers modulo 232, the overhead reduces to around 50% more than MASCOT, although here the statistical security parameters of 26 and 32 bits may be too low for some applications.”