SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. - Nishat Koti; Mahak Pancholi; Arpita Patra; Ajith Suresh (IACR Cryptol. ePrint Arch., 2020)

Reverse Firewalls for Adaptively Secure MPC without Setup. - Suvradip Chakraborty; Chaya Ganesh; Mahak Pancholi; Pratik Sarkar (IACR Cryptol. ePrint Arch., 2021)

Fiatâ"Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). - Chaya Ganesh; Claudio Orlandi; Mahak Pancholi; Akira Takahashi 002; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2021)

Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). - Chaya Ganesh; Claudio Orlandi; Mahak Pancholi; Akira Takahashi 002; Daniel Tschudi (EUROCRYPT (2), 2022)

Witness-Succinct Universally-Composable SNARKs. - Chaya Ganesh; Yashvanth Kondi; Claudio Orlandi; Mahak Pancholi; Akira Takahashi 002; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2022)

Ramen: Souper Fast Three-Party Computation for RAM Programs. - Lennart Braun; Mahak Pancholi; Rahul Rachuri; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2023)

How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach. - Markulf Kohlweiss; Mahak Pancholi; Akira Takahashi 002 (IACR Cryptol. ePrint Arch., 2023)

Securely Computing One-Sided Matching Markets. - James Hsin-Yu Chiang; Ivan Damgård; Claudio Orlandi; Mahak Pancholi; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2024)

When Can We Incrementally Prove Computations of Arbitrary Depth? - Matteo Campanelli; Dario Fiore 001; Mahak Pancholi (IACR Cryptol. ePrint Arch., 2025)

Fiat-Shamir Bulletproofs are Non-malleable (in the Random Oracle Model). - Chaya Ganesh; Claudio Orlandi; Mahak Pancholi; Akira Takahashi 002; Daniel Tschudi (J. Cryptol., 2025)