World's Best Scientists 2026 revealed!
Vinod Vaikuntanathan

Vinod Vaikuntanathan

D-Index & Metrics

Computer Science

D-Index
71
Citations
31475
World Ranking
1733
National Ranking
883

Research.com Recognitions

  • 2013 - Fellow of Alfred P. Sloan Foundation

Overview

Vinod Vaikuntanathan is affiliated with MIT in the United States and has a research profile predominantly centered in computer science. Their work spans a variety of areas within this field, with a particular emphasis on cryptography and data security, where they have made substantial contributions.

The scientist's research covers multiple subfields of computer science, including:

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Computer Vision and Pattern Recognition
  • Information Systems
  • Computer Networks and Communications

Vinod Vaikuntanathan's main topics of investigation consist of:

  • Cryptography and Data Security
  • Complexity and Algorithms in Graphs
  • Privacy-Preserving Technologies in Data
  • Quantum Computing Algorithms and Architecture
  • Cryptographic Implementations and Security
  • Chaos-based Image/Signal Encryption
  • Adversarial Robustness in Machine Learning

The breadth of their work is reflected in a variety of recent publications including:

  • "Optimized homomorphic encryption solution for secure genome-wide association studies" (2020), published in BMC Medical Genomics
  • "Rate-1 Non-Interactive Arguments for Batch-NP and Applications" (2022), presented at the 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • "Planting Undetectable Backdoors in Machine Learning Models: [Extended Abstract]" (2022), also at the 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • "Does Fully Homomorphic Encryption Need Compute Acceleration?" (2021), available on arXiv (Cornell University)
  • "Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE" (2022), published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Vinod Vaikuntanathan frequently publishes in several venues, most notably:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • BMC Medical Genomics
  • Proceedings of the National Academy of Sciences

Their collaborative network includes frequent co-authors such as:

  • Neekon Vafa
  • Yael Tauman Kalai
  • Alex Lombardi
  • Daniel Wichs
  • Seyoon Ragavan

Recognition for Vinod Vaikuntanathan's work includes being named a fellow of the Alfred P. Sloan Foundation in 2013.

Best Publications

  • Trapdoors for hard lattices and new cryptographic constructions

    Craig Gentry;Chris Peikert;Vinod Vaikuntanathan

  • Fully homomorphic encryption over the integers

    Marten van Dijk;Craig Gentry;Shai Halevi;Vinod Vaikuntanathan

  • Leveled) fully homomorphic encryption without bootstrapping

    Zvika Brakerski;Craig Gentry;Vinod Vaikuntanathan

  • Efficient Fully Homomorphic Encryption from (Standard) LWE

    Zvika Brakerski;Vinod Vaikuntanathan

  • Leveled) Fully Homomorphic Encryption without Bootstrapping

    Zvika Brakerski;Craig Gentry;Vinod Vaikuntanathan

  • Fully homomorphic encryption from ring-LWE and security for key dependent messages

    Zvika Brakerski;Vinod Vaikuntanathan

  • Can homomorphic encryption be practical

    Michael Naehrig;Kristin Lauter;Vinod Vaikuntanathan

  • On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption.

    Adriana López-Alt;Eran Tromer;Vinod Vaikuntanathan

  • A Framework for Efficient and Composable Oblivious Transfer

    Chris Peikert;Vinod Vaikuntanathan;Brent Waters

  • Simultaneous Hardcore Bits and Cryptography against Memory Attacks

    Adi Akavia;Shafi Goldwasser;Vinod Vaikuntanathan

  • Reusable garbled circuits and succinct functional encryption

    Shafi Goldwasser;Yael Kalai;Raluca Ada Popa;Vinod Vaikuntanathan

  • Multiparty computation with low communication, computation and interaction via threshold FHE

    Gilad Asharov;Abhishek Jain;Adriana López-Alt;Eran Tromer

  • Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

    Dan Boneh;Craig Gentry;Sergey Gorbunov;Shai Halevi

  • Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$

    Zvika Brakerski;Vinod Vaikuntanathan

  • Fully Homomorphic Encryption without Bootstrapping.

    Zvika Brakerski;Craig Gentry;Vinod Vaikuntanathan

  • Attribute-based encryption for circuits

    Sergey Gorbunov;Vinod Vaikuntanathan;Hoeteck Wee

  • How to delegate and verify in public: verifiable computation from attribute-based encryption

    Bryan Parno;Mariana Raykova;Vinod Vaikuntanathan

  • {GAZELLE}: A Low Latency Framework for Secure Neural Network Inference

    Chiraag Juvekar;Vinod Vaikuntanathan;Anantha P. Chandrakasan

  • Lattice-based FHE as secure as PKE

    Zvika Brakerski;Vinod Vaikuntanathan

  • Functional Encryption with Bounded Collusions via Multi-party Computation

    Sergey Gorbunov;Vinod Vaikuntanathan;Hoeteck Wee

  • Can homomorphic encryption be practical

    Kristin E. Lauter;Michael Naehrig;Vinod Vaikuntanathan

Frequent Co-Authors

Zvika Brakerski
Zvika Brakerski Weizmann Institute of Science
Hoeteck Wee
Hoeteck Wee École Normale Supérieure
Craig Gentry
Craig Gentry TripleBlind
Daniel Wichs
Daniel Wichs Northeastern University
Shafi Goldwasser
Shafi Goldwasser University of California, Berkeley
Shai Halevi
Shai Halevi Amazon (United States)
Jonathan Katz
Jonathan Katz University of Maryland, College Park
Ran Canetti
Ran Canetti Boston University
Eran Tromer
Eran Tromer Tel Aviv University

If you think any of the details on this page are incorrect, let us know.

Report an issue

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:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a wide range of online degrees and career opportunities. Many students choose to pursue specialized master’s programs, such as those found among the most affordable online masters. These programs provide flexibility and can fit into busy schedules, making them ideal for professionals seeking to advance their skills.

If your interests extend beyond computer science, you might consider online options such as the emba programs for leadership in tech-driven businesses, or an mlis degree for information management roles. For those aiming to achieve the highest scholarly credentials, a doctorate organizational leadership online can help you transition into executive or academic leadership positions.

Each of these online degrees opens unique career pathways and can complement a background in computer science. Evaluating cost, flexibility, and career goals is key when choosing the right program for your future.

Best Scientists Citing Vinod Vaikuntanathan

Trending Scientists

Recently Published Articles