Gradual and Verifiable Release of a Secret. - Ernest F. Brickell; David Chaum; Ivan Damgård; Jeroen van de Graaf (CRYPTO, 1987)

Multiparty Unconditionally Secure Protocols (Abstract). - David Chaum; Claude Crépeau; Ivan Damgård (CRYPTO, 1987)

Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result. - David Chaum; Ivan Damgård; Jeroen van de Graaf (CRYPTO, 1987)

Collision Free Hash Functions and Public Key Signature Schemes. - Ivan Damgård (EUROCRYPT, 1987)

Concatenated group codes and their exponents. - Ivan Damgård (IEEE Trans. Inf. Theory, 1987)

Zero-Knowledge Authentication Scheme with Secret Key Exchange (Extended Abstract). - Jørgen Brandt; Ivan Damgård; Peter Landrock; Torben P. Pedersen (CRYPTO, 1988)

"Practical IP" <= MA. - Gilles Brassard; Ivan Damgård (CRYPTO, 1988)

On the Randomness of Legendre and Jacobi Sequences. - Ivan Damgård (CRYPTO, 1988)

Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals. - Ivan Damgård (CRYPTO, 1988)

Anonymous and Verifiable Registration in Databases. - Jørgen Brandt; Ivan Damgård; Peter Landrock (EUROCRYPT, 1988)

Multiparty Unconditionally Secure Protocols (Extended Abstract) - David Chaum; Claude Crépeau; Ivan Damgård (STOC, 1988)

On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs. - Ivan Damgård (CRYPTO, 1989)

A Design Principle for Hash Functions. - Ivan Damgård (CRYPTO, 1989)

Convertible Undeniable Signatures. - Joan Boyar; David Chaum; Ivan Damgård; Torben P. Pedersen (CRYPTO, 1990)

Speeding up Prime Number Generation. - Jørgen Brandt; Ivan Damgård; Peter Landrock (ASIACRYPT, 1991)

Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks. - Ivan Damgård (CRYPTO, 1991)

On Generation of Probable Primes By Incremental Search. - Jørgen Brandt; Ivan Damgård (CRYPTO, 1992)

Security Bounds for Parallel Versions of Identification Protocols (Extended Abstract). - Lidong Chen; Ivan Damgård (EUROCRYPT, 1992)

Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing. - Ivan Damgård (EUROCRYPT, 1992)

Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract). - Ivan Damgård (CRYPTO, 1993)

The Breaking of the AR Hash Function. - Ivan Damgård; Lars R. Knudsen (EUROCRYPT, 1993)

Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols. - Ronald Cramer; Ivan Damgård; Berry Schoenmakers (CRYPTO, 1994)

Parallel Divertibility of Proofs of Knowledge (Extended Abstract). - Lidong Chen; Ivan Damgård; Torben P. Pedersen (EUROCRYPT, 1994)

Multiple Encryption with Minimum Key. - Ivan Damgård; Lars R. Knudsen (Cryptography: Policy and Algorithms, 1995)

Secure Signature Schemes based on Interactive Protocols. - Ronald Cramer; Ivan Damgård (CRYPTO, 1995)

Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs. - Ivan Damgård; Oded Goldreich 001; Tatsuaki Okamoto; Avi Wigderson (CRYPTO, 1995)

Practical and Provably Secure Release of a Secret and Exchange of Signatures. - Ivan Damgård (J. Cryptol., 1995)

New Generation of Secure and Practical RSA-Based Signatures. - Ronald Cramer; Ivan Damgård (CRYPTO, 1996)

New Convertible Undeniable Signature Schemes. - Ivan Damgård; Torben P. Pedersen (EUROCRYPT, 1996)

Efficient and Provable Security Amplifications. - Ronald Cramer; Ivan Damgård; Torben P. Pedersen (Security Protocols Workshop, 1996)

On Monotone Function Closure of Statistical Zero-Knowledge. - Ronald Cramer; Ivan Damgård (IACR Cryptol. ePrint Arch., 1996)

Linear Zero-Knowledge - A note on Efficient Zero-Knowledge Proofs and Arguments. - Ronald Cramer; Ivan Damgård (IACR Cryptol. ePrint Arch., 1996)

Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation. - Ronald Cramer; Ivan Damgård (EUROCRYPT, 1997)

On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures. - Ivan Damgård; Torben P. Pedersen; Birgit Pfitzmann (J. Cryptol., 1997)

Commitment Schemes and Zero-Knowledge Protocols. - Ivan Damgård (Lectures on Data Security, 1998)

Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? - Ronald Cramer; Ivan Damgård (CRYPTO, 1998)

Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP. - Ivan Damgård; Birgit Pfitzmann (ICALP, 1998)

Zero-Knowledge Authentication Scheme with Secret Key Exchange. - Jørgen Brandt; Ivan Damgård; Peter Landrock; Torben P. Pedersen (J. Cryptol., 1998)

Two-Key Triple Encryption. - Ivan Damgård; Lars R. Knudsen (J. Cryptol., 1998)

Statistical Secrecy and Multibit Commitments. - Ivan Damgård; Torben P. Pedersen; Birgit Pfitzmann (IEEE Trans. Inf. Theory, 1998)

Efficient Multiparty Computations Secure Against an Adaptive Adversary. - Ronald Cramer; Ivan Damgård; Stefan Dziembowski; Martin Hirt; Tal Rabin (EUROCRYPT, 1999)

On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. - Ivan Damgård; Joe Kilian; Louis Salvail (EUROCRYPT, 1999)

Verifiable Encryption and Applications to Group Signatures and Signature Sharing. - Jan Camenisch; Ivan Damgård (IACR Cryptol. ePrint Arch., 1999)

An error in the mixed adversary protocol by Fitzi, Hirt and Maurer. - Ivan Damgård (IACR Cryptol. ePrint Arch., 1999)

Concurrent Zero-Knowledge is Easy in Practice. - Ivan Damgård (IACR Cryptol. ePrint Arch., 1999)

Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes. - Jan Camenisch; Ivan Damgård (ASIACRYPT, 2000)

Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. - Ivan Damgård; Jesper Buus Nielsen (CRYPTO, 2000)

Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. - Ivan Damgård (EUROCRYPT, 2000)

On the complexity of verifiable secret sharing and multiparty computation. - Ronald Cramer; Ivan Damgård; Stefan Dziembowski (STOC, 2000)

On the Complexity of Verifiable Secret Sharing and Multi-Party Computation. - Ronald Cramer; Ivan Damgård; Stefan Dziembowski (IACR Cryptol. ePrint Arch., 2000)

General Secure Multi-Party Computation from any Linear Secret Sharing Scheme. - Ronald Cramer; Ivan Damgård; Ueli Maurer (IACR Cryptol. ePrint Arch., 2000)

Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. - Ronald Cramer; Ivan Damgård; Philip D. MacKenzie (IACR Cryptol. ePrint Arch., 2000)

Multiparty Computation from Threshold Homomorphic Encryption. - Ronald Cramer; Ivan Damgård; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2000)

Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes. - Ivan Damgård; Mads Jurik (IACR Cryptol. ePrint Arch., 2000)

Short Non-Interactive Cryptographic Proofs. - Joan Boyar; Ivan Damgård; René Peralta 001 (J. Cryptol., 2000)

Secure Distributed Linear Algebra in a Constant Number of Rounds. - Ronald Cramer; Ivan Damgård (CRYPTO, 2001)

On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase. - Ronald Cramer; Ivan Damgård; Serge Fehr (CRYPTO, 2001)

Practical Threshold RSA Signatures without a Trusted Dealer. - Ivan Damgård; Maciej Koprowski (EUROCRYPT, 2001)

A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. - Ivan Damgård; Mads Jurik (Public Key Cryptography, 2001)

On adaptive vs. non-adaptive security of multiparty protocols. - Ran Canetti; Ivan Damgård; Stefan Dziembowski; Yuval Ishai; Tal Malkin (IACR Cryptol. ePrint Arch., 2001)

An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates. - Ivan Damgård; Gudmund Skovbjerg Frandsen (IACR Cryptol. ePrint Arch., 2001)

An Integer Commitment Scheme based on Groups with Hidden Order. - Ivan Damgård; Eiichiro Fujisaki (IACR Cryptol. ePrint Arch., 2001)

Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. - Ivan Damgård; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2001)

A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. - Ivan Damgård; Eiichiro Fujisaki (ASIACRYPT, 2002)

Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security. - Ivan Damgård; Jesper Buus Nielsen (CRYPTO, 2002)

Client/Server Tradeoffs for Online Elections. - Ivan Damgård; Mads Jurik (Public Key Cryptography, 2002)

Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups. - Ivan Damgård; Maciej Koprowski (IACR Cryptol. ePrint Arch., 2002)

A Length-Flexible Threshold Cryptosystem with Applications. - Ivan Damgård; Mads Jurik (ACISP, 2003)

Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. - Ivan Damgård; Jesper Buus Nielsen (CRYPTO, 2003)

An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. - Ivan Damgård; Gudmund Skovbjerg Frandsen (FCT, 2003)

Non-interactive and Reusable Non-malleable Commitment Schemes. - Ivan Damgård; Jens Groth (IACR Cryptol. ePrint Arch., 2003)

The Theory and Implementation of an Electronic Voting System. - Ivan Damgård; Jens Groth; Gorm Salomonsen (Secure Electronic Voting, 2003)

Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks. - Ivan Damgård; Serge Fehr; Louis Salvail (CRYPTO, 2004)

Secret-Key Zero-Knowlegde and Non-interactive Verifiable Exponentiation. - Ronald Cramer; Ivan Damgård (TCC, 2004)

Unfair Noisy Channels and Oblivious Transfer. - Ivan Damgård; Serge Fehr; Kirill Morozov; Louis Salvail (TCC, 2004)

On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-way Quantum Transmission. - Ivan Damgård; Thomas Pedersen; Louis Salvail (IACR Cryptol. ePrint Arch., 2004)

