Hemanta Maji
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Geometry of Secure Computation | Secure Computation 2025 | 2025-08-04 |
Answers whether a two‑party randomized function is information‑theoretically securely computable by giving a finite procedure that reduces the problem to… | ||
| Geometry of Secure Computation | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Presents a geometric characterization of information‑theoretic two‑party secure computation that encodes every b‑bit protocol as a point and reduces existence… | ||
| Capacity Inversion and MPC over Elastic Noisy Channels | Securing Computation (Simons Institute, June 2015) | 2015-06-08 |
Shows how to get oblivious transfer from “elastic” noisy channels (receiver can reduce erasure/flip rate from alpha to beta) by decomposing repeated-channel… | ||
| nothing matches | ||