Amit Sahai

Q: What Schools Are Affiliated With Amit Sahai

Amit Sahai is affiliated with the following schools: University of California, Berkeley, University of California, Los Angeles, Princeton University, Massachusetts Institute of Technology

Amit Sahai's AcademicInfluence.com Rankings

Amit Sahai

Computer Science

#1131

World Rank

#1171

Historical Rank

#597

USA Rank

Database

#804

World Rank

#845

Historical Rank

#252

USA Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Amit Sahai Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Amit Sahai is an American computer scientist. He is a professor of computer science at UCLA and the director of the Center for Encrypted Functionalities. Biography Amit Sahai was born in 1974 in Thousand Oaks, California, to parents who had immigrated from India. He received a B.A. in mathematics with a computer science minor from the University of California, Berkeley, summa cum laude, in 1996. At Berkeley, Sahai was named Computing Research Association Outstanding Undergraduate of the Year, North America, and was a member of the three-person team that won first place in the 1996 ACM International Collegiate Programming Contest.

(See a Problem?)

Amit Sahai'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

Attribute-based encryption for fine-grained access control of encrypted data (2006) (5311)
Fuzzy Identity-Based Encryption (2005) (4421)
Ciphertext-Policy Attribute-Based Encryption (2007) (4173)
On the (im)possibility of obfuscating programs (2001) (1429)
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (2010) (1333)
Attribute-based encryption with non-monotonic access structures (2007) (1192)
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013) (1185)
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based (2013) (1175)
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2008) (1166)
Efficient Noninteractive Proof Systems for Bilinear Groups (2008) (956)
Private Circuits: Securing Hardware against Probing Attacks (2003) (874)
Functional Encryption: Definitions and Challenges (2011) (862)
Universally composable two-party and multi-party secure computation (2002) (722)
Bounded Ciphertext Policy Attribute Based Encryption (2008) (631)
How to use indistinguishability obfuscation: deniable encryption, and more (2014) (605)
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems (2009) (570)
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security (1999) (558)
Founding Cryptography on Oblivious Transfer - Efficiently (2008) (552)
Pseudonym Systems (1999) (537)
Concurrent zero-knowledge (1998) (412)
The smallest grammar problem (2005) (372)
Perfect Non-Interactive Zero Knowledge for NP (2006) (337)
Attribute-Based Encryption for Circuits from Multilinear Maps (2012) (327)
Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys (2006) (324)
Sequential Aggregate Signatures and Multisignatures Without Random Oracles (2006) (319)
Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption (2012) (319)
Robust Non-interactive Zero Knowledge (2001) (297)
Zero-knowledge from secure multiparty computation (2007) (287)
Revocation Systems with Very Small Private Keys (2010) (281)
Witness encryption and its applications (2013) (281)
Multi-Input Functional Encryption (2014) (269)
The power of a pebble: exploring and mapping directed graphs (1998) (247)
Positive Results and Techniques for Obfuscation (2004) (247)
Protecting Obfuscation against Algebraic Attacks (2014) (230)
Secure Multi-Party Computation (2013) (221)
Batch codes and their applications (2004) (219)
Exposure-Resilient Functions and All-or-Nothing Transforms (2000) (209)
Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation (2015) (205)
Concurrent zero knowledge with logarithmic round-complexity (2002) (198)
Non-interactive Zaps and New Techniques for NIZK (2006) (193)
Multiclass learning, boosting, and error-correcting codes (1999) (190)
Founding Cryptography on Tamper-Proof Hardware Tokens (2010) (184)
Coding Constructions for Blacklisting Problems without Computational Assumptions (1999) (182)
Private Circuits II: Keeping Secrets in Tamperable Circuits (2006) (173)
Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization (1999) (170)
Worry-free encryption: functional encryption with public keys (2010) (168)
Concurrent zero-knowledge (2004) (166)
New Techniques for Noninteractive Zero-Knowledge (2012) (165)
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations (2015) (162)
Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption (2015) (156)
Cryptography with constant computational overhead (2008) (151)
New notions of security: achieving universal composability without trusted setup (2004) (148)
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13 (2016) (144)
Secure Arithmetic Computation with No Honest Majority (2008) (142)
Differing-Inputs Obfuscation and Applications (2013) (134)
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge (1998) (133)
Threshold Cryptosystems From Threshold Fully Homomorphic Encryption (2018) (131)
Frugality in path auctions (2004) (127)
Cryptography from Anonymity (2006) (127)
How to play almost any mental game over the net - concurrent composition via super-polynomial simulation (2005) (113)
Replacing a Random Oracle: Full Domain Hash From Indistinguishability Obfuscation (2014) (113)
Efficient Non-interactive Secure Computation (2011) (112)
Optimizing Obfuscation: Avoiding Barrington's Theorem (2014) (107)
Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints (1998) (107)
Ring Signatures of Sub-linear Size Without Random Oracles (2007) (106)
New Constructions for UC Secure Computation Using Tamper-Proof Hardware (2008) (100)
Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK (1998) (100)
Zero-Knowledge Proofs from Secure Multiparty Computation (2009) (97)
Functional encryption: a new vision for public-key cryptography (2012) (97)
On the (im)possibility of cryptography with imperfect randomness (2004) (96)
A complete promise problem for statistical zero-knowledge (1997) (93)
Secure Obfuscation in a Weak Multilinear Map Model (2016) (93)
On Perfect and Adaptive Security in Exposure-Resilient Cryptography (2001) (92)
Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures (2013) (92)
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (2017) (92)
Black-box accountable authority identity-based encryption (2008) (91)
Building efficient fully collusion-resilient traitor tracing and revocation schemes (2010) (85)
Concurrent Non-Malleable Zero Knowledge (2006) (83)
Circuits resilient to additive attacks with applications to secure computation (2014) (83)
Leakage-Resilient Zero Knowledge (2011) (80)
Indistinguishability obfuscation from well-founded assumptions (2020) (80)
Query Strategies for Priced Information (2002) (75)
Efficient and Explicit Coding for Interactive Communication (2011) (74)
Cryptography with Tamperable and Leaky Memory (2011) (73)
"Soft-decision" decoding of Chinese remainder codes (2000) (70)
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy (2009) (69)
Approximating the smallest grammar: Kolmogorov complexity in natural models (2002) (68)
Public-Coin Differing-Inputs Obfuscation and Its Applications (2015) (67)
Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems (1998) (67)
Homomorphic Encryption Standard (2019) (66)
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs (2015) (66)
Efficient Coding for Interactive Communication (2014) (62)
Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits (2016) (62)
Functional Encryption for Turing Machines (2016) (61)
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography (2010) (60)
SECURITY OF HOMOMORPHIC ENCRYPTION (2017) (58)
A complete problem for statistical zero knowledge (2003) (58)
On the (im)possibility of obfuscating programs : (Extended abstract) (2001) (55)
Obfuscation for Evasive Functions (2014) (54)
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions (2017) (53)
Zeroizing without zeroes: Cryptanalyzing multilinear maps without encodings of zero (2014) (53)
Round Optimal Blind Signatures (2011) (52)
Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (2017) (50)
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification (2019) (50)
Functional Encryption for Randomized Functionalities (2015) (50)
Extracting Correlations (2009) (48)
Function Private Functional Encryption and Property Preserving Encryption : New Definitions and Positive Results (2013) (47)
Resettably Secure Computation (2009) (47)
Concurrently Secure Computation in Constant Rounds (2012) (46)
Receiver anonymity via incomparable public keys (2003) (46)
Promise Zero Knowledge and its Applications to Round Optimal MPC (2018) (44)
How to Generate and Use Universal Samplers (2016) (44)
Discrete Gaussian Leftover Hash Lemma over Infinite Domains (2013) (44)
Adaptive protocols for interactive communication (2013) (43)
Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption (2015) (42)
How to Achieve Non-Malleability in One or Two Rounds (2017) (40)
Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP (2015) (40)
Concurrent Zero Knowledge without Complexity Assumptions (2006) (40)
Cryptanalysis of the Quadratic Zero-Testing of GGH (2015) (39)
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness (2018) (39)
Pseudonym Systems (Extended Abstract) (2000) (38)
Constant-Rate Oblivious Transfer from Noisy Channels (2011) (37)
Combinatorial feature selection problems (2000) (37)
Protecting obfuscation against arithmetic attacks (2014) (36)
Verifiable Functional Encryption (2016) (36)
On the Practical Security of Inner Product Functional Encryption (2015) (35)
Indistinguishability Obfuscation from Functional Encryption for Simple Functions Prabhanjan Ananth (2015) (35)
Manipulating statistical difference (1997) (35)
Secure Computation against Adaptive Auxiliary Information (2013) (35)
A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack (2002) (35)
Identifying genetic relatives without compromising privacy (2014) (34)
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (2016) (34)
How to leverage hardness of constant-degree expanding polynomials over ℝ to build iO (2018) (34)
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles (2013) (32)
On Complete Primitives for Fairness (2010) (32)
Round Optimal Concurrent MPC via Strong Simulation (2017) (31)
Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs (2018) (31)
Statistical Witness Indistinguishability (and more) in Two Messages (2018) (31)
Statistical ZAP Arguments (2020) (31)
Dimension reduction in the /spl lscr//sub 1/ norm (2002) (29)
Covert Multi-Party Computation (2007) (27)
On Efficient Zero-Knowledge PCPs (2012) (27)
Computing on Encrypted Data (2008) (27)
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma (2015) (27)
Adaptively Secure Multi-Party Computation with Dishonest Majority (2012) (27)
Threshold Fully Homomorphic Encryption (2017) (26)
Secure MPC: Laziness Leads to GOD (2018) (26)
Private Locally Decodable Codes (2007) (26)
Non-Interactive Multiparty Computation Without Correlated Randomness (2017) (26)
Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification (2020) (26)
Private Circuits: A Modular Approach (2018) (26)
Robust Pseudorandom Generators (2013) (25)
Exploring Crypto Dark Matter: - New Simple PRF Candidates and Their Applications (2018) (25)
Multi-input Functional Encryption for Unbounded Arity Functions (2015) (24)
On the Computational Complexity of Coin Flipping (2010) (24)
Fully Secure Accountable-Authority Identity-Based Encryption (2011) (24)
Hosting Services on an Untrusted Cloud (2015) (23)
Obfuscating Low-Rank Matrix Branching Programs (2014) (23)
On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (2012) (23)
Precise Concurrent Zero Knowledge (2008) (23)
Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols (2013) (22)
Pushing Disks Together—The Continuous-Motion Case (1996) (22)
Leakage-Resilient Secret Sharing Against Colluding Parties (2019) (22)
Succinct delegation for low-space non-deterministic computation (2018) (22)
Bounded-Communication Leakage Resilience via Parity-Resilient Circuits (2016) (21)
Leakage-Resilient Secret Sharing (2018) (20)
Query strategies for priced information (extended abstract) (2000) (20)
A Full Characterization of Completeness for Two-Party Randomized Function Evaluation (2014) (20)
Post-Zeroizing Obfuscation: The case of Evasive Circuits (2015) (19)
Secure Protocol Transformations (2016) (19)
Bringing People of Different Beliefs Together to Do UC (2011) (19)
Sum-of-Squares Meets Program Obfuscation, Revisited (2019) (19)
Simplifying Constructions and Assumptions for iO (2019) (18)
New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation (2012) (18)
Resettable Cryptography in Constant Rounds - the Case of Zero Knowledge (2011) (18)
Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption (2020) (18)
Dimension Reduction in the l 1 norm (2002) (17)
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption (2017) (17)
How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O (2019) (17)
Private Interactive Communication Across an Adversarial Channel (2014) (17)
Attribute-Based Encryption (2009) (16)
Potent Tree Codes and their applications: Coding for Interactive Communication, revisited (2011) (16)
On the Equivalence of Obfuscation and Multilinear Maps (2015) (16)
On Zero-Knowledge PCPs : Limitations , Simplifications , and Applications ∗ (2015) (16)
Do Distributed Differentially-Private Protocols Require Oblivious Transfer? (2016) (15)
Preventing CLT Attacks on Obfuscation with Linear Overhead (2017) (15)
Breaking the Three Round Barrier for Non-malleable Commitments (2016) (15)
Functional Encryption: Decentralised and Delegatable (2015) (15)
Cryptography with One-Way Communication (2015) (15)
Privacy preserving protocol for detecting genetic relatives using rare variants (2014) (14)
How to Generate and use Universal Parameters (2014) (14)
From FE Combiners to Secure MPC and Back (2019) (13)
Indistinguishability Obfuscation from LPN over F_p, DLIN, and PRGs in NC^0 (2021) (13)
Cryptography and Computer Security (2003) (13)
Simulation-Sound Non-Interactive Zero Knowledge (2000) (13)
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security (2016) (12)
Minimizing wirelength in zero and bounded skew clock trees (2004) (12)
Non-Interactive Delegation for Low-Space Non-Deterministic Computation (2017) (11)
Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization (2017) (11)
A note on VRFs from Verifiable Functional Encryption (2017) (11)
Secure Computation from Elastic Noisy Channels (2016) (11)
Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation (2005) (10)
Hiding secrets in software (2016) (10)
On Invertible Sampling and Adaptive Security (2010) (10)
Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation (2015) (10)
Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions (2007) (10)
New notions of security (2005) (9)
Secure Computation from Leaky Correlated Randomness (2015) (9)
Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions (2017) (9)
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products (2012) (9)
Single-use ot combiners with near-optimal resilience (2014) (9)
Patchable Indistinguishability Obfuscation: iO for Evolving Software (2017) (7)
Simplifying Constructions and Assumptions for i풪 (2019) (7)
Zero Knowledge LTCs and Their Applications (2013) (7)
Sampling Discrete Gaussians Efficiently and Obliviously (2012) (7)
Concurrent Zero Knowledge Proofs with Logarithmic Round-Complexity (2002) (7)
Indistinguishability Obfuscation with Constant Size Overhead (2015) (7)
Improved algorithms for optimal embeddings (2008) (6)
New Techniques for Non-interactive Zero-Knowledge (2006) (6)
Concurrent Secure Computation via Non-Black Box Simulation (2015) (6)
Black-Box Separations for Differentially Private Protocols (2014) (6)
Statistical Concurrent Non-Malleable Zero Knowledge (2014) (6)
Preventing CLT Zeroizing Attacks on Obfuscation (2016) (6)
On Pseudorandom Encodings (2020) (6)
Combiners for Functional Encryption, Unconditionally (2020) (6)
Fully Collusion Resistant Traitor Tracing (2006) (5)
White Paper: DEEP FAKERY—An Action Plan (2020) (5)
Expander Graphs are Non-Malleable Codes (2018) (5)
On the Round Complexity of Black-Box Secure MPC (2021) (4)
Many-toone Trapdoor Functions and Their Relation to Public-Key Cryptosystems (2009) (4)
Functional Encryption (2021) (4)
Amplifying the Security of Functional Encryption, Unconditionally (2020) (4)
Fuzzy identities and attribute-based encryption (2007) (4)
Selected Areas in Cryptography (2011) (4)
Theory of Cryptography (2014) (3)
Patchable Obfuscation (2015) (3)
Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge (2019) (3)
Output Compression, MPC, and iO for Turing Machines (2019) (2)
Proceedings of the 10th theory of cryptography conference on Theory of Cryptography (2013) (2)
Upgrading to Functional Encryption (2018) (2)
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs (2014) (2)
Quantum Immune One-Time Memories (2020) (2)
Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC (2022) (2)
Secure Computation Using Leaky Tokens (2014) (2)
Theoretical foundations of position-based cryptography (2011) (1)
Computational issues in optimal auction design (2005) (1)
Frontiers in zero knowledge (2000) (1)
Cryptographic Sensing (2019) (1)
Round-Optimal Black-Box Protocol Compilers (2022) (1)
Single-Use Oblivious Transfer Combiners (2013) (1)
All Complete Functionalities are Reversible (2016) (1)
Secure Protocols for Complex Tasks in Complex Environments (2004) (1)
Beyond the Csiszár-Körner Bound: Best-Possible Wiretap Coding via Obfuscation (2022) (1)
How to Play ANY Mental Game Over the Net Concurrently composable secure computation without setup assumptions (2005) (1)
Self-Processing Private Sensor Data via Garbled Encryption (2020) (1)
Functional Encryption : Decentralized and Delegatable (2015) (0)
A Note on the Pseudorandomness of Low-Degree Polynomials over the Integers (2021) (0)
Black-Box Reusable NISC with Random Oracles (2023) (0)
The IPS Compiler (2013) (0)
Fuzzy Identity Based Encryption Preliminary Version (2004) (0)
Non-Interactive Publicly-Verifiable Delegation of Committed Programs (2022) (0)
Theory of Cryptography (2013) (0)
Indistinguishability Obfuscation from LPN over $\mathbb {F}_p$, DLIN, and PRGs in NC0 (2022) (0)
Statistical WI ( and more ) in Two Messages (2018) (0)
Studies in zero knowledge (2010) (0)
General Composability without a Common Reference String (2004) (0)
Attribute based Encryption and Decryption Technique (2016) (0)
Two-Round Concurrent 2PC from Sub-Exponential LWE (2022) (0)
Pseudonym Systems =4g 2 Pseudonym Systems (2013) (0)
Graph-based Adaptive Diagnosis (2008) (0)
Robust Transfroming Combiners from iO to FE Prabhanjan Ananth (2017) (0)
Streaming Functional Encryption (2022) (0)
Indistinguishability Obfus ation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Se urity Ampli(cid:28) ation ⋆ (2021) (0)
for Randomized Functionalities (2015) (0)
An information-theoretic protocol compiler (2012) (0)
Informal Theorem 1 ( Reversibility Characterization ) (2016) (0)
Towards Unified , Achievable , Simulation Based Function and Data Privacy in Functional Encryption (2014) (0)
Efficient NIZKs from LWE via Polynomial Reconstruction and "MPC in the Head" (2022) (0)
On the Geometry of Two-Party Differentially-Private Protocols (2013) (0)
Manipulating Statistical Di � erence (2018) (0)
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT (2022) (0)
Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-Quantum i풪 (2022) (0)
An Improved Security enabled Distribution of Protected Cloud Storage Services by Zero-Knowledge Proof based on RSA Assumption (2017) (0)
Concurrent-Secure Two-Party Computation in Two Rounds from Subexponential LWE (2021) (0)
Expanding COVID-19 symptom screening to retail, restaurants, and schools by preserving privacy using relaxed digital signatures (2020) (0)
Manipulating Statistical Diierence (1998) (0)
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles (2012) (0)
Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006) (2009) (0)
Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017) (2022) (0)
Theory of cryptography : 10th Theory of Cryptography Conference, TCC 2013, Tokyo, Japan, March 3-6, 2013 : proceedings (2013) (0)
Computing on Encrypted Data (Extended Abstract) (2008) (0)

This paper list is powered by the following services:

Other Resources About Amit Sahai

en.wikipedia.org

What Schools Are Affiliated With Amit Sahai?

Amit Sahai is affiliated with the following schools:

Amit Sahai's Academic­Influence.com Rankings