• Publications
  • Influence
Efficient Receipt-Free Voting Based on Homomorphic Encryption
TLDR
We analyze the security of the multi-authority voting protocol of Benaloh and Tuinstra and demonstrate that this protocol is not receiptfree, opposed to what was claimed in the paper and was believed before. Expand
  • 523
  • 33
  • PDF
Perfectly-Secure MPC with Linear Communication Complexity
TLDR
We present a perfectly secure MPC protocol communicating O(n) field elements per multiplication. Expand
  • 157
  • 17
  • PDF
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
TLDR
The classical results in unconditional multi-party computation among a set of n players state that less than n/2 passive or less than 3 active adversaries can be tolerated; assuming a broadcast channel the threshold for active adversaries is n/3. Expand
  • 184
  • 13
  • PDF
Efficient Multiparty Computations Secure Against an Adaptive Adversary
TLDR
We consider verifiable secret sharing (VSS) and multiparty computation (MPC) in the secure-channel model, where a broadcast channel is given and a non-zero error probability is allowed. Expand
  • 214
  • 12
  • PDF
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
TLDR
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party among the players. Expand
  • 221
  • 10
  • PDF
Optimally efficient multi-valued byzantine agreement
TLDR
We present the first Byzantine agreement protocol in which the message is communicated only <i>O</i>(<i>n</i>) times (the hidden factor is less than 2). Expand
  • 61
  • 9
  • PDF
Efficient Multi-party Computation with Dispute Control
TLDR
We present an active MPC protocol that provides optimal (t < n/2) security and communicates only O(n 2 ) field elements per multiplication. Expand
  • 99
  • 8
  • PDF
Robustness for Free in Unconditional Multi-party Computation
TLDR
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. Expand
  • 80
  • 7
  • PDF
Asynchronous Multi-Party Computation with Quadratic Communication
TLDR
We present an efficient protocol for secure multi-party computation in the asynchronous model with optimal resilience, which improves on the previously known solutions by a factor of i¾?(n). Expand
  • 23
  • 6
  • PDF