← back to search

Vinod Vaikuntanathan

Massachusetts Institute of Technology · US
Area of research
Artificial Intelligence · Computational Theory and Mathematics
Research interest
Research interests include Cryptography and Data Security, Complexity and Algorithms in Graphs, Cryptographic Implementations and Security, and Privacy-Preserving Technologies in Data.
h-index
61
citations
20,346
works
249
NIH funding
primary concept
email

Recent publications

Pseudorandom Obfuscation and Applications
Lecture notes in computer science 2025cited by 6position: lastdoi
Somewhat Homomorphic Encryption from Linear Homomorphism and Sparse LPN
Lecture notes in computer science 2025cited by 5position: lastdoi
Cryptography
Oberwolfach Reports 2025cited by 0position: lastdoi
Quantum State Obfuscation from Classical Oracles
2024cited by 17position: lastdoi
SoK: Learning with Errors, Circular Security, and Fully Homomorphic Encryption
Lecture notes in computer science 2024cited by 6position: lastdoi
FAB: An FPGA-based Accelerator for Bootstrappable Fully Homomorphic Encryption
2023cited by 113position: middledoi
Boosting Batch Arguments and RAM Delegation
2023cited by 42position: middledoi
Quantum Advantage from Any Non-local Game
2023cited by 25position: middledoi
MAD: Memory-Aware Design Techniques for Accelerating Fully Homomorphic Encryption
2023cited by 24position: middledoi
SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption
Lecture notes in computer science 2023cited by 14position: lastdoi
OpenFHE
2022cited by 225position: middledoi
Rate-1 Non-Interactive Arguments for Batch-NP and Applications
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) 2022cited by 41position: lastdoi
Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) 2022cited by 33position: middledoi
Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) 2022cited by 21position: lastdoi
Locally Verifiable Signature and Key Aggregation
Lecture notes in computer science 2022cited by 19position: lastdoi
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) 2022cited by 14position: lastdoi
Succinct Classical Verification of Quantum Computation
Lecture notes in computer science 2022cited by 12position: middledoi
A Note on Perfect Correctness by Derandomization
Journal of Cryptology 2022cited by 3position: lastdoi
Oblivious Transfer Is in MiniQCrypt
Lecture notes in computer science 2021cited by 55position: lastdoi
The t-wise Independence of Substitution-Permutation Networks
Lecture notes in computer science 2021cited by 14position: lastdoi
Structure Versus Hardness Through the Obfuscation Lens
SIAM Journal on Computing 2021cited by 5position: lastdoi
The t-wise Independence of Substitution-Permutation Networks.
IACR Cryptology ePrint Archive 2021cited by 1position: last
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs
Lecture notes in computer science 2020cited by 37position: lastdoi
Extracting Randomness from Extractor-Dependent Sources
Lecture notes in computer science 2020cited by 13position: middledoi
Statistical ZAPR Arguments from Bilinear Maps
Lecture notes in computer science 2020cited by 11position: middledoi
Cryptography from Information Loss
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) 2020cited by 4position: middledoi
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs.
IACR Cryptology ePrint Archive 2020cited by 0position: last
Reusable Non-Interactive Secure Computation
Lecture notes in computer science 2019cited by 38position: lastdoi
Extracting Randomness from Extractor-Dependent Sources.
IACR Cryptology ePrint Archive 2019cited by 2position: middle
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) 2019cited by 0position: lastdoi

Grants

SaTC 2.0: RES: Foundations of Quantum Cryptography
NSF2534400$1,200,0002026–2030PIRePORTER
Collaborative Research: SaTC: CORE: Medium: Theoretical Foundations of Block Ciphers
NSF2154149$600,0002022–2026PIRePORTER
NSFSaTC-BSF: CORE: Small: Foundations of Lattice-based Cryptography
NSF1718161$500,0002017–2020PIRePORTER
CAREER: Computing on Encrypted Data
NSF1350619$536,8082014–2019PIRePORTER

Frequent collaborators

Zvika Brakerski · Jain Irrigation Systems (Israel)13 papers (2012–2024)Daniel Wichs · Northeastern University10 papers (2012–2023)Yael Tauman Kalai · Massachusetts Institute of Technology10 papers (2012–2025)Alex Lombardi · Massachusetts Institute of Technology9 papers (2017–2023)Hoeteck Wee · Columbia University9 papers (2012–2019)Nir Bitansky · Tel Aviv University8 papers (2016–2022)Tianren Liu · Chinese Academy of Sciences6 papers (2017–2021)Yevgeniy Dodis · New York University5 papers (2013–2020)Ran Canetti · Boston University5 papers (2012–2018)S. Gorbunov · Massachusetts Institute of Technology5 papers (2013–2015)Abhishek Jain · Johns Hopkins University5 papers (2012–2025)Shafi Goldwasser · Massachusetts Institute of Technology5 papers (2012–2025)Justin Holmgren · Massachusetts Institute of Technology4 papers (2015–2018)Gil Segev · Hebrew University of Jerusalem4 papers (2014–2018)Huijia Lin · University of Washington4 papers (2015–2021) · 3 papers (2012–2014)Eran Tromer · Boston University3 papers (2012–2017)Adriana López-Alt · New York University3 papers (2012–2017)Stefano Tessaro · Massachusetts Institute of Technology3 papers (2015–2021)Akshay Degwekar · IIT@MIT3 papers (2017–2021)