Ivan Damgård
Orcid: 0009-0003-6164-0896Affiliations:
- Aarhus University
According to our database1,
Ivan Damgård
authored at least 242 papers
between 1987 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on daimi.au.dk
On csauthors.net:
Bibliography
2024
CoRR, 2024
2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
2022
J. Cryptol., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security.
IACR Cryptol. ePrint Arch., 2022
Proceedings of the Theory of Cryptography - 20th International Conference, 2022
2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021
2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/p^k Z.
IACR Cryptol. ePrint Arch., 2020
Proceedings of the Theory of Cryptography - 18th International Conference, 2020
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $\mathbb {Z}/p^k\mathbb {Z} $.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020
2019
Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing.
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning.
IACR Cryptol. ePrint Arch., 2019
Efficient Information-Theoretic Secure Multiparty Computation over ℤ/p<sup>k</sup> ℤ via Galois Rings.
IACR Cryptol. ePrint Arch., 2019
2018
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments.
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
SPDℤ<sub>2<sup>k</sup></sub>: Efficient MPC mod 2<sup>k</sup> for Dishonest Majority.
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures.
IACR Cryptol. ePrint Arch., 2018
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018
2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017
2016
Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation.
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack.
IACR Cryptol. ePrint Arch., 2016
Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement.
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Efficient Commitments and Zero-Knowledge Protocols from Ring-SIS with Applications to Lattice-based Threshold Cryptosystems.
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016
Proceedings of the Public-Key Cryptography - PKC 2016, 2016
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016
2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions.
IACR Cryptol. ePrint Arch., 2015
Electron. Colloquium Comput. Complex., 2015
Proceedings of the Topics in Cryptology, 2015
Proceedings of the 3rd International Workshop on Security in Cloud Computing, 2015
Cambridge University Press, ISBN: 9781107043053, 2015
2014
Theor. Comput. Sci., 2014
Nat. Comput., 2014
IACR Cryptol. ePrint Arch., 2014
An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation.
IACR Cryptol. ePrint Arch., 2014
An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation.
IACR Cryptol. ePrint Arch., 2014
On The Orthogonal Vector Problem and The Feasibility of Unconditionally Secure Leakage Resilient Computation.
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
Proceedings of the Information Security and Cryptology - ICISC 2014, 2014
2013
Unconditionally Secure and Universally Composable Commitments from Physical Assumptions.
IACR Cryptol. ePrint Arch., 2013
Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2013
Electron. Colloquium Comput. Complex., 2013
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013
Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract).
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013
2012
Constant-Overhead Secure Computation for Boolean Circuits in the Preprocessing Model.
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012
2011
IACR Cryptol. ePrint Arch., 2011
IACR Cryptol. ePrint Arch., 2011
On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations.
IACR Cryptol. ePrint Arch., 2011
Proceedings of the Information Theoretic Security - 5th International Conference, 2011
2010
A generalization of Paillier's public-key system with applications to electronic voting.
Int. J. Inf. Sec., 2010
Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost.
IACR Cryptol. ePrint Arch., 2010
IACR Cryptol. ePrint Arch., 2010
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography.
IACR Cryptol. ePrint Arch., 2010
IACR Cryptol. ePrint Arch., 2010
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010
Proceedings of the Financial Cryptography and Data Security, 14th International Conference, 2010
2009
Int. J. Appl. Cryptogr., 2009
IACR Cryptol. ePrint Arch., 2009
IACR Cryptol. ePrint Arch., 2009
IACR Cryptol. ePrint Arch., 2009
Proceedings of the ISSE 2009, 2009
Proceedings of the Financial Cryptography and Data Security, 2009
Proceedings of the Advances in Cryptology, 2009
Proceedings of the Advances in Cryptology, 2009
Proceedings of the Advances in Cryptology, 2009
2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
ERCIM News, 2008
Proceedings of the Topics in Cryptology, 2008
Proceedings of the Advances in Cryptology, 2008
Proceedings of the Applied Cryptography and Network Security, 6th International Conference, 2008
2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007
Proceedings of the Advances in Cryptology, 2007
Proceedings of the Advances in Cryptology, 2007
Proceedings of the Advances in Cryptology, 2007
Proceedings of the Information Security and Privacy, 12th Australasian Conference, 2007
2006
An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate.
J. Cryptol., 2006
IACR Cryptol. ePrint Arch., 2006
IACR Cryptol. ePrint Arch., 2006
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006
Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006
A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation.
Proceedings of the Financial Cryptography and Data Security, 2006
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006
Proceedings of the Advances in Cryptology, 2006
2005
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers.
J. Symb. Comput., 2005
IACR Cryptol. ePrint Arch., 2005
IACR Cryptol. ePrint Arch., 2005
Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005
Proceedings of the Public Key Cryptography, 2005
Proceedings of the Advances in Cryptology, 2005
Contemporary cryptology.
Advanced courses in mathematics : CRM Barcelona, Birkhäuser, ISBN: 978-3-7643-7294-1, 2005
2004
On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-way Quantum Transmission.
IACR Cryptol. ePrint Arch., 2004
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004
Proceedings of the Advances in Cryptology, 2004
2003
Proceedings of the Secure Electronic Voting, 2003
IACR Cryptol. ePrint Arch., 2003
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption.
Proceedings of the Advances in Cryptology, 2003
Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003
2002
IACR Cryptol. ePrint Arch., 2002
Proceedings of the Public Key Cryptography, 2002
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security.
Proceedings of the Advances in Cryptology, 2002
Proceedings of the Advances in Cryptology, 2002
2001
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor.
IACR Cryptol. ePrint Arch., 2001
IACR Cryptol. ePrint Arch., 2001
IACR Cryptol. ePrint Arch., 2001
IACR Cryptol. ePrint Arch., 2001
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System.
Proceedings of the Public Key Cryptography, 2001
Proceedings of the Advances in Cryptology, 2001
Proceedings of the Advances in Cryptology, 2001
Proceedings of the Advances in Cryptology, 2001
2000
Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes.
IACR Cryptol. ePrint Arch., 2000
IACR Cryptol. ePrint Arch., 2000
IACR Cryptol. ePrint Arch., 2000
IACR Cryptol. ePrint Arch., 2000
IACR Cryptol. ePrint Arch., 2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the Advances in Cryptology, 2000
Proceedings of the Advances in Cryptology, 2000
Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes.
Proceedings of the Advances in Cryptology, 2000
1999
IACR Cryptol. ePrint Arch., 1999
IACR Cryptol. ePrint Arch., 1999
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions.
Proceedings of the Advances in Cryptology, 1999
Proceedings of the Advances in Cryptology, 1999
1998
Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
Proceedings of the Advances in Cryptology, 1998
Proceedings of the Lectures on Data Security, 1998
1997
On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures.
J. Cryptol., 1997
Proceedings of the Advances in Cryptology, 1997
1996
IACR Cryptol. ePrint Arch., 1996
IACR Cryptol. ePrint Arch., 1996
Proceedings of the Security Protocols, 1996
Proceedings of the Advances in Cryptology, 1996
Proceedings of the Advances in Cryptology, 1996
1995
J. Cryptol., 1995
Proceedings of the Advances in Cryptology, 1995
Proceedings of the Advances in Cryptology, 1995
Proceedings of the Cryptography: Policy and Algorithms, 1995
1994
Proceedings of the Advances in Cryptology, 1994
Proceedings of the Advances in Cryptology, 1994
1993
Proceedings of the Advances in Cryptology, 1993
Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract).
Proceedings of the Advances in Cryptology, 1993
1992
Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing.
Proceedings of the Advances in Cryptology, 1992
Security Bounds for Parallel Versions of Identification Protocols (Extended Abstract).
Proceedings of the Advances in Cryptology, 1992
Proceedings of the Advances in Cryptology, 1992
1991
Proceedings of the Advances in Cryptology, 1991
1990
1989
Proceedings of the Advances in Cryptology, 1989
Proceedings of the Advances in Cryptology, 1989
1988
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988
Proceedings of the Advances in Cryptology, 1988
Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals.
Proceedings of the Advances in Cryptology, 1988
Proceedings of the Advances in Cryptology, 1988
Proceedings of the Advances in Cryptology, 1988
1987
Proceedings of the Advances in Cryptology, 1987
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result.
Proceedings of the Advances in Cryptology, 1987
Proceedings of the Advances in Cryptology, 1987
Proceedings of the Advances in Cryptology, 1987