default search action
Aarushi Goel
Person information
- affiliation: NTT Research
- affiliation (PhD): Johns Hopkins University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Elette Boyle, Ran Cohen, Aarushi Goel:
Breaking the $O(\sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. J. Cryptol. 37(1): 2 (2024) - [j3]Arka Rai Choudhuri, Sanjam Garg, Aarushi Goel, Sruthi Sekar, Rohit Sinha:
SublonK: Sublinear Prover PlonK. Proc. Priv. Enhancing Technol. 2024(3): 314-335 (2024) - [c22]Aarushi Goel
, Mathias Hall-Andersen
Dora: A Simple Approach to Zero-Knowledge for RAM Programs. CCS 2024: 869-883 - [c21]Sanjam Garg, Aarushi Goel, Mingyuan Wang:
How to Prove Statements Obliviously? CRYPTO (10) 2024: 449-487 - [c20]Arka Rai Choudhuri
Homomorphic Secret Sharing with Verifiable Evaluation. TCC (4) 2024: 614-650 - 2023
- [c19]Sanjam Garg
Experimenting with Zero-Knowledge Proofs of Training. CCS 2023: 1880-1894 - [c18]Gabrielle Beck
Scalable Multiparty Garbling. CCS 2023: 2158-2172 - [c17]Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, Varun Narayanan:
Perfect MPC over Layered Graphs. CRYPTO (1) 2023: 360-392 - [c16]Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner:
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. EUROCRYPT (2) 2023: 347-378 - [c15]Sanjam Garg
zkSaaS: Zero-Knowledge SNARKs as a Service. USENIX Security Symposium 2023: 4427-4444 - [i22]Gabrielle Beck, Aarushi Goel, Aditya Hegde, Abhishek Jain, Zhengzhong Jin, Gabriel Kaptchuk:
Scalable Multiparty Garbling. IACR Cryptol. ePrint Arch. 2023: 99 (2023) - [i21]Giovanni Deligios, Aarushi Goel, Chen-Da Liu-Zhang:
Maximally-Fluid MPC with Guaranteed Output Delivery. IACR Cryptol. ePrint Arch. 2023: 415 (2023) - [i20]Aarushi Goel, Mathias Hall-Andersen, Aditya Hegde, Abhishek Jain:
Secure Multiparty Computation with Free Branching. IACR Cryptol. ePrint Arch. 2023: 901 (2023) - [i19]Arka Rai Choudhuri, Sanjam Garg
SublonK: Sublinear Prover PlonK. IACR Cryptol. ePrint Arch. 2023: 902 (2023) - [i18]Sanjam Garg
zkSaaS: Zero-Knowledge SNARKs as a Service. IACR Cryptol. ePrint Arch. 2023: 905 (2023) - [i17]Sanjam Garg
Experimenting with Zero-Knowledge Proofs of Training. IACR Cryptol. ePrint Arch. 2023: 1345 (2023) - [i16]Sanjam Garg
How to Prove Statements Obliviously? IACR Cryptol. ePrint Arch. 2023: 1609 (2023) - [i15]Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk:
Dora: Processor Expressiveness is (Nearly) Free in Zero-Knowledge for RAM Programs. IACR Cryptol. ePrint Arch. 2023: 1749 (2023) - 2022
- [j2]Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk:
Efficient Set Membership Proofs using MPC-in-the-Head. Proc. Priv. Enhancing Technol. 2022(2): 304-324 (2022) - [c14]Aarushi Goel, Mathias Hall-Andersen, Aditya Hegde, Abhishek Jain:
Secure Multiparty Computation with Free Branching. EUROCRYPT (1) 2022: 397-426 - [c13]Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk:
Stacking Sigmas: A Framework to Compose $\varSigma $-Protocols for Disjunctions. EUROCRYPT (2) 2022: 458-487 - [c12]Harry Eldridge
One-Time Programs from Commodity Hardware. TCC (3) 2022: 121-150 - [i14]Harry Eldridge, Aarushi Goel, Matthew Green, Abhishek Jain, Maximilian Zinkus:
One-Time Programs from Commodity Hardware. IACR Cryptol. ePrint Arch. 2022: 1257 (2022) - [i13]Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner:
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. IACR Cryptol. ePrint Arch. 2022: 1419 (2022) - 2021
- [c11]Arka Rai Choudhuri
Fluid MPC: Secure Multiparty Computation with Dynamic Participants. CRYPTO (2) 2021: 94-123 - [c10]Gabrielle Beck, Aarushi Goel, Abhishek Jain, Gabriel Kaptchuk:
Order-C Secure Multiparty Computation for Highly Repetitive Circuits. EUROCRYPT (2) 2021: 663-693 - [c9]Elette Boyle, Ran Cohen, Aarushi Goel:
Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party. PODC 2021: 319-330 - [c8]Aarushi Goel, Abhishek Jain, Manoj Prabhakaran, Rajeev Raghunath:
On Communication Models and Best-Achievable Security in Two-Round MPC. TCC (2) 2021: 97-128 - [c7]Benny Applebaum, Aarushi Goel:
On Actively-Secure Elementary MPC Reductions. TCC (1) 2021: 717-749 - [i12]Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk:
Stacking Sigmas: A Framework to Compose Σ-Protocols for Disjunctions. IACR Cryptol. ePrint Arch. 2021: 422 (2021) - [i11]Gabrielle Beck, Aarushi Goel, Abhishek Jain
Order-C Secure Multiparty Computation for Highly Repetitive Circuits. IACR Cryptol. ePrint Arch. 2021: 500 (2021) - [i10]Aarushi Goel, Abhishek Jain
On Communication Models and Best-Achievable Security in Two-Round MPC. IACR Cryptol. ePrint Arch. 2021: 690 (2021) - [i9]Benny Applebaum, Aarushi Goel:
On Actively-Secure Elementary MPC Reductions. IACR Cryptol. ePrint Arch. 2021: 1208 (2021) - [i8]Aarushi Goel, Matthew Green, Mathias Hall-Andersen, Gabriel Kaptchuk:
Efficient Set Membership Proofs using MPC-in-the-Head. IACR Cryptol. ePrint Arch. 2021: 1656 (2021) - 2020
- [c6]Prabhanjan Ananth, Arka Rai Choudhuri
Towards Efficiency-Preserving Round Compression in MPC - Do Fewer Rounds Mean More Computation? ASIACRYPT (3) 2020: 181-212 - [i7]Elette Boyle, Ran Cohen, Aarushi Goel:
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. CoRR abs/2002.02516 (2020) - [i6]Elette Boyle, Ran Cohen, Aarushi Goel:
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement. IACR Cryptol. ePrint Arch. 2020: 130 (2020) - [i5]Arka Rai Choudhuri, Aarushi Goel, Matthew Green, Abhishek Jain
Fluid MPC: Secure Multiparty Computation with Dynamic Participants. IACR Cryptol. ePrint Arch. 2020: 754 (2020) - [i4]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation? IACR Cryptol. ePrint Arch. 2020: 1100 (2020)
2010 – 2019
- 2019
- [j1]Akshima, Donghoon Chang, Aarushi Goel, Sweta Mishra
Generation of Secure and Reliable Honeywords, Preventing False Detection. IEEE Trans. Dependable Secur. Comput. 16(5): 757-769 (2019) - [c5]Sanjam Garg, Aarushi Goel, Abhishek Jain:
The Broadcast Message Complexity of Secure Multiparty Computation. ASIACRYPT (1) 2019: 426-455 - [c4]Prabhanjan Ananth, Arka Rai Choudhuri
Two Round Information-Theoretic MPC with Malicious Security. EUROCRYPT (2) 2019: 532-561 - 2018
- [c3]Prabhanjan Ananth, Arka Rai Choudhuri
Round-Optimal Secure Multiparty Computation with Honest Majority. CRYPTO (2) 2018: 395-424 - [i3]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
Round-Optimal Secure Multiparty Computation with Honest Majority. IACR Cryptol. ePrint Arch. 2018: 572 (2018) - [i2]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
Two Round Information-Theoretic MPC with Malicious Security. IACR Cryptol. ePrint Arch. 2018: 1078 (2018) - 2015
- [c2]Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar Sanadhya
Single Key Recovery Attacks on 9-Round Kalyna-128/256 and Kalyna-256/512. ICISC 2015: 119-135 - [c1]Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar Sanadhya
Improved Meet-in-the-Middle Attacks on 7 and 8-Round ARIA-192 and ARIA-256. INDOCRYPT 2015: 198-217 - [i1]Akshima, Donghoon Chang, Mohona Ghosh, Aarushi Goel, Somitra Kumar Sanadhya:
Single Key Recovery Attacks on 9-round Kalyna-128/256 and Kalyna-256/512. IACR Cryptol. ePrint Arch. 2015: 1227 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: