Iftach Haitner
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- Jad Silbakonce
- Noam Mazoronce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Foundations 2 | Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 | 2025-05-19 |
Best one-way-function PRG constructions use seed length n^3 and about n^3 oracle calls; black-box reductions cannot substantially beat that for length-doubling… | ||
| Foundations 1 | Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 | 2025-05-19 |
Claims a concrete path from one-way function → PRG via pseudoentropy: build G(x,h,i) that outputs f(x), h and a prefix of h·x whose length depends on x’s… | ||
| Incompressiblity and Next-Block Pseudoentropy | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
A k-incompressible distribution provably has (k−2) bits of next-block pseudoentropy: the contrapositive builds an efficient compressor from any estimator with… | ||
| Incompressiblity and Next-Block Pseudoentropy | ITCS 2023 | 2023-01-10 |
Shows that a distribution that is k incompressible yields k−2 next‑bit pseudoentropy and that incompressibility is equivalent (up to two bits) to a strong… | ||
| nothing matches | ||