I
Ivan Damgård
Researcher at Aarhus University
Publications - 363
Citations - 26742
Ivan Damgård is an academic researcher from Aarhus University. The author has contributed to research in topics: Secure multi-party computation & Encryption. The author has an hindex of 75, co-authored 355 publications receiving 24160 citations. Previous affiliations of Ivan Damgård include BRICS & Université de Montréal.
Papers
More filters
Proceedings ArticleDOI
Multiparty unconditionally secure protocols
TL;DR: It is shown that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest and the secrecy achieved is unconditional.
Book ChapterDOI
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
TL;DR: In this paper, the authors show how to transform a proof of knowledge P into a witness indistinguishable protocol, in which the prover demonstrates knowledge of the solution to some subset of n problem instances out of a collection of subsets denned by a secret sharing scheme S on n participants.
Book ChapterDOI
A design principle for hash functions
TL;DR: Apart from suggesting a generally sound design principle for hash functions, the results give a unified view of several apparently unrelated constructions of hash functions proposed earlier, and suggests changes to other proposed constructions to make a proof of security potentially easier.
Book ChapterDOI
Multiparty Computation from Somewhat Homomorphic Encryption
TL;DR: A general multiparty computation protocol secure against an active adversary corrupting up to $$n-1$$ of the n players is proposed, which may be used to compute securely arithmetic circuits over any finite field $$\mathbb {F}_{p^k}$$.
Book ChapterDOI
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
Ivan Damgård,Mads J. Jurik +1 more
TL;DR: 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 is proposed.