Ivan Damgård
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 |
|---|---|---|
| Lower Bounds for Information-Theoretic MPC | Securing Computation (Simons Institute, June 2015) | 2015-06-08 |
Unconditional MPC requires many messages: computing AND with n players and t corruptions needs omega(nt) messages, and for three players with one corruption… | ||
| nothing matches | ||