Ivan Damgård

ORCID: 0009-0003-6164-0896
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Cryptography and Data Security
  • Complexity and Algorithms in Graphs
  • Cryptographic Implementations and Security
  • Privacy-Preserving Technologies in Data
  • Coding theory and cryptography
  • Chaos-based Image/Signal Encryption
  • Cryptography and Residue Arithmetic
  • Internet Traffic Analysis and Secure E-voting
  • Blockchain Technology Applications and Security
  • Quantum Computing Algorithms and Architecture
  • Advanced Authentication Protocols Security
  • Security and Verification in Computing
  • Quantum Information and Cryptography
  • graph theory and CDMA systems
  • Computability, Logic, AI Algorithms
  • Security in Wireless Sensor Networks
  • Quantum Mechanics and Applications
  • Access Control and Trust
  • Wireless Communication Security Techniques
  • Cloud Data Security Solutions
  • Physical Unclonable Functions (PUFs) and Hardware Security
  • DNA and Biological Computing
  • Algorithms and Data Compression
  • Distributed systems and fault tolerance
  • Advanced Steganography and Watermarking Techniques

Aarhus University
2016-2025

Université de Montréal
2011-2014

Weizmann Institute of Science
2013

Centrum Wiskunde & Informatica
2008-2012

National Research Foundation
1997-2011

Nokia (Finland)
2010

Danish National Research Foundation
1996-2008

Mathematical Institute of the Slovak Academy of Sciences
2007

ETH Zurich
1997

Cryptomathic (United Kingdom)
1997

Under the assumption that each pair of participants em communieatc secretly, we show any reasonable multiparty protwol can be achieved if at least Q Participants am honest.The secrecy is unconditional, It does not rely on about computational intractability.

10.1145/62212.62214 article EN 1988-01-01

We propose a protocol for secure comparison of integers based on homomorphic encryption. also encryption scheme that can be used in our protocol, makes it more efficient than previous solutions, and as the basis general Multiparty Computation (MPC). show how to improve security online auctions, demonstrate is enough practice. For 16 bits numbers with 1024 RSA (executed by two parties), implementation takes 0.28 sec including all computation communication. Using precomputation, one save...

10.1504/ijact.2008.017048 article EN International Journal of Applied Cryptography 2008-01-01
Coming Soon ...