• Publications
  • Influence
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
We propose a generalisation of Paillier's probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without loosing the homomorphic property. Expand
  • 947
  • 86
A Design Principle for Hash Functions
  • I. Damgård
  • Mathematics, Computer Science
  • 1 July 1989
We show that if there exists a computationally collision free function f from m bits to t bits where m > t, then there exists collision free hash function h mapping messages of arbitrary polynomial lengths to t-bit strings. Expand
  • 1,099
  • 84
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. Expand
  • 683
  • 81
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
We use a proof of knowledge P, an access structure Γ, and a secret sharing scheme S for the access structure dual to Γ to build a new protocol, in which the prover shows that he knows some subset of n secrets. Expand
  • 1,090
  • 75
Multiparty unconditionally secure protocols
Under the assumption that each pair can communicate secretly, we show that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest. Expand
  • 1,190
  • 44
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) for the players, provided that the access structure of the LSSS allows MPC or VSS at all. Expand
  • 434
  • 34
Secure Multiparty Computation and Secret Sharing
In a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. Expand
  • 224
  • 33
Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits
In this paper we both resolve a number of open problems with SPDZ; and present several theoretical and practical improvements to the protocol. Expand
  • 281
  • 28
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
We present a statistically-hiding commitment scheme allowing commitment to arbitrary size integers, based on any (Abelian) group with certain properties, most importantly, that it is hard for the committer to compute its order. Expand
  • 287
  • 27