Vinod Vaikuntanathan

Affiliations:
  • MIT, Cambridge, USA


According to our database1, Vinod Vaikuntanathan authored at least 167 papers between 2003 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A Note on Perfect Correctness by Derandomization.
J. Cryptol., 2022

Witness Encryption and Null-IO from Evasive LWE.
IACR Cryptol. ePrint Arch., 2022

Quantum Advantage from Any Non-Local Game.
IACR Cryptol. ePrint Arch., 2022

Boosting Batch Arguments and RAM Delegation.
IACR Cryptol. ePrint Arch., 2022

SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption.
IACR Cryptol. ePrint Arch., 2022

One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval.
IACR Cryptol. ePrint Arch., 2022

Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures.
IACR Cryptol. ePrint Arch., 2022

Locally Verifiable Signature and Key Aggregation.
IACR Cryptol. ePrint Arch., 2022

Rate-1 Non-Interactive Arguments for Batch-NP and Applications.
IACR Cryptol. ePrint Arch., 2022

Succinct Classical Verification of Quantum Computation.
IACR Cryptol. ePrint Arch., 2022

OpenFHE: Open-Source Fully Homomorphic Encryption Library.
IACR Cryptol. ePrint Arch., 2022

Lattice Problems Beyond Polynomial Time.
CoRR, 2022

FAB: An FPGA-based Accelerator for Bootstrappable Fully Homomorphic Encryption.
CoRR, 2022

Planting Undetectable Backdoors in Machine Learning Models.
CoRR, 2022

Correlation-Intractable Hash Functions via Shift-Hiding.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract].
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Asymptotically Quasi-Optimal Cryptography.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Structure Versus Hardness Through the Obfuscation Lens.
SIAM J. Comput., 2021

The t-wise Independence of Substitution-Permutation Networks.
IACR Cryptol. ePrint Arch., 2021

Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs for P.
IACR Cryptol. ePrint Arch., 2021

Succinct LWE Sampling, Random Polynomials, and Obfuscation.
IACR Cryptol. ePrint Arch., 2021

Does Fully Homomorphic Encryption Need Compute Acceleration?
IACR Cryptol. ePrint Arch., 2021

The Fine-Grained Hardness of Sparse Linear Regression.
CoRR, 2021

NeuraCrypt: Hiding Private Health Data via Random Neural Networks for Public Training.
CoRR, 2021

Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

On the Hardness of Average-Case k-SUM.
Proceedings of the Approximation, 2021

2020
Statistical ZAPR Arguments from Bilinear Maps.
IACR Cryptol. ePrint Arch., 2020

Multi-Input Correlation-Intractable Hash Functions via Shift-Hiding.
IACR Cryptol. ePrint Arch., 2020

Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs.
IACR Cryptol. ePrint Arch., 2020

Oblivious Transfer is in MiniQCrypt.
IACR Cryptol. ePrint Arch., 2020

Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors.
IACR Cryptol. ePrint Arch., 2020

Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE.
IACR Cryptol. ePrint Arch., 2020

Cryptography from Information Loss.
Electron. Colloquium Comput. Complex., 2020

Data structures meet cryptography: 3SUM with preprocessing.
Proceedings of the Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
2-Message Publicly Verifiable WI from (Subexponential) LWE.
IACR Cryptol. ePrint Arch., 2019

Lattice Trapdoors and IBE from Middle-Product LWE.
IACR Cryptol. ePrint Arch., 2019

Extracting Randomness from Extractor-Dependent Sources.
IACR Cryptol. ePrint Arch., 2019

Computational Limitations in Robust Classification and Win-Win Results.
IACR Cryptol. ePrint Arch., 2019

Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation.
IACR Cryptol. ePrint Arch., 2019

Optimized Homomorphic Encryption Solution for Secure Genome-Wide Association Studies.
IACR Cryptol. ePrint Arch., 2019

Optimal Bounded-Collusion Secure Functional Encryption.
IACR Cryptol. ePrint Arch., 2019

Homomorphic Encryption Standard.
IACR Cryptol. ePrint Arch., 2019

SETH-hardness of Coding Problems.
Electron. Colloquium Comput. Complex., 2019

3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications.
CoRR, 2019

Computational Limitations in Robust Classification and Win-Win Results.
Proceedings of the Conference on Learning Theory, 2019

2018
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.
SIAM J. Comput., 2018

Indistinguishability Obfuscation from Functional Encryption.
J. ACM, 2018

Breaking the Circuit-Size Barrier in Secret Sharing.
IACR Cryptol. ePrint Arch., 2018

GAZELLE: A Low Latency Framework for Secure Neural Network Inference.
IACR Cryptol. ePrint Arch., 2018

How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts.
IACR Cryptol. ePrint Arch., 2018

Traitor-Tracing from LWE Made Simple and Attribute-Based.
IACR Cryptol. ePrint Arch., 2018

GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates.
IACR Cryptol. ePrint Arch., 2018

Reusable Non-Interactive Secure Computation.
IACR Cryptol. ePrint Arch., 2018

Adversarially Robust Property Preserving Hash Functions.
IACR Cryptol. ePrint Arch., 2018

Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing.
Electron. Colloquium Comput. Complex., 2018

2017
Fast Proxy Re-Encryption for Publish/Subscribe Systems.
ACM Trans. Priv. Secur., 2017

Multikey Fully Homomorphic Encryption and Applications.
SIAM J. Comput., 2017

On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2017

Minimizing the Complexity of Goldreich's Pseudorandom Generator.
IACR Cryptol. ePrint Arch., 2017

Towards Breaking the Exponential Barrier for General Secret Sharing.
IACR Cryptol. ePrint Arch., 2017

Private Constrained PRFs (and More) from LWE.
IACR Cryptol. ePrint Arch., 2017

Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions.
IACR Cryptol. ePrint Arch., 2017

Zero-Knowledge Proofs of Proximity.
IACR Cryptol. ePrint Arch., 2017

New Protocols for Conditional Disclosure of Secrets (and More).
Electron. Colloquium Comput. Complex., 2017

Low-Complexity Cryptographic Hash Functions.
Electron. Colloquium Comput. Complex., 2017

Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Chosen-Ciphertext Secure Fully Homomorphic Encryption.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

Some Open Problems in Information-Theoretic Cryptography.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Conditional Disclosure of Secrets via Non-linear Reconstruction.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers.
IEEE Trans. Computers, 2016

Splinter: Practical Private Queries on Public Data.
IACR Cryptol. ePrint Arch., 2016

Indistinguishability Obfuscation from DDH-like Assumptions on Constant-Degree Graded Encodings.
IACR Cryptol. ePrint Arch., 2016

Fine-grained Cryptography.
IACR Cryptol. ePrint Arch., 2016

Circuit-ABE from LWE: Unbounded Attributes and Semi-Adaptive Security.
IACR Cryptol. ePrint Arch., 2016

3-Message Zero Knowledge Against Human Ignorance.
IACR Cryptol. ePrint Arch., 2016

Structure vs Hardness through the Obfuscation Lens.
Electron. Colloquium Comput. Complex., 2016

Sieve: Cryptographically Enforced Access Control for User Data in Untrusted Clouds.
Proceedings of the 13th USENIX Symposium on Networked Systems Design and Implementation, 2016

Obfuscating Conjunctions under Entropic Ring LWE.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

Improvements to Secure Computation with Penalties.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Attribute-Based Encryption for Circuits.
J. ACM, 2015

From Statistical Zero Knowledge to Secret Sharing.
IACR Cryptol. ePrint Arch., 2015

On Basing Private Information Retrieval on NP-Hardness.
IACR Cryptol. ePrint Arch., 2015

Predicate Encryption for Circuits from LWE.
IACR Cryptol. ePrint Arch., 2015

Publicly Verifiable Software Watermarking.
IACR Cryptol. ePrint Arch., 2015

Watermarking Cryptographic Capabilities.
IACR Cryptol. ePrint Arch., 2015

Aggregatable Pseudorandom Functions and Connections to Learning.
IACR Cryptol. ePrint Arch., 2015

Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions Or: How to Secretly Embed a Circuit in Your PRF.
IACR Cryptol. ePrint Arch., 2015

Indistinguishability Obfuscation: from Approximate to Exact.
IACR Cryptol. ePrint Arch., 2015

Time-Lock Puzzles from Randomized Encodings.
IACR Cryptol. ePrint Arch., 2015

Aggregate Pseudorandom Functions and Connections to Learning.
Electron. Colloquium Comput. Complex., 2015

Succinct Garbling and Indistinguishability Obfuscation for RAM Programs.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

From Selective to Adaptive Security in Functional Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

Secret Sharing and Statistical Zero Knowledge.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
(Leveled) Fully Homomorphic Encryption without Bootstrapping.
ACM Trans. Comput. Theory, 2014

Protecting Circuits from Computationally Bounded and Noisy Leakage.
SIAM J. Comput., 2014

Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$.
SIAM J. Comput., 2014

Leveled Fully Homomorphic Signatures from Standard Lattices.
IACR Cryptol. ePrint Arch., 2014

(Leveled) Fully Homomorphic Signatures from Lattices.
IACR Cryptol. ePrint Arch., 2014

Obfuscation of Probabilistic Circuits and Applications.
IACR Cryptol. ePrint Arch., 2014

Indistinguishability Obfuscation of Iterated Circuits and RAM Programs.
IACR Cryptol. ePrint Arch., 2014

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits.
IACR Cryptol. ePrint Arch., 2014

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically.
IACR Cryptol. ePrint Arch., 2014

2013
Inspection-Resistant Memory Architectures.
IEEE Micro, 2013

Round-Optimal Password-Based Authenticated Key Exchange.
J. Cryptol., 2013

On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2013

Overcoming the Worst-Case Curse for Cryptographic Constructions.
IACR Cryptol. ePrint Arch., 2013

How to Compress (Reusable) Garbled Circuits.
IACR Cryptol. ePrint Arch., 2013

Obfuscating Branching Programs Using Black-Box Pseudo-Free Groups.
IACR Cryptol. ePrint Arch., 2013

Lattice-Based FHE as Secure as PKE.
IACR Cryptol. ePrint Arch., 2013

Tight Bounds for Set Disjointness in the Message Passing Model
CoRR, 2013

Reusable garbled circuits and succinct functional encryption.
Proceedings of the Symposium on Theory of Computing Conference, 2013

A Tight Bound for Set Disjointness in the Message-Passing Model.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

How to Run Turing Machines on Encrypted Data.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Functional Encryption with Bounded Collusions via Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2012

Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond.
IACR Cryptol. ePrint Arch., 2012

Functional Encryption: New Perspectives and Lower Bounds.
IACR Cryptol. ePrint Arch., 2012

On Continual Leakage of Discrete Log Representations.
IACR Cryptol. ePrint Arch., 2012

Functional Re-encryption and Collusion-Resistant Obfuscation.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Efficient Password Authenticated Key Exchange via Oblivious Transfer.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices.
Proceedings of the Public Key Cryptography - PKC 2012, 2012

Inspection resistant memory: Architectural support for security from physical examination.
Proceedings of the 39th International Symposium on Computer Architecture (ISCA 2012), 2012

How to Compute on Encrypted Data.
Proceedings of the Progress in Cryptology, 2012

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011
Securely Obfuscating Re-Encryption.
J. Cryptol., 2011

How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption.
IACR Cryptol. ePrint Arch., 2011

Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2011

Can Homomorphic Encryption be Practical?
IACR Cryptol. ePrint Arch., 2011

A Group Signature Scheme from Lattice Assumptions.
IACR Cryptol. ePrint Arch., 2011

Collusion Resistant Obfuscation and Functional Re-encryption.
IACR Cryptol. ePrint Arch., 2011

Functional Encryption for Inner Product Predicates from Learning with Errors.
IACR Cryptol. ePrint Arch., 2011

Fuzzy Identity Based Encryption from Lattices.
IACR Cryptol. ePrint Arch., 2011

Efficient Fully Homomorphic Encryption from (Standard) LWE.
Electron. Colloquium Comput. Complex., 2011

Fully Homomorphic Encryption without Bootstrapping.
Electron. Colloquium Comput. Complex., 2011

New Developments in Leakage-Resilient Cryptography.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

Computing Blindfolded: New Developments in Fully Homomorphic Encryption.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
One-Round Password-Based Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2010

A Simple BGN-type Cryptosystem from LWE.
IACR Cryptol. ePrint Arch., 2010

i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits.
IACR Cryptol. ePrint Arch., 2010

Overcoming the Hole In The Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage.
IACR Cryptol. ePrint Arch., 2010

Public-Key Encryption Schemes with Auxiliary Inputs.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Robustness of the Learning with Errors Assumption.
Proceedings of the Innovations in Computer Science, 2010

Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

<i>i</i>-Hop Homomorphic Encryption and Rerandomizable Yao Circuits.
Proceedings of the Advances in Cryptology, 2010

2009
Randomized algorithms for reliable broadcast.
PhD thesis, 2009

Fully Homomorphic Encryption over the Integers.
IACR Cryptol. ePrint Arch., 2009

How Efficient Can Memory Checking Be?.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Weak Verifiable Random Functions.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Simultaneous Hardcore Bits and Cryptography against Memory Attacks.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Signature Schemes with Bounded Leakage Resilience.
Proceedings of the Advances in Cryptology, 2009

Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices.
Proceedings of the Advances in Cryptology, 2009

2008
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems.
Proceedings of the Advances in Cryptology, 2008

Adaptive One-Way Functions and Applications.
Proceedings of the Advances in Cryptology, 2008

2007
A Framework for Efficient and Composable Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2007

Trapdoors for Hard Lattices and New Cryptographic Constructions.
Electron. Colloquium Comput. Complex., 2007

Secure Computation from Random Error Correcting Codes.
Proceedings of the Advances in Cryptology, 2007

Relations Among Notions of Non-malleability for Encryption.
Proceedings of the Advances in Cryptology, 2007

Bounded CCA2-Secure Encryption.
Proceedings of the Advances in Cryptology, 2007

2006
Byzantine agreement in the full-information model in O(log n) rounds.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Fault-Tolerant Distributed Computing in Full-Information Networks.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.
Proceedings of the Advances in Cryptology, 2006

2005
Distributed Computing with Imperfect Randomness.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Brief announcement: broadcast in radio networks in the presence of byzantine adversaries.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004
Information Leak in the Chord Lookup Protocol.
Proceedings of the 4th International Conference on Peer-to-Peer Computing (P2P 2004), 2004

2003
Brief announcement: efficient perfectly secure communication over synchronous networks.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Distributed consensus in the presence of sectional faults.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

On the Power of Computational Secret Sharing.
Proceedings of the Progress in Cryptology, 2003


  Loading...