Eylon Yogev

From MaRDI portal
Revision as of 14:21, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:247172

Available identifiers

zbMath Open yogev.eylonMaRDI QIDQ247172

List of research outcomes

PublicationDate of PublicationType
Adversarial laws of large numbers and optimal regret in online classification2023-11-14Paper
A toolbox for barriers on interactive oracle proofs2023-08-14Paper
Lower bound on SNARGs in the random oracle model2023-06-30Paper
One-Way Functions and (Im)perfect Obfuscation2023-04-04Paper
Tight security bounds for Micali's SNARGs2023-03-31Paper
Interactive proofs for social graphs2022-12-07Paper
A PCP theorem for interactive proofs and applications2022-08-30Paper
Congested Clique Algorithms for Graph Spanners2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50912492022-07-21Paper
Subquadratic SNARGs in the random oracle model2022-03-31Paper
A Framework for Adversarially Robust Streaming Algorithms2022-03-31Paper
Barriers for succinct arguments in the random oracle model2022-03-23Paper
Transparent error correcting in a computationally bounded world2022-03-23Paper
The Power of Distributed Verifiers in Interactive Proofs2021-02-02Paper
Secure Distributed Computing Made (Nearly) Optimal2021-01-20Paper
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds2020-12-04Paper
White-Box vs. Black-Box Complexity of Search Problems2020-02-11Paper
Distributional collision resistance beyond one-way functions2020-02-04Paper
Bloom Filters in Adversarial Environments2019-11-25Paper
Low Congestion Cycle Covers and Their Applications2019-10-15Paper
Distributed Algorithms Made Secure: A Graph Theoretic Approach2019-10-15Paper
On distributional collision resistant hashing2018-09-26Paper
How to Share a Secret, Infinitely2018-09-14Paper
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds2018-07-16Paper
Another step towards realizing random oracles: non-malleable point obfuscation2018-07-09Paper
Collision resistant hashing for paranoids: dealing with multiple collisions2018-07-09Paper
The Journey from NP to TFNP Hardness2018-05-03Paper
Functional encryption for randomized functionalities in the private-key setting from minimal assumptions2018-04-26Paper
Non-interactive multiparty computation without correlated randomness2018-02-23Paper
Secret-sharing for NP2017-05-22Paper
How to Share a Secret, Infinitely2016-12-22Paper
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption2016-10-27Paper
Tight bounds for sliding Bloom filters2016-02-19Paper
Bloom Filters in Adversarial Environments2015-12-10Paper
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions2015-07-06Paper
Secret-Sharing for NP2015-01-06Paper
Sliding Bloom Filters2014-01-14Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Eylon Yogev