On-Line/Off-Line Leakage Resilient Secure Computation Protocols. - Chaya Ganesh; Vipul Goyal; Satyanarayana V. Lokam (INDOCRYPT, 2012)

Optimal Parameters for Efficient Two-Party Computation Protocols. - Chaya Ganesh; C. Pandu Rangan (WISTP, 2012)

Broadcast Extensions with Optimal Communication and Round Complexity. - Chaya Ganesh; Arpita Patra (PODC, 2016)

Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials. - Melissa Chase; Chaya Ganesh; Payman Mohassel (IACR Cryptol. ePrint Arch., 2016)

A Formal Treatment of Backdoored Pseudorandom Generators. - Yevgeniy Dodis; Chaya Ganesh; Alexander Golovnev; Ari Juels; Thomas Ristenpart (IACR Cryptol. ePrint Arch., 2016)

Hashing Garbled Circuits for Free. - Xiong Fan; Chaya Ganesh; Vladimir Kolesnikov (IACR Cryptol. ePrint Arch., 2017)

Zero-knowledge Proofs: Efficient Techniques for Combination Statements and their Applications. - Chaya Ganesh (2017)

Non-Interactive Zero-Knowledge Proofs for Composite Statements. - Shashank Agrawal; Chaya Ganesh; Payman Mohassel (IACR Cryptol. ePrint Arch., 2018)

Proofs of Replicated Storage Without Timing Assumptions. - Ivan Damgård; Chaya Ganesh; Claudio Orlandi (IACR Cryptol. ePrint Arch., 2018)

Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. - Chaya Ganesh; Yashvanth Kondi; Arpita Patra; Pratik Sarkar (IACR Cryptol. ePrint Arch., 2018)

Proof-of-Stake Protocols for Privacy-Aware Blockchains. - Chaya Ganesh; Claudio Orlandi; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2018)

Balancing Privacy and Accountability in Blockchain Transactions. - Ivan Damgård; Chaya Ganesh; Hamidreza Khoshakhlagh; Claudio Orlandi; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2020)

Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. - Chaya Ganesh; Claudio Orlandi; Daniel Tschudi; Aviv Zohar (IACR Cryptol. ePrint Arch., 2020)

Fairness in the Eyes of the Data: Certifying Machine-Learning Models. - Shahar Segal; Yossi Adi; Benny Pinkas; Carsten Baum; Chaya Ganesh; Joseph Keshet (AIES, 2021)

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

Optimal extension protocols for byzantine broadcast and agreement. - Chaya Ganesh; Arpita Patra (Distributed Comput., 2021)

ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines. - Diego F. Aranha; Emil Madsen Bennedsen; Matteo Campanelli; Chaya Ganesh; Claudio Orlandi; Akira Takahashi 002 (IACR Cryptol. ePrint Arch., 2021)

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)

Cryptographic reverse firewalls for interactive proof systems. - Chaya Ganesh; Bernardo Magri; Daniele Venturi 001 (Theor. Comput. Sci., 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)

Achieving Almost All Blockchain Functionalities with Polylogarithmic Storage. - Parikshit Hegde; Robert Streit; Yanni Georghiades; Chaya Ganesh; Sriram Vishwanath (Financial Cryptography, 2022)

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

Dew: Transparent Constant-sized zkSNARKs. - Arasu Arun; Chaya Ganesh; Satya V. Lokam; Tushar Mopuri; Sriram Sridhar 001 (IACR Cryptol. ePrint Arch., 2022)

Impossibilities in Succinct Arguments: Black-box Extraction and More. - Matteo Campanelli; Chaya Ganesh; Hamidreza Khoshakhlagh; Janno Siim (IACR Cryptol. ePrint Arch., 2022)

Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge. - Suvradip Chakraborty; Chaya Ganesh; Pratik Sarkar (IACR Cryptol. ePrint Arch., 2022)

Compute, but Verify: Efficient Multiparty Computation over Authenticated Inputs. - Moumita Dutta; Chaya Ganesh; Sikhar Patranabis; Nitin Singh (IACR Cryptol. ePrint Arch., 2022)

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

NIWI and New Notions of Extraction for Algebraic Languages. - Chaya Ganesh; Hamidreza Khoshakhlagh; Roberto Parisella (IACR Cryptol. ePrint Arch., 2022)

Secure Auctions in the Presence of Rational Adversaries. - Chaya Ganesh; Bhavana Kanukurthi; Girisha Shankar (IACR Cryptol. ePrint Arch., 2022)

Dew: A Transparent Constant-Sized Polynomial Commitment Scheme. - Arasu Arun; Chaya Ganesh; Satya V. Lokam; Tushar Mopuri; Sriram Sridhar 001 (Public Key Cryptography (2), 2023)

Rinocchio: SNARKs for Ring Arithmetic. - Chaya Ganesh; Anca Nitulescu; Eduardo Soria-Vazquez (J. Cryptol., 2023)

How to Make Rational Arguments Practical and Extractable. - Matteo Campanelli; Chaya Ganesh; Rosario Gennaro (IACR Commun. Cryptol., 2024)

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 (IACR Cryptol. ePrint Arch., 2024)

Succinct Verification of Compressed Sigma Protocols in the Updatable SRS setting. - Moumita Dutta; Chaya Ganesh; Neha Jawalkar (IACR Cryptol. ePrint Arch., 2024)

Batching-Efficient RAM using Updatable Lookup Arguments. - Moumita Dutta; Chaya Ganesh; Sikhar Patranabis; Shubh Prakash; Nitin Singh (IACR Cryptol. ePrint Arch., 2024)

Secure Vickrey Auctions with Rational Parties. - Chaya Ganesh; Shreyas Gupta; Bhavana Kanukurthi; Girisha Shankar (IACR Cryptol. ePrint Arch., 2024)

Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs. - Chaya Ganesh; Vineet Nair; Ashish Sharma (IACR Cryptol. ePrint Arch., 2024)

GAPP: Generic Aggregation of Polynomial Protocols. - Chaya Ganesh; Sikhar Patranabis; Shubh Prakash; Nitin Singh (IACR Cryptol. ePrint Arch., 2024)

Samaritan: Linear-time Prover SNARK from New Multilinear Polynomial Commitments. - Chaya Ganesh; Sikhar Patranabis; Nitin Singh (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)