Adaptive versus Non-Adaptive Security of Multi-Party Protocols. - Ran Canetti; Ivan Damgård; Stefan Dziembowski; Yuval Ishai; Tal Malkin (J. Cryptol., 2004)

Contemporary cryptology. - Dario Catalano; Ronald Cramer; Ivan Bjerre Damgård; Giovanni Di Crescenzo; David Pointcheval (Birkhäuser, 2005)

A Quantum Cipher with Near Optimal Key-Recycling. - Ivan Damgård; Thomas Brochmann Pedersen; Louis Salvail (CRYPTO, 2005)

Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions. - Ivan Damgård; Kasper Dupont (Public Key Cryptography, 2005)

Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. - Ronald Cramer; Ivan Damgård; Yuval Ishai (TCC, 2005)

Oblivious Transfer and Linear Functions. - Ivan Damgård; Serge Fehr; Louis Salvail; Christian Schaffner (IACR Cryptol. ePrint Arch., 2005)

Universally Composable Disk Encryption Schemes. - Ivan Damgård; Kasper Dupont (IACR Cryptol. ePrint Arch., 2005)

Unclonable Group Identification. - Ivan Damgård; Kasper Dupont; Michael Østergaard Pedersen (IACR Cryptol. ePrint Arch., 2005)

How to Split a Shared Secret into Shared Bits in Constant-Round. - Ivan Damgård; Matthias Fitzi; Jesper Buus Nielsen; Tomas Toft (IACR Cryptol. ePrint Arch., 2005)

Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. - Ivan Damgård; Yuval Ishai (IACR Cryptol. ePrint Arch., 2005)

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers. - Ivan Damgård; Gudmund Skovbjerg Frandsen (J. Symb. Comput., 2005)

Scalable Secure Multiparty Computation. - Ivan Damgård; Yuval Ishai (CRYPTO, 2006)

Simplified Threshold RSA with Adaptive and Proactive Security. - Jesús F. Almansa; Ivan Damgård; Jesper Buus Nielsen (EUROCRYPT, 2006)

A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. - Peter Bogetoft; Ivan Damgård; Thomas P. Jakobsen; Kurt Nielsen; Jakob Pagter; Tomas Toft (Financial Cryptography, 2006)

Theory and Practice of Multiparty Computation. - Ivan Damgård (SCN, 2006)

Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. - Ivan Damgård; Matthias Fitzi; Eike Kiltz; Jesper Buus Nielsen; Tomas Toft (TCC, 2006)

Non-interactive Zero-Knowledge from Homomorphic Encryption. - Ivan Damgård; Nelly Fazio; Antonio Nicolosi (TCC, 2006)

RFID Security: Tradeoffs between Security and Efficiency. - Ivan Damgård; Michael Østergaard Pedersen (IACR Cryptol. ePrint Arch., 2006)

Linear Integer Secret Sharing and Distributed Exponentiation. - Ivan Damgård; Rune Thorbek (IACR Cryptol. ePrint Arch., 2006)

An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate. - Ivan Damgård; Gudmund Skovbjerg Frandsen (J. Cryptol., 2006)

Efficient and Secure Comparison for On-Line Auctions. - Ivan Damgård; Martin Geisler 001; Mikkel Krøigaard (ACISP, 2007)

Secure Protocols with Asymmetric Trust. - Ivan Damgård; Yvo Desmedt; Matthias Fitzi; Jesper Buus Nielsen (ASIACRYPT, 2007)

Scalable and Unconditionally Secure Multiparty Computation. - Ivan Damgård; Jesper Buus Nielsen (CRYPTO, 2007)

Atomic Secure Multi-party Multiplication with Low Communication. - Ronald Cramer; Ivan Damgård; Robbert de Haan (EUROCRYPT, 2007)

A "proof-reading" of Some Issues in Cryptography. - Ivan Damgård (ICALP, 2007)

A Tight High-Order Entropic Quantum Uncertainty Relation With Applications. - Ivan Damgård; Serge Fehr; Renato Renner; Louis Salvail; Christian Schaffner (IACR Cryptol. ePrint Arch., 2007)

Isolated Proofs of Knowledge and Isolated Zero Knowledge. - Ivan Damgård; Jesper Buus Nielsen; Daniel Wichs (IACR Cryptol. ePrint Arch., 2007)

Universally Composable Multiparty Computation with Partially Isolated Parties. - Ivan Damgård; Jesper Buus Nielsen; Daniel Wichs (IACR Cryptol. ePrint Arch., 2007)

Non-Interactive Proofs for Integer Multiplication. - Ivan Damgård; Rune Thorbek (IACR Cryptol. ePrint Arch., 2007)

Dakota- Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography. - Ivan Damgård; Lars R. Knudsen; Søren S. Thomsen (ACNS, 2008)

Scalable Multiparty Computation with Nearly Optimal Work and Resilience. - Ivan Damgård; Yuval Ishai; Mikkel Krøigaard; Jesper Buus Nielsen; Adam D. Smith 001 (CRYPTO, 2008)

Public-Key Encryption with Non-interactive Opening. - Ivan Damgård; Dennis Hofheinz; Eike Kiltz; Rune Thorbek (CT-RSA, 2008)

Trading Sugar Beet Quotas - Secure Multiparty Computation in Practice. - Ivan Damgård; Tomas Toft (ERCIM News, 2008)

Multiparty Computation Goes Live. - Peter Bogetoft; Dan Lund Christensen; Ivan Damgård; Martin Geisler 001; Thomas P. Jakobsen; Mikkel Krøigaard; Janus Dam Nielsen; Jesper Buus Nielsen; Kurt Nielsen; Jakob Pagter; Michael I. Schwartzbach; Tomas Toft (IACR Cryptol. ePrint Arch., 2008)

Asynchronous Multiparty Computation: Theory and Implementation. - Ivan Damgård; Martin Geisler 001; Mikkel Krøigaard; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2008)

Essentially Optimal Universally Composable Oblivious Transfer. - Ivan Damgård; Jesper Buus Nielsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2008)

Efficient Conversion of Secret-shared Values Between Different Fields. - Ivan Damgård; Rune Thorbek (IACR Cryptol. ePrint Arch., 2008)

Supporting Non-membership Proofs with Bilinear-map Accumulators. - Ivan Damgård; Nikos Triandopoulos (IACR Cryptol. ePrint Arch., 2008)

Homomorphic encryption and secure comparison. - Ivan Damgård; Martin Geisler 001; Mikkel Krøigaard (Int. J. Appl. Cryptogr., 2008)

Cryptography in the Bounded-Quantum-Storage Model. - Ivan Damgård; Serge Fehr; Louis Salvail; Christian Schaffner (SIAM J. Comput., 2008)

Quantum-Secure Coin-Flipping and Applications. - Ivan Damgård; Carolin Lunemann (ASIACRYPT, 2009)

On the Amortized Complexity of Zero-Knowledge Protocols. - Ronald Cramer; Ivan Damgård (CRYPTO, 2009)

Improving the Security of Quantum Protocols via Commit-and-Open. - Ivan Damgård; Serge Fehr; Carolin Lunemann; Louis Salvail; Christian Schaffner (CRYPTO, 2009)

Secure Multiparty Computation Goes Live. - Peter Bogetoft; Dan Lund Christensen; Ivan Damgård; Martin Geisler 001; Thomas P. Jakobsen; Mikkel Krøigaard; Janus Dam Nielsen; Jesper Buus Nielsen; Kurt Nielsen; Jakob Pagter; Michael I. Schwartzbach; Tomas Toft (Financial Cryptography, 2009)

Using Compilers to Enhance Cryptographic Product Development. - Endre Bangerter; Manuel Barbosa; Daniel J. Bernstein; Ivan Damgård; Daniel Page; Jakob Illeborg Pagter; Ahmad-Reza Sadeghi; Sampo Sovio (ISSE, 2009)

Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems. - Rikke Bendlin; Ivan Damgård (IACR Cryptol. ePrint Arch., 2009)

From Passive to Covert Security at Low Cost. - Ivan Damgård; Martin Geisler 001; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2009)

Secure Multiparty AES (full paper). - Ivan Damgård; Marcel Keller (IACR Cryptol. ePrint Arch., 2009)

On the Theory and Practice of Personal Digital Signatures. - Ivan Damgård; Gert Læssøe Mikkelsen (IACR Cryptol. ePrint Arch., 2009)

On the Necessary and Sufficient Assumptions for UC Computation. - Ivan Damgård; Jesper Buus Nielsen; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2009)

A correction to 'efficient and secure comparison for on-line auctions'. - Ivan Damgård; Martin Geisler 001; Mikkel Krøigaard (Int. J. Appl. Cryptogr., 2009)

Secure Multiparty AES. - Ivan Damgård; Marcel Keller (Financial Cryptography, 2010)

Efficient, Robust and Constant-Round Distributed RSA Key Generation. - Ivan Damgård; Gert Læssøe Mikkelsen (TCC, 2010)

Semi-Homomorphic Encryption and Multiparty Computation. - Rikke Bendlin; Ivan Damgård; Claudio Orlandi; Sarah Zakarias (IACR Cryptol. ePrint Arch., 2010)

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. - Ivan Damgård; Yuval Ishai; Mikkel Krøigaard (IACR Cryptol. ePrint Arch., 2010)

Perfectly Secure Oblivious RAM Without Random Oracles. - Ivan Damgård; Sigurd Meldgaard; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2010)

Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost. - Ivan Damgård; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2010)

A generalization of Paillier's public-key system with applications to electronic voting. - Ivan Damgård; Mads Jurik; Jesper Buus Nielsen (Int. J. Inf. Sec., 2010)

Quantum Communication Attacks on Classical Cryptographic Protocols - (Invited Talk). - Ivan Damgård (ICITS, 2011)

DDH-like Assumptions Based on Extension Rings. - Ronald Cramer; Ivan Damgård; Eike Kiltz; Sarah Zakarias; Angela Zottarel (IACR Cryptol. ePrint Arch., 2011)

On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. - Ronald Cramer; Ivan Damgård; Valerio Pastro (IACR Cryptol. ePrint Arch., 2011)

