Eylon Yogev

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs.

[BibT_eX]

[DOI]

Gal Arnon

Proceedings of the 37th Computational Complexity Conference, 2022

2021

A PCP Theorem for Interactive Proofs.

[BibT_eX]

[DOI]

Gal Arnon

IACR Cryptol. ePrint Arch., 2021

Tight Security Bounds for Micali's SNARGs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Adversarial laws of large numbers and optimal regret in online classification.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Subquadratic SNARGs in the Random Oracle Model.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

Transparent Error Correcting in a Computationally Bounded World.

[BibT_eX]

[DOI]

Ofer Grossman

Justin Holmgren

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Barriers for Succinct Arguments in the Random Oracle Model.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

The Power of Distributed Verifiers in Interactive Proofs.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

The Adversarial Robustness of Sampling.

[BibT_eX]

[DOI]

Omri Ben-Eliezer

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

A Framework for Adversarially Robust Streaming Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Interactive Proofs for Social Graphs.

[BibT_eX]

[DOI]

Liran Katzir

Clara Shikhelman

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Parallel Balanced Allocations: The Heavily Loaded Case.

[BibT_eX]

[DOI]

Christoph Lenzen

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Distributed Algorithms Made Secure: A Graph Theoretic Approach.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Low Congestion Cycle Covers and Their Applications.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

CB2CF: a neural multiview content-to-collaborative filtering model for completely cold item recommendations.

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Conference on Recommender Systems, 2019

Secure Distributed Computing Made (Nearly) Optimal.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Optimal Short Cycle Decomposition in Almost Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Distributional Collision Resistance Beyond One-Way Functions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018

Congested Clique Algorithms for Graph Spanners.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Another Step Towards Realizing Random Oracles: Non-malleable Point 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

Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions.

[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

2017

Distributed Computing Made Secure: A New Cycle Cover Theorem.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds.

[BibT_eX]

[DOI]

Pavel Hubácek

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

The Journey from NP to TFNP Hardness.

[BibT_eX]

[DOI]

Pavel Hubácek

Proceedings of the 8th Innovations in Theoretical Computer Science 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

Non-Interactive Multiparty Computation Without Correlated Randomness.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

The Deep Journey from Content to Collaborative Filtering.

[BibT_eX]

[DOI]

Oren Barkan

Noam Koenigstein

CoRR, 2016

How to Share a Secret, Infinitely.

[BibT_eX]

[DOI]

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

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015

Tight Bounds for Sliding Bloom Filters.

[BibT_eX]

[DOI]

Algorithmica, 2015

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

[BibT_eX]

[DOI]

Gil Segev

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

Bloom Filters in Adversarial Environments.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2015, 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

Sliding Bloom Filters.

[BibT_eX]

[DOI]