Aarushi Goel

Available identifiers

Publication	Date of Publication	Type
How to prove statements obliviously?	2025-01-10	Paper
Breaking the O(√ n)-Bit Barrier	2024-03-26	Paper
Perfect MPC over layered graphs	2024-02-02	Paper
Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions	2023-12-08	Paper
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party	2023-11-21	Paper
On communication models and best-achievable security in two-round MPC	2023-04-13	Paper
On actively-secure elementary MPC reductions	2023-03-31	Paper
Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?	2023-03-29	Paper
Secure multiparty computation with free branching	2022-08-30	Paper
Order-C secure multiparty computation for highly repetitive circuits	2021-12-08	Paper
The broadcast message complexity of secure multiparty computation	2020-05-20	Paper
Two round information-theoretic MPC with malicious security	2020-02-06	Paper
Round-optimal secure multiparty computation with honest majority	2018-09-26	Paper
Single key recovery attacks on 9-round Kalyna-128/256 and Kalyna-256/512	2016-05-19	Paper
Improved meet-in-the-middle attacks on 7 and 8-round ARIA-192 and ARIA-256	2016-01-12	Paper

This page was built for person: Aarushi Goel