Secure Two-Party Computation with Low Communication. - Ivan Damgård; Sebastian Faust; Carmit Hazay (IACR Cryptol. ePrint Arch., 2011)

Superposition Attacks on Cryptographic Protocols\

Multiparty Computation from Somewhat Homomorphic Encryption. - Ivan Damgård; Valerio Pastro; Nigel P. Smart; Sarah Zakarias (IACR Cryptol. ePrint Arch., 2011)

Secure Computation, I/O-Efficient Algorithms and Distributed Signatures. - Ivan Damgård; Jonas Kölker; Tomas Toft (CT-RSA, 2012)

Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol. - Ivan Damgård; Marcel Keller; Enrique Larraia; Christian Miles; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2012)

Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits. - Ivan Damgård; Marcel Keller; Enrique Larraia; Valerio Pastro; Peter Scholl; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2012)

Secret Sharing and Secure Computing from Monotone Formulae. - Ivan Bjerre Damgård; Jonas Kölker; Peter Bro Miltersen (IACR Cryptol. ePrint Arch., 2012)

Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions. - Ivan Damgård; Adriana López-Alt (IACR Cryptol. ePrint Arch., 2012)

Is Public-Key Encryption Based on LPN Practical? - Ivan Damgård; Sunoo Park (IACR Cryptol. ePrint Arch., 2012)

Constant-Overhead Secure Computation for Boolean Circuits in the Preprocessing Model. - Ivan Damgård; Sarah Zakarias (IACR Cryptol. ePrint Arch., 2012)

Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). - Gil Cohen; Ivan Bjerre Damgård; Yuval Ishai; Jonas Kölker; Peter Bro Miltersen; Ran Raz; Ron D. Rothblum (CRYPTO (2), 2013)

Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing. - Ivan Damgård; Sarah Zakarias (TCC, 2013)

Efficient Multiparty Protocols via Log-Depth Threshold Formulae. - Gil Cohen; Ivan Bjerre Damgård; Yuval Ishai; Jonas Kölker; Peter Bro Miltersen; Ran Raz; Ron Rothblum (Electron. Colloquium Comput. Complex., 2013)

Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption. - Morten Dahl; Ivan Damgård (IACR Cryptol. ePrint Arch., 2013)

Secure Key Management in the Cloud. - Ivan Damgård; Thomas P. Jakobsen; Jesper Buus Nielsen; Jakob Illeborg Pagter (IACR Cryptol. ePrint Arch., 2013)

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions. - Ivan Damgård; Alessandra Scafuro (IACR Cryptol. ePrint Arch., 2013)

On the Security of Distributed Multiprime RSA. - Ivan Damgård; Gert Læssøe Mikkelsen; Tue Skeltved (ICISC, 2014)

Publicly Auditable Secure Multi-Party Computation. - Carsten Baum; Ivan Damgård; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2014)

Additively Homomorphic UC commitments with Optimal Amortized Overhead. - Ignacio Cascudo; Ivan Damgård; Bernardo David; Irene Giacomelli; Jesper Buus Nielsen; Roberto Trifiletti (IACR Cryptol. ePrint Arch., 2014)

Server-Aided Two-Party Computation with Simultaneous Corruption. - Ignacio Cascudo; Ivan Damgård; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2014)

Adaptively Secure UC Constant Round Multi-Party Computation Protocols. - Ivan Damgård; Antigoni Polychroniadou; Vanishree Rao (IACR Cryptol. ePrint Arch., 2014)

Compact VSS and Efficient Homomorphic UC Commitments. - Ivan Damgård; Bernardo David; Irene Giacomelli; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2014)

On The Orthogonal Vector Problem and The Feasibility of Unconditionally Secure Leakage Resilient Computation. - Ivan Damgård; Frédéric Dupuis; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2014)

The Chaining Lemma and its application. - Ivan Damgård; Sebastian Faust; Pratyay Mukherjee; Daniele Venturi 001 (IACR Cryptol. ePrint Arch., 2014)

An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation. - Ivan Damgård; Rasmus Lauritsen; Tomas Toft (IACR Cryptol. ePrint Arch., 2014)

An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation. - Ivan Damgård; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2014)

Adaptive versus Static Security in the UC Model. - Ivan Damgård; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2014)

Towards Optimally Efficient Secret-Key Authentication from PRG. - Ivan Damgård; Sunoo Park (IACR Cryptol. ePrint Arch., 2014)

On the Amortized Complexity of Zero-Knowledge Protocols. - Ronald Cramer; Ivan Damgård; Marcel Keller (J. Cryptol., 2014)

How to re-use a one-time pad safely and almost optimally even if P = NP. - Ivan Damgård; Thomas Brochmann Pedersen; Louis Salvail (Nat. Comput., 2014)

Secure identification and QKD in the bounded-quantum-storage model. - Ivan Damgård; Serge Fehr; Louis Salvail; Christian Schaffner (Theor. Comput. Sci., 2014)

Secure Multiparty Computation and Secret Sharing. - Ronald Cramer; Ivan Damgård; Jesper Buus Nielsen (Cambridge University Press, 2015)

