default search action
Chaya Ganesh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Matteo Campanelli
, Chaya Ganesh
How to Make Rational Arguments Practical and Extractable. IACR Commun. Cryptol. 1(1): 19 (2024) - [c29]Chaya Ganesh, Vineet Nair, Ashish Sharma:
Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs. CCS 2024: 884-898 - [c28]Chaya Ganesh, Shreyas Gupta, Bhavana Kanukurthi, Girisha Shankar:
Secure Vickrey Auctions with Rational Parties. CCS 2024: 4062-4076 - [c27]Moumita Dutta, Chaya Ganesh, Sikhar Patranabis, Shubh Prakash, Nitin Singh:
Batching-Efficient RAM using Updatable Lookup Arguments. CCS 2024: 4077-4091 - [c26]Moumita Dutta, Chaya Ganesh
Succinct Verification of Compressed Sigma Protocols in the Updatable SRS Setting. Public Key Cryptography (2) 2024: 305-336 - [i32]Moumita Dutta, Chaya Ganesh, Neha Jawalkar:
Succinct Verification of Compressed Sigma Protocols in the Updatable SRS setting. IACR Cryptol. ePrint Arch. 2024: 75 (2024) - [i31]Moumita Dutta, Chaya Ganesh, Sikhar Patranabis, Shubh Prakash, Nitin Singh:
Batching-Efficient RAM using Updatable Lookup Arguments. IACR Cryptol. ePrint Arch. 2024: 840 (2024) - [i30]Chaya Ganesh, Vineet Nair, Ashish Sharma:
Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs. IACR Cryptol. ePrint Arch. 2024: 943 (2024) - [i29]Chaya Ganesh, Shreyas Gupta, Bhavana Kanukurthi, Girisha Shankar:
Secure Vickrey Auctions with Rational Parties. IACR Cryptol. ePrint Arch. 2024: 1011 (2024) - [i28]Chaya Ganesh, Sikhar Patranabis, Shubh Prakash, Nitin Singh:
GAPP: Generic Aggregation of Polynomial Protocols. IACR Cryptol. ePrint Arch. 2024: 1685 (2024) - [i27]Megan Chen, Pousali Dey, Chaya Ganesh, Pratyay Mukherjee, Pratik Sarkar, Swagata Sasmal:
Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler. IACR Cryptol. ePrint Arch. 2024: 1713 (2024) - 2023
- [j3]Chaya Ganesh, Anca Nitulescu, Eduardo Soria-Vazquez
Rinocchio: SNARKs for Ring Arithmetic. J. Cryptol. 36(4): 41 (2023) - [c25]Matteo Campanelli
Impossibilities in Succinct Arguments: Black-Box Extraction and More. AFRICACRYPT 2023: 465-489 - [c24]Suvradip Chakraborty, Chaya Ganesh, Pratik Sarkar:
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge. EUROCRYPT (1) 2023: 239-270 - [c23]Chaya Ganesh
Witness-Succinct Universally-Composable SNARKs. EUROCRYPT (2) 2023: 315-346 - [c22]Arasu Arun, Chaya Ganesh, Satya V. Lokam, Tushar Mopuri, Sriram Sridhar
Dew: A Transparent Constant-Sized Polynomial Commitment Scheme. Public Key Cryptography (2) 2023: 542-571 - [i26]Chaya Ganesh, Claudio Orlandi, Mahak Pancholi
Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model). IACR Cryptol. ePrint Arch. 2023: 147 (2023) - [i25]Matteo Campanelli, Chaya Ganesh, Rosario Gennaro:
How to Make Rational Arguments Practical and Extractable. IACR Cryptol. ePrint Arch. 2023: 1966 (2023) - 2022
- [c21]Chaya Ganesh, Bhavana Kanukurthi, Girisha Shankar:
Secure Auctions in the Presence of Rational Adversaries. CCS 2022: 1173-1186 - [c20]Chaya Ganesh
Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). EUROCRYPT (2) 2022: 397-426 - [c19]Parikshit Hegde, Robert Streit, Yanni Georghiades, Chaya Ganesh, Sriram Vishwanath:
Achieving Almost All Blockchain Functionalities with Polylogarithmic Storage. Financial Cryptography 2022: 642-660 - [c18]Diego F. Aranha
ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. Public Key Cryptography (1) 2022: 584-614 - [c17]Chaya Ganesh
NIWI and New Notions of Extraction for Algebraic Languages. SCN 2022: 687-710 - [c16]Chaya Ganesh
What Makes Fiat-Shamir zkSNARKs (Updatable SRS) Simulation Extractable? SCN 2022: 735-760 - [i24]Parikshit Hegde, Robert Streit, Yanni Georghiades, Chaya Ganesh, Sriram Vishwanath:
Achieving Almost All Blockchain Functionalities with Polylogarithmic Storage. CoRR abs/2207.05869 (2022) - [i23]Arasu Arun, Chaya Ganesh, Satya V. Lokam, Tushar Mopuri, Sriram Sridhar
Dew: Transparent Constant-sized zkSNARKs. IACR Cryptol. ePrint Arch. 2022: 419 (2022) - [i22]Matteo Campanelli, Chaya Ganesh, Hamidreza Khoshakhlagh, Janno Siim:
Impossibilities in Succinct Arguments: Black-box Extraction and More. IACR Cryptol. ePrint Arch. 2022: 638 (2022) - [i21]Chaya Ganesh, Hamidreza Khoshakhlagh, Roberto Parisella:
NIWI and New Notions of Extraction for Algebraic Languages. IACR Cryptol. ePrint Arch. 2022: 851 (2022) - [i20]Suvradip Chakraborty, Chaya Ganesh, Pratik Sarkar:
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge. IACR Cryptol. ePrint Arch. 2022: 1535 (2022) - [i19]Chaya Ganesh, Bhavana Kanukurthi, Girisha Shankar:
Secure Auctions in the Presence of Rational Adversaries. IACR Cryptol. ePrint Arch. 2022: 1541 (2022) - [i18]Chaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi:
Witness-Succinct Universally-Composable SNARKs. IACR Cryptol. ePrint Arch. 2022: 1618 (2022) - [i17]Moumita Dutta, Chaya Ganesh, Sikhar Patranabis, Nitin Singh:
Compute, but Verify: Efficient Multiparty Computation over Authenticated Inputs. IACR Cryptol. ePrint Arch. 2022: 1648 (2022) - 2021
- [j2]Chaya Ganesh, Arpita Patra
Optimal extension protocols for byzantine broadcast and agreement. Distributed Comput. 34(1): 59-77 (2021) - [j1]Chaya Ganesh, Bernardo Magri, Daniele Venturi:
Cryptographic reverse firewalls for interactive proof systems. Theor. Comput. Sci. 855: 104-132 (2021) - [c15]Shahar Segal, Yossi Adi, Benny Pinkas, Carsten Baum
Fairness in the Eyes of the Data: Certifying Machine-Learning Models. AIES 2021: 926-935 - [c14]Suvradip Chakraborty, Chaya Ganesh, Mahak Pancholi
Reverse Firewalls for Adaptively Secure MPC Without Setup. ASIACRYPT (2) 2021: 335-364 - [c13]Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh
Balancing Privacy and Accountability in Blockchain Identity Management. CT-RSA 2021: 552-576 - [c12]Chaya Ganesh, Claudio Orlandi, Daniel Tschudi, Aviv Zohar:
Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. DPM/CBT@ESORICS 2021: 173-191 - [i16]Chaya Ganesh, Anca Nitulescu, Eduardo Soria-Vazquez:
Rinocchio: SNARKs for Ring Arithmetic. IACR Cryptol. ePrint Arch. 2021: 322 (2021) - [i15]Diego F. Aranha, Emil Madsen Bennedsen, Matteo Campanelli, Chaya Ganesh, Claudio Orlandi, Akira Takahashi:
ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines. IACR Cryptol. ePrint Arch. 2021: 934 (2021) - [i14]Suvradip Chakraborty, Chaya Ganesh, Mahak Pancholi, Pratik Sarkar:
Reverse Firewalls for Adaptively Secure MPC without Setup. IACR Cryptol. ePrint Arch. 2021: 1262 (2021) - [i13]Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi:
Fiatâ€"Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). IACR Cryptol. ePrint Arch. 2021: 1393 (2021) - 2020
- [c11]Chaya Ganesh, Bernardo Magri, Daniele Venturi:
Cryptographic Reverse Firewalls for Interactive Proof Systems. ICALP 2020: 55:1-55:16 - [i12]Shahar Segal, Yossi Adi, Benny Pinkas, Carsten Baum, Chaya Ganesh, Joseph Keshet:
Fairness in the Eyes of the Data: Certifying Machine-Learning Models. CoRR abs/2009.01534 (2020) - [i11]Chaya Ganesh, Bernardo Magri, Daniele Venturi:
Cryptographic Reverse Firewalls for Interactive Proof Systems. IACR Cryptol. ePrint Arch. 2020: 204 (2020) - [i10]Chaya Ganesh, Claudio Orlandi, Daniel Tschudi, Aviv Zohar:
Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. IACR Cryptol. ePrint Arch. 2020: 791 (2020) - [i9]Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh, Claudio Orlandi, Luisa Siniscalchi:
Balancing Privacy and Accountability in Blockchain Transactions. IACR Cryptol. ePrint Arch. 2020: 1511 (2020)
2010 – 2019
- 2019
- [c10]Ivan Damgård, Chaya Ganesh, Claudio Orlandi
Proofs of Replicated Storage Without Timing Assumptions. CRYPTO (1) 2019: 355-380 - [c9]Chaya Ganesh, Claudio Orlandi
Proof-of-Stake Protocols for Privacy-Aware Blockchains. EUROCRYPT (1) 2019: 690-719 - 2018
- [c8]Shashank Agrawal, Chaya Ganesh, Payman Mohassel:
Non-Interactive Zero-Knowledge Proofs for Composite Statements. CRYPTO (3) 2018: 643-673 - [c7]Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar:
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits. Public Key Cryptography (2) 2018: 499-529 - [i8]Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar:
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. IACR Cryptol. ePrint Arch. 2018: 43 (2018) - [i7]Shashank Agrawal, Chaya Ganesh, Payman Mohassel:
Non-Interactive Zero-Knowledge Proofs for Composite Statements. IACR Cryptol. ePrint Arch. 2018: 557 (2018) - [i6]Ivan Damgård, Chaya Ganesh, Claudio Orlandi:
Proofs of Replicated Storage Without Timing Assumptions. IACR Cryptol. ePrint Arch. 2018: 654 (2018) - [i5]Chaya Ganesh, Claudio Orlandi, Daniel Tschudi:
Proof-of-Stake Protocols for Privacy-Aware Blockchains. IACR Cryptol. ePrint Arch. 2018: 1105 (2018) - 2017
- [b1]Chaya Ganesh:
Zero-knowledge Proofs: Efficient Techniques for Combination Statements and their Applications. New York University, USA, 2017 - [c6]Xiong Fan, Chaya Ganesh, Vladimir Kolesnikov:
Hashing Garbled Circuits for Free. EUROCRYPT (3) 2017: 456-485 - [i4]Chaya Ganesh, Arpita Patra:
Optimal Extension Protocols for Byzantine Broadcast and Agreement. IACR Cryptol. ePrint Arch. 2017: 63 (2017) - [i3]Xiong Fan, Chaya Ganesh, Vladimir Kolesnikov:
Hashing Garbled Circuits for Free. IACR Cryptol. ePrint Arch. 2017: 135 (2017) - 2016
- [c5]Melissa Chase, Chaya Ganesh, Payman Mohassel:
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials. CRYPTO (3) 2016: 499-530 - [c4]Chaya Ganesh, Arpita Patra:
Broadcast Extensions with Optimal Communication and Round Complexity. PODC 2016: 371-380 - [i2]Yevgeniy Dodis, Chaya Ganesh, Alexander Golovnev, Ari Juels, Thomas Ristenpart:
A Formal Treatment of Backdoored Pseudorandom Generators. IACR Cryptol. ePrint Arch. 2016: 306 (2016) - [i1]Melissa Chase, Chaya Ganesh, Payman Mohassel:
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials. IACR Cryptol. ePrint Arch. 2016: 583 (2016) - 2015
- [c3]Yevgeniy Dodis, Chaya Ganesh, Alexander Golovnev, Ari Juels, Thomas Ristenpart:
A Formal Treatment of Backdoored Pseudorandom Generators. EUROCRYPT (1) 2015: 101-126 - 2012
- [c2]Chaya Ganesh, Vipul Goyal, Satyanarayana V. Lokam:
On-Line/Off-Line Leakage Resilient Secure Computation Protocols. INDOCRYPT 2012: 100-119 - [c1]Chaya Ganesh, C. Pandu Rangan:
Optimal Parameters for Efficient Two-Party Computation Protocols. WISTP 2012: 128-143
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-11 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: