Arpita Patra
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 |
|---|---|---|
| The Communication Complexity Landscape of Information-theoretic MPC | Secure Computation 2025 | 2025-08-04 |
Draws a clear map: proofs show optimal-resiliency information-theoretic MPC needs Θ(n/s) communication per multiplication when n = 3t+s (synchronous) or n =… | ||
| nothing matches | ||