What is he best known for?
The fields of study he is best known for:
- Cryptography
- Algebra
- Algorithm
His scientific interests lie mostly in Theoretical computer science, Computer security, Encryption, Protocol and Zero-knowledge proof.
His studies in Theoretical computer science integrate themes in fields like Base, Algorithm and Designated verifier signature.
Many of his research projects under Computer security are closely connected to NIST with NIST, tying the diverse disciplines of science together.
His research in Encryption intersects with topics in Computation, Data mining, Computer engineering and Section.
His Protocol research incorporates elements of Cryptosystem, Upper and lower bounds, Extension and Public-key cryptography.
His research integrates issues of Discrete mathematics, Quadratic equation and Representation in his study of Zero-knowledge proof.
His most cited work include:
- On private scalar product computation for privacy-preserving data mining (343 citations)
- An oblivious transfer protocol with log-squared communication (249 citations)
- Multi-query computationally-private information retrieval with constant communication rate (209 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Theoretical computer science, Computer security, Discrete mathematics, Cryptography and Zero-knowledge proof.
His Theoretical computer science study combines topics in areas such as Homomorphic encryption, Gas meter prover, Construct, Protocol and Cryptosystem.
His work on Hash function, Security properties and Security analysis as part of general Computer security study is frequently linked to Database transaction, therefore connecting diverse disciplines of science.
His Discrete mathematics study combines topics from a wide range of disciplines, such as Computational complexity theory, String, Combinatorics and Computation.
The study incorporates disciplines such as Interleaving and Mechanism design in addition to Cryptography.
His work is dedicated to discovering how Zero-knowledge proof, Argument are connected with Linear subspace and other disciplines.
He most often published in these fields:
- Theoretical computer science (34.11%)
- Computer security (24.03%)
- Discrete mathematics (20.16%)
What were the highlights of his more recent work (between 2015-2021)?
- Theoretical computer science (34.11%)
- Soundness (9.30%)
- Argument (10.85%)
In recent papers he was focusing on the following fields of study:
Helger Lipmaa spends much of his time researching Theoretical computer science, Soundness, Argument, Zero-knowledge proof and Discrete mathematics.
The various areas that he examines in his Theoretical computer science study include SNARK, Gas meter prover, Random oracle and Protocol, Commitment scheme.
Helger Lipmaa has included themes like Rounding and Multivariable calculus in his Protocol study.
While the research belongs to areas of Zero-knowledge proof, Helger Lipmaa spends his time largely on the problem of Construct, intersecting his research to questions surrounding Universal composability and Integer.
His Discrete mathematics research is multidisciplinary, relying on both Scheme, Class and Alpha.
His study in Public-key cryptography is interdisciplinary in nature, drawing from both Homomorphic encryption, Cryptosystem, Prime factor, Prime and Plaintext.
Between 2015 and 2021, his most popular works were:
- A Subversion-Resistant SNARK (26 citations)
- Valiant's Universal Circuit: Improvements, Implementation, and Applications. (18 citations)
- A Shuffle Argument Secure in the Generic Model (15 citations)
In his most recent research, the most cited papers focused on:
- Cryptography
- Algebra
- Algorithm
His main research concerns Theoretical computer science, Argument, Soundness, Discrete mathematics and Zero-knowledge proof.
His Theoretical computer science research is multidisciplinary, incorporating elements of Cryptographic protocol, Protocol, Multivariable calculus and Rounding.
Helger Lipmaa connects Soundness with Gas meter prover in his study.
His Gas meter prover research includes themes of Structure, Permutation, Computational complexity theory, Random oracle and Server.
His work carried out in the field of Discrete mathematics brings together such families of science as Multiple encryption, Functional encryption, Ciphertext indistinguishability, Probabilistic encryption and Plaintext-aware encryption.
His Zero-knowledge proof research is multidisciplinary, incorporating perspectives in Generic group model and Permutation matrix.
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.
