default search action
Vinod Vaikuntanathan
Person information
- affiliation: MIT, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Carsten Baum, Jens Berlips, Walther Chen, Ivan Bjerre Damgård, Kevin M. Esvelt, Leonard Foner, Dana Gretton, Martin Kysel, Ronald L. Rivest, Lawrence Roy, Francesca Sage-Ling, Adi Shamir, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu:
Efficient Maliciously Secure Oblivious Exponentiations. IACR Commun. Cryptol. 1(3): 10 (2024) - [c137]Surya Mathialagan, Spencer Peters, Vinod Vaikuntanathan:
Adaptively Sound Zero-Knowledge SNARKs for UP. CRYPTO (10) 2024: 38-71 - [c136]Seyoon Ragavan, Vinod Vaikuntanathan:
Space-Efficient and Noise-Robust Quantum Factoring. CRYPTO (6) 2024: 107-140 - [c135]Aparna Gupte, Vinod Vaikuntanathan:
How to Construct Quantum FHE, Generically. CRYPTO (3) 2024: 246-279 - [c134]Daniele Micciancio, Vinod Vaikuntanathan:
SoK: Learning with Errors, Circular Security, and Fully Homomorphic Encryption. Public Key Cryptography (4) 2024: 291-321 - [c133]James Bartusek, Zvika Brakerski, Vinod Vaikuntanathan:
Quantum State Obfuscation from Classical Oracles. STOC 2024: 1009-1017 - [c132]Zhengzhong Jin, Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs under LWE via Propositional Proofs. STOC 2024: 1750-1757 - [i144]James Bartusek, Zvika Brakerski, Vinod Vaikuntanathan:
Quantum State Obfuscation from Classical Oracles. CoRR abs/2401.10200 (2024) - [i143]Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan:
Sparse Linear Regression and Lattice Problems. CoRR abs/2402.14645 (2024) - [i142]Carsten Baum, Jens Berlips, Walther Chen, Hongrui Cui, Ivan Damgård, Jiangbin Dong, Kevin M. Esvelt, Mingyu Gao, Dana Gretton, Leonard Foner, Martin Kysel, Kaiyi Zhang, Juanru Li, Xiang Li, Omer Paneth, Ronald L. Rivest, Francesca Sage-Ling, Adi Shamir, Yue Shen, Meicen Sun, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Yun Wang, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu, Haoling Zhang:
A system capable of verifiably and privately screening global DNA synthesis. CoRR abs/2403.14023 (2024) - [i141]Aparna Gupte, Vinod Vaikuntanathan:
How to Construct Quantum FHE, Generically. CoRR abs/2406.03379 (2024) - [i140]James Bartusek, Zvika Brakerski, Vinod Vaikuntanathan:
Quantum State Obfuscation from Classical Oracles. IACR Cryptol. ePrint Arch. 2024: 82 (2024) - [i139]Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan:
Layout Graphs, Random Walks and the t-wise Independence of SPN Block Ciphers. IACR Cryptol. ePrint Arch. 2024: 83 (2024) - [i138]Surya Mathialagan, Spencer Peters, Vinod Vaikuntanathan:
Adaptively Sound Zero-Knowledge SNARKs for UP. IACR Cryptol. ePrint Arch. 2024: 227 (2024) - [i137]Seyoon Ragavan, Neekon Vafa, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from Bilinear Maps and LPN Variants. IACR Cryptol. ePrint Arch. 2024: 856 (2024) - [i136]Aparna Gupte, Vinod Vaikuntanathan:
How to Construct Quantum FHE, Generically. IACR Cryptol. ePrint Arch. 2024: 893 (2024) - [i135]Zhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs under LWE via Propositional Proofs. IACR Cryptol. ePrint Arch. 2024: 956 (2024) - [i134]Carsten Baum, Jens Berlips, Walther Chen, Ivan Damgård, Kevin M. Esvelt, Leonard Foner, Dana Gretton, Martin Kysel, Ronald L. Rivest, Lawrence Roy, Francesca Sage-Ling, Adi Shamir, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Daniel Wichs, Stephen Wooster, Andrew C. Yao, Yu Yu:
Efficient Maliciously Secure Oblivious Exponentiations. IACR Cryptol. ePrint Arch. 2024: 1613 (2024) - [i133]Pedro Branco, Nico Döttling, Abhishek Jain, Giulio Malavolta, Surya Mathialagan, Spencer Peters, Vinod Vaikuntanathan:
Pseudorandom Obfuscation and Applications. IACR Cryptol. ePrint Arch. 2024: 1742 (2024) - [i132]Henry Corrigan-Gibbs, Alexandra Henzinger, Yael Kalai, Vinod Vaikuntanathan:
Somewhat Homomorphic Encryption from Linear Homomorphism and Sparse LPN. IACR Cryptol. ePrint Arch. 2024: 1760 (2024) - [i131]Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan:
How Fast Does the Inverse Walk Approximate a Random Permutation? IACR Cryptol. ePrint Arch. 2024: 1795 (2024) - 2023
- [c131]Tianren Liu, Angelos Pelecanos, Stefano Tessaro, Vinod Vaikuntanathan:
Layout Graphs, Random Walks and the t-Wise Independence of SPN Block Ciphers. CRYPTO (3) 2023: 694-726 - [c130]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption. EUROCRYPT (2) 2023: 470-498 - [c129]Rashmi Agrawal, Leo de Castro, Guowei Yang, Chiraag Juvekar, Rabia Tugce Yazicigil, Anantha P. Chandrakasan, Vinod Vaikuntanathan, Ajay Joshi:
FAB: An FPGA-based Accelerator for Bootstrappable Fully Homomorphic Encryption. HPCA 2023: 882-895 - [c128]Rashmi Agrawal, Leo de Castro, Chiraag Juvekar, Anantha P. Chandrakasan, Vinod Vaikuntanathan, Ajay Joshi:
MAD: Memory-Aware Design Techniques for Accelerating Fully Homomorphic Encryption. MICRO 2023: 685-697 - [c127]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems beyond Polynomial Time. STOC 2023: 1516-1526 - [c126]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Boosting Batch Arguments and RAM Delegation. STOC 2023: 1545-1552 - [c125]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. STOC 2023: 1553-1566 - [c124]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-local Game. STOC 2023: 1617-1628 - [c123]Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan:
Revocable Cryptography from Learning with Errors. TCC (4) 2023: 93-122 - [c122]Alexandra Henzinger, Matthew M. Hong, Henry Corrigan-Gibbs, Sarah Meiklejohn, Vinod Vaikuntanathan:
One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. USENIX Security Symposium 2023: 3889-3905 - [i130]Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan:
Revocable Cryptography from Learning with Errors. CoRR abs/2302.14860 (2023) - [i129]Homa Esfahanizadeh, Adam Yala, Rafael G. L. D'Oliveira, Andrea J. D. Jaba, Victor Quach, Ken R. Duffy, Tommi S. Jaakkola, Vinod Vaikuntanathan, Manya Ghobadi, Regina Barzilay, Muriel Médard:
PEOPL: Characterizing Privately Encoded Open Datasets with Public Labels. CoRR abs/2304.00047 (2023) - [i128]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. Electron. Colloquium Comput. Complex. TR23 (2023) - [i127]Prabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan:
Revocable Cryptography from Learning with Errors. IACR Cryptol. ePrint Arch. 2023: 325 (2023) - [i126]Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. IACR Cryptol. ePrint Arch. 2023: 955 (2023) - [i125]Ravit Geva, Alexander Gusev, Yuriy Polyakov, Lior Liram, Oded Rosolio, Andreea Alexandru, Nicholas Genise, Marcelo Blatt, Zohar Duchin, Barliz Waissengrin, Dan Mirelman, Felix Bukstein, Deborah T. Blumenthal, Ido Wolf, Sharon Pelles-Avraham, Tali Schaffer, Lee A. Lavi, Daniele Micciancio, Vinod Vaikuntanathan, Ahmad Al Badawi, Shafi Goldwasser:
Collaborative Privacy-Preserving Analysis of Oncological Data using Multiparty Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2023: 1203 (2023) - [i124]Seyoon Ragavan, Vinod Vaikuntanathan:
Optimizing Space in Regev's Factoring Algorithm. IACR Cryptol. ePrint Arch. 2023: 1501 (2023) - 2022
- [j15]Nir Bitansky, Vinod Vaikuntanathan:
A Note on Perfect Correctness by Derandomization. J. Cryptol. 35(3): 18 (2022) - [c121]Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Witness Encryption and Null-IO from Evasive LWE. ASIACRYPT (1) 2022: 195-221 - [c120]Ahmad Al Badawi, Jack Bates, Flávio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, R. V. Saraswathy, Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, Vincent Zucca:
OpenFHE: Open-Source Fully Homomorphic Encryption Library. WAHC@CCS 2022: 53-63 - [c119]James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang:
Succinct Classical Verification of Quantum Computation. CRYPTO (2) 2022: 195-211 - [c118]Rishab Goyal, Vinod Vaikuntanathan:
Locally Verifiable Signature and Key Aggregation. CRYPTO (2) 2022: 761-791 - [c117]Leo de Castro, Carmit Hazay, Yuval Ishai, Vinod Vaikuntanathan, Muthuramakrishnan Venkitasubramaniam:
Asymptotically Quasi-Optimal Cryptography. EUROCRYPT (1) 2022: 303-334 - [c116]Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir:
Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]. FOCS 2022: 931-942 - [c115]Lalita Devadas, Rishab Goyal, Yael Kalai, Vinod Vaikuntanathan:
Rate-1 Non-Interactive Arguments for Batch-NP and Applications. FOCS 2022: 1057-1068 - [c114]Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan:
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. FOCS 2022: 1162-1173 - [c113]Zvika Brakerski, Vinod Vaikuntanathan:
Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE. ITCS 2022: 28:1-28:20 - [c112]Alex Lombardi, Vinod Vaikuntanathan:
Correlation-Intractable Hash Functions via Shift-Hiding. ITCS 2022: 102:1-102:16 - [e3]Eike Kiltz, Vinod Vaikuntanathan:
Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part I. Lecture Notes in Computer Science 13747, Springer 2022, ISBN 978-3-031-22317-4 [contents] - [e2]Eike Kiltz, Vinod Vaikuntanathan:
Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part II. Lecture Notes in Computer Science 13748, Springer 2022, ISBN 978-3-031-22364-8 [contents] - [e1]Eike Kiltz, Vinod Vaikuntanathan:
Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part III. Lecture Notes in Computer Science 13749, Springer 2022, ISBN 978-3-031-22367-9 [contents] - [i123]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-Local Game. CoRR abs/2203.15877 (2022) - [i122]Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan:
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. CoRR abs/2204.02550 (2022) - [i121]Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir:
Planting Undetectable Backdoors in Machine Learning Models. CoRR abs/2204.06974 (2022) - [i120]James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang:
Succinct Classical Verification of Quantum Computation. CoRR abs/2206.14929 (2022) - [i119]Rashmi Agrawal, Leo de Castro, Guowei Yang, Chiraag Juvekar, Rabia Tugce Yazicigil, Anantha P. Chandrakasan, Vinod Vaikuntanathan, Ajay Joshi:
FAB: An FPGA-based Accelerator for Bootstrappable Fully Homomorphic Encryption. CoRR abs/2207.11872 (2022) - [i118]Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems Beyond Polynomial Time. CoRR abs/2211.11693 (2022) - [i117]Rishab Goyal, Vinod Vaikuntanathan:
Locally Verifiable Signature and Key Aggregation. IACR Cryptol. ePrint Arch. 2022: 179 (2022) - [i116]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-Local Game. IACR Cryptol. ePrint Arch. 2022: 400 (2022) - [i115]Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan:
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. IACR Cryptol. ePrint Arch. 2022: 437 (2022) - [i114]James Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang:
Succinct Classical Verification of Quantum Computation. IACR Cryptol. ePrint Arch. 2022: 857 (2022) - [i113]Ahmad Al Badawi, Jack Bates, Flávio Bergamaschi, David Bruce Cousins, Saroja Erabelli, Nicholas Genise, Shai Halevi, Hamish Hunt, Andrey Kim, Yongwoo Lee, Zeyu Liu, Daniele Micciancio, Ian Quah, Yuriy Polyakov, R. V. Saraswathy, Kurt Rohloff, Jonathan Saylor, Dmitriy Suponitsky, Matthew Triplett, Vinod Vaikuntanathan, Vincent Zucca:
OpenFHE: Open-Source Fully Homomorphic Encryption Library. IACR Cryptol. ePrint Arch. 2022: 915 (2022) - [i112]Alexandra Henzinger, Matthew M. Hong, Henry Corrigan-Gibbs, Sarah Meiklejohn, Vinod Vaikuntanathan:
One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. IACR Cryptol. ePrint Arch. 2022: 949 (2022) - [i111]Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Witness Encryption and Null-IO from Evasive LWE. IACR Cryptol. ePrint Arch. 2022: 1140 (2022) - [i110]Lalita Devadas, Rishab Goyal, Yael Kalai, Vinod Vaikuntanathan:
Rate-1 Non-Interactive Arguments for Batch-NP and Applications. IACR Cryptol. ePrint Arch. 2022: 1236 (2022) - [i109]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Boosting Batch Arguments and RAM Delegation. IACR Cryptol. ePrint Arch. 2022: 1320 (2022) - [i108]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2022: 1409 (2022) - 2021
- [j14]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure Versus Hardness Through the Obfuscation Lens. SIAM J. Comput. 50(1): 98-144 (2021) - [c111]Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
On the Hardness of Average-Case k-SUM. APPROX-RANDOM 2021: 29:1-29:19 - [c110]Leo de Castro, Chiraag Juvekar, Vinod Vaikuntanathan:
Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors. WAHC@CCS 2021: 29-41 - [c109]Tianren Liu, Stefano Tessaro, Vinod Vaikuntanathan:
The t-wise Independence of Substitution-Permutation Networks. CRYPTO (4) 2021: 454-483 - [c108]Alex B. Grilo, Huijia Lin, Fang Song, Vinod Vaikuntanathan:
Oblivious Transfer Is in MiniQCrypt. EUROCRYPT (2) 2021: 531-561 - [c107]Lalita Devadas, Willy Quach, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Succinct LWE Sampling, Random Polynomials, and Obfuscation. TCC (2) 2021: 256-287 - [c106]Yael Tauman Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang:
Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs. TCC (1) 2021: 330-368 - [i107]Adam Yala, Homa Esfahanizadeh, Rafael G. L. D'Oliveira, Ken R. Duffy, Manya Ghobadi, Tommi S. Jaakkola, Vinod Vaikuntanathan, Regina Barzilay, Muriel Médard:
NeuraCrypt: Hiding Private Health Data via Random Neural Networks for Public Training. CoRR abs/2106.02484 (2021) - [i106]Aparna Gupte, Vinod Vaikuntanathan:
The Fine-Grained Hardness of Sparse Linear Regression. CoRR abs/2106.03131 (2021) - [i105]Leo de Castro, Rashmi Agrawal, Rabia Tugce Yazicigil, Anantha P. Chandrakasan, Vinod Vaikuntanathan, Chiraag Juvekar, Ajay Joshi:
Does Fully Homomorphic Encryption Need Compute Acceleration? CoRR abs/2112.06396 (2021) - [i104]Tianren Liu, Stefano Tessaro, Vinod Vaikuntanathan:
The t-wise Independence of Substitution-Permutation Networks. IACR Cryptol. ePrint Arch. 2021: 507 (2021) - [i103]Yael Tauman Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang:
Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs for P. IACR Cryptol. ePrint Arch. 2021: 788 (2021) - [i102]Lalita Devadas, Willy Quach, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Succinct LWE Sampling, Random Polynomials, and Obfuscation. IACR Cryptol. ePrint Arch. 2021: 1226 (2021) - [i101]Leo de Castro, Rashmi Agrawal, Rabia Tugce Yazicigil, Anantha P. Chandrakasan, Vinod Vaikuntanathan, Chiraag Juvekar, Ajay Joshi:
Does Fully Homomorphic Encryption Need Compute Acceleration? IACR Cryptol. ePrint Arch. 2021: 1636 (2021) - 2020
- [c105]Alex Lombardi, Vinod Vaikuntanathan:
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs. CRYPTO (3) 2020: 632-651 - [c104]Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
Extracting Randomness from Extractor-Dependent Sources. EUROCRYPT (1) 2020: 313-342 - [c103]Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Statistical ZAPR Arguments from Bilinear Maps. EUROCRYPT (3) 2020: 620-641 - [c102]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. ITCS 2020: 81:1-81:27 - [c101]Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan:
Data structures meet cryptography: 3SUM with preprocessing. STOC 2020: 294-307 - [i100]Zvika Brakerski, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
On the Hardness of Average-case k-SUM. CoRR abs/2010.08821 (2020) - [i99]Alex B. Grilo, Huijia Lin, Fang Song, Vinod Vaikuntanathan:
Oblivious Transfer is in MiniQCrypt. CoRR abs/2011.14980 (2020) - [i98]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. Electron. Colloquium Comput. Complex. TR20 (2020) - [i97]Zvika Brakerski, Vinod Vaikuntanathan:
Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE. IACR Cryptol. ePrint Arch. 2020: 191 (2020) - [i96]Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Statistical ZAPR Arguments from Bilinear Maps. IACR Cryptol. ePrint Arch. 2020: 256 (2020) - [i95]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. IACR Cryptol. ePrint Arch. 2020: 395 (2020) - [i94]Leo de Castro, Chiraag Juvekar, Vinod Vaikuntanathan:
Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors. IACR Cryptol. ePrint Arch. 2020: 685 (2020) - [i93]Alex Lombardi, Vinod Vaikuntanathan:
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs. IACR Cryptol. ePrint Arch. 2020: 772 (2020) - [i92]Alex Lombardi, Vinod Vaikuntanathan:
Multi-Input Correlation-Intractable Hash Functions via Shift-Hiding. IACR Cryptol. ePrint Arch. 2020: 1378 (2020) - [i91]Alex B. Grilo, Huijia Lin, Fang Song, Vinod Vaikuntanathan:
Oblivious Transfer is in MiniQCrypt. IACR Cryptol. ePrint Arch. 2020: 1500 (2020)
2010 – 2019
- 2019
- [c100]Akshay Degwekar, Preetum Nakkiran, Vinod Vaikuntanathan:
Computational Limitations in Robust Classification and Win-Win Results. COLT 2019: 994-1028 - [c99]Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, Vinod Vaikuntanathan:
Reusable Non-Interactive Secure Computation. CRYPTO (3) 2019: 462-488 - [c98]Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. EUROCRYPT (3) 2019: 619-635 - [c97]Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
SETH-Hardness of Coding Problems. FOCS 2019: 287-301 - [c96]Elette Boyle, Rio LaVigne, Vinod Vaikuntanathan:
Adversarially Robust Property-Preserving Hash Functions. ITCS 2019: 16:1-16:20 - [c95]Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan:
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. ITCS 2019: 42:1-42:20 - [c94]Alex Lombardi, Vinod Vaikuntanathan, Thuy-Duong Vuong:
Lattice Trapdoors and IBE from Middle-Product LWE. TCC (1) 2019: 24-54 - [c93]Yilei Chen, Minki Hhan, Vinod Vaikuntanathan, Hoeteck Wee:
Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation. TCC (1) 2019: 55-80 - [c92]Prabhanjan Ananth, Vinod Vaikuntanathan:
Optimal Bounded-Collusion Secure Functional Encryption. TCC (1) 2019: 174-198 - [i90]Akshay Degwekar, Vinod Vaikuntanathan:
Computational Limitations in Robust Classification and Win-Win Results. CoRR abs/1902.01086 (2019) - [i89]Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan:
3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications. CoRR abs/1907.08355 (2019) - [i88]Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
SETH-hardness of Coding Problems. Electron. Colloquium Comput. Complex. TR19 (2019) - [i87]Akshay Degwekar, Vinod Vaikuntanathan:
Computational Limitations in Robust Classification and Win-Win Results. IACR Cryptol. ePrint Arch. 2019: 218 (2019) - [i86]Marcelo Blatt, Alexander Gusev, Yuriy Polyakov, Kurt Rohloff, Vinod Vaikuntanathan:
Optimized Homomorphic Encryption Solution for Secure Genome-Wide Association Studies. IACR Cryptol. ePrint Arch. 2019: 223 (2019) - [i85]Prabhanjan Ananth, Vinod Vaikuntanathan:
Optimal Bounded-Collusion Secure Functional Encryption. IACR Cryptol. ePrint Arch. 2019: 314 (2019) - [i84]Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
2-Message Publicly Verifiable WI from (Subexponential) LWE. IACR Cryptol. ePrint Arch. 2019: 808 (2019) - [i83]Martin R. Albrecht, Melissa Chase, Hao Chen, Jintai Ding, Shafi Goldwasser, Sergey Gorbunov, Shai Halevi, Jeffrey Hoffstein, Kim Laine, Kristin E. Lauter, Satya Lokam, Daniele Micciancio, Dustin Moody, Travis Morrison, Amit Sahai, Vinod Vaikuntanathan:
Homomorphic Encryption Standard. IACR Cryptol. ePrint Arch. 2019: 939 (2019) - [i82]Alex Lombardi, Vinod Vaikuntanathan, Thuy-Duong Vuong:
Lattice Trapdoors and IBE from Middle-Product LWE. IACR Cryptol. ePrint Arch. 2019: 1067 (2019) - [i81]Yilei Chen, Minki Hhan, Vinod Vaikuntanathan, Hoeteck Wee:
Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation. IACR Cryptol. ePrint Arch. 2019: 1085 (2019) - [i80]Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
Extracting Randomness from Extractor-Dependent Sources. IACR Cryptol. ePrint Arch. 2019: 1339 (2019) - 2018
- [j13]Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from Functional Encryption. J. ACM 65(6): 39:1-39:37 (2018) - [j12]Nir Bitansky, Ran Canetti, Sanjam Garg, Justin Holmgren, Abhishek Jain, Huijia Lin, Rafael Pass, Sidharth Telang, Vinod Vaikuntanathan:
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. SIAM J. Comput. 47(3): 1123-1210 (2018) - [j11]Aloni Cohen, Justin Holmgren, Ryo Nishimaki, Vinod Vaikuntanathan, Daniel Wichs:
Watermarking Cryptographic Capabilities. SIAM J. Comput. 47(6): 2157-2202 (2018) - [c91]Yilei Chen, Vinod Vaikuntanathan, Hoeteck Wee:
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates. CRYPTO (2) 2018: 577-607 - [c90]Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan:
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. EUROCRYPT (1) 2018: 535-564 - [c89]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
Towards Breaking the Exponential Barrier for General Secret Sharing. EUROCRYPT (1) 2018: 567-596 - [c88]Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan:
Zero-Knowledge Proofs of Proximity. ITCS 2018: 19:1-19:20 - [c87]Tianren Liu, Vinod Vaikuntanathan:
Breaking the circuit-size barrier in secret sharing. STOC 2018: 699-708 - [c86]Yilei Chen, Vinod Vaikuntanathan, Brent Waters, Hoeteck Wee, Daniel Wichs:
Traitor-Tracing from LWE Made Simple and Attribute-Based. TCC (2) 2018: 341-369 - [c85]Chiraag Juvekar, Vinod Vaikuntanathan, Anantha P. Chandrakasan:
GAZELLE: A Low Latency Framework for Secure Neural Network Inference. USENIX Security Symposium 2018: 1651-1669 - [i79]Chiraag Juvekar, Vinod Vaikuntanathan, Anantha P. Chandrakasan:
Gazelle: A Low Latency Framework for Secure Neural Network Inference. CoRR abs/1801.05507 (2018) - [i78]Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan:
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. CoRR abs/1802.07381 (2018) - [i77]Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. Electron. Colloquium Comput. Complex. TR18 (2018) - [i76]Chiraag Juvekar, Vinod Vaikuntanathan, Anantha P. Chandrakasan:
GAZELLE: A Low Latency Framework for Secure Neural Network Inference. IACR Cryptol. ePrint Arch. 2018: 73 (2018) - [i75]Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan:
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. IACR Cryptol. ePrint Arch. 2018: 212 (2018) - [i74]Zvika Brakerski, Vadim Lyubashevsky, Vinod Vaikuntanathan, Daniel Wichs:
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing. IACR Cryptol. ePrint Arch. 2018: 279 (2018) - [i73]Tianren Liu, Vinod Vaikuntanathan:
Breaking the Circuit-Size Barrier in Secret Sharing. IACR Cryptol. ePrint Arch. 2018: 333 (2018) - [i72]Yilei Chen, Vinod Vaikuntanathan, Hoeteck Wee:
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates. IACR Cryptol. ePrint Arch. 2018: 360 (2018) - [i71]Yilei Chen, Vinod Vaikuntanathan, Brent Waters, Hoeteck Wee, Daniel Wichs:
Traitor-Tracing from LWE Made Simple and Attribute-Based. IACR Cryptol. ePrint Arch. 2018: 897 (2018) - [i70]Melissa Chase, Yevgeniy Dodis, Yuval Ishai, Daniel Kraschewski, Tianren Liu, Rafail Ostrovsky, Vinod Vaikuntanathan:
Reusable Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2018: 940 (2018) - [i69]Elette Boyle, Rio LaVigne, Vinod Vaikuntanathan:
Adversarially Robust Property Preserving Hash Functions. IACR Cryptol. ePrint Arch. 2018: 1158 (2018) - 2017
- [j10]Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan:
Multikey Fully Homomorphic Encryption and Applications. SIAM J. Comput. 46(6): 1827-1892 (2017) - [j9]Yuriy Polyakov, Kurt Rohloff, Gyana Sahu, Vinod Vaikuntanathan:
Fast Proxy Re-Encryption for Publish/Subscribe Systems. ACM Trans. Priv. Secur. 20(4): 14:1-14:31 (2017) - [c84]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure vs. Hardness Through the Obfuscation Lens. CRYPTO (1) 2017: 696-723 - [c83]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
Conditional Disclosure of Secrets via Non-linear Reconstruction. CRYPTO (1) 2017: 758-790 - [c82]Nir Bitansky, Vinod Vaikuntanathan:
A Note on Perfect Correctness by Derandomization. EUROCRYPT (2) 2017: 592-606 - [c81]Vinod Vaikuntanathan:
Some Open Problems in Information-Theoretic Cryptography. FSTTCS 2017: 5:1-5:7 - [c80]Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan:
Low-Complexity Cryptographic Hash Functions . ITCS 2017: 7:1-7:31 - [c79]Frank Wang, Catherine Yun, Shafi Goldwasser, Vinod Vaikuntanathan, Matei Zaharia:
Splinter: Practical Private Queries on Public Data. NSDI 2017: 299-313 - [c78]Ran Canetti, Srinivasan Raghuraman, Silas Richelson, Vinod Vaikuntanathan:
Chosen-Ciphertext Secure Fully Homomorphic Encryption. Public Key Cryptography (2) 2017: 213-240 - [c77]Alex Lombardi, Vinod Vaikuntanathan:
Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation. TCC (1) 2017: 119-137 - [c76]Zvika Brakerski, Rotem Tsabary, Vinod Vaikuntanathan, Hoeteck Wee:
Private Constrained PRFs (and More) from LWE. TCC (1) 2017: 264-302 - [i68]Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan:
Low-Complexity Cryptographic Hash Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - [i67]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
New Protocols for Conditional Disclosure of Secrets (and More). Electron. Colloquium Comput. Complex. TR17 (2017) - [i66]Benny Applebaum, Naama Haramaty, Yuval Ishai, Eyal Kushilevitz, Vinod Vaikuntanathan:
Low-Complexity Cryptographic Hash Functions. IACR Cryptol. ePrint Arch. 2017: 36 (2017) - [i65]Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan:
Zero-Knowledge Proofs of Proximity. IACR Cryptol. ePrint Arch. 2017: 114 (2017) - [i64]Alex Lombardi, Vinod Vaikuntanathan:
Minimizing the Complexity of Goldreich's Pseudorandom Generator. IACR Cryptol. ePrint Arch. 2017: 277 (2017) - [i63]Alex Lombardi, Vinod Vaikuntanathan:
On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2017: 301 (2017) - [i62]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
New Protocols for Conditional Disclosure of Secrets (and More). IACR Cryptol. ePrint Arch. 2017: 359 (2017) - [i61]Yuriy Polyakov, Kurt Rohloff, Gyana Sahu, Vinod Vaikuntanathan:
Fast Proxy Re-Encryption for Publish/Subscribe Systems. IACR Cryptol. ePrint Arch. 2017: 410 (2017) - [i60]Zvika Brakerski, Rotem Tsabary, Vinod Vaikuntanathan, Hoeteck Wee:
Private Constrained PRFs (and More) from LWE. IACR Cryptol. ePrint Arch. 2017: 795 (2017) - [i59]Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan:
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. IACR Cryptol. ePrint Arch. 2017: 967 (2017) - [i58]Tianren Liu, Vinod Vaikuntanathan, Hoeteck Wee:
Towards Breaking the Exponential Barrier for General Secret Sharing. IACR Cryptol. ePrint Arch. 2017: 1062 (2017) - 2016
- [j8]Alhassan Khedr, P. Glenn Gulak, Vinod Vaikuntanathan:
SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers. IEEE Trans. Computers 65(9): 2848-2858 (2016) - [c75]Ranjit Kumaresan, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Improvements to Secure Computation with Penalties. CCS 2016: 406-417 - [c74]Zvika Brakerski, Vinod Vaikuntanathan:
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security. CRYPTO (3) 2016: 363-384 - [c73]Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Fine-Grained Cryptography. CRYPTO (3) 2016: 533-562 - [c72]Huijia Lin, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings. FOCS 2016: 11-20 - [c71]Zvika Brakerski, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Obfuscating Conjunctions under Entropic Ring LWE. ITCS 2016: 147-156 - [c70]Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent Waters:
Time-Lock Puzzles from Randomized Encodings. ITCS 2016: 345-356 - [c69]Frank Wang, James Mickens, Nickolai Zeldovich, Vinod Vaikuntanathan:
Sieve: Cryptographically Enforced Access Control for User Data in Untrusted Clouds. NSDI 2016: 611-626 - [c68]Aloni Cohen, Justin Holmgren, Ryo Nishimaki, Vinod Vaikuntanathan, Daniel Wichs:
Watermarking cryptographic capabilities. STOC 2016: 1115-1127 - [c67]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan:
3-Message Zero Knowledge Against Human Ignorance. TCC (B1) 2016: 57-83 - [c66]Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation: From Approximate to Exact. TCC (A1) 2016: 67-95 - [c65]Tianren Liu, Vinod Vaikuntanathan:
On Basing Private Information Retrieval on NP-Hardness. TCC (A1) 2016: 372-386 - [i57]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure vs Hardness through the Obfuscation Lens. Electron. Colloquium Comput. Complex. TR16 (2016) - [i56]Zvika Brakerski, Vinod Vaikuntanathan:
Circuit-ABE from LWE: Unbounded Attributes and Semi-Adaptive Security. IACR Cryptol. ePrint Arch. 2016: 118 (2016) - [i55]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan:
3-Message Zero Knowledge Against Human Ignorance. IACR Cryptol. ePrint Arch. 2016: 213 (2016) - [i54]Nir Bitansky, Akshay Degwekar, Vinod Vaikuntanathan:
Structure vs Hardness through the Obfuscation Lens. IACR Cryptol. ePrint Arch. 2016: 574 (2016) - [i53]Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Fine-grained Cryptography. IACR Cryptol. ePrint Arch. 2016: 580 (2016) - [i52]Huijia Lin, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from DDH-like Assumptions on Constant-Degree Graded Encodings. IACR Cryptol. ePrint Arch. 2016: 795 (2016) - [i51]Frank Wang, Catherine Yun, Shafi Goldwasser, Vinod Vaikuntanathan, Matei Zaharia:
Splinter: Practical Private Queries on Public Data. IACR Cryptol. ePrint Arch. 2016: 1148 (2016) - 2015
- [j7]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Attribute-Based Encryption for Circuits. J. ACM 62(6): 45:1-45:33 (2015) - [c64]Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Secret Sharing and Statistical Zero Knowledge. ASIACRYPT (1) 2015: 656-680 - [c63]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Predicate Encryption for Circuits from LWE. CRYPTO (2) 2015: 503-523 - [c62]Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan:
From Selective to Adaptive Security in Functional Encryption. CRYPTO (2) 2015: 657-677 - [c61]Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from Functional Encryption. FOCS 2015: 171-190 - [c60]Ran Canetti, Justin Holmgren, Abhishek Jain, Vinod Vaikuntanathan:
Succinct Garbling and Indistinguishability Obfuscation for RAM Programs. STOC 2015: 429-437 - [c59]Sergey Gorbunov, Vinod Vaikuntanathan, Daniel Wichs:
Leveled Fully Homomorphic Signatures from Standard Lattices. STOC 2015: 469-477 - [c58]Zvika Brakerski, Vinod Vaikuntanathan:
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions - Or: How to Secretly Embed a Circuit in Your PRF. TCC (2) 2015: 1-30 - [c57]Aloni Cohen, Shafi Goldwasser, Vinod Vaikuntanathan:
Aggregate Pseudorandom Functions and Connections to Learning. TCC (2) 2015: 61-89 - [c56]Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan:
Obfuscation of Probabilistic Circuits and Applications. TCC (2) 2015: 468-497 - [i50]Nir Bitansky, Vinod Vaikuntanathan:
A Note on Perfect Correctness by Derandomization. Electron. Colloquium Comput. Complex. TR15 (2015) - [i49]Aloni Cohen, Shafi Goldwasser, Vinod Vaikuntanathan:
Aggregate Pseudorandom Functions and Connections to Learning. Electron. Colloquium Comput. Complex. TR15 (2015) - [i48]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Predicate Encryption for Circuits from LWE. IACR Cryptol. ePrint Arch. 2015: 29 (2015) - [i47]Zvika Brakerski, Vinod Vaikuntanathan:
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions Or: How to Secretly Embed a Circuit in Your PRF. IACR Cryptol. ePrint Arch. 2015: 32 (2015) - [i46]Aloni Cohen, Shafi Goldwasser, Vinod Vaikuntanathan:
Aggregatable Pseudorandom Functions and Connections to Learning. IACR Cryptol. ePrint Arch. 2015: 38 (2015) - [i45]Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation from Functional Encryption. IACR Cryptol. ePrint Arch. 2015: 163 (2015) - [i44]Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
From Statistical Zero Knowledge to Secret Sharing. IACR Cryptol. ePrint Arch. 2015: 281 (2015) - [i43]Aloni Cohen, Justin Holmgren, Vinod Vaikuntanathan:
Publicly Verifiable Software Watermarking. IACR Cryptol. ePrint Arch. 2015: 373 (2015) - [i42]Nir Bitansky, Shafi Goldwasser, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent Waters:
Time-Lock Puzzles from Randomized Encodings. IACR Cryptol. ePrint Arch. 2015: 514 (2015) - [i41]Nir Bitansky, Vinod Vaikuntanathan:
Indistinguishability Obfuscation: from Approximate to Exact. IACR Cryptol. ePrint Arch. 2015: 704 (2015) - [i40]Tianren Liu, Vinod Vaikuntanathan:
On Basing Private Information Retrieval on NP-Hardness. IACR Cryptol. ePrint Arch. 2015: 1061 (2015) - [i39]Aloni Cohen, Justin Holmgren, Ryo Nishimaki, Vinod Vaikuntanathan, Daniel Wichs:
Watermarking Cryptographic Capabilities. IACR Cryptol. ePrint Arch. 2015: 1096 (2015) - [i38]Nir Bitansky, Vinod Vaikuntanathan:
A Note on Perfect Correctness by Derandomization. IACR Cryptol. ePrint Arch. 2015: 1130 (2015) - 2014
- [j6]Zvika Brakerski, Vinod Vaikuntanathan:
Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$. SIAM J. Comput. 43(2): 831-871 (2014) - [j5]Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, Vinod Vaikuntanathan:
Protecting Circuits from Computationally Bounded and Noisy Leakage. SIAM J. Comput. 43(5): 1564-1614 (2014) - [j4]Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan:
(Leveled) Fully Homomorphic Encryption without Bootstrapping. ACM Trans. Comput. Theory 6(3): 13:1-13:36 (2014) - [c55]Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy:
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits. EUROCRYPT 2014: 533-556 - [c54]Zvika Brakerski, Vinod Vaikuntanathan:
Lattice-based FHE as secure as PKE. ITCS 2014: 1-12 - [i37]Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy:
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits. IACR Cryptol. ePrint Arch. 2014: 356 (2014) - [i36]Sergey Gorbunov, Vinod Vaikuntanathan:
(Leveled) Fully Homomorphic Signatures from Lattices. IACR Cryptol. ePrint Arch. 2014: 463 (2014) - [i35]Ran Canetti, Justin Holmgren, Abhishek Jain, Vinod Vaikuntanathan:
Indistinguishability Obfuscation of Iterated Circuits and RAM Programs. IACR Cryptol. ePrint Arch. 2014: 769 (2014) - [i34]Alhassan Khedr, P. Glenn Gulak, Vinod Vaikuntanathan:
SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers. IACR Cryptol. ePrint Arch. 2014: 838 (2014) - [i33]Ran Canetti, Huijia Lin, Stefano Tessaro, Vinod Vaikuntanathan:
Obfuscation of Probabilistic Circuits and Applications. IACR Cryptol. ePrint Arch. 2014: 882 (2014) - [i32]Sergey Gorbunov, Vinod Vaikuntanathan, Daniel Wichs:
Leveled Fully Homomorphic Signatures from Standard Lattices. IACR Cryptol. ePrint Arch. 2014: 897 (2014) - [i31]Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan:
The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically. IACR Cryptol. ePrint Arch. 2014: 917 (2014) - 2013
- [j3]Jonathan Katz, Vinod Vaikuntanathan:
Round-Optimal Password-Based Authenticated Key Exchange. J. Cryptol. 26(4): 714-743 (2013) - [j2]Jonathan Kaveh Valamehr, Melissa Chase, Seny Kamara, Andrew Putnam, Daniel Shumow, Vinod Vaikuntanathan, Timothy Sherwood:
Inspection-Resistant Memory Architectures. IEEE Micro 33(3): 48-56 (2013) - [c53]Shweta Agrawal, Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
On Continual Leakage of Discrete Log Representations. ASIACRYPT (2) 2013: 401-420 - [c52]Shweta Agrawal, Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption: New Perspectives and Lower Bounds. CRYPTO (2) 2013: 500-518 - [c51]Shafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, Nickolai Zeldovich:
How to Run Turing Machines on Encrypted Data. CRYPTO (2) 2013: 536-553 - [c50]Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan:
A Tight Bound for Set Disjointness in the Message-Passing Model. FOCS 2013: 668-677 - [c49]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Attribute-based encryption for circuits. STOC 2013: 545-554 - [c48]Shafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, Nickolai Zeldovich:
Reusable garbled circuits and succinct functional encryption. STOC 2013: 555-564 - [i30]Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, Vinod Vaikuntanathan:
Tight Bounds for Set Disjointness in the Message Passing Model. CoRR abs/1305.4696 (2013) - [i29]Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan:
On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2013: 94 (2013) - [i28]Shafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, Nickolai Zeldovich:
Overcoming the Worst-Case Curse for Cryptographic Constructions. IACR Cryptol. ePrint Arch. 2013: 229 (2013) - [i27]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Attribute-Based Encryption for Circuits. IACR Cryptol. ePrint Arch. 2013: 337 (2013) - [i26]Ran Canetti, Vinod Vaikuntanathan:
Obfuscating Branching Programs Using Black-Box Pseudo-Free Groups. IACR Cryptol. ePrint Arch. 2013: 500 (2013) - [i25]Zvika Brakerski, Vinod Vaikuntanathan:
Lattice-Based FHE as Secure as PKE. IACR Cryptol. ePrint Arch. 2013: 541 (2013) - [i24]Craig Gentry, Sergey Gorbunov, Shai Halevi, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy:
How to Compress (Reusable) Garbled Circuits. IACR Cryptol. ePrint Arch. 2013: 687 (2013) - 2012
- [c47]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption with Bounded Collusions via Multi-party Computation. CRYPTO 2012: 162-179 - [c46]Gilad Asharov, Abhishek Jain, Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan, Daniel Wichs:
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. EUROCRYPT 2012: 483-501 - [c45]Vinod Vaikuntanathan:
How to Compute on Encrypted Data. INDOCRYPT 2012: 1-15 - [c44]Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan:
(Leveled) fully homomorphic encryption without bootstrapping. ITCS 2012: 309-325 - [c43]Jonathan Valamehr, Melissa Chase, Seny Kamara, Andrew Putnam, Daniel Shumow, Vinod Vaikuntanathan, Timothy Sherwood:
Inspection resistant memory: Architectural support for security from physical examination. ISCA 2012: 130-141 - [c42]Shweta Agrawal, Xavier Boyen, Vinod Vaikuntanathan, Panagiotis Voulgaris, Hoeteck Wee:
Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices. Public Key Cryptography 2012: 280-297 - [c41]Ran Canetti, Dana Dachman-Soled, Vinod Vaikuntanathan, Hoeteck Wee:
Efficient Password Authenticated Key Exchange via Oblivious Transfer. Public Key Cryptography 2012: 449-466 - [c40]Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan:
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. STOC 2012: 1219-1234 - [c39]Nishanth Chandran, Melissa Chase, Vinod Vaikuntanathan:
Functional Re-encryption and Collusion-Resistant Obfuscation. TCC 2012: 404-421 - [c38]Bryan Parno, Mariana Raykova, Vinod Vaikuntanathan:
How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption. TCC 2012: 422-439 - [i23]Shweta Agrawal, Yevgeniy Dodis, Vinod Vaikuntanathan, Daniel Wichs:
On Continual Leakage of Discrete Log Representations. IACR Cryptol. ePrint Arch. 2012: 367 (2012) - [i22]Shweta Agrawal, Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption: New Perspectives and Lower Bounds. IACR Cryptol. ePrint Arch. 2012: 468 (2012) - [i21]Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption with Bounded Collusions via Multi-Party Computation. IACR Cryptol. ePrint Arch. 2012: 521 (2012) - [i20]Shafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, Nickolai Zeldovich:
Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond. IACR Cryptol. ePrint Arch. 2012: 733 (2012) - 2011
- [j1]Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan:
Securely Obfuscating Re-Encryption. J. Cryptol. 24(4): 694-719 (2011) - [c37]Shweta Agrawal, David Mandell Freeman, Vinod Vaikuntanathan:
Functional Encryption for Inner Product Predicates from Learning with Errors. ASIACRYPT 2011: 21-40 - [c36]Michael Naehrig, Kristin E. Lauter, Vinod Vaikuntanathan:
Can homomorphic encryption be practical? CCSW 2011: 113-124 - [c35]Zvika Brakerski, Vinod Vaikuntanathan:
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages. CRYPTO 2011: 505-524 - [c34]Vinod Vaikuntanathan:
Computing Blindfolded: New Developments in Fully Homomorphic Encryption. FOCS 2011: 5-16 - [c33]Zvika Brakerski, Vinod Vaikuntanathan:
Efficient Fully Homomorphic Encryption from (Standard) LWE. FOCS 2011: 97-106 - [c32]Vinod Vaikuntanathan:
New Developments in Leakage-Resilient Cryptography. Public Key Cryptography 2011: 283 - [c31]Jonathan Katz, Vinod Vaikuntanathan:
Round-Optimal Password-Based Authenticated Key Exchange. TCC 2011: 293-310 - [i19]Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan:
Fully Homomorphic Encryption without Bootstrapping. Electron. Colloquium Comput. Complex. TR11 (2011) - [i18]Zvika Brakerski, Vinod Vaikuntanathan:
Efficient Fully Homomorphic Encryption from (Standard) LWE. Electron. Colloquium Comput. Complex. TR11 (2011) - [i17]S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan:
A Group Signature Scheme from Lattice Assumptions. IACR Cryptol. ePrint Arch. 2011: 60 (2011) - [i16]Zvika Brakerski, Craig Gentry, Vinod Vaikuntanathan:
Fully Homomorphic Encryption without Bootstrapping. IACR Cryptol. ePrint Arch. 2011: 277 (2011) - [i15]Nishanth Chandran, Melissa Chase, Vinod Vaikuntanathan:
Collusion Resistant Obfuscation and Functional Re-encryption. IACR Cryptol. ePrint Arch. 2011: 337 (2011) - [i14]Zvika Brakerski, Vinod Vaikuntanathan:
Efficient Fully Homomorphic Encryption from (Standard) LWE. IACR Cryptol. ePrint Arch. 2011: 344 (2011) - [i13]Kristin E. Lauter, Michael Naehrig, Vinod Vaikuntanathan:
Can Homomorphic Encryption be Practical? IACR Cryptol. ePrint Arch. 2011: 405 (2011) - [i12]Shweta Agrawal, David Mandell Freeman, Vinod Vaikuntanathan:
Functional Encryption for Inner Product Predicates from Learning with Errors. IACR Cryptol. ePrint Arch. 2011: 410 (2011) - [i11]Shweta Agrawal, Xavier Boyen, Vinod Vaikuntanathan, Panagiotis Voulgaris, Hoeteck Wee:
Fuzzy Identity Based Encryption from Lattices. IACR Cryptol. ePrint Arch. 2011: 414 (2011) - [i10]Bryan Parno, Mariana Raykova, Vinod Vaikuntanathan:
How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption. IACR Cryptol. ePrint Arch. 2011: 597 (2011) - [i9]Adriana López-Alt, Eran Tromer, Vinod Vaikuntanathan:
Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2011: 663 (2011) - 2010
- [c30]S. Dov Gordon, Jonathan Katz, Vinod Vaikuntanathan:
A Group Signature Scheme from Lattice Assumptions. ASIACRYPT 2010: 395-412 - [c29]Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits. CRYPTO 2010: 155-172 - [c28]Marten van Dijk, Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
Fully Homomorphic Encryption over the Integers. EUROCRYPT 2010: 24-43 - [c27]Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer, Vinod Vaikuntanathan:
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases. EUROCRYPT 2010: 135-156 - [c26]Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
A Simple BGN-Type Cryptosystem from LWE. EUROCRYPT 2010: 506-522 - [c25]Zvika Brakerski, Yael Tauman Kalai, Jonathan Katz, Vinod Vaikuntanathan:
Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage. FOCS 2010: 501-510 - [c24]Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan:
Robustness of the Learning with Errors Assumption. ICS 2010: 230-240 - [c23]Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan:
Public-Key Encryption Schemes with Auxiliary Inputs. TCC 2010: 361-381 - [i8]Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits. IACR Cryptol. ePrint Arch. 2010: 145 (2010) - [i7]Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
A Simple BGN-type Cryptosystem from LWE. IACR Cryptol. ePrint Arch. 2010: 182 (2010) - [i6]Zvika Brakerski, Yael Tauman Kalai, Jonathan Katz, Vinod Vaikuntanathan:
Overcoming the Hole In The Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage. IACR Cryptol. ePrint Arch. 2010: 278 (2010) - [i5]Jonathan Katz, Vinod Vaikuntanathan:
One-Round Password-Based Authenticated Key Exchange. IACR Cryptol. ePrint Arch. 2010: 368 (2010)
2000 – 2009
- 2009
- [b1]Vinod Vaikuntanathan:
Randomized algorithms for reliable broadcast. Massachusetts Institute of Technology, Cambridge, MA, USA, 2009 - [c22]Jonathan Katz, Vinod Vaikuntanathan:
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices. ASIACRYPT 2009: 636-652 - [c21]Jonathan Katz, Vinod Vaikuntanathan:
Signature Schemes with Bounded Leakage Resilience. ASIACRYPT 2009: 703-720 - [c20]Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan:
Simultaneous Hardcore Bits and Cryptography against Memory Attacks. TCC 2009: 474-495 - [c19]Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan:
How Efficient Can Memory Checking Be?. TCC 2009: 503-520 - [c18]Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan:
Weak Verifiable Random Functions. TCC 2009: 558-576 - [i4]Marten van Dijk, Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
Fully Homomorphic Encryption over the Integers. IACR Cryptol. ePrint Arch. 2009: 616 (2009) - 2008
- [c17]Omkant Pandey, Rafael Pass, Vinod Vaikuntanathan:
Adaptive One-Way Functions and Applications. CRYPTO 2008: 57-74 - [c16]Chris Peikert, Vinod Vaikuntanathan:
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems. CRYPTO 2008: 536-553 - [c15]Chris Peikert, Vinod Vaikuntanathan, Brent Waters:
A Framework for Efficient and Composable Oblivious Transfer. CRYPTO 2008: 554-571 - [c14]Craig Gentry, Chris Peikert, Vinod Vaikuntanathan:
Trapdoors for hard lattices and new cryptographic constructions. STOC 2008: 197-206 - 2007
- [c13]Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan:
Bounded CCA2-Secure Encryption. ASIACRYPT 2007: 502-518 - [c12]Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan:
Relations Among Notions of Non-malleability for Encryption. ASIACRYPT 2007: 519-535 - [c11]Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert de Haan, Vinod Vaikuntanathan:
Secure Computation from Random Error Correcting Codes. EUROCRYPT 2007: 291-310 - [c10]Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan:
Securely Obfuscating Re-encryption. TCC 2007: 233-252 - [i3]Craig Gentry, Chris Peikert, Vinod Vaikuntanathan:
Trapdoors for Hard Lattices and New Cryptographic Constructions. Electron. Colloquium Comput. Complex. TR07 (2007) - [i2]Chris Peikert, Vinod Vaikuntanathan, Brent Waters:
A Framework for Efficient and Composable Oblivious Transfer. IACR Cryptol. ePrint Arch. 2007: 348 (2007) - [i1]Craig Gentry, Chris Peikert, Vinod Vaikuntanathan:
Trapdoors for Hard Lattices and New Cryptographic Constructions. IACR Cryptol. ePrint Arch. 2007: 432 (2007) - 2006
- [c9]Rafael Pass, Abhi Shelat, Vinod Vaikuntanathan:
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. CRYPTO 2006: 271-289 - [c8]Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanathan:
Fault-Tolerant Distributed Computing in Full-Information Networks. FOCS 2006: 15-26 - [c7]Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan:
Byzantine agreement in the full-information model in O(log n) rounds. STOC 2006: 179-186 - 2005
- [c6]Vinod Vaikuntanathan:
Brief announcement: broadcast in radio networks in the presence of byzantine adversaries. PODC 2005: 167 - [c5]Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanathan:
Distributed Computing with Imperfect Randomness. DISC 2005: 288-302 - 2004
- [c4]Charles W. O'Donnell, Vinod Vaikuntanathan:
Information Leak in the Chord Lookup Protocol. Peer-to-Peer Computing 2004: 28-35 - 2003
- [c3]Vinod Vaikuntanathan, Arvind Narayanan, K. Srinathan, C. Pandu Rangan, Kwangjo Kim:
On the Power of Computational Secret Sharing. INDOCRYPT 2003: 162-176 - [c2]S. Amitanand, I. Sanketh, K. Srinathan, Vinod Vaikuntanathan, C. Pandu Rangan:
Distributed consensus in the presence of sectional faults. PODC 2003: 202-210 - [c1]K. Srinathan, Vinod Vaikuntanathan, C. Pandu Rangan:
Brief announcement: efficient perfectly secure communication over synchronous networks. PODC 2003: 252
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint