What is he best known for?
The fields of study he is best known for:
- Cryptography
- Algorithm
- Programming language
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 most cited work include:
- Multiparty unconditionally secure protocols (1254 citations)
- A design principle for hash functions (993 citations)
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols (985 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Theoretical computer science (46.22%)
- Discrete mathematics (23.51%)
- Computer security (21.35%)
What were the highlights of his more recent work (between 2014-2021)?
- Secure multi-party computation (18.38%)
- Discrete mathematics (23.51%)
- Theoretical computer science (46.22%)
In recent papers he was focusing on the following fields of study:
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.
Between 2014 and 2021, his most popular works were:
- Secure Multiparty Computation (56 citations)
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions (34 citations)
- Secure Arithmetic Computation with Constant Computational Overhead (28 citations)
In his most recent research, the most cited papers focused on:
- Cryptography
- Algorithm
- Algebra
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.
