Mahak Pancholi

Orcid: 0009-0006-5317-5535

According to our database1, Mahak Pancholi authored at least 10 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
When Can We Incrementally Prove Computations of Arbitrary Depth?
IACR Cryptol. ePrint Arch., 2025

2024
Securely Computing One-Sided Matching Markets.
IACR Cryptol. ePrint Arch., 2024

2023
Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model).
IACR Cryptol. ePrint Arch., 2023

How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular Approach.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Witness-Succinct Universally-Composable SNARKs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Ramen: Souper Fast Three-Party Computation for RAM Programs.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model).
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
Fiatâ€"Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model).
IACR Cryptol. ePrint Arch., 2021

SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning.
Proceedings of the 30th USENIX Security Symposium, 2021

Reverse Firewalls for Adaptively Secure MPC Without Setup.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021


  Loading...