{SWIFT}: Super-fast and robust {Privacy-Preserving} machine learning N Koti, M Pancholi, A Patra, A Suresh 30th USENIX Security Symposium (USENIX Security 21), 2651-2668, 2021 | 119 | 2021 |
Fiat–shamir bulletproofs are non-malleable (in the algebraic group model) C Ganesh, C Orlandi, M Pancholi, A Takahashi, D Tschudi Annual International Conference on the Theory and Applications of …, 2022 | 37 | 2022 |
Witness-succinct universally-composable snarks C Ganesh, Y Kondi, C Orlandi, M Pancholi, A Takahashi, D Tschudi Annual International Conference on the Theory and Applications of …, 2023 | 19 | 2023 |
Reverse firewalls for adaptively secure MPC without setup S Chakraborty, C Ganesh, M Pancholi, P Sarkar International Conference on the Theory and Application of Cryptology and …, 2021 | 8 | 2021 |
Fiat-shamir bulletproofs are non-malleable (in the random oracle model) C Ganesh, C Orlandi, M Pancholi, A Takahashi, D Tschudi Cryptology ePrint Archive, 2023 | 6 | 2023 |
How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach M Kohlweiss, M Pancholi, A Takahashi Theory of Cryptography Conference, 486-512, 2023 | 4 | 2023 |
Ramen: Souper fast three-party computation for ram programs L Braun, M Pancholi, R Rachuri, M Simkin Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications …, 2023 | 2 | 2023 |
Beyond Knowledge Soundness of SNARKs MR Pancholi Aarhus University, 2024 | | 2024 |
A Robust PPML Framework for Three Servers M Pancholi Indian Institute of Science Bangalore, 2020 | | 2020 |
Fiat–Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model) M Pancholi, A Takahashi, D Tschudi | | |