2023 - Research.com Computer Science in Denmark Leader Award
2022 - Research.com Computer Science in Denmark Leader Award
The scientist’s investigation covers issues in Theoretical computer science, Commitment scheme, Cryptography, Computer security and Homomorphic encryption. The concepts of his Theoretical computer science study are interwoven with issues in Secret sharing, Encryption, Security parameter, Verifiable secret sharing and Secure two-party computation. His biological study spans a wide range of topics, including Secure multi-party computation and Multiplication.
His Commitment scheme research includes elements of Cryptographic protocol, Mathematical proof, Zero-knowledge proof, Function and String. The various areas that Ivan Damgård examines in his Computer security study include Protocol and Digital signature. His study in Homomorphic encryption is interdisciplinary in nature, drawing from both Ciphertext, Public-key cryptography, Cryptosystem, Precomputation and Homomorphic secret sharing.
His main research concerns Theoretical computer science, Discrete mathematics, Computer security, Cryptography and Secure multi-party computation. Ivan Damgård interconnects Homomorphic encryption, Encryption and Protocol, Commitment scheme, Oblivious transfer in the investigation of issues within Theoretical computer science. His Homomorphic encryption study integrates concerns from other disciplines, such as Cryptosystem and Public-key cryptography.
In his study, which falls under the umbrella issue of Discrete mathematics, Communication complexity is strongly linked to Mathematical proof. His Cryptography research includes themes of Multiplication and Constant. Ivan Damgård has researched Secure multi-party computation in several fields, including Verifiable secret sharing, Boolean circuit and Secret sharing.
His primary areas of study are Secure multi-party computation, Discrete mathematics, Theoretical computer science, Protocol and Computer security. His studies in Secure multi-party computation integrate themes in fields like Boolean circuit, Verifiable secret sharing, Communication complexity, Function and Upper and lower bounds. The study of Discrete mathematics is intertwined with the study of Security parameter in a number of ways.
Ivan Damgård has included themes like Homomorphic encryption, Mathematical proof, Oblivious transfer, Correctness and Cryptosystem in his Theoretical computer science study. His research investigates the connection between Homomorphic encryption and topics such as Commitment scheme that intersect with issues in Universal composability. His Protocol study combines topics from a wide range of disciplines, such as Distributed computing, Active security, Set and Benchmark.
His primary areas of study are Secure multi-party computation, Protocol, Theoretical computer science, Computer security and Commitment scheme. The Secure multi-party computation study combines topics in areas such as Function, Boolean circuit, Modulo and Benchmark. His work carried out in the field of Protocol brings together such families of science as Password, Distributed computing and AES implementations.
Ivan Damgård combines subjects such as Homomorphic encryption, Hash function and Secret sharing with his study of Theoretical computer science. His research investigates the link between Homomorphic encryption and topics such as Algorithm that cross with problems in Mathematical proof. His research in Computer security tackles topics such as Set which are related to areas like Scheme and Construct.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Multiparty unconditionally secure protocols
David Chaum;Claude Crépeau;Ivan Damgard.
symposium on the theory of computing (1988)
A design principle for hash functions
Ivan Bjerre Damgård.
international cryptology conference (1989)
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Ronald Cramer;Ivan Damgård;Berry Schoenmakers.
international cryptology conference (1994)
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System
Ivan Damgård;Mats Jurik.
public key cryptography (2001)
Multiparty Computation from Somewhat Homomorphic Encryption
Ivan Damgård;Valerio Pastro;Nigel Smart;Sarah Zakarias.
international cryptology conference (2012)
Multiparty Computation from Threshold Homomorphic Encryption
Ronald Cramer;Ivan Damgård;Jesper Buus Nielsen.
theory and application of cryptographic techniques (2001)
A statistically-hiding integer commitment scheme based on groups with hidden order
Ivan Damgard;Eiichiro Fujisaki.
Lecture Notes in Computer Science (2002)
Secure Multiparty Computation Goes Live
Peter Bogetoft;Dan Lund Christensen;Ivan Damgård;Martin Geisler.
financial cryptography (2009)
General secure multi-party computation from any linear secret-sharing scheme
Ronald Cramer;Ivan Damgård;Ueli Maurer.
theory and application of cryptographic techniques (2000)
Multiparty Unconditionally Secure Protocols (Extended Abstract)
David Chaum;Claude Crépeau;Ivan Damgård.
symposium on the theory of computing (1988)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: