Aarushi Goel

Orcid: 0000-0002-8903-6354

Affiliations:
  • NTT Research
  • Johns Hopkins University, USA (PhD)


According to our database1, Aarushi Goel authored at least 35 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
PICS: Private Intersection over Committed (and reusable) Sets.
IACR Cryptol. ePrint Arch., 2025

Jigsaw: Doubly Private Smart Contracts.
IACR Cryptol. ePrint Arch., 2025

Split Prover Zero-Knowledge SNARKs.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

Multiparty Distributed Point Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Malicious Security in Collaborative zk-SNARKs: More than Meets the Eye.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Breaking the $O(\sqrt{n})$-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party.
J. Cryptol., March, 2024

Homomorphic Secret Sharing with Verifiable Evaluation.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

How to Prove Statements Obliviously?
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Dora: A Simple Approach to Zero-Knowledge for RAM Programs.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Dora: Processor Expressiveness is (Nearly) Free in Zero-Knowledge for RAM Programs.
IACR Cryptol. ePrint Arch., 2023

Maximally-Fluid MPC with Guaranteed Output Delivery.
IACR Cryptol. ePrint Arch., 2023

SublonK: Sublinear Prover PlonK.
IACR Cryptol. ePrint Arch., 2023

zkSaaS: Zero-Knowledge SNARKs as a Service.
Proceedings of the 32nd USENIX Security Symposium, 2023

Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Perfect MPC over Layered Graphs.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Experimenting with Zero-Knowledge Proofs of Training.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

Scalable Multiparty Garbling.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
One-Time Programs from Commodity Hardware.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Secure Multiparty Computation with Free Branching.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Stacking Sigmas: A Framework to Compose $\varSigma $-Protocols for Disjunctions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Efficient Set Membership Proofs using MPC-in-the-Head.
IACR Cryptol. ePrint Arch., 2021

Stacking Sigmas: A Framework to Compose Σ-Protocols for Disjunctions.
IACR Cryptol. ePrint Arch., 2021

On Communication Models and Best-Achievable Security in Two-Round MPC.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

On Actively-Secure Elementary MPC Reductions.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Breaking the O(√ n)-Bit Barrier: Byzantine Agreement with Polylog Bits Per Party.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Order-C Secure Multiparty Computation for Highly Repetitive Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Fluid MPC: Secure Multiparty Computation with Dynamic Participants.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Succinctly Reconstructed Distributed Signatures and Balanced Byzantine Agreement.
IACR Cryptol. ePrint Arch., 2020

Towards Efficiency-Preserving Round Compression in MPC - Do Fewer Rounds Mean More Computation?
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Generation of Secure and Reliable Honeywords, Preventing False Detection.
IEEE Trans. Dependable Secur. Comput., 2019

Two Round Information-Theoretic MPC with Malicious Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

The Broadcast Message Complexity of Secure Multiparty Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Round-Optimal Secure Multiparty Computation with Honest Majority.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2015
Improved Meet-in-the-Middle Attacks on 7 and 8-Round ARIA-192 and ARIA-256.
Proceedings of the Progress in Cryptology - INDOCRYPT 2015, 2015

Single Key Recovery Attacks on 9-Round Kalyna-128/256 and Kalyna-256/512.
Proceedings of the Information Security and Cryptology - ICISC 2015, 2015


  Loading...