Yael Tauman Kalai

Affiliations:
  • Microsoft Research New England, Cambridge, USA


According to our database1, Yael Tauman Kalai authored at least 114 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
SNARGs for Monotone Policy Batch NP.
IACR Cryptol. ePrint Arch., 2023

On the works of Avi Wigderson.
CoRR, 2023

2022
Efficient Multiparty Interactive Coding - Part II: Non-Oblivious Noise.
IEEE Trans. Inf. Theory, 2022

How to Delegate Computations: The Power of No-Signaling Proofs.
J. ACM, 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

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

Constructive Post-Quantum Reductions.
IACR Cryptol. ePrint Arch., 2022

Verifiable Private Information Retrieval.
IACR Cryptol. ePrint Arch., 2022

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

Interactive Coding with Small Memory.
Electron. Colloquium Comput. Complex., 2022

Circuits Resilient to Short-Circuit Errors.
Electron. Colloquium Comput. Complex., 2022

Interactive error correcting codes over binary erasure channels resilient to > ½ adversarial corruption.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Efficient Multiparty Interactive Coding - Part I: Oblivious Insertions, Deletions and Substitutions.
IEEE Trans. Inf. Theory, 2021

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

Interactive Error Correcting Codes Over Binary Erasure Channels Resilient to $>\frac12$ Adversarial Corruption.
IACR Cryptol. ePrint Arch., 2021

A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols.
Comb., 2021

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

2020
SNARGs for Bounded Depth Computations from Sub-Exponential LWE.
IACR Cryptol. ePrint Arch., 2020

SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE.
IACR Cryptol. ePrint Arch., 2020

Privacy-Preserving Automated Exposure Notification.
IACR Cryptol. ePrint Arch., 2020

Deterministic and Efficient Interactive Coding from Hard-to-Decode Tree Codes.
Electron. Colloquium Comput. Complex., 2020

Non-signaling proofs with o(√ log n) provers are in PSPACE.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examples.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Identifying unpredictable test examples with worst-case guarantees.
Proceedings of the Information Theory and Applications Workshop, 2020

Low Error Efficient Computational Extractors in the CRS Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Delegation with Updatable Unambiguous Proofs and PPAD-Hardness.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
A Survey of Leakage-Resilient Cryptography.
IACR Cryptol. ePrint Arch., 2019

How to Delegate Computations Publicly.
IACR Cryptol. ePrint Arch., 2019

Computational Extractors with Negligible Error in the CRS Model.
IACR Cryptol. ePrint Arch., 2019

Fully Homomorphic NIZK and NIWI Proofs.
IACR Cryptol. ePrint Arch., 2019

No-Signaling Proofs with O(√(log n)) Provers are in PSPACE.
CoRR, 2019

Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

A survey of leakage-resilient cryptography.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2018
Special Section on the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2015).
SIAM J. Comput., 2018

On Publicly Verifiable Delegation From Standard Assumptions.
IACR Cryptol. ePrint Arch., 2018

Statistical Witness Indistinguishability (and more) in Two Messages.
IACR Cryptol. ePrint Arch., 2018

Proofs of Ignorance and Applications to 2-Message Witness Hiding.
IACR Cryptol. ePrint Arch., 2018

Monotone Batch NP-Delegation with Applications to Access Control.
IACR Cryptol. ePrint Arch., 2018

Non-Interactive Non-Malleability from Quantum Supremacy.
Electron. Colloquium Comput. Complex., 2018

Interactive Coding with Constant Round and Communication Blowup.
Electron. Colloquium Comput. Complex., 2018

Non-Interactive Delegation for Low-Space Non-Deterministic Computation.
Electron. Colloquium Comput. Complex., 2018

Succinct delegation for low-space non-deterministic computation.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
Distinguisher-Dependent Simulation in Two Rounds and its Applications.
IACR Cryptol. ePrint Arch., 2017

Succinct Spooky Free Compilers Are Not Black Box Sound.
IACR Cryptol. ePrint Arch., 2017

Promise Zero Knowledge and its Applications to Round Optimal MPC.
IACR Cryptol. ePrint Arch., 2017

Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks.
Electron. Colloquium Comput. Complex., 2017

Multi-Collision Resistance: A Paradigm for Keyless Hash Functions.
Electron. Colloquium Comput. Complex., 2017

On Virtual Grey Box Obfuscation for General Circuits.
Algorithmica, 2017

Non-interactive delegation and batch NP verification from standard computational assumptions.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016
From Obfuscation to the Security of Fiat-Shamir for Proofs.
IACR Cryptol. ePrint Arch., 2016

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

Non-Interactive RAM and Batch NP Delegation from any PIR.
Electron. Colloquium Comput. Complex., 2016

On the Space Complexity of Linear Programming with Preprocessing.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Delegating Computation: Interactive Proofs for Muggles.
J. ACM, 2015

Delegating RAM Computations.
IACR Cryptol. ePrint Arch., 2015

Adaptively Secure Coin-Flipping, Revisited.
IACR Cryptol. ePrint Arch., 2015

Cryptographic Assumptions: A Position Paper.
IACR Cryptol. ePrint Arch., 2015

On Obfuscation with Random Oracles.
IACR Cryptol. ePrint Arch., 2015

Compressing Communication in Distributed Protocols.
Electron. Colloquium Comput. Complex., 2015

Interactive Coding for Multiparty Protocols.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Arguments of Proximity - [Extended Abstract].
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Fast Interactive Coding against Adversarial Noise.
J. ACM, 2014

On the Space Complexity of Linear Programming with Preprocessing.
Electron. Colloquium Comput. Complex., 2014

Leakage-resilient coin tossing.
Distributed Comput., 2014

The impossibility of obfuscation with a universal simulator.
CoRR, 2014

Securing Circuits and Protocols against 1/poly(k) Tampering Rate.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

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

A Note on the Impossibility of Obfuscation with Auxiliary Input.
IACR Cryptol. ePrint Arch., 2013

Protecting Obfuscation Against Algebraic Attacks.
IACR Cryptol. ePrint Arch., 2013

Obfuscation for Evasive Functions.
IACR Cryptol. ePrint Arch., 2013

Why "Fiat-Shamir for Proofs" Lacks a Proof.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Delegation for bounded space.
Proceedings of the Symposium on Theory of Computing Conference, 2013

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

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

Secure Computation against Adaptive Auxiliary Information.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Smooth Projective Hashing and Two-Message Oblivious Transfer.
J. Cryptol., 2012

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

Securing Circuits Against Constant-Rate Tampering.
IACR Cryptol. ePrint Arch., 2012

On the (In)security of the Fiat-Shamir Paradigm, Revisited.
IACR Cryptol. ePrint Arch., 2012

Efficient Interactive Coding Against Adversarial Noise.
Electron. Colloquium Comput. Complex., 2012

Multiparty computation secure against continual memory leakage.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Formulas Resilient to Short-Circuit Errors.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Memory Delegation.
IACR Cryptol. ePrint Arch., 2011

A Parallel Repetition Theorem for Leakage Resilience.
IACR Cryptol. ePrint Arch., 2011

Program Obfuscation with Leaky Hardware.
IACR Cryptol. ePrint Arch., 2011

Leaky Pseudo-Entropy Functions.
Proceedings of the Innovations in Computer Science, 2011

Cryptography with Tamperable and Leaky Memory.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
Improved Delegation of Computation using Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2010

On Symmetric Encryption and Point Obfuscation.
IACR Cryptol. ePrint Arch., 2010

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

A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model.
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

2009
Black-Box Circular-Secure Encryption Beyond Affine Functions.
IACR Cryptol. ePrint Arch., 2009

On cryptography with auxiliary input.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Probabilistically Checkable Arguments.
Proceedings of the Advances in Cryptology, 2009

2008
Network Extractor Protocols.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

One-Time Programs.
Proceedings of the Advances in Cryptology, 2008

2007
Concurrent Composition of Secure Protocols in the Timing Model.
J. Cryptol., 2007

Interactive PCP.
Electron. Colloquium Comput. Complex., 2007

2006
Attacks on the Fiat-Shamir paradigm and program obfuscation.
PhD thesis, 2006

Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

How to Leak a Secret: Theory and Applications of Ring Signatures.
Proceedings of the Theoretical Computer Science, 2006

2005
Concurrent general composition of secure protocols in the timing model.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On the Impossibility of Obfuscation with Auxiliary Input.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

Smooth Projective Hashing and Two-Message Oblivious Transfer.
Proceedings of the Advances in Cryptology, 2005

2003
On the (In)security of the Fiat-Shamir Paradigm.
Electron. Colloquium Comput. Complex., 2003

2001
Improved Online/Offline Signature Schemes.
Proceedings of the Advances in Cryptology, 2001

How to Leak a Secret.
Proceedings of the Advances in Cryptology, 2001


  Loading...