Chaya Ganesh

Orcid: 0000-0002-2909-9177

According to our database1, Chaya Ganesh authored at least 41 papers between 2012 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Samaritan: Linear-time Prover SNARK from New Multilinear Polynomial Commitments.
IACR Cryptol. ePrint Arch., 2025

Universally Composable Non-interactive Zero-Knowledge from Sigma Protocols via a New Straight-Line Compiler.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

2024
GAPP: Generic Aggregation of Polynomial Protocols.
IACR Cryptol. ePrint Arch., 2024

How to Make Rational Arguments Practical and Extractable.
IACR Commun. Cryptol., 2024

Succinct Verification of Compressed Sigma Protocols in the Updatable SRS Setting.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Secure Vickrey Auctions with Rational Parties.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Batching-Efficient RAM using Updatable Lookup Arguments.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

Compute, but Verify: Efficient Multiparty Computation over Authenticated Inputs.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model).
IACR Cryptol. ePrint Arch., 2023

Dew: A Transparent Constant-Sized Polynomial Commitment Scheme.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Witness-Succinct Universally-Composable SNARKs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Impossibilities in Succinct Arguments: Black-Box Extraction and More.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2023, 2023

2022
Dew: Transparent Constant-sized zkSNARKs.
IACR Cryptol. ePrint Arch., 2022

NIWI and New Notions of Extraction for Algebraic Languages.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

What Makes Fiat-Shamir zkSNARKs (Updatable SRS) Simulation Extractable?
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Achieving Almost All Blockchain Functionalities with Polylogarithmic Storage.
Proceedings of the Financial Cryptography and Data Security, 2022

Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model).
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Secure Auctions in the Presence of Rational Adversaries.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Fiatâ€"Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model).
IACR Cryptol. ePrint Arch., 2021

Rinocchio: SNARKs for Ring Arithmetic.
IACR Cryptol. ePrint Arch., 2021

Optimal extension protocols for byzantine broadcast and agreement.
Distributed Comput., 2021

Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies.
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2021

Balancing Privacy and Accountability in Blockchain Identity Management.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

Reverse Firewalls for Adaptively Secure MPC Without Setup.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

Fairness in the Eyes of the Data: Certifying Machine-Learning Models.
Proceedings of the AIES '21: AAAI/ACM Conference on AI, 2021

2020
Balancing Privacy and Accountability in Blockchain Transactions.
IACR Cryptol. ePrint Arch., 2020

Cryptographic Reverse Firewalls for Interactive Proof Systems.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Proof-of-Stake Protocols for Privacy-Aware Blockchains.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Proofs of Replicated Storage Without Timing Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Non-Interactive Zero-Knowledge Proofs for Composite Statements.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Zero-knowledge Proofs: Efficient Techniques for Combination Statements and their Applications.
PhD thesis, 2017

Hashing Garbled Circuits for Free.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
Broadcast Extensions with Optimal Communication and Round Complexity.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
A Formal Treatment of Backdoored Pseudorandom Generators.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2012
Optimal Parameters for Efficient Two-Party Computation Protocols.
Proceedings of the Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems, 2012

On-Line/Off-Line Leakage Resilient Secure Computation Protocols.
Proceedings of the Progress in Cryptology, 2012


  Loading...