• Publications
  • Influence
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to $$n-1$$ of the n players. The protocol may be used to compute securely arithmetic circuitsExpand
  • 693
  • 84
  • PDF
Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits
SPDZ (pronounced “Speedz”) is the nickname of the MPC protocol of Damgard et al. from Crypto 2012. In this paper we both resolve a number of open problems with SPDZ; and present several theoreticalExpand
  • 286
  • 28
  • PDF
Overdrive: Making SPDZ Great Again
SPDZ denotes a multiparty computation scheme in the preprocessing model based on somewhat homomorphic encryption (SHE) in the form of BGV. At CCS ’16, Keller et al. presented MASCOT, a replacement ofExpand
  • 96
  • 13
  • PDF
Efficiently Verifiable Computation on Encrypted Data
We study the task of verifiable delegation of computation on encrypted data. We improve previous definitions in order to tolerate adversaries that learn whether or not clients accept the result of aExpand
  • 117
  • 8
  • PDF
Essentially Optimal Robust Secret Sharing with Maximal Corruptions
In a t-out-of-nrobust secret sharing scheme, a secret message is shared among n parties who can reconstruct the message by combining their shares. An adversary can adaptively corrupt upi¾?to t of theExpand
  • 22
  • 7
  • PDF
A Simple Obfuscation Scheme for Pattern-Matching with Wildcards
We give a simple and efficient method for obfuscating pattern matching with wildcards. In other words, we construct a way to check an input against a secret pattern, which is described in terms ofExpand
  • 16
  • 3
  • PDF
Robust Secret Sharing Schemes Against Local Adversaries
We study robust secret sharing schemes in which between one third and one half of the players are corrupted. In this scenario, robust secret sharing is possible only with a share size larger than theExpand
  • 13
  • 3
  • PDF
Secure Computation for Machine Learning With SPDZ
Secure Multi-Party Computation (MPC) is an area of cryptography that enables computation on sensitive data from multiple sources while maintaining privacy guarantees. However, theoretical MPCExpand
  • 17
  • 2
  • PDF
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
We present a protocol that allows to prove in zero-knowledge that committed values xi, yi, zi, i=1,…,l satisfy xiyi=zi, where the values are taken from a finite field. For error probability 2−u theExpand
  • 22
  • 1