Noam Mazor
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Iftach Haitneronce
- Jad Silbakonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Lower Bounds on the Overhead of Indistinguishability Obfuscation | Obfuscation | 2025-06-23 |
Under the assumption NP not in BPP the work proves a concrete inefficiency: efficient iO for multi-output Boolean circuits must add about s/log s additive… | ||
| 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 | ||