| A formal treatment of backdoored pseudorandom generators Y Dodis, C Ganesh, A Golovnev, A Juels, T Ristenpart Advances in Cryptology--EUROCRYPT 2015: 34th Annual International Conference …, 2015 | 102 | 2015 |
| Non-interactive zero-knowledge proofs for composite statements S Agrawal, C Ganesh, P Mohassel Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 99 | 2018 |
| Proof-of-stake protocols for privacy-aware blockchains C Ganesh, C Orlandi, D Tschudi Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019 | 75 | 2019 |
| Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials M Chase, C Ganesh, P Mohassel Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology …, 2016 | 75 | 2016 |
| Rinocchio: SNARKs for ring arithmetic C Ganesh, A Nitulescu, E Soria-Vazquez Journal of Cryptology 36 (4), 41, 2023 | 48 | 2023 |
| Balancing privacy and accountability in blockchain identity management I Damgård, C Ganesh, H Khoshakhlagh, C Orlandi, L Siniscalchi Cryptographers’ Track at the RSA Conference, 552-576, 2021 | 46* | 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 |
| Proofs of replicated storage without timing assumptions I Damgård, C Ganesh, C Orlandi Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019 | 35 | 2019 |
| What Makes Fiat–Shamir zkSNARKs (Updatable SRS) Simulation Extractable? C Ganesh, H Khoshakhlagh, M Kohlweiss, A Nitulescu, M Zając International Conference on Security and Cryptography for Networks, 735-760, 2022 | 34* | 2022 |
| Fairness in the eyes of the data: Certifying machine-learning models S Segal, Y Adi, B Pinkas, C Baum, C Ganesh, J Keshet Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society, 926-935, 2021 | 34 | 2021 |
| Broadcast extensions with optimal communication and round complexity C Ganesh, A Patra Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 28 | 2016 |
| Optimal extension protocols for byzantine broadcast and agreement C Ganesh, A Patra Distributed Computing 34, 59-77, 2021 | 23 | 2021 |
| Efficient adaptively secure zero-knowledge from garbled circuits C Ganesh, Y Kondi, A Patra, P Sarkar Public-Key Cryptography–PKC 2018: 21st IACR International Conference on …, 2018 | 23 | 2018 |
| 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 | 21 | 2023 |
| ECLIPSE: enhanced compiling method for Pedersen-committed zkSNARK engines DF Aranha, EM Bennedsen, M Campanelli, C Ganesh, C Orlandi, ... IACR International Conference on Public-Key Cryptography, 584-614, 2022 | 20 | 2022 |
| Dew: transparent constant-sized zkSNARKs A Arun, C Ganesh, S Lokam, T Mopuri, S Sridhar Cryptology ePrint Archive, 2022 | 18 | 2022 |
| Cryptographic reverse firewalls for interactive proof systems C Ganesh, B Magri, D Venturi Theoretical Computer Science 855, 104-132, 2021 | 15 | 2021 |
| Adding privacy to standard credentials ME Chase, P Mohassel, C Ganesh US Patent 10,243,738, 2019 | 14 | 2019 |
| Impossibilities in succinct arguments: Black-box extraction and more M Campanelli, C Ganesh, H Khoshakhlagh, J Siim International Conference on Cryptology in Africa, 465-489, 2023 | 13 | 2023 |
| Method, system, and computer program product for determining solvency of a digital asset exchange P Mohassel, S Agrawal, C Ganesh US Patent 11,645,658, 2023 | 13 | 2023 |