Entangled Encodings and Data Entanglement. - Giuseppe Ateniese; Özgür Dagdelen; Ivan Damgård; Daniele Venturi 001 (SCC@ASIACCS, 2015)

Efficient Leakage Resilient Circuit Compilers. - Marcin Andrychowicz; Ivan Damgård; Stefan Dziembowski; Sebastian Faust; Antigoni Polychroniadou (CT-RSA, 2015)

On Public Key Encryption from Noisy Codewords. - Eli Ben-Sasson; Iddo Bentov; Ivan Bjerre Damgård; Yuval Ishai; Noga Ron-Zewi (Electron. Colloquium Comput. Complex., 2015)

Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions. - Ronald Cramer; Ivan Bjerre Damgård; Nico Döttling; Serge Fehr; Gabriele Spini (IACR Cryptol. ePrint Arch., 2015)

Confidential Benchmarking based on Multiparty Computation. - Ivan Damgård; Kasper Damgård; Kurt Nielsen; Peter Sebastian Nordholt; Tomas Toft (IACR Cryptol. ePrint Arch., 2015)

Unconditionally Secure Computation with Reduced Interaction. - Ivan Damgård; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2015)

On the Communication required for Unconditionally Secure Multiplication. - Ivan Damgård; Jesper Buus Nielsen; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2015)

Fast Oblivious AES A dedicated application of the MiniMac protocol. - Ivan Damgård; Rasmus Winther Zakarias (IACR Cryptol. ePrint Arch., 2015)

On the Communication Required for Unconditionally Secure Multiplication. - Ivan Damgård; Jesper Buus Nielsen; Antigoni Polychroniadou; Michael A. Raskin (CRYPTO (2), 2016)

Unconditionally Secure Computation with Reduced Interaction. - Ivan Damgård; Jesper Buus Nielsen; Rafail Ostrovsky; Adi Rosén (EUROCRYPT (2), 2016)

Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE). - Ivan Damgård; Antigoni Polychroniadou; Vanishree Rao (Public Key Cryptography (2), 2016)

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement. - Ignacio Cascudo; Ivan Damgård; Felipe Lacerda; Samuel Ranellucci (TCC (B1), 2016)

Entangled cloud storage. - Giuseppe Ateniese; Özgür Dagdelen; Ivan Damgård; Daniele Venturi 001 (Future Gener. Comput. Syst., 2016)

Non-Interactive Verifiable Secret Sharing For Monotone Circuits. - Ge Bai; Ivan Damgård; Claudio Orlandi; Yu Xia 005 (IACR Cryptol. ePrint Arch., 2016)

How to prove knowledge of small secrets. - Carsten Baum; Ivan Damgård; Kasper Green Larsen; Michael Nielsen 001 (IACR Cryptol. ePrint Arch., 2016)

Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems. - Carsten Baum; Ivan Damgård; Sabine Oechsner; Chris Peikert (IACR Cryptol. ePrint Arch., 2016)

Better Preprocessing for Secure Multiparty Computation. - Carsten Baum; Ivan Damgård; Tomas Toft; Rasmus Winther Zakarias (IACR Cryptol. ePrint Arch., 2016)

Rate-1, Linear Time and Additively Homomorphic UC Commitments. - Ignacio Cascudo; Ivan Damgård; Bernardo David; Nico Döttling; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2016)

Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement. - Ignacio Cascudo; Ivan Damgård; Felipe Lacerda; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2016)

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. - Ronald Cramer; Ivan Damgård (IACR Cryptol. ePrint Arch., 2016)

Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model. - Ronald Cramer; Ivan Damgård; Nico Döttling; Irene Giacomelli; Chaoping Xing (IACR Cryptol. ePrint Arch., 2016)

Access Control Encryption: Enforcing Information Flow with Cryptography. - Ivan Damgård; Helene Haagh; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2016)

Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation. - Ivan Damgård; Jesper Buus Nielsen; Michael Nielsen 001; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2016)

Fast Multiparty Multiplications from shared bits. - Ivan Damgård; Tomas Toft; Rasmus Winther Zakarias (IACR Cryptol. ePrint Arch., 2016)

The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited. - Ivan Damgård; Jesper Buus Nielsen; Michael Nielsen 001; Samuel Ranellucci (CRYPTO (1), 2017)

Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack. - Ronald Cramer; Ivan Damgård; Chaoping Xing; Chen Yuan 003 (EUROCRYPT (1), 2017)

Secure Arithmetic Computation with Constant Computational Overhead. - Benny Applebaum; Ivan Damgård; Yuval Ishai; Michael Nielsen 001; Lior Zichron (IACR Cryptol. ePrint Arch., 2017)

Resource-efficient OT combiners with active security. - Ignacio Cascudo; Ivan Damgård; Oriol Farràs; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2017)

Compact Zero-Knowledge Proofs of Small Hamming Weight. - Ivan Damgård; Ji Luo 002; Sabine Oechsner; Peter Scholl; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2017)

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings. - Ivan Damgård; Claudio Orlandi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2017)

Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier. - Ivan Damgård; Sebastian Faust; Pratyay Mukherjee; Daniele Venturi 001 (J. Cryptol., 2017)

More Efficient Commitments from Structured Lattice Assumptions. - Carsten Baum; Ivan Damgård; Vadim Lyubashevsky; Sabine Oechsner; Chris Peikert (SCN, 2018)

Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. - Divesh Aggarwal; Ivan Damgård; Jesper Buus Nielsen; Maciej Obremski; Erick Purwanto; João Ribeiro 002; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2018)

Efficient UC Commitment Extension with Homomorphism for Free (and Applications). - Ignacio Cascudo; Ivan Damgård; Bernardo David; Nico Döttling; Rafael Dowsley; Irene Giacomelli (IACR Cryptol. ePrint Arch., 2018)

SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority. - Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Peter Scholl; Chaoping Xing (IACR Cryptol. ePrint Arch., 2018)

Proofs of Replicated Storage Without Timing Assumptions. - Ivan Damgård; Chaya Ganesh; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2018)

Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. - Ivan Damgård; Tomasz Kazana; Maciej Obremski; Varun Raj; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2018)

Efficient Information-Theoretic Secure Multiparty Computation over ℤ/pk ℤ via Galois Rings. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2019)

New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. - Ivan Damgård; Daniel Escudero 001; Tore Kasper Frederiksen; Marcel Keller; Peter Scholl; Nikolaj Volgushev (IACR Cryptol. ePrint Arch., 2019)

Stronger Notions and Constructions for Multi-Designated Verifier Signatures. - Ivan Damgård; Helene Haagh; Rebekah Mercer; Anca Nitulescu; Claudio Orlandi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2019)

Commodity-Based 2PC for Arithmetic Circuits. - Ivan Damgård; Helene Haagh; Michael Nielsen 001; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2019)

Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing. - Ivan Damgård; Kasper Green Larsen; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2019)

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $ mathbb {Z}/p^k mathbb {Z} $. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Matthieu Rambaud; Chaoping Xing; Chen Yuan 003 (ASIACRYPT (3), 2020)

Stronger Security and Constructions of Multi-designated Verifier Signatures. - Ivan Damgård; Helene Haagh; Rebekah Mercer; Anca Nitulescu; Claudio Orlandi; Sophia Yakoubov (TCC (2), 2020)

Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z. - Mark Abspoel; Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Matthieu Rambaud; Chaoping Xing; Chen Yuan 003 (IACR Cryptol. ePrint Arch., 2020)

Balancing Privacy and Accountability in Blockchain Transactions. - Ivan Damgård; Chaya Ganesh; Hamidreza Khoshakhlagh; Claudio Orlandi; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2020)

Fast Threshold ECDSA with Honest Majority. - Ivan Damgård; Thomas Pelle Jakobsen; Jesper Buus Nielsen; Jakob Illeborg Pagter; Michael Bæksvang Østergård (IACR Cryptol. ePrint Arch., 2020)

Broadcast-Optimal Two Round MPC with an Honest Majority. - Ivan Damgård; Bernardo Magri; Luisa Siniscalchi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2020)

Black-Box Transformations from Passive to Covert Security with Public Verifiability. - Ivan Damgård; Claudio Orlandi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2020)

Communication Lower Bounds for Perfect Maliciously Secure MPC. - Ivan Damgård; Nikolaj I. Schwartzbach (IACR Cryptol. ePrint Arch., 2020)

Bounds on Ad Hoc Threshold Encryption. - Ivan Damgård; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2020)

Broadcast Secret-Sharing, Bounds and Applications. - Ivan Bjerre Damgård; Kasper Green Larsen; Sophia Yakoubov (ITC, 2021)

Broadcast-Optimal Two Round MPC with an Honest Majority. - Ivan Damgård; Bernardo Magri; Divya Ravi 001; Luisa Siniscalchi; Sophia Yakoubov (CRYPTO (2), 2021)

Balancing Privacy and Accountability in Blockchain Identity Management. - Ivan Damgård; Chaya Ganesh; Hamidreza Khoshakhlagh; Claudio Orlandi; Luisa Siniscalchi (CT-RSA, 2021)

Oblivious TLS via Multi-Party Computation. - Damiano Abram; Ivan Damgård; Peter Scholl; Sven Trieflinger (IACR Cryptol. ePrint Arch., 2021)

Improved single-round secure multiplication using regenerating codes. - Mark Abspoel; Ronald Cramer; Daniel Escudero 001; Ivan Damgård; Chaoping Xing (IACR Cryptol. ePrint Arch., 2021)

Phoenix: Secure Computation in an Unstable Network with Dropouts and Comebacks. - Ivan Damgård; Daniel Escudero 001; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2021)

Information-Theoretically Secure MPC against Mixed Dynamic Adversaries. - Ivan Damgård; Daniel Escudero 001; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2021)

More Communication Lower Bounds for Information-Theoretic MPC. - Ivan Damgård; Boyang Li 012; Nikolaj I. Schwartzbach (IACR Cryptol. ePrint Arch., 2021)

Vector Commitments over Rings and Compressed $ varSigma $-Protocols. - Thomas Attema; Ignacio Cascudo; Ronald Cramer; Ivan Damgård; Daniel Escudero 001 (TCC (1), 2022)

An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. - Damiano Abram; Ivan Damgård; Claudio Orlandi; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Vector Commitments over Rings and Compressed Σ-Protocols. - Thomas Attema; Ignacio Cascudo; Ronald Cramer; Ivan Bjerre Damgård; Daniel Escudero 001 (IACR Cryptol. ePrint Arch., 2022)

On Access Control Encryption without Sanitization. - Cecilia Boschini; Ivan Damgård; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2022)

Secure Multiparty Computation from Threshold Encryption based on Class Groups. - Lennart Braun; Ivan Damgård; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2022)

Minimizing Setup in Broadcast-Optimal Two Round MPC. - Ivan Damgård; Divya Ravi 001; Luisa Siniscalchi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2022)

Fast threshold ECDSA with honest majority. - Ivan Damgård; Thomas P. Jakobsen; Jesper Buus Nielsen; Jakob Illeborg Pagter; Michael Bæksvang Østergaard (J. Comput. Secur., 2022)

Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices. - Ivan Damgård; Claudio Orlandi; Akira Takahashi 002; Mehdi Tibouchi (J. Cryptol., 2022)

Improved Distributed RSA Key Generation Using the Miller-Rabin Test. - Jakob Burkhardt; Ivan Damgård; Tore Kasper Frederiksen; Satrajit Ghosh; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2023)

Broadcast-Optimal Four-Round MPC in the Plain Model. - Michele Ciampi; Ivan Damgård; Divya Ravi 001; Luisa Siniscalchi; Yu Xia 008; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2023)

Differentially Private Selection from Secure Distributed Computing. - Ivan Damgård; Hannah Keller; Boel Nelson; Claudio Orlandi; Rasmus Pagh (IACR Cryptol. ePrint Arch., 2023)

Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels. - Ivan Damgård; Divya Ravi 001; Luisa Siniscalchi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2023)

Secure Communication in Dynamic Incomplete Networks. - Ivan Damgård; Divya Ravi 001; Daniel Tschudi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2023)

Honest Majority GOD MPC with O(sfdepth(C)) Rounds and Low Online Communication. - Amit Agarwal; Alexander Bienstock; Ivan Damgård; Daniel Escudero 001 (ASIACRYPT (6), 2024)

Efficient Maliciously Secure Oblivious Exponentiations. - Carsten Baum; Jens Berlips; Walther Chen; Ivan Bjerre Damgård; Kevin M. Esvelt; Leonard Foner; Dana Gretton; Martin Kysel; Ronald L. Rivest; Lawrence Roy; Francesca Sage-Ling; Adi Shamir; et al. (IACR Commun. Cryptol., 2024)

A system capable of verifiably and privately screening global DNA synthesis. - Carsten Baum; Jens Berlips; Walther Chen; Hongrui Cui; Ivan Damgård; Jiangbin Dong; Kevin M. Esvelt; Mingyu Gao 001; Dana Gretton; Leonard Foner; Martin Kysel; Kaiyi Zhang 001; et al. (CoRR, 2024)

Honest Majority GOD MPC with O(depth(C)) Rounds and Low Online Communication. - Amit Agarwal; Alexander Bienstock; Ivan Damgård; Daniel Escudero 001 (IACR Cryptol. ePrint Arch., 2024)

An Improved Threshold Homomorphic Cryptosystem Based on Class Groups. - Lennart Braun; Guilhem Castagnos; Ivan Damgård; Fabien Laguillaumie; Kelsey Melissaris; Claudio Orlandi; Ida Tucker (IACR Cryptol. ePrint Arch., 2024)

Securely Computing One-Sided Matching Markets. - James Hsin-Yu Chiang; Ivan Damgård; Claudio Orlandi; Mahak Pancholi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2024)

Efficient Secure Communication Over Dynamic Incomplete Networks With Minimal Connectivity. - Ivan Damgård; Divya Ravi 001; Lawrence Roy; Daniel Tschudi; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2024)

Asynchronous Algorand: Reaching Agreement with Near Linear Communication and Constant Expected Time. - Ittai Abraham; Eli Chouatt; Ivan Damgård; Yossi Gilad; Gilad Stern; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2025)

Deniable Secret Sharing. - Ran Canetti; Ivan Damgård; Sebastian Kolby; Divya Ravi 001; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2025)

Post-Quantum Threshold Ring Signature Applications from VOLE-in-the-Head. - James Hsin-Yu Chiang; Ivan Damgård; William R. Duro; Sunniva Engan; Sebastian Kolby; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)

Asynchronous YOSO a la Paillier. - Ivan Bjerre Damgård; Simon Holmgaard Kamp; Julian Loss; Jesper Buus Nielsen (IACR Cryptol. ePrint Arch., 2025)

New Upper and Lower Bounds for Perfectly Secure MPC. - Ivan Damgård; Shravani Patil; Arpita Patra; Lawrence Roy (IACR Cryptol. ePrint Arch., 2025)