Research papers of Ivan Damgård
The list contains selected recent papers, starting
with the most recent one. It is not necessarily complete,
and is definitely incomplete w.r.t. older papers.
Most of my older papers appeared in Crypto or EuroCrypt.
These are accessible through Spinger Verlags
web site (requires you subscribe, so I can't link directly) or using
the CD ROM published by IACR.
You may want to also check the BRICS
web site for additional publications.
All links are to ps files unless otherwise stated.
Ivan Damgård and Jesper Buus Nielsen
Perfect
Hiding and Perfect Binding Universally Composable
Commitment
Schemes with Constant Expansion Factor
Ivan Damgård and Eiichiro Fujisaki
An
Integer Commitment Scheme based on Groups with Hidden order
Ivan Damgård and Jesper Buus Nielsen
An
Efficient Pseudo-Random Generator with Applications to Public-Key Encryption
and
Constant-Round
Multiparty Computation
(has not been published anywhere else, the results will be included
in the journal version of
Cramer, Damgård and Nielsen: Multiparty Computation from
Threshold Homomorphic Encryption).
Ronald Cramer and Ivan Damgård
Secure
distributed linear algebra in a constant number of rounds
(Appears in prod. of Crypto 2001)
Ronald Cramer, Ivan Damgård and Serge Fehr:
On
the cost of reconstructing a secret, or VSS with optimal reconstruction
phase
(Appears in Proc. of Crypto 2001)
Peter Møller Nielsen, Christian Schori,
Jens Lykke Sørensen, Louis Salvail,
Ivan Damgård and Eugene Polzik:
Experimental
Quantum key Distribution with Proven Security Against Realistic Attacks
(gzip file, appears in Journal of Moderns Optics, 2001, vol 48)
Ran Canetti, Ivan Damgård, Stefan Dziembowski,
Yuval Ishai and Tal Malkin:
On
adaptive vs. non-adaptive security of multiparty protocols
(Appears in proc. of EuroCrypt 2001, the full
version is available here, a revision
is submitted to J.Cryptology)
Ivan Damgård and Maciej Koprowski:
Practical
Threshold RSA Signatures Without a Trusted Dealer
(To appear in Proc. of EuroCrypt 2001)
Ronald Cramer, Ivan Damgård and Jesper Buus
Nielsen (revised November 2000):
Multiparty
Computation from Threshold Homomorphic Encryption
(Appears in Proc. of EuroCrypt 2001, the full version is available
here, an extended journal version
is in preparation)
Ivan Damgård and Mads Jurik:
A
Generalisation, a Simplification and some Applications of Paillier's
Probabilistic
Public-Key System
(Appears in Proc. of Public Key Cryptography
2001)
Jan Camenisch and Ivan Damgård:
Verifiable
Encryption, Group Encryption, and Their Applications to Group
Signatures
and Signature Sharing Schemes
(Appears in proc. of AsiaCrypt 2000)
Ivan Damgård and Jesper Buus Nielsen:
Improved
Non-Committing Encryption Schemes based on aGeneral Complexity Assumption
(appears in proc. of Crypto 2000)
Ronald Cramer, Ivan Damgård and Stefan Dziembowski:
On
the Complexity of Verifiable Secret Sharing and Multiparty Computation
(appears in Proc. of STOC 2000)
Ivan Damgård:
Efficient
Concurrent Zero-Knowledge in the Auxiliary String Model
(appears in Proc. of EuroCrypt 2000)
Ronald Cramer, Ivan Damgård and Ueli Maurer:
General
Secure Multi-Party Computation from any Linear Secret-Sharing Scheme
(this is the full version of the paper
that appears in Proc. of EuroCrypt 2000)
Ronald Cramer, Ivan Damgård and Phil MacKenzie:
Efficient
Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions
(appears in Public Key Cryptography 2000)