I have moved. This webpage will no longer be updated.
Publications
(Authors arranged alphabetically)
Stacking Sigmas: A Framework to Compose Σ-protocols for Disjunctions [eprint] Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk EUROCRYPT 2022
Secure Multiparty Computation with Free Branching Aarushi Goel, Mathias Hall-Andersen, Aditya Hegde, Abhishek Jain EUROCRYPT 2022
Efficient Set Membership Proofs using MPC-in-the-Head [eprint] Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk PETS 2022
On Communication Models and Best-Achievable Security in Two-Round MPC [eprint] Aarushi Goel, Abhishek Jain, Manoj Prabhakaran, Rajeev Raghunath TCC 2021
On Actively-Secure Elementary MPC Reductions [eprint] Benny Applebaum, Aarushi Goel TCC 2021
Fluid MPC: Secure Multiparty Computation with Dynamic Participants [eprint] Arka Rai Choudhuri, Aarushi Goel, Matthew Green, Abhishek Jain, Gabriel Kaptchuk CRYPTO 2021
Breaking the \(O(\sqrt{n})\)-Bits Barrier: Byzantine Agreement with Polylog Bits Per Party [eprint][arxiv] Elette Boyle, Ran Cohen, Aarushi Goel PODC 2021
Order-C Secure Multiparty Computation for Highly Repetitive Circuits [eprint] Gabrielle Beck, Aarushi Goel, Abhishek Jain, Gabriel KaptchukEUROCRYPT 2021
Towards Efficiency-Preserving Round Compression in MPC [eprint] Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek JainASIACRYPT 2020
The Broadcast Message Complexity of Secure Multiparty Computation [eprint] Sanjam Garg, Aarushi Goel, Abhishek JainASIACRYPT 2019
Two Round Information-Theoretic MPC with Malicious Security [eprint] Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek JainEUROCRYPT 2019
Round-Optimal Secure Multiparty Computation with Honest Majority [eprint] Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek JainCRYPTO 2018
Generation of Secure and Reliable Honeywords, Preventing False Detection [PDF] Akshima, Donghoon Chang, Aarushi Goel, Sweta Mishra, Somitra Kumar SanadhyaIEEE Transactions on Dependable and Secure Computing 2018
Single Key Recovery Attacks on 9-Round Kalyna-128/256 and Kalyna-256/512 [eprint] Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar SanadhyaICISC 2015
Improved Meet-in-the-Middle Attacks on 7 and 8-Round ARIA-192 and ARIA-256 [PDF] Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar SanadhyaINDOCRYPT 2015
Talks
Secure Multiparty Computation with Free Branching EUROCRYPT 2022, Trondheim [Slides][Video]
Stacking Sigmas: A Framework to Compose Σ-protocols for Disjunctions UC Berkeley Crypto Seminar [Slides]
On Communication Models and Best-Achievable Security in Two-Round MPC TCC 2021, Raleigh [Slides][Video]
On Actively-Secure Elementary MPC Reductions TCC 2021, Raleigh [Slides][Video]
Order-C Secure Multiparty Computation for Highly Repetitive Circuits EUROCRYPT 2021, Pre-recorded [Slides][Video]
Breaking the \(O(\sqrt{n})\)-Bits Barrier: Byzantine Agreement with Polylog Bits Per Party PODC 2021, Virtual [Slides(by Ran)][Video]
MPC for Everyone BUSEC Seminar, Virtual [Slides]
Fluid MPC: Secure Multiparty Computation with Dynamic Participants CRYPTO 2021, Virtual [Slides][Video] UC Berkeley Crypto Seminar, Virtual [Slides]
-
The Broadcast Message Complexity of Secure Multiparty Computation ASIACRYPT 2019, Kobe [Slides]
-
Two Round Information-Theoretic MPC with Malicious Security EUROCRYPT 2019, Darmstadt [Slides][Video]TPMPC 2019, Tel Aviv [Slides]
-
Round-Optimal Secure Multiparty Computation with Honest Majority CRYPTO 2018, Santa Barbara [Slides][Video]
Teaching
Modern CryptographyTeaching Assistant - Fall 2020, 2017
-
Blockchains and CryptocurrenciesTeaching Assistant - Spring 2018