Ilan Komargodski

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

On Distributional Collision Resistant Hashing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

On the Complexity of Compressing Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound.

[BibT_eX]

[DOI]

Avishay Tal

SIAM J. Comput., 2017

Evolving Secret Sharing: Dynamic Thresholds and Robustness.

[BibT_eX]

[DOI]

Anat Paskin-Cherniavsky

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

From Minicrypt to Obfustopia via Private-Key Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

Be Adaptive, Avoid Overcommitting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Non-Interactive Multiparty Computation Without Correlated Randomness.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Cutting-Edge Cryptography Through the Lens of Secret Sharing.

[BibT_eX]

[DOI]

Mark Zhandry

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

How to Share a Secret, Infinitely.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Leakage Resilient One-Way Functions: The Auxiliary-Input Setting.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Threshold Secret Sharing Requires a Linear Size Alphabet.

[BibT_eX]

[DOI]

Andrej Bogdanov

Siyao Guo

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Communication with Contextual Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions.

[BibT_eX]

[DOI]

Zvika Brakerski

Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015

Modern Cryptography Through the Lens of Secret Sharing.

[BibT_eX]

[DOI]

Mark Zhandry

IACR Cryptol. ePrint Arch., 2015

From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting.

[BibT_eX]

[DOI]

Zvika Brakerski

IACR Cryptol. ePrint Arch., 2015

Communication with Contextual Uncertainty.

[BibT_eX]

[DOI]

Pravesh Kothari

Madhu Sudan

Electron. Colloquium Comput. Complex., 2015

Compressing Communication in Distributed Protocols.

[BibT_eX]

[DOI]

Yael Tauman Kalai

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Strong Locally Testable Codes with Relaxed Local Decoders.

[BibT_eX]

[DOI]

Oded Goldreich

Tom Gur

Proceedings of the 30th Conference on Computational Complexity, 2015

Negation-Limited Formulas.

[BibT_eX]

[DOI]

Siyao Guo

Proceedings of the Approximation, 2015

2014

Secret-Sharing for NP from Indistinguishability Obfuscation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

One-Way Functions and (Im)Perfect Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

Secret-Sharing for NP.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013

Hardness Preserving Reductions via Cuckoo Hashing.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Average-case lower bounds for formula size.

[BibT_eX]

[DOI]

Proceedings of the Symposium on Theory of Computing Conference, 2013

Improved Average-Case Lower Bounds for DeMorgan Formula Size.

[BibT_eX]

[DOI]

Avishay Tal

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

The Spectrum of Small DeMorgan Formulas.

[BibT_eX]

[DOI]

Anat Ganor