Luisa Siniscalchi
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 |
|---|---|---|
| On the Optimal Round Complexity of Multi-Party Computation in the Plain Model | Secure Computation 2025 | 2025-08-04 |
Claims a black-box construction of general MPC in the plain model that matches the known four rounds lower bound for unanimous abort security against up to n−1… | ||
| nothing matches | ||