default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYael Tauman Kalai
Yael Kalai – Yael Tauman
Person information
- affiliation: Microsoft Research New England, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c88]Yael Tauman Kalai, Raghuvansh R. Saxena:
Polynomial Size, Short-Circuit Resilient Circuits for NC. ITCS 2025: 90:1-90:18- 2024
- [c87]Zhengzhong Jin
, Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs under LWE via Propositional Proofs. STOC 2024: 1750-1757 - [i87]Sam Gunn, Yael Tauman Kalai, Anand Natarajan, Agi Villanyi:
Classical Commitments to Quantum States. IACR Cryptol. ePrint Arch. 2024: 606 (2024) - [i86]Zhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs under LWE via Propositional Proofs. IACR Cryptol. ePrint Arch. 2024: 956 (2024) - [i85]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) - [i84]Zhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Surya Mathialagan:
Universal SNARGs for NP from Proofs of Correctness. IACR Cryptol. ePrint Arch. 2024: 2015 (2024) - 2023
- [c86]Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth:
SNARGs for Monotone Policy Batch NP. CRYPTO (2) 2023: 252-283 - [c85]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption. EUROCRYPT (2) 2023: 470-498 - [c84]Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena:
Interactive Coding with Small Memory. SODA 2023: 3587-3613 - [c83]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Boosting Batch Arguments and RAM Delegation. STOC 2023: 1545-1552 - [c82]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-local Game. STOC 2023: 1617-1628 - [e4]Yael Tauman Kalai:
14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA. LIPIcs 251, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-263-1 [contents] - [i83]Boaz Barak, Yael Kalai, Ran Raz, Salil P. Vadhan, Nisheeth K. Vishnoi:
On the works of Avi Wigderson. CoRR abs/2307.09524 (2023) - [i82]Zvika Brakerski, Maya Farber Brodsky, Yael Tauman Kalai, Alex Lombardi, Omer Paneth:
SNARGs for Monotone Policy Batch NP. IACR Cryptol. ePrint Arch. 2023: 1050 (2023) - 2022
- [j12]Yael Tauman Kalai, Ran Raz, Ron D. Rothblum:
How to Delegate Computations: The Power of No-Signaling Proofs. J. ACM 69(1): 1:1-1:82 (2022) - [j11]Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan:
Efficient Multiparty Interactive Coding - Part II: Non-Oblivious Noise. IEEE Trans. Inf. Theory 68(7): 4723-4749 (2022) - [c81]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 - [c80]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai:
Constructive Post-Quantum Reductions. CRYPTO (3) 2022: 654-683 - [c79]Lalita Devadas, Rishab Goyal, Yael Kalai, Vinod Vaikuntanathan:
Rate-1 Non-Interactive Arguments for Batch-NP and Applications. FOCS 2022: 1057-1068 - [c78]Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena:
Circuits resilient to short-circuit errors. STOC 2022: 582-594 - [c77]Meghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang:
Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption. STOC 2022: 609-622 - [c76]Shany Ben-David, Yael Tauman Kalai, Omer Paneth:
Verifiable Private Information Retrieval. TCC (3) 2022: 3-32 - [i81]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai:
Constructive Post-Quantum Reductions. CoRR abs/2203.02314 (2022) - [i80]Yael Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-Local Game. CoRR abs/2203.15877 (2022) - [i79]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) - [i78]Klim Efremenko, Bernhard Haeupler, Yael Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh Saxena:
Circuits Resilient to Short-Circuit Errors. Electron. Colloquium Comput. Complex. TR22 (2022) - [i77]Klim Efremenko, Bernhard Haeupler, Gillat Kol, Nicolas Resch, Raghuvansh Saxena, Yael Tauman Kalai:
Interactive Coding with Small Memory. Electron. Colloquium Comput. Complex. TR22 (2022) - [i76]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai:
Constructive Post-Quantum Reductions. IACR Cryptol. ePrint Arch. 2022: 298 (2022) - [i75]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan, Lisa Yang:
Quantum Advantage from Any Non-Local Game. IACR Cryptol. ePrint Arch. 2022: 400 (2022) - [i74]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) - [i73]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) - [i72]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan, Daniel Wichs:
Boosting Batch Arguments and RAM Delegation. IACR Cryptol. ePrint Arch. 2022: 1320 (2022) - [i71]Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2022: 1409 (2022) - [i70]Shany Ben-David, Yael Tauman Kalai, Omer Paneth:
Verifiable Private Information Retrieval. IACR Cryptol. ePrint Arch. 2022: 1560 (2022) - 2021
- [j10]Yael Tauman Kalai, Ilan Komargodski, Ran Raz:
A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols. Comb. 41(1): 75-98 (2021) - [j9]Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan:
Efficient Multiparty Interactive Coding - Part I: Oblivious Insertions, Deletions and Substitutions. IEEE Trans. Inf. Theory 67(6): 3411-3437 (2021) - [c75]Ruta Jawale, Yael Tauman Kalai, Dakshita Khurana, Rachel Yun Zhang:
SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE. STOC 2021: 708-721 - [c74]Yael Tauman Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang:
Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs. TCC (1) 2021: 330-368 - [i69]Meghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang:
Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to $>\frac12$ Adversarial Corruption. CoRR abs/2111.04181 (2021) - [i68]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) - [i67]Meghal Gupta, Yael Tauman Kalai, Rachel Yun Zhang:
Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to $>\frac12$ Adversarial Corruption. IACR Cryptol. ePrint Arch. 2021: 1481 (2021) - 2020
- [c73]Yael Tauman Kalai, Omer Paneth, Lisa Yang:
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness. CRYPTO (3) 2020: 652-673 - [c72]Ankit Garg, Yael Tauman Kalai, Dakshita Khurana:
Low Error Efficient Computational Extractors in the CRS Model. EUROCRYPT (1) 2020: 373-402 - [c71]Zvika Brakerski, Yael Tauman Kalai, Raghuvansh R. Saxena:
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes. FOCS 2020: 446-457 - [c70]Klim Efremenko, Elad Haramaty, Yael Tauman Kalai:
Interactive Coding with Constant Round and Communication Blowup. ITCS 2020: 7:1-7:34 - [c69]Shafi Goldwasser, Adam Tauman Kalai, Yael Tauman Kalai, Omar Montasser:
Identifying unpredictable test examples with worst-case guarantees. ITA 2020: 1-14 - [c68]Shafi Goldwasser, Adam Tauman Kalai, Yael Kalai, Omar Montasser:
Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examples. NeurIPS 2020 - [c67]Zvika Brakerski, Yael Kalai:
Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control. Public Key Cryptography (2) 2020: 97-123 - [c66]Dhiraj Holden, Yael Tauman Kalai:
Non-signaling proofs with o(√ log n) provers are in PSPACE. STOC 2020: 1024-1037 - [e3]Yael Tauman Kalai, Adam D. Smith, Daniel Wichs:
1st Conference on Information-Theoretic Cryptography, ITC 2020, June 17-19, 2020, Boston, MA, USA. LIPIcs 163, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-151-1 [contents] - [i66]Shafi Goldwasser, Adam Tauman Kalai, Yael Tauman Kalai, Omar Montasser:
Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examples. CoRR abs/2007.05145 (2020) - [i65]Zvika Brakerski, Yael Tauman Kalai, Raghuvansh Saxena:
Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes. Electron. Colloquium Comput. Complex. TR20 (2020) - [i64]Yael Tauman Kalai, Rachel Yun Zhang:
SNARGs for Bounded Depth Computations from Sub-Exponential LWE. IACR Cryptol. ePrint Arch. 2020: 860 (2020) - [i63]Ran Canetti, Yael Tauman Kalai, Anna Lysyanskaya, Ronald L. Rivest, Adi Shamir, Emily Shen, Ari Trachtenberg, Mayank Varia, Daniel J. Weitzner:
Privacy-Preserving Automated Exposure Notification. IACR Cryptol. ePrint Arch. 2020: 863 (2020) - [i62]Ruta Jawale, Yael Tauman Kalai, Dakshita Khurana, Rachel Yun Zhang:
SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE. IACR Cryptol. ePrint Arch. 2020: 980 (2020)
2010 – 2019
- 2019
- [j8]Ran Gelles, Yael Tauman Kalai:
Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks. IEEE Trans. Inf. Theory 65(6): 3812-3829 (2019) - [c65]Yael Tauman Kalai, Dakshita Khurana:
Non-interactive Non-malleability from Quantum Supremacy. CRYPTO (3) 2019: 552-582 - [c64]Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan:
Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions. PODC 2019: 137-146 - [c63]Yael Tauman Kalai, Omer Paneth, Lisa Yang:
How to delegate computations publicly. STOC 2019: 1115-1124 - [c62]Prabhanjan Ananth, Apoorvaa Deshpande, Yael Tauman Kalai, Anna Lysyanskaya:
Fully Homomorphic NIZK and NIWI Proofs. TCC (2) 2019: 356-385 - [p1]Yael Tauman Kalai, Leonid Reyzin:
A survey of leakage-resilient cryptography. Providing Sound Foundations for Cryptography 2019: 727-794 - [i61]Ran Gelles, Yael Tauman Kalai, Govind Ramnarayan:
Efficient Multiparty Interactive Coding for Insertions, Deletions and Substitutions. CoRR abs/1901.09863 (2019) - [i60]Dhiraj Holden, Yael Kalai:
No-Signaling Proofs with O(√(log n)) Provers are in PSPACE. CoRR abs/1910.02590 (2019) - [i59]Yael Tauman Kalai, Leonid Reyzin:
A Survey of Leakage-Resilient Cryptography. IACR Cryptol. ePrint Arch. 2019: 302 (2019) - [i58]Yael Kalai, Omer Paneth, Lisa Yang:
How to Delegate Computations Publicly. IACR Cryptol. ePrint Arch. 2019: 603 (2019) - [i57]Prabhanjan Ananth, Apoorvaa Deshpande, Yael Tauman Kalai, Anna Lysyanskaya:
Fully Homomorphic NIZK and NIWI Proofs. IACR Cryptol. ePrint Arch. 2019: 732 (2019) - [i56]Ankit Garg, Yael Tauman Kalai, Dakshita Khurana:
Computational Extractors with Negligible Error in the CRS Model. IACR Cryptol. ePrint Arch. 2019: 1116 (2019) - 2018
- [j7]Costis Daskalakis, Yael Kalai, Sandy Irani:
Special Section on the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2015). SIAM J. Comput. 47(3): 888-889 (2018) - [c61]Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai:
Promise Zero Knowledge and Its Applications to Round Optimal MPC. CRYPTO (2) 2018: 459-487 - [c60]Yael Tauman Kalai, Dakshita Khurana, Amit Sahai:
Statistical Witness Indistinguishability (and more) in Two Messages. EUROCRYPT (3) 2018: 34-65 - [c59]Nir Bitansky, Yael Tauman Kalai, Omer Paneth:
Multi-collision resistance: a paradigm for keyless hash functions. STOC 2018: 671-684 - [c58]Saikrishna Badrinarayanan, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Succinct delegation for low-space non-deterministic computation. STOC 2018: 709-721 - [c57]Yael Tauman Kalai, Ilan Komargodski, Ran Raz:
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. DISC 2018: 34:1-34:16 - [i55]Saikrishna Badrinarayanan, Yael Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Non-Interactive Delegation for Low-Space Non-Deterministic Computation. Electron. Colloquium Comput. Complex. TR18 (2018) - [i54]Klim Efremenko, Elad Haramaty, Yael Kalai:
Interactive Coding with Constant Round and Communication Blowup. Electron. Colloquium Comput. Complex. TR18 (2018) - [i53]Yael Kalai, Dakshita Khurana:
Non-Interactive Non-Malleability from Quantum Supremacy. Electron. Colloquium Comput. Complex. TR18 (2018) - [i52]Ilan Komargodski, Ran Raz, Yael Tauman Kalai:
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. Electron. Colloquium Comput. Complex. TR18 (2018) - [i51]Yael Tauman Kalai, Dakshita Khurana, Amit Sahai:
Statistical Witness Indistinguishability (and more) in Two Messages. IACR Cryptol. ePrint Arch. 2018: 168 (2018) - [i50]Zvika Brakerski, Yael Tauman Kalai:
Monotone Batch NP-Delegation with Applications to Access Control. IACR Cryptol. ePrint Arch. 2018: 375 (2018) - [i49]Yael Kalai, Omer Paneth, Lisa Yang:
On Publicly Verifiable Delegation From Standard Assumptions. IACR Cryptol. ePrint Arch. 2018: 776 (2018) - [i48]Apoorvaa Deshpande, Yael Kalai:
Proofs of Ignorance and Applications to 2-Message Witness Hiding. IACR Cryptol. ePrint Arch. 2018: 896 (2018) - [i47]Yael Tauman Kalai, Dakshita Khurana:
Non-Interactive Non-Malleability from Quantum Supremacy. IACR Cryptol. ePrint Arch. 2018: 1118 (2018) - 2017
- [j6]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. Algorithmica 79(4): 1014-1051 (2017) - [c56]Zvika Brakerski, Yael Tauman Kalai, Renen Perlman:
Succinct Spooky Free Compilers Are Not Black Box Sound. ASIACRYPT (3) 2017: 159-180 - [c55]Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Ron Rothblum:
Distinguisher-Dependent Simulation in Two Rounds and its Applications. CRYPTO (2) 2017: 158-189 - [c54]Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum:
From Obfuscation to the Security of Fiat-Shamir for Proofs. CRYPTO (2) 2017: 224-251 - [c53]Ran Gelles, Yael Tauman Kalai:
Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks. ITCS 2017: 21:1-21:13 - [c52]Zvika Brakerski, Justin Holmgren, Yael Tauman Kalai:
Non-interactive delegation and batch NP verification from standard computational assumptions. STOC 2017: 474-482 - [e2]Yael Kalai, Leonid Reyzin:
Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I. Lecture Notes in Computer Science 10677, Springer 2017, ISBN 978-3-319-70499-9 [contents] - [e1]Yael Kalai, Leonid Reyzin:
Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10678, Springer 2017, ISBN 978-3-319-70502-6 [contents] - [i46]Nir Bitansky, Omer Paneth, Yael Tauman Kalai:
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. Electron. Colloquium Comput. Complex. TR17 (2017) - [i45]Ran Gelles, Yael Tauman Kalai:
Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks. Electron. Colloquium Comput. Complex. TR17 (2017) - [i44]Shafi Goldwasser, Guy N. Rothblum, Yael Tauman Kalai:
Delegating Computation: Interactive Proofs for Muggles. Electron. Colloquium Comput. Complex. TR17 (2017) - [i43]Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Ron Rothblum:
Distinguisher-Dependent Simulation in Two Rounds and its Applications. IACR Cryptol. ePrint Arch. 2017: 330 (2017) - [i42]Nir Bitansky, Yael Tauman Kalai, Omer Paneth:
Multi-Collision Resistance: A Paradigm for Keyless Hash Functions. IACR Cryptol. ePrint Arch. 2017: 488 (2017) - [i41]Zvika Brakerski, Yael Tauman Kalai, Renen Perlman:
Succinct Spooky Free Compilers Are Not Black Box Sound. IACR Cryptol. ePrint Arch. 2017: 887 (2017) - [i40]Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai:
Promise Zero Knowledge and its Applications to Round Optimal MPC. IACR Cryptol. ePrint Arch. 2017: 1088 (2017) - [i39]Saikrishna Badrinarayanan, Yael Tauman Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Non-Interactive Delegation for Low-Space Non-Deterministic Computation. IACR Cryptol. ePrint Arch. 2017: 1250 (2017) - 2016
- [c51]Yael Tauman Kalai, Ran Raz, Oded Regev:
On the Space Complexity of Linear Programming with Preprocessing. ITCS 2016: 293-300 - [c50]Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan:
3-Message Zero Knowledge Against Human Ignorance. TCC (B1) 2016: 57-83 - [c49]Yael Tauman Kalai, Omer Paneth:
Delegating RAM Computations. TCC (B2) 2016: 91-118 - [c48]Shafi Goldwasser, Yael Tauman Kalai:
Cryptographic Assumptions: A Position Paper. TCC (A1) 2016: 505-522 - [i38]Zvika Brakerski, Justin Holmgren, Yael Tauman Kalai:
Non-Interactive RAM and Batch NP Delegation from any PIR. Electron. Colloquium Comput. Complex. TR16 (2016) - [i37]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) - [i36]Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum:
From Obfuscation to the Security of Fiat-Shamir for Proofs. IACR Cryptol. ePrint Arch. 2016: 303 (2016) - [i35]Zvika Brakerski, Justin Holmgren, Yael Tauman Kalai:
Non-Interactive RAM and Batch NP Delegation from any PIR. IACR Cryptol. ePrint Arch. 2016: 459 (2016) - 2015
- [j5]Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum:
Delegating Computation: Interactive Proofs for Muggles. J. ACM 62(4): 27:1-27:64 (2015) - [c47]Yael Tauman Kalai, Ron D. Rothblum:
Arguments of Proximity - [Extended Abstract]. CRYPTO (2) 2015: 422-442 - [c46]Shafi Goldwasser, Yael Tauman Kalai, Sunoo Park:
Adaptively Secure Coin-Flipping, Revisited. ICALP (2) 2015: 663-674 - [c45]Abhishek Jain, Yael Tauman Kalai, Allison Bishop Lewko:
Interactive Coding for Multiparty Protocols. ITCS 2015: 1-10 - [c44]Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Obfuscation with Random Oracles. TCC (2) 2015: 456-467 - [c43]Yael Tauman Kalai, Ilan Komargodski:
Compressing Communication in Distributed Protocols. DISC 2015: 467-479 - [i34]Shafi Goldwasser, Yael Tauman Kalai, Sunoo Park:
Adaptively Secure Coin-Flipping, Revisited. CoRR abs/1503.01588 (2015) - [i33]Yael Tauman Kalai, Ilan Komargodski:
Compressing Communication in Distributed Protocols. CoRR abs/1506.00290 (2015) - [i32]Yael Tauman Kalai, Ilan Komargodski:
Compressing Communication in Distributed Protocols. Electron. Colloquium Comput. Complex. TR15 (2015) - [i31]Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Obfuscation with Random Oracles. IACR Cryptol. ePrint Arch. 2015: 48 (2015) - [i30]Shafi Goldwasser, Yael Tauman Kalai, Sunoo Park:
Adaptively Secure Coin-Flipping, Revisited. IACR Cryptol. ePrint Arch. 2015: 202 (2015) - [i29]Shafi Goldwasser, Yael Tauman Kalai:
Cryptographic Assumptions: A Position Paper. IACR Cryptol. ePrint Arch. 2015: 907 (2015) - [i28]Yael Tauman Kalai, Omer Paneth:
Delegating RAM Computations. IACR Cryptol. ePrint Arch. 2015: 957 (2015) - 2014
- [j4]Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai:
Leakage-resilient coin tossing. Distributed Comput. 27(3): 147-164 (2014) - [j3]Zvika Brakerski, Yael Tauman Kalai, Moni Naor:
Fast Interactive Coding against Adversarial Noise. J. ACM 61(6): 35:1-35:30 (2014) - [c42]Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, Alon Rosen:
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. CRYPTO (2) 2014: 71-89 - [c41]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. CRYPTO (2) 2014: 108-125 - [c40]Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Protecting Obfuscation against Algebraic Attacks. EUROCRYPT 2014: 221-238 - [c39]Yael Tauman Kalai, Ran Raz, Ron D. Rothblum:
How to delegate computations: the power of no-signaling proofs. STOC 2014: 485-494 - [c38]Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. TCC 2014: 26-51 - [c37]Dana Dachman-Soled, Yael Tauman Kalai:
Securing Circuits and Protocols against 1/poly(k) Tampering Rate. TCC 2014: 540-565 - [i27]Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai:
The impossibility of obfuscation with a universal simulator. CoRR abs/1401.0348 (2014) - [i26]Yael Tauman Kalai, Ran Raz:
On the Space Complexity of Linear Programming with Preprocessing. Electron. Colloquium Comput. Complex. TR14 (2014) - [i25]Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth:
On Virtual Grey Box Obfuscation for General Circuits. IACR Cryptol. ePrint Arch. 2014: 554 (2014) - 2013
- [c36]Elette Boyle, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Amit Sahai:
Secure Computation against Adaptive Auxiliary Information. CRYPTO (1) 2013: 316-334 - [c35]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 - [c34]Shafi Goldwasser, Yael Tauman Kalai, Raluca A. Popa, Vinod Vaikuntanathan, Nickolai Zeldovich:
Reusable garbled circuits and succinct functional encryption. STOC 2013: 555-564 - [c33]Yael Tauman Kalai, Ran Raz, Ron D. Rothblum:
Delegation for bounded space. STOC 2013: 565-574 - [c32]Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt, Daniel Wichs:
Why "Fiat-Shamir for Proofs" Lacks a Proof. TCC 2013: 182-201 - [i24]Yael Tauman Kalai, Ran Raz, Ron Rothblum:
How to Delegate Computations: The Power of No-Signaling Proofs. Electron. Colloquium Comput. Complex. TR13 (2013) - [i23]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) - [i22]Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Protecting Obfuscation Against Algebraic Attacks. IACR Cryptol. ePrint Arch. 2013: 631 (2013) - [i21]Shafi Goldwasser, Yael Tauman Kalai:
A Note on the Impossibility of Obfuscation with Auxiliary Input. IACR Cryptol. ePrint Arch. 2013: 665 (2013) - [i20]Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. IACR Cryptol. ePrint Arch. 2013: 668 (2013) - [i19]Yael Tauman Kalai, Ran Raz, Ron Rothblum:
How to Delegate Computations: The Power of No-Signaling Proofs. IACR Cryptol. ePrint Arch. 2013: 862 (2013) - 2012
- [j2]Shai Halevi, Yael Tauman Kalai:
Smooth Projective Hashing and Two-Message Oblivious Transfer. J. Cryptol. 25(1): 158-193 (2012) - [c31]Dana Dachman-Soled, Yael Tauman Kalai:
Securing Circuits against Constant-Rate Tampering. CRYPTO 2012: 533-551 - [c30]Zvika Brakerski, Yael Tauman Kalai:
Efficient Interactive Coding against Adversarial Noise. FOCS 2012: 160-166 - [c29]Yael Tauman Kalai, Allison B. Lewko, Anup Rao:
Formulas Resilient to Short-Circuit Errors. FOCS 2012: 490-499 - [c28]Elette Boyle, Shafi Goldwasser, Abhishek Jain, Yael Tauman Kalai:
Multiparty computation secure against continual memory leakage. STOC 2012: 1235-1254 - [c27]Zvika Brakerski, Yael Tauman Kalai:
A Parallel Repetition Theorem for Leakage Resilience. TCC 2012: 248-265 - [i18]Zvika Brakerski, Yael Tauman Kalai:
Efficient Interactive Coding Against Adversarial Noise. Electron. Colloquium Comput. Complex. TR12 (2012) - [i17]Dana Dachman-Soled, Yael Tauman Kalai:
Securing Circuits Against Constant-Rate Tampering. IACR Cryptol. ePrint Arch. 2012: 366 (2012) - [i16]Dana Dachman-Soled, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt:
On the (In)security of the Fiat-Shamir Paradigm, Revisited. IACR Cryptol. ePrint Arch. 2012: 706 (2012) - [i15]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
- [c26]Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum:
Program Obfuscation with Leaky Hardware. ASIACRYPT 2011: 722-739 - [c25]Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz:
Memory Delegation. CRYPTO 2011: 151-168 - [c24]Yael Tauman Kalai, Bhavana Kanukurthi, Amit Sahai:
Cryptography with Tamperable and Leaky Memory. CRYPTO 2011: 373-390 - [c23]Mark Braverman, Avinatan Hassidim, Yael Tauman Kalai:
Leaky Pseudo-Entropy Functions. ICS 2011: 353-366 - [c22]Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai:
Black-Box Circular-Secure Encryption beyond Affine Functions. TCC 2011: 201-218 - [c21]Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai:
Leakage-Resilient Coin Tossing. DISC 2011: 181-196 - [i14]Zvika Brakerski, Yael Tauman Kalai:
A Parallel Repetition Theorem for Leakage Resilience. IACR Cryptol. ePrint Arch. 2011: 250 (2011) - [i13]Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz:
Memory Delegation. IACR Cryptol. ePrint Arch. 2011: 273 (2011) - [i12]Elette Boyle, Shafi Goldwasser, Yael Tauman Kalai:
Leakage-Resilient Coin Tossing. IACR Cryptol. ePrint Arch. 2011: 291 (2011) - [i11]Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum:
Program Obfuscation with Leaky Hardware. IACR Cryptol. ePrint Arch. 2011: 660 (2011) - 2010
- [c20]Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan:
Improved Delegation of Computation Using Fully Homomorphic Encryption. CRYPTO 2010: 483-501 - [c19]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 - [c18]Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan:
Robustness of the Learning with Errors Assumption. ICS 2010: 230-240 - [c17]Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs:
On Symmetric Encryption and Point Obfuscation. TCC 2010: 52-71 - [c16]Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan:
Public-Key Encryption Schemes with Auxiliary Inputs. TCC 2010: 361-381 - [i10]Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs:
On Symmetric Encryption and Point Obfuscation. IACR Cryptol. ePrint Arch. 2010: 49 (2010) - [i9]Zvika Brakerski, Yael Tauman Kalai:
A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model. IACR Cryptol. ePrint Arch. 2010: 86 (2010) - [i8]Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan:
Improved Delegation of Computation using Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2010: 241 (2010) - [i7]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)
2000 – 2009
- 2009
- [c15]Yael Tauman Kalai, Ran Raz:
Probabilistically Checkable Arguments. CRYPTO 2009: 143-159 - [c14]Yael Tauman Kalai, Xin Li, Anup Rao:
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness. FOCS 2009: 617-626 - [c13]Yevgeniy Dodis, Yael Tauman Kalai, Shachar Lovett:
On cryptography with auxiliary input. STOC 2009: 621-630 - [i6]Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai:
Black-Box Circular-Secure Encryption Beyond Affine Functions. IACR Cryptol. ePrint Arch. 2009: 485 (2009) - 2008
- [c12]Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum:
One-Time Programs. CRYPTO 2008: 39-56 - [c11]Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman:
Network Extractor Protocols. FOCS 2008: 654-663 - [c10]Yael Tauman Kalai, Ran Raz:
Interactive PCP. ICALP (2) 2008: 536-547 - [c9]Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum:
Delegating computation: interactive proofs for muggles. STOC 2008: 113-122 - 2007
- [j1]Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran:
Concurrent Composition of Secure Protocols in the Timing Model. J. Cryptol. 20(4): 431-492 (2007) - [i5]Yael Tauman Kalai, Ran Raz:
Interactive PCP. Electron. Colloquium Comput. Complex. TR07 (2007) - [i4]Shai Halevi, Yael Tauman Kalai:
Smooth Projective Hashing and Two-Message Oblivious Transfer. IACR Cryptol. ePrint Arch. 2007: 118 (2007) - 2006
- [b1]Yael Tauman Kalai:
Attacks on the Fiat-Shamir paradigm and program obfuscation. Massachusetts Institute of Technology, Cambridge, MA, USA, 2006 - [c8]Ronald L. Rivest, Adi Shamir, Yael Tauman:
How to Leak a Secret: Theory and Applications of Ring Signatures. Essays in Memory of Shimon Even 2006: 164-186 - [c7]Yael Tauman Kalai, Ran Raz:
Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP. FOCS 2006: 355-366 - 2005
- [c6]Yael Tauman Kalai:
Smooth Projective Hashing and Two-Message Oblivious Transfer. EUROCRYPT 2005: 78-95 - [c5]Shafi Goldwasser, Yael Tauman Kalai:
On the Impossibility of Obfuscation with Auxiliary Input. FOCS 2005: 553-562 - [c4]Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran:
Concurrent general composition of secure protocols in the timing model. STOC 2005: 644-653 - [i3]Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakaran:
Concurrent Composition of Secure Protocols in the Timing Model. IACR Cryptol. ePrint Arch. 2005: 36 (2005) - 2003
- [c3]Shafi Goldwasser, Yael Tauman Kalai:
On the (In)security of the Fiat-Shamir Paradigm. FOCS 2003: 102-113 - [i2]Shafi Goldwasser, Yael Tauman:
On the (In)security of the Fiat-Shamir Paradigm. Electron. Colloquium Comput. Complex. TR03 (2003) - [i1]Shafi Goldwasser, Yael Tauman:
On the (In)security of the Fiat-Shamir Paradigm. IACR Cryptol. ePrint Arch. 2003: 34 (2003) - 2001
- [c2]Ronald L. Rivest, Adi Shamir, Yael Tauman:
How to Leak a Secret. ASIACRYPT 2001: 552-565 - [c1]Adi Shamir, Yael Tauman:
Improved Online/Offline Signature Schemes. CRYPTO 2001: 355-367
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 2025-03-04 21:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
