Dana Dachman-Soled
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 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 |
|---|---|---|
| New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, ... | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Transformation shows that a NIZK in the uniform random string model with provers running in time T yields a ZAP where provers run in time poly(n)·T, enabling… | ||
| nothing matches | ||