2013 - Fellow of Alfred P. Sloan Foundation
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 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.
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.
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.
Fully homomorphic encryption over the integers
Marten van Dijk;Craig Gentry;Shai Halevi;Vinod Vaikuntanathan.
theory and application of cryptographic techniques (2010)
Trapdoors for hard lattices and new cryptographic constructions
Craig Gentry;Chris Peikert;Vinod Vaikuntanathan.
symposium on the theory of computing (2008)
Efficient Fully Homomorphic Encryption from (Standard) LWE
Zvika Brakerski;Vinod Vaikuntanathan.
foundations of computer science (2011)
Leveled) fully homomorphic encryption without bootstrapping
Zvika Brakerski;Craig Gentry;Vinod Vaikuntanathan.
conference on innovations in theoretical computer science (2012)
Can homomorphic encryption be practical
Michael Naehrig;Kristin Lauter;Vinod Vaikuntanathan.
cloud computing security workshop (2011)
Fully homomorphic encryption from ring-LWE and security for key dependent messages
Zvika Brakerski;Vinod Vaikuntanathan.
international cryptology conference (2011)
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
Adriana López-Alt;Eran Tromer;Vinod Vaikuntanathan.
symposium on the theory of computing (2012)
A Framework for Efficient and Composable Oblivious Transfer
Chris Peikert;Vinod Vaikuntanathan;Brent Waters.
international cryptology conference (2008)
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
Adi Akavia;Shafi Goldwasser;Vinod Vaikuntanathan.
theory of cryptography conference (2009)
How to delegate and verify in public: verifiable computation from attribute-based encryption
Bryan Parno;Mariana Raykova;Vinod Vaikuntanathan.
theory of cryptography conference (2012)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
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: