#### Filter Results:

- Full text PDF available (178)

#### Publication Year

1987

2018

- This year (6)
- Last 5 years (50)
- Last 10 years (99)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ivan Damgård, Mads Jurik
- Public Key Cryptography
- 2001

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… (More)

- Ivan Damgård
- CRYPTO
- 1989

We show that if there exists a computationally collision free function f from m bits to t bits where m > 1, then there exists a computationally collision free function h mapping mesaages of a&frog… (More)

- Ronald Cramer, Ivan Damgård, Berry Schoenmakers
- CRYPTO
- 1994

Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S on n participants.… (More)

- Ivan Damgård, Valerio Pastro, Nigel P. Smart, Sarah Zakarias
- IACR Cryptology ePrint Archive
- 2011

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 circuits over… (More)

- Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen
- IACR Cryptology ePrint Archive
- 2000

We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given keys for any sufficiently efficient system of this type, general MPC… (More)

In this paper we are interested in efficient and secure constant round multi-party protocols which provide unconditional security against so called honest-but-curious adversaries. In particular, we… (More)

- Ivan Damgård, Eiichiro Fujisaki
- ASIACRYPT
- 2002

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… (More)

- David Chaum, Claude Crépeau, Ivan Damgård
- STOC
- 1988

Under the assumption that each pair of participants can communicate secretly, we show that any reasonable multiparty protocol can be achieved if at least 2n/3 of the participants are honest. The… (More)

- Ronald Cramer, Ivan Damgård, Ueli Maurer
- IACR Cryptology ePrint Archive
- 2000

- Ivan Damgård, Martin Geisler, Mikkel Krøigaard, Jesper Buus Nielsen
- IACR Cryptology ePrint Archive
- 2008

We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n|C|k) where n is the number of parties, |C| is the size of the arithmetic… (More)