What is he best known for?
The fields of study he is best known for:
- Cryptography
- Algebra
- Operating system
Vinod Vaikuntanathan spends much of his time researching Encryption, Theoretical computer science, Homomorphic encryption, Learning with errors and Probabilistic encryption.
His studies in Encryption integrate themes in fields like Discrete mathematics and Secure multi-party computation, Cryptography.
The Discrete mathematics study combines topics in areas such as Cryptosystem, Lattice problem, Multiplication and Trapdoor function.
He has included themes like Attribute-based encryption, Semantic security and 56-bit encryption in his Theoretical computer science study.
His Homomorphic encryption research includes themes of Distributed computing, Security parameter, Computation, Homomorphic secret sharing and On-the-fly encryption.
His studies examine the connections between Probabilistic encryption and genetics, as well as such issues in Multiple encryption, with regards to 40-bit encryption.
His most cited work include:
- Trapdoors for hard lattices and new cryptographic constructions (1390 citations)
- Fully homomorphic encryption over the integers (1241 citations)
- Efficient Fully Homomorphic Encryption from (Standard) LWE (1047 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of investigation include Theoretical computer science, Encryption, Discrete mathematics, Homomorphic encryption and Cryptography.
His study explores the link between Theoretical computer science and topics such as Functional encryption that cross with problems in Turing machine.
His Encryption study contributes to a more complete understanding of Computer security.
His Discrete mathematics research integrates issues from Lattice problem, Combinatorics, Pseudorandom number generator, Function and Polynomial.
His Homomorphic encryption study integrates concerns from other disciplines, such as Computation, Security parameter, Arithmetic, Key and Homomorphic secret sharing.
His study in Cryptography is interdisciplinary in nature, drawing from both Correctness, Obfuscation and Private information retrieval.
He most often published in these fields:
- Theoretical computer science (46.96%)
- Encryption (44.35%)
- Discrete mathematics (26.96%)
What were the highlights of his more recent work (between 2017-2021)?
- Theoretical computer science (46.96%)
- Encryption (44.35%)
- Discrete mathematics (26.96%)
In recent papers he was focusing on the following fields of study:
Vinod Vaikuntanathan mainly focuses on Theoretical computer science, Encryption, Discrete mathematics, Cryptography and Construct.
His Theoretical computer science research includes themes of Mathematical proof, Obfuscation, Verifiable secret sharing, Protocol and Functional encryption.
The subject of his Encryption research is within the realm of Computer security.
The Discrete mathematics study combines topics in areas such as Random oracle, Hash function, Learning with errors, Lattice and Function.
He usually deals with Cryptography and limits it to topics linked to Upper and lower bounds and Scheme.
His study looks at the intersection of Construct and topics like Cryptographic primitive with Secure multi-party computation.
Between 2017 and 2021, his most popular works were:
- {GAZELLE}: A Low Latency Framework for Secure Neural Network Inference (177 citations)
- Gazelle: A Low Latency Framework for Secure Neural Network Inference (64 citations)
- Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions (41 citations)
In his most recent research, the most cited papers focused on:
- Cryptography
- Algebra
- Operating system
Vinod Vaikuntanathan mostly deals with Theoretical computer science, Encryption, Cryptography, Homomorphic encryption and Computer security.
His Theoretical computer science research incorporates themes from Construct, Mathematical proof and Counterexample.
The Ciphertext, Discrete logarithm and Stream cipher research Vinod Vaikuntanathan does as part of his general Encryption study is frequently linked to other disciplines of science, such as Special case, therefore creating a link between diverse domains of science.
He has researched Cryptography in several fields, including Discrete mathematics, Low complexity, Algebraic number, Obfuscation and Lattice.
His studies in Homomorphic encryption integrate themes in fields like Node and Data mining.
His work on Adversary, Traitor tracing and Public-key cryptography is typically connected to TRACE as part of general Computer security study, connecting several disciplines of science.
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.
