Eylon Yogev

Orcid: 0000-0001-8599-2472

Affiliations:
  • Bar-Ilan University, Ramat-Gan, Israel


According to our database1, Eylon Yogev authored at least 51 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
STIR: Reed-Solomon Proximity Testing with Fewer Queries.
IACR Cryptol. ePrint Arch., 2024

2023
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds.
J. ACM, August, 2023

Rogue-Instance Security for Batch Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2023

Security Bounds for Proof-Carrying Data from Straightline Extractors.
IACR Cryptol. ePrint Arch., 2023

IOPs with Inverse Polynomial Soundness Error.
IACR Cryptol. ePrint Arch., 2023

Secure Distributed Network Optimization Against Eavesdroppers.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost.
IACR Cryptol. ePrint Arch., 2022

Lower Bound on SNARGs in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2022

Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS.
IACR Cryptol. ePrint Arch., 2022

Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs.
IACR Cryptol. ePrint Arch., 2022

A Toolbox for Barriers on Interactive Oracle Proofs.
IACR Cryptol. ePrint Arch., 2022

Broadcast CONGEST Algorithms Against Eavesdroppers.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

A PCP Theorem for Interactive Proofs and Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
A Framework for Adversarially Robust Streaming Algorithms.
SIGMOD Rec., 2021

Subquadratic SNARGs in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2021

Tight Security Bounds for Micali's SNARGs.
IACR Cryptol. ePrint Arch., 2021

A PCP Theorem for Interactive Proofs.
IACR Cryptol. ePrint Arch., 2021

Adversarial laws of large numbers and optimal regret in online classification.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020
Interactive Proofs for Social Graphs.
IACR Cryptol. ePrint Arch., 2020

Transparent Error Correcting in a Computationally Bounded World.
IACR Cryptol. ePrint Arch., 2020

Barriers for Succinct Arguments in the Random Oracle Model.
IACR Cryptol. ePrint Arch., 2020

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Bloom Filters in Adversarial Environments.
ACM Trans. Algorithms, 2019

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

Distributional Collision Resistance Beyond One-Way Functions.
IACR Cryptol. ePrint Arch., 2019

The Adversarial Robustness of Sampling.
IACR Cryptol. ePrint Arch., 2019

Parallel Balanced Allocations: The Heavily Loaded Case.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Distributed Algorithms Made Secure: A Graph Theoretic Approach.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Low Congestion Cycle Covers and Their Applications.
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.
Proceedings of the 13th ACM Conference on Recommender Systems, 2019

Secure Distributed Computing Made (Nearly) Optimal.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Optimal Short Cycle Decomposition in Almost Linear Time.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.
J. Cryptol., 2018

On Distributional Collision Resistant Hashing.
IACR Cryptol. ePrint Arch., 2018

Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation.
IACR Cryptol. ePrint Arch., 2018

The Power of Distributed Verifiers in Interactive Proofs.
Electron. Colloquium Comput. Complex., 2018

Congested Clique Algorithms for Graph Spanners.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

2017
Secret-Sharing for NP.
J. Cryptol., 2017

Distributed Computing Made Secure: A New Cycle Cover Theorem.
IACR Cryptol. ePrint Arch., 2017

Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions.
IACR Cryptol. ePrint Arch., 2017

Non-Interactive Multiparty Computation without Correlated Randomness.
IACR Cryptol. ePrint Arch., 2017

2016
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.
IACR Cryptol. ePrint Arch., 2016

How to Share a Secret, Infinitely.
Electron. Colloquium Comput. Complex., 2016

Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds.
Electron. Colloquium Comput. Complex., 2016

The Journey from NP to TFNP Hardness.
Electron. Colloquium Comput. Complex., 2016

The Deep Journey from Content to Collaborative Filtering.
CoRR, 2016

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
Tight Bounds for Sliding Bloom Filters.
Algorithmica, 2015

2014
Secret-Sharing for NP from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2014

One-Way Functions and (Im)perfect Obfuscation.
IACR Cryptol. ePrint Arch., 2014

2013
Sliding Bloom Filters.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013


  Loading...