Dana Shamir
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Non-interactive Universal Arguments | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Constructs non-interactive universal arguments by lifting existing SNARGs for P into a universal protocol using fully homomorphic encryption plus a family of… | ||
| nothing matches | ||