About

I am a post-doctoral researcher in the CIS Lab at NTT Research, mentored by Sanjam Garg.

I received my PhD from Johns Hopkins University in 2022, where I was extremely fortunate to be advised by Abhishek Jain. During my PhD, I was part of the Cryptography lab at Hopkins. I spent the summer of 2018 working with Elette Boyle at Reichman University, the summer of 2019 working with Benny Applebaum at Tel Aviv University and Fall 2021-Spring 2022 as a visiting student at UC Berkeley.

Previously, I received my Bachelor's in Computer Science and Engineering in 2016 from IIIT-Delhi, where I worked with Donghoon Chang and Somitra Sanadhya.

My research interests are in cryptography and in related areas of security and theoretical computer science.

Email: aarushi.goel [AT] ntt-research [DOT] com

Publications

(Authors arranged alphabetically)

Manuscripts

• Dora: Processor Expressiveness is (Nearly) Free in Zero-Knowledge for RAM Programs [eprint]
  Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk
  

• How to Prove Statements Obliviously? [eprint]
  Sanjam Garg, Aarushi Goel, Mingyuan Wang
  

• SublonK: Sublinear Prover PlonK [eprint]
  Arka Rai Choudhuri, Sanjam Garg, Aarushi Goel, Sruthi Sekar, Rohit Sinha
  

• Offline-Online Prover for Groth16 SNARKs
  Sanjam Garg, Aarushi Goel, Dimitris Kolonelos, Sina Shiehan, Rohit Sinha
  

2023

• Experimenting with Zero-Knowledge Proofs of Training [eprint][code][blog]
  Sanjam Garg, Aarushi Goel, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Guru Vamsi Policharla, Mingyuan Wang
  RWC 2024
  ACM CCS 2023

• Scalable Multiparty Garbling [eprint][code]
  Gabrielle Beck, Aarushi Goel, Aditya Hegde, Abhishek Jain, Zhengzhong Jin, Gabriel Kaptchuk
  ACM CCS 2023

• zkSaaS: Zero-Knowledge SNARKs as a Service [eprint][code]
  Sanjam Garg, Aarushi Goel, Abhishek Jain, Guru Vamsi Policharla, Sruthi Sekar
  USENIX Security 2023

• Perfect MPC over Layered Graphs (Merge of [DGL23] and [DIKKN23])
  Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, Varun Narayanan
  CRYPTO 2023

• Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions [eprint]
  Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner
  EUROCRYPT 2023

2022

• One-Time Programs from Commodity Hardware [eprint][blog]
  Harry Eldridge, Aarushi Goel, Matthew Green, Abhishek Jain, Maximilian Zinkus
  TCC 2022

• Stacking Sigmas: A Framework to Compose Σ-protocols for Disjunctions [eprint][code]
  Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk
  EUROCRYPT 2022

• Secure Multiparty Computation with Free Branching [eprint][code]
  Aarushi Goel, Mathias Hall-Andersen, Aditya Hegde, Abhishek Jain
  EUROCRYPT 2022

• Efficient Set Membership Proofs using MPC-in-the-Head [eprint][code]
  Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk
  PETS 2022

2021

• 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][JoC]
  Elette Boyle, Ran Cohen, Aarushi Goel
  Journal of Cryptology 2024
  PODC 2021

• Order-C Secure Multiparty Computation for Highly Repetitive Circuits [eprint]
  Gabrielle Beck, Aarushi Goel, Abhishek Jain, Gabriel Kaptchuk
  EUROCRYPT 2021

2020

• Towards Efficiency-Preserving Round Compression in MPC [eprint]
  Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
  ASIACRYPT 2020

2019

• The Broadcast Message Complexity of Secure Multiparty Computation [eprint]
  Sanjam Garg, Aarushi Goel, Abhishek Jain
  ASIACRYPT 2019

• Two Round Information-Theoretic MPC with Malicious Security [eprint]
  Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
  EUROCRYPT 2019

2018

• Round-Optimal Secure Multiparty Computation with Honest Majority [eprint]
  Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
  CRYPTO 2018

• Generation of Secure and Reliable Honeywords, Preventing False Detection [pdf]
  Akshima, Donghoon Chang, Aarushi Goel, Sweta Mishra, Somitra Kumar Sanadhya
  IEEE Transactions on Dependable and Secure Computing 2018

2015

• Single Key Recovery Attacks on 9-Round Kalyna-128/256 and Kalyna-256/512 [eprint]
  Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar Sanadhya
  ICISC 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 Sanadhya
  INDOCRYPT 2015

Talks

• Dora: Processor Expressiveness is (Nearly) Free in Zero-Knowledge for RAM Programs
  Stanford Security Seminar, Stanford [slides (pdf)]

• Zero-Knowledge Proofs of Training
  Rising Star Talk at TCS for All (STOC 2023), Orlando [slides (pptx)]

• zkSaaS: Zero-Knowledge SNARKs as a Service
  USENIX Security 2023, Anaheim [slides (pdf)]
  JP Morgan Crypto Seminar [slides (pptx)]

• Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions
  EUROCRYPT 2023, Lyon [slides (pptx)][video]

• Stacking Zero-Knowledge Proofs for Disjunctions
  Bay Area Crypto Day, Sunnyvale [slides (pptx)]
  NYU Crypto Seminar, Virtual

• Secure Multiparty Computation with Free Branching
  EUROCRYPT 2022, Trondheim [slides (pdf)][video]

• Stacking Sigmas: A Framework to Compose Σ-protocols for Disjunctions
  UC Berkeley Crypto Seminar [slides (pdf)]

• On Communication Models and Best-Achievable Security in Two-Round MPC
  TCC 2021, Raleigh [slides (pdf)][video]

• On Actively-Secure Elementary MPC Reductions
  TCC 2021, Raleigh [slides (pdf)][video]

• Order-C Secure Multiparty Computation for Highly Repetitive Circuits
  EUROCRYPT 2021, Pre-recorded [slides (pdf)][video]

• Breaking the \(O(\sqrt{n})\)-Bits Barrier: Byzantine Agreement with Polylog Bits Per Party
  PODC 2021, Virtual [slides (pptx)][video]

• MPC for Everyone
  BUSEC Seminar, Virtual [slides (pptx)]

• Fluid MPC: Secure Multiparty Computation with Dynamic Participants
  CRYPTO 2021, Virtual [slides (pdf)][video]
  UC Berkeley Crypto Seminar, Virtual [slides (pdf)]

• The Broadcast Message Complexity of Secure Multiparty Computation
  ASIACRYPT 2019, Kobe [slides (pdf)]

• Two Round Information-Theoretic MPC with Malicious Security
  EUROCRYPT 2019, Darmstadt [slides (pdf)][video]
  TPMPC 2019, Tel Aviv [slides (pdf)]

• Round-Optimal Secure Multiparty Computation with Honest Majority
  CRYPTO 2018, Santa Barbara [slides (pdf)][video]

Service

• Program Committee: TCC 2023, TCC 2024

• External Reviewer: CRYPTO, EUROCRYPT, IEEE S&P, STOC, FOCS, ACM CCS, TCC, ITCS, ASIACRYPT, ICALP, SCN, ITC, SODA, PKC

• Organizing: RISE: Research Insights and Stories for Enlightenment (Affiliated Event at CRYPTO 2023)

Teaching

• Modern Cryptography (Johns Hopkins University)
  Teaching Assistant - Fall 2020, 2017

• Blockchains and Cryptocurrencies (Johns Hopkins University)
  Teaching Assistant - Spring 2018