Moni Naor
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
- Boaz Menuhinonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Communication Complexity, Streaming and Computational Assumptions | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Assuming polynomial-time adversaries, the work shows concrete reductions: a simultaneous-message equality protocol that beats the sqrt(n) bound implies a… | ||
| Keep That Card in Mind: Card Guessing with Limited Memory | ITCS 2022 | 2022-01-31 |
A deterministic algorithm using about log^2 N bits of memory tracks log N nested ranges and guarantees about half sqrt(M) correct guesses in expectation… | ||
| nothing matches | ||