Vinod Vaikuntanathan

Vinod Vaikuntanathan's AcademicInfluence.com Rankings

Computer Science

#6862

World Rank

#7228

Historical Rank

Database

#3940

World Rank

#4098

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Vinod Vaikuntanathan Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Vinod Vaikuntanathan's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Trapdoors for hard lattices and new cryptographic constructions (2008) (2060)
(Leveled) fully homomorphic encryption without bootstrapping (2012) (1882)
Fully Homomorphic Encryption over the Integers (2010) (1784)
Efficient Fully Homomorphic Encryption from (Standard) LWE (2011) (1565)
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages (2011) (1019)
Can homomorphic encryption be practical? (2011) (995)
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption (2012) (766)
A Framework for Efficient and Composable Oblivious Transfer (2008) (660)
Gazelle: A Low Latency Framework for Secure Neural Network Inference (2018) (562)
Simultaneous Hardcore Bits and Cryptography against Memory Attacks (2009) (506)
Attribute-based encryption for circuits (2013) (400)
Reusable garbled circuits and succinct functional encryption (2013) (392)
How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption (2012) (363)
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits (2014) (351)
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE (2012) (350)
(Leveled) Fully Homomorphic Encryption without Bootstrapping (2014) (348)
Lattice-based FHE as secure as PKE (2014) (262)
Functional Encryption with Bounded Collusions via Multi-party Computation (2012) (257)
Signature Schemes with Bounded Leakage Resilience (2009) (257)
Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ (2014) (239)
A Group Signature Scheme from Lattice Assumptions (2010) (230)
Functional Encryption for Inner Product Predicates from Learning with Errors (2011) (224)
Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage (2010) (222)
Securely Obfuscating Re-Encryption (2007) (198)
Public-Key Encryption Schemes with Auxiliary Inputs (2010) (196)
Indistinguishability Obfuscation from Functional Encryption (2015) (193)
Predicate Encryption for Circuits from LWE (2015) (191)
Fully Homomorphic Encryption without Bootstrapping (2011) (189)
How to Run Turing Machines on Encrypted Data (2013) (184)
Robustness of the Learning with Errors Assumption (2010) (183)
A Simple BGN-Type Cryptosystem from LWE (2010) (166)
Round-Optimal Password-Based Authenticated Key Exchange (2011) (164)
Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases (2010) (147)
Computing Blindfolded: New Developments in Fully Homomorphic Encryption (2011) (145)
Functional Encryption: New Perspectives and Lower Bounds (2013) (145)
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits (2010) (137)
Secure Computation from Random Error Correcting Codes (2007) (130)
Functional Encryption for Threshold Functions (or Fuzzy IBE) from Lattices (2012) (126)
From Selective to Adaptive Security in Functional Encryption (2015) (121)
Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices (2009) (117)
Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings (2016) (112)
Obfuscation of Probabilistic Circuits and Applications (2015) (109)
Time-Lock Puzzles from Randomized Encodings (2016) (105)
Adaptive One-Way Functions and Applications (2008) (102)
SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers (2015) (101)
Watermarking cryptographic capabilities (2016) (89)
Splinter: Practical Private Queries on Public Data (2017) (86)
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions - Or: How to Secretly Embed a Circuit in Your PRF (2015) (86)
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security (2016) (84)
Bounded CCA2-Secure Encryption (2007) (79)
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions (2018) (77)
Improvements to Secure Computation with Penalties (2016) (74)
A Tight Bound for Set Disjointness in the Message-Passing Model (2013) (74)
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems (2008) (72)
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One (2006) (67)
Sieve: Cryptographically Enforced Access Control for User Data in Untrusted Clouds (2016) (66)
Homomorphic Encryption Standard (2019) (66)
Succinct Garbling and Indistinguishability Obfuscation for RAM Programs (2015) (64)
Private Constrained PRFs (and More) from LWE (2017) (61)
Low-Complexity Cryptographic Hash Functions (2017) (58)
SECURITY OF HOMOMORPHIC ENCRYPTION (2017) (58)
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates (2018) (51)
Chosen-Ciphertext Secure Fully Homomorphic Encryption (2017) (50)
How Efficient Can Memory Checking Be? (2009) (50)
Obfuscating Conjunctions under Entropic Ring LWE (2016) (49)
Byzantine agreement in the full-information model in O(log n) rounds (2006) (47)
Functional Re-encryption and Collusion-Resistant Obfuscation (2012) (47)
On the Power of Computational Secret Sharing (2003) (46)
Fast Proxy Re-Encryption for Publish/Subscribe Systems (2017) (46)
Indistinguishability Obfuscation of Iterated Circuits and RAM Programs (2014) (45)
Conditional Disclosure of Secrets via Non-linear Reconstruction (2017) (43)
On Continual Leakage of Discrete Log Representations (2013) (42)
Computational Limitations in Robust Classification and Win-Win Results (2019) (38)
Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond (2012) (38)
Breaking the circuit-size barrier in secret sharing (2018) (36)
Fuzzy Identity Based Encryption from Lattices (2011) (36)
Efficient Password Authenticated Key Exchange via Oblivious Transfer (2012) (35)
Succinct Randomized Encodings and their Applications. (2014) (34)
Cryptography Resilient to Continual Memory Leakage (2010) (33)
Attribute-Based Encryption for Circuits (2015) (33)
Towards Breaking the Exponential Barrier for General Secret Sharing (2018) (32)
Optimized homomorphic encryption solution for secure genome-wide association studies (2020) (31)
Relations Among Notions of Non-malleability for Encryption (2007) (31)
Reusable Non-Interactive Secure Computation (2019) (31)
Oblivious Transfer is in MiniQCrypt (2020) (31)
Cloud-Assisted Multiparty Computation from Fully Homomorphic Encryption (2011) (28)
Weak Verifiable Random Functions (2009) (26)
Obfuscating Branching Programs Using Black-Box Pseudo-Free Groups (2013) (25)
Information leak in the Chord lookup protocol (2004) (24)
Inspection resistant memory: Architectural support for security from physical examination (2012) (24)
Fault-Tolerant Distributed Computing in Full-Information Networks (2006) (23)
Publicly Verifiable Software Watermarking (2015) (23)
Traitor-Tracing from LWE Made Simple and Attribute-Based (2018) (22)
Indistinguishability Obfuscation: From Approximate to Exact (2016) (22)
Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing (2019) (22)
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs (2020) (21)
Optimal Bounded-Collusion Secure Functional Encryption (2019) (21)
Optimal and Player-Replaceable Consensus with an Honest Majority (2017) (21)
Planting Undetectable Backdoors in Machine Learning Models (2022) (20)
OpenFHE: Open-Source Fully Homomorphic Encryption Library (2022) (20)
Secret Sharing and Statistical Zero Knowledge (2015) (20)
3-Message Zero Knowledge Against Human Ignorance (2016) (19)
Distributed Computing with Imperfect Randomness (2005) (19)
Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation (2017) (18)
The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically (2014) (18)
Structure vs. Hardness Through the Obfuscation Lens (2017) (17)
Succinct LWE Sampling, Random Polynomials, and Obfuscation (2021) (15)
A Note on Perfect Correctness by Derandomization (2017) (15)
On Basing Private Information Retrieval on NP-Hardness (2016) (15)
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (2018) (14)
How to Compress (Reusable) Garbled Circuits (2013) (14)
Statistical ZAPR Arguments from Bilinear Maps (2020) (14)
Fine-Grained Cryptography (2016) (13)
Zero-Knowledge Proofs of Proximity (2017) (13)
Aggregate Pseudorandom Functions and Connections to Learning (2015) (13)
Protecting Circuits from Computationally Bounded and Noisy Leakage (2014) (13)
Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors (2021) (12)
Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE (2020) (12)
Brief announcement: broadcast in radio networks in the presence of byzantine adversaries (2005) (12)
On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation (2017) (11)
Data structures meet cryptography: 3SUM with preprocessing (2019) (11)
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures (2022) (10)
(Leveled) Fully Homomorphic Signatures from Lattices (2014) (10)
Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs for P (2021) (10)
Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation (2019) (10)
Adversarially Robust Property Preserving Hash Functions (2018) (9)
Distributed consensus in the presence of sectional faults (2003) (9)
2-Message Publicly Verifiable WI from (Subexponential) LWE (2019) (9)
One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval (2022) (9)
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts (2018) (9)
NeuraCrypt: Hiding Private Health Data via Random Neural Networks for Public Training (2021) (9)
How to Compute on Encrypted Data (2012) (8)
Quantum Advantage from Any Non-Local Game (2022) (8)
Does Fully Homomorphic Encryption Need Compute Acceleration? (2021) (8)
3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications (2019) (7)
Extracting Randomness from Extractor-Dependent Sources (2020) (6)
SETH-Hardness of Coding Problems (2019) (6)
Brief announcement: efficient perfectly secure communication over synchronous networks (2003) (6)
Succinct Classical Verification of Quantum Computation (2022) (5)
On the Hardness of Average-case k-SUM (2020) (5)
FAB: An FPGA-based Accelerator for Bootstrappable Fully Homomorphic Encryption (2022) (5)
Overcoming the Worst-Case Curse for Cryptographic Constructions (2013) (5)
Minimizing the Complexity of Goldreich's Pseudorandom Generator (2017) (5)
Multi-Input Correlation-Intractable Hash Functions via Shift-Hiding (2020) (5)
Lattice Trapdoors and IBE from Middle-Product LWE (2019) (5)
Multikey Fully Homomorphic Encryption and Applications (2017) (5)
Locally Verifiable Signature and Key Aggregation (2022) (4)
SCRAM: A Platform for Securely Measuring Cyber Risk (2020) (4)
Some Open Problems in Information-Theoretic Cryptography (2017) (4)
Revocable Cryptography from Learning with Errors (2023) (4)
Cryptography from Information Loss (2020) (4)
From Statistical Zero Knowledge to Secret Sharing (2015) (4)
Collusion Resistant Obfuscation and Functional Re-encryption (2011) (3)
Randomized algorithms for reliable broadcast (2009) (3)
Bounded CCA2-Secure Non-Malleable Encryption (2006) (3)
The Fine-Grained Hardness of Sparse Linear Regression (2021) (3)
The t-wise Independence of Substitution-Permutation Networks (2021) (2)
Rate-1 Non-Interactive Arguments for Batch-NP and Applications (2022) (2)
Boosting Batch Arguments and RAM Delegation (2022) (2)
6.892 Computing on Encrypted Data (2013) (2)
New Protocols for Conditional Disclosure of Secrets (and More) (2017) (2)
Witness Encryption and Null-IO from Evasive LWE (2022) (2)
SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption (2022) (1)
VLSI implementation of LNS arithmetic unit by LUT partitioning (2017) (1)
New Developments in Leakage-Resilient Cryptography (2011) (1)
Structure Versus Hardness Through the Obfuscation Lens (2021) (1)
Public-Key Encryption Schemes with Auxiliary Inputs . Theory of Cryptography Citation (2009) (1)
New-Age Cryptography (2008) (1)
One-Round Password-Based Authenticated Key Exchange (2010) (1)
Round-Optimal Password-Based Authenticated Key Exchange (2012) (1)
Lattice Problems Beyond Polynomial Time (2022) (1)
Inspection-Resistant Memory Architectures (2013) (0)
2 A Pseudo-proof of the Smoothing Lemma (2015) (0)
Low Complexity Pseudorandom Generators and Indistinguishability Obfuscation (2018) (0)
DNA Screening Technical Note Cryptographic Aspects of DNA Screening (2020) (0)
Table of Contents P2P 2004 (2004) (0)
• SV P ≤ CV P • Approximating CVP: Babai’s Nearest Plane Algorithm • An Efficient Algorithm for Integer Programming in constant dimensions (2011) (0)
Correlation-Intractable Hash Functions via Shift-Hiding (2022) (0)
Computing on Encrypted Data: Theory and Application (2016) (0)
Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract] (2022) (0)
Session details: Session 6: 10:30--10:40 (2014) (0)
Optimized Section-Wise Relay Coordination based on Coordination Time Interval using Standard Curves with Centralized System (2019) (0)
Improvised Version: Fully Homomorphic Encryption (2017) (0)
6.892 Computing on Encrypted Data Lecture 4 (2013) (0)
OpenFHE (2022) (0)
Theorem 2 Alternative Definition of Lattices (2015) (0)
PEOPL: Characterizing Privately Encoded Open Datasets with Public Labels (2023) (0)
Watermarking Cryptographic Capabilities | SIAM Journal on Computing | Vol. 47, No. 6 | Society for Industrial and Applied Mathematics (2018) (0)
Simultaneous Hardcore Bits and Cryptography Against Freezing Attacks (2008) (0)
Asymptotically Quasi-Optimal Cryptography (2022) (0)
MIT Open Access Articles Reusable garbled circuits and succinct functional encryption (2022) (0)

This paper list is powered by the following services:

Other Resources About Vinod Vaikuntanathan

people.csail.mit.edu

What Schools Are Affiliated With Vinod Vaikuntanathan?

Vinod Vaikuntanathan is affiliated with the following schools: