Yael Tauman Kalai
#20,074
Most Influential Person Now
Cryptographer and theoretical computer scientist
Yael Tauman Kalai's AcademicInfluence.com Rankings
Yael Tauman Kalaicomputer-science Degrees
Computer Science
#1008
World Rank
#1044
Historical Rank
Theoretical Computer Science
#133
World Rank
#133
Historical Rank
Yael Tauman Kalaimathematics Degrees
Mathematics
#3506
World Rank
#5157
Historical Rank
Measure Theory
#2959
World Rank
#3514
Historical Rank
Download Badge
Computer Science Mathematics
Yael Tauman Kalai's Degrees
- Bachelors Mathematics Tel Aviv University
Similar Degrees You Can Earn
Why Is Yael Tauman Kalai Influential?
(Suggest an Edit or Addition)According to Wikipedia, Yael Tauman Kalai is a cryptographer and theoretical computer scientist who works as a Senior Principal Researcher at Microsoft Research New England and as an adjunct professor at MIT in the Computer Science and Artificial Intelligence Lab.
Yael Tauman Kalai'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
- How to Leak a Secret (2001) (1621)
- Delegating computation: interactive proofs for muggles (2008) (469)
- Improved Delegation of Computation using Fully Homomorphic Encryption (2010) (401)
- Reusable garbled circuits and succinct functional encryption (2013) (392)
- Improved Online/Offline Signature Schemes (2001) (386)
- On the (In)security of the Fiat-Shamir paradigm (2003) (354)
- One-Time Programs (2008) (232)
- Protecting Obfuscation against Algebraic Attacks (2014) (230)
- Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage (2010) (222)
- On cryptography with auxiliary input (2009) (213)
- On the impossibility of obfuscation with auxiliary input (2005) (202)
- Smooth Projective Hashing and Two-Message Oblivious Transfer (2005) (201)
- Public-Key Encryption Schemes with Auxiliary Inputs (2010) (196)
- Delegating Computation (2015) (190)
- How to Run Turing Machines on Encrypted Data (2013) (184)
- Robustness of the Learning with Errors Assumption (2010) (183)
- How to delegate computations: the power of no-signaling proofs (2014) (132)
- Memory Delegation (2011) (132)
- How to Leak a Secret: Theory and Applications of Ring Signatures (2006) (106)
- On Symmetric Encryption and Point Obfuscation (2010) (79)
- From Obfuscation to the Security of Fiat-Shamir for Proofs (2017) (78)
- Interactive PCP (2008) (76)
- Cryptography with Tamperable and Leaky Memory (2011) (73)
- A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model (2010) (73)
- Black-Box Circular-Secure Encryption beyond Affine Functions (2011) (69)
- Efficient Interactive Coding against Adversarial Noise (2012) (66)
- Delegation for bounded space (2013) (65)
- Probabilistically Checkable Arguments (2009) (63)
- Cryptographic Assumptions: A Position Paper (2016) (60)
- Obfuscation for Evasive Functions (2014) (54)
- On Virtual Grey Box Obfuscation for General Circuits (2017) (52)
- Multi-collision resistance: a paradigm for keyless hash functions (2018) (51)
- Multiparty computation secure against continual memory leakage (2012) (50)
- Distinguisher-Dependent Simulation in Two Rounds and its Applications (2017) (49)
- Concurrent general composition of secure protocols in the timing model (2005) (49)
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator (2014) (46)
- Promise Zero Knowledge and its Applications to Round Optimal MPC (2018) (44)
- Program Obfuscation with Leaky Hardware (2011) (44)
- Non-interactive delegation and batch NP verification from standard computational assumptions (2017) (44)
- 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness (2009) (43)
- Delegating RAM Computations (2016) (43)
- Fast Interactive Coding against Adversarial Noise (2014) (41)
- Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond (2012) (38)
- A Survey of Leakage-Resilient Cryptography (2019) (37)
- Network Extractor Protocols (2008) (37)
- How to delegate computations publicly (2019) (35)
- Secure Computation against Adaptive Auxiliary Information (2013) (35)
- Cryptography Resilient to Continual Memory Leakage (2010) (33)
- Statistical Witness Indistinguishability (and more) in Two Messages (2018) (31)
- Concurrent Composition of Secure Protocols in the Timing Model (2007) (30)
- On Obfuscation with Random Oracles (2015) (30)
- Privacy-Preserving Automated Exposure Notification (2020) (29)
- Securing Circuits against Constant-Rate Tampering (2012) (29)
- Leakage-resilient coin tossing (2011) (28)
- Interactive Coding for Multiparty Protocols (2015) (27)
- Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP (2006) (26)
- Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examples (2020) (25)
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE (2020) (25)
- Succinct delegation for low-space non-deterministic computation (2018) (22)
- Arguments of Proximity - [Extended Abstract] (2015) (20)
- 3-Message Zero Knowledge Against Human Ignorance (2016) (19)
- Leaky Pseudo-Entropy Functions (2011) (19)
- Adaptively Secure Coin-Flipping, Revisited (2015) (19)
- Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks (2019) (18)
- Securing Circuits and Protocols against 1/poly(k) Tampering Rate (2014) (17)
- A Parallel Repetition Theorem for Leakage Resilience (2012) (16)
- Formulas Resilient to Short-Circuit Errors (2012) (16)
- A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols (2018) (15)
- On Publicly Verifiable Delegation From Standard Assumptions (2018) (14)
- Non-Interactive Delegation for Low-Space Non-Deterministic Computation (2017) (11)
- Non-Interactive Non-Malleability from Quantum Supremacy (2019) (11)
- Extractors and the Leftover Hash Lemma (2011) (11)
- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs for P (2021) (10)
- Non-Interactive RAM and Batch NP Delegation from any PIR (2016) (9)
- Proofs of Ignorance and Applications to 2-Message Witness Hiding (2018) (9)
- On the Space Complexity of Linear Programming with Preprocessing (2016) (9)
- Delegation with Updatable Unambiguous Proofs and PPAD-Hardness (2020) (9)
- Quantum Advantage from Any Non-Local Game (2022) (8)
- Circular-Secure Encryption Beyond Affine Functions (2009) (8)
- Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions (2019) (8)
- Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control (2020) (7)
- Low Error Efficient Computational Extractors in the CRS Model (2020) (6)
- Interactive Coding with Constant Round and Communication Blowup (2018) (6)
- Compressing Communication in Distributed Protocols (2015) (5)
- Overcoming the Worst-Case Curse for Cryptographic Constructions (2013) (5)
- Succinct Classical Verification of Quantum Computation (2022) (5)
- SNARGs for Bounded Depth Computations from Sub-Exponential LWE (2020) (5)
- Computational Extractors with Negligible Error in the CRS Model (2019) (4)
- Fully Homomorphic NIZK and NIWI Proofs (2019) (4)
- Monotone Batch NP-Delegation with Applications to Access Control (2018) (4)
- Theory of Cryptography (2014) (3)
- Attacks on the Fiat-Shamir paradigm and program obfuscation (2006) (3)
- A note on the impossibility of obfuscation (2014) (3)
- Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes (2020) (3)
- Non-signaling proofs with o(√ log n) provers are in PSPACE (2020) (3)
- Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption (2022) (2)
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface (2007) (2)
- Introduction to Homomorphic Encryption (2011) (2)
- Rate-1 Non-Interactive Arguments for Batch-NP and Applications (2022) (2)
- Theory of Cryptography (2017) (2)
- Boosting Batch Arguments and RAM Delegation (2022) (2)
- PPAD-Hardness and Delegation with Unambiguous Proofs (2020) (2)
- Circuits resilient to short-circuit errors (2022) (1)
- SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption (2022) (1)
- On Virtual Grey Box Obfuscation for General Circuits (2016) (1)
- Non-Signaling Proofs with $O(\sqrt{\log n})$ Provers are in PSPACE (2019) (1)
- Constructive Post-Quantum Reductions (2022) (1)
- Efficient Multiparty Interactive Coding—Part II: Non-Oblivious Noise (2022) (1)
- How to Delegate Computations: The Power of No-Signaling Proofs (2021) (1)
- The impossibility of obfuscation with a universal simulator (2014) (1)
- Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to $>\frac12$ Adversarial Corruption (2021) (1)
- Public-Key Encryption Schemes with Auxiliary Inputs . Theory of Cryptography Citation (2009) (1)
- Lecture 18: Mixnet Voting Systems (2004) (0)
- Interactive Coding with Small Memory (2022) (0)
- Identifying unpredictable test examples with worst-case guarantees (2020) (0)
- Efficient Multiparty Interactive Coding—Part I: Oblivious Insertions, Deletions and Substitutions (2021) (0)
- Robustness of the Learning with Errors Assumption Citation (2009) (0)
- Witness Indistinguishability for any Single-Round Argument (2020) (0)
- Digital Signatures (2022) (0)
- Compressing Communication in Selection Protocols ∗ (2018) (0)
- Special Section on the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2015) (2018) (0)
- A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols (2020) (0)
- MIT Open Access Articles Reusable garbled circuits and succinct functional encryption (2022) (0)
- Verifiable Private Information Retrieval (2022) (0)
- Verifiable Private Information Retrieval (2022) (0)
- Smooth Projective Hashing and Two-Message Oblivious Transfer (2010) (0)
- Cryptography Against Continual Memory Leakage (2011) (0)
- Lecture 22: Voter Veriflcation in Mix-net Voting Systems (2004) (0)
- Leakage-resilient coin tossing (2014) (0)
- Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008: Preface (2008) (0)
- Theory of Cryptography (2017) (0)
- Statistical WI ( and more ) in Two Messages (2018) (0)
- Succinct Spooky Free Compilers Are Not Black Box Sound (2017) (0)
- Efficient Interactive Coding Against Adversarial Noise Zvika Brakerski (2012) (0)
- Differential Privacy 2 a Bayesian Forumulation of Differential Privacy (2011) (0)
- Message Authentication Codes (2022) (0)
- Interactive PCP 2007 (2017) (0)
- Session details: Session 3A (2010) (0)
- Session details: Session 12B (2010) (0)
- Lecture 3,4: Universal Composability (2004) (0)
- Cryptography (2019) (0)
- Hardware Security (2022) (0)
- Bounded Memory Leakage 1 Preliminaries 1.1 Notation 1.2 Leftover Hash Lemma (2011) (0)
- Answering Many Queries with Dierential Privacy (2011) (0)
- DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES (2019) (0)
This paper list is powered by the following services:
Other Resources About Yael Tauman Kalai
What Schools Are Affiliated With Yael Tauman Kalai?
Yael Tauman Kalai is affiliated with the following schools:
