Aarushi Goel

Orcid: 0000-0002-8903-6354

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


According to our database1, Aarushi Goel authored at least 28 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

SublonK: Sublinear Prover PlonK.
Proc. Priv. Enhancing Technol., 2024

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

Secure Multiparty Computation with Free Branching.
IACR Cryptol. ePrint Arch., 2023

How to Prove Statements Obliviously?
IACR Cryptol. ePrint Arch., 2023

zkSaaS: Zero-Knowledge SNARKs as a Service.
IACR Cryptol. ePrint Arch., 2023

Experimenting with Zero-Knowledge Proofs of Training.
IACR Cryptol. ePrint Arch., 2023

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

Scalable Multiparty Garbling.
IACR Cryptol. ePrint Arch., 2023

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

2022
Efficient Set Membership Proofs using MPC-in-the-Head.
Proc. Priv. Enhancing Technol., 2022

Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions.
IACR Cryptol. ePrint Arch., 2022

One-Time Programs from Commodity Hardware.
IACR Cryptol. ePrint Arch., 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
On Communication Models and Best-Achievable Security in Two-Round MPC.
IACR Cryptol. ePrint Arch., 2021

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

Order-C Secure Multiparty Computation for Highly Repetitive Circuits.
IACR Cryptol. ePrint Arch., 2021

On Actively-Secure Elementary MPC Reductions.
IACR Cryptol. ePrint Arch., 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

2020
Fluid MPC: Secure Multiparty Computation with Dynamic Participants.
IACR Cryptol. ePrint Arch., 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?
IACR Cryptol. ePrint Arch., 2020

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

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

2018
Two Round Information-Theoretic MPC with Malicious Security.
IACR Cryptol. ePrint Arch., 2018

Round-Optimal Secure Multiparty Computation with Honest Majority.
IACR Cryptol. ePrint Arch., 2018

2015
Single Key Recovery Attacks on 9-round Kalyna-128/256 and Kalyna-256/512.
IACR Cryptol. ePrint Arch., 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


  Loading...