Home Research Teaching Advising Other Contact

I am an Assistant Professor in the Department of Computer Science and Automation at Indian Institute of Science . My research interests are in Cryptography and Security. Before joining IISc, I was a post-doctoral researcher in the Crypto group at Aarhus University. I received my PhD from NYU's Courant Institute of Mathematical Sciences.

Research

Following the Hardy-Littlewood rule , the list of authors in the publications below is sorted alphabetically. (* indicate exceptions where they are sorted by contribution.)

Preprints:

  • GAPP: Generic Aggregation of Polynomial Protocols
    Chaya Ganesh, Sikhar Patranabis, Shubh Prakash, Nitin Singh
    Preprint 2024 ePrint

  • Samaritan: Linear-time Prover SNARK from New Multilinear Polynomial Commitments
    Chaya Ganesh, Sikhar Patranabis, Nitin Singh
    Preprint 2024 ePrint

Publications:

  1. Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler.
    Megan Chen, Pousali Dey, Chaya Ganesh, Pratyay Mukherjee, Pratik Sarkar, Swagata Sasmal
    In Public-Key Cryptography (PKC) 2025

  2. Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model)
    Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi
    Journal of Cryptology 2024. Full version of [19] with improved results.

  3. Compute, but Verify: Efficient Multiparty Computation over Authenticated Inputs
    Moumita Dutta, Chaya Ganesh, Sikhar Patranabis, Nitin Singh
    Asiacrypt 2024

  4. Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs
    Chaya Ganesh, Vineet Nair, Ashish Sharma
    ACM CCS 2024

  5. Batching-Efficient RAM using Updatable Lookup Arguments
    Moumita Dutta, Chaya Ganesh, Sikhar Patranabis, Shubh Prakash, Nitin Singh
    ACM CCS 2024

  6. Secure Vickrey Auctions with Rational Parties
    Chaya Ganesh, Shreyas Gupta, Bhavana Kanukurthi, Girisha Shankar
    ACM CCS 2024

  7. How to Make Rational Arguments Practical and Extractable
    Matteo Campanelli, Chaya Ganesh, Rosario Gennaro
    IACR Communications in Cryptology 2024, Issue 1

  8. Succinct Verification of Compressed Sigma Protocols in the Updatable SRS setting
    Moumita Dutta, Chaya Ganesh, Neha Jawalkar
    PKC 2024

  9. Rinocchio: SNARKs for Ring Arithmetic
    Chaya Ganesh, Anca Nitulescu, Eduardo Soria-Vazquez
    Journal of Cryptology 2023

  10. Impossibilities in Succinct Arguments: Black-box Extraction and More
    Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim
    Africacrypt 2023

  11. Witness-Succinct Universally-Composable SNARKs
    Chaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi
    Eurocrypt 2023

  12. Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge
    Suvradip Chakraborty, Chaya Ganesh, Pratik Sarkar
    Eurocrypt 2023

  13. Dew: Transparent Constant-sized zkSNARKs
    Arasu Arun, Chaya Ganesh, Satya Lokam, Tushar Mopuri, Sriram Sridhar
    PKC 2023

  14. Secure Auctions in the Presence of Rational Adversaries
    Chaya Ganesh, Bhavana Kanukurthi, Girisha Shankar
    ACM CCS 2022

  15. What Makes Fiat-Shamir zkSNARKs (Updatable SRS) Simulation Extractable?
    Chaya Ganesh, Hamidreza Khoshakhlagh, Markulf Kohlweiss, Anca Nitulescu, Michal Zajac
    SCN 2022

  16. NIWI and New Notions of Extraction for Algebraic Languages
    Chaya Ganesh, Hamidreza Khoshakhlagh, Roberto Parisella
    SCN 2022

  17. Fiat–Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model)
    Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi
    Eurocrypt 2022

  18. ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines
    Diego F. Aranha, Emil Madsen Bennedsen, Matteo Campanelli, Chaya Ganesh, Claudio Orlandi, Akira Takahashi
    PKC 2022

  19. Achieving Almost All Blockchain Functionalities with Polylogarithmic Storage (*)
    Parikshit Hegde, Robert Streit, Yanni Georghiades, Chaya Ganesh, Sriram Vishwanath
    FC 2022

  20. Reverse Firewalls for Adaptively Secure MPC without Setup
    Suvradip Chakraborty, Chaya Ganesh, Mahak Pancholi and Pratik Sarkar
    Asiacrypt 2021

  21. Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies
    Chaya Ganesh, Claudio Orlandi, Daniel Tschudi, Aviv Zohar
    CBT 2021

  22. Fairness in the Eyes of the Data: Certifying Machine-Learning Models (*)
    Shahar Segal, Yossi Adi, Benny Pinkas, Carsten Baum, Chaya Ganesh, Joseph Keshet
    AAAI/ACM Conference on Artificial Intelligence, Ethics and Society, 2021

  23. Balancing Privacy and Accountability in Blockchain Identity Management
    Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh, Claudio Orlandi, Luisa Siniscalchi
    CT-RSA 2021

  24. Optimal Extension Protocols for Byzantine Broadcast and Agreement
    Chaya Ganesh, Arpita Patra
    Distributed Computing 2020

  25. Cryptographic Reverse Firewalls for Interactive Proof Systems
    Chaya Ganesh, Bernardo Magri, Daniele Venturi
    ICALP 2020

  26. Proofs of Replicated Storage without Timing Assumptions
    Ivan Damgård, Chaya Ganesh, Claudio Orlandi
    Crypto 2019

  27. Proof-of-Stake Protocols for Privacy-Aware Blockchains
    Chaya Ganesh, Claudio Orlandi, Daniel Tschudi
    Eurocrypt 2019

  28. Non-Interactive Zero-Knowledge Proofs for Composite Statements
    Shashank Agrawal, Chaya Ganesh, Payman Mohassel
    CRYPTO 2018

  29. Efficient Adaptively Secure Zero-knowledge from Garbled Circuits
    Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar
    PKC 2018

  30. Hashing Garbled Circuits for Free
    Xiong Fan, Chaya Ganesh, Vladimir Kolesnikov
    Eurocrypt 2017

  31. Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
    Melissa Chase, Chaya Ganesh, Payman Mohassel
    CRYPTO 2016

  32. Broadcast Extensions with Optimal Communication and Round Complexity
    [Full version]
    Chaya Ganesh, Arpita Patra
    PODC 2016

  33. A Formal Treatment of Backdoored Pseudorandom Generators
    Yevgeniy Dodis, Chaya Ganesh, Alexander Golovnev, Ari Juels, Thomas Ristenpart
    Eurocrypt 2015

  34. On-Line/Off-Line Leakage Resilient Secure Computation Protocols
    Chaya Ganesh, Vipul Goyal, Satya Lokam
    Indocrypt 2012

  35. Communication Complexity of Efficient Two-party Computation Protocols
    Chaya Ganesh, C. Pandurangan
    WISTP 2012

Teaching

Cryptography: Fall 2023 (co-taught with Arpita Patra ), Fall 2022 (co-taught with Sanjit Chatterjee), Fall 2021 (co-taught with Arpita Patra), Fall 2020 (co-taught with Arpita Patra)

Proof Systems in Cryptography: Spring 2024, Spring 2023, Spring 2022, Spring 2021

Advising

Current students:
  • PhD: Adarsh Abraham Basumata, Soumya Kanti Saha, Girisha B Shankar (Joint with Bhavana Kanukurthi), Moumita Dutta (Joint with Arpita Patra)

Graduated students:
  • Suvankar Sur (MTech Research)
  • Siddharth Agarwal (MTech Research, jointly advised with Bhavana Kanukurthi) ( --> PhD student at University of Toronto)

Contact

Computer Science and Automation
Indian Institute of Science
Office 334, CSA
IISc, Bengaluru 560012
Email: chaya [at] iisc [dot] ac [dot] in

Thanks

My research is being and/or has been funded, in part, due to generous awards: a start-up grant from the Indian Institute of Science, a SERB Core Research Grant, IBM Academic award , Google India Research Award , Intel Rising Star Faculty Award , Infosys Young Investigator Award, Protocol Labs Research Grant.