Yael Tauman Kalai

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
A Survey of Leakage-Resilient Cryptography.
IACR Cryptology ePrint Archive, 2019

How to Delegate Computations Publicly.
IACR Cryptology ePrint Archive, 2019

Computational Extractors with Negligible Error in the CRS Model.
IACR Cryptology ePrint Archive, 2019

Fully Homomorphic NIZK and NIWI Proofs.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2018

Statistical Witness Indistinguishability (and more) in Two Messages.
IACR Cryptology ePrint Archive, 2018

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

Monotone Batch NP-Delegation with Applications to Access Control.
IACR Cryptology ePrint Archive, 2018

A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Non-Interactive Non-Malleability from Quantum Supremacy.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Interactive Coding with Constant Round and Communication Blowup.
Electronic Colloquium on Computational Complexity (ECCC), 2018

Non-Interactive Delegation for Low-Space Non-Deterministic Computation.
Electronic Colloquium on Computational Complexity (ECCC), 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 Cryptology ePrint Archive, 2017

Succinct Spooky Free Compilers Are Not Black Box Sound.
IACR Cryptology ePrint Archive, 2017

Promise Zero Knowledge and its Applications to Round Optimal MPC.
IACR Cryptology ePrint Archive, 2017

Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Multi-Collision Resistance: A Paradigm for Keyless Hash Functions.
Electronic Colloquium on Computational Complexity (ECCC), 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 Cryptology ePrint Archive, 2016

3-Message Zero Knowledge Against Human Ignorance.
IACR Cryptology ePrint Archive, 2016

Non-Interactive RAM and Batch NP Delegation from any PIR.
Electronic Colloquium on Computational Complexity (ECCC), 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 Cryptology ePrint Archive, 2015

Adaptively Secure Coin-Flipping, Revisited.
IACR Cryptology ePrint Archive, 2015

Cryptographic Assumptions: A Position Paper.
IACR Cryptology ePrint Archive, 2015

On Obfuscation with Random Oracles.
IACR Cryptology ePrint Archive, 2015

Compressing Communication in Distributed Protocols.
Electronic Colloquium on Computational Complexity (ECCC), 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.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Leakage-resilient coin tossing.
Distributed Computing, 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 Cryptology ePrint Archive, 2013

A Note on the Impossibility of Obfuscation with Auxiliary Input.
IACR Cryptology ePrint Archive, 2013

Protecting Obfuscation Against Algebraic Attacks.
IACR Cryptology ePrint Archive, 2013

Obfuscation for Evasive Functions.
IACR Cryptology ePrint Archive, 2013

How to Delegate Computations: The Power of No-Signaling Proofs.
Electronic Colloquium on Computational Complexity (ECCC), 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. Cryptology, 2012

Succinct Functional Encryption and Applications: Reusable Garbled Circuits and Beyond.
IACR Cryptology ePrint Archive, 2012

Securing Circuits Against Constant-Rate Tampering.
IACR Cryptology ePrint Archive, 2012

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

Efficient Interactive Coding Against Adversarial Noise.
Electronic Colloquium on Computational Complexity (ECCC), 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 Cryptology ePrint Archive, 2011

A Parallel Repetition Theorem for Leakage Resilience.
IACR Cryptology ePrint Archive, 2011

Program Obfuscation with Leaky Hardware.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2010

On Symmetric Encryption and Point Obfuscation.
IACR Cryptology ePrint Archive, 2010

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

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

Interactive PCP.
Electronic Colloquium on Computational Complexity (ECCC), 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.
Electronic Colloquium on Computational Complexity (ECCC), 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...