Chaya Ganesh

Orcid: 0000-0002-2909-9177

According to our database1, Chaya Ganesh authored at least 35 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Succinct Verification of Compressed Sigma Protocols in the Updatable SRS setting.
IACR Cryptol. ePrint Arch., 2024

2023
Rinocchio: SNARKs for Ring Arithmetic.
J. Cryptol., October, 2023

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

How to Make Rational Arguments Practical and Extractable.
IACR Cryptol. ePrint Arch., 2023

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

2022
Secure Auctions in the Presence of Rational Adversaries.
IACR Cryptol. ePrint Arch., 2022

NIWI and New Notions of Extraction for Algebraic Languages.
IACR Cryptol. ePrint Arch., 2022

Witness-Succinct Universally-Composable SNARKs.
IACR Cryptol. ePrint Arch., 2022

Compute, but Verify: Efficient Multiparty Computation over Authenticated Inputs.
IACR Cryptol. ePrint Arch., 2022

Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2022

Impossibilities in Succinct Arguments: Black-box Extraction and More.
IACR Cryptol. ePrint Arch., 2022

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

What Makes Fiat-Shamir zkSNARKs (Updatable SRS) Simulation Extractable?
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 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

2021
Cryptographic reverse firewalls for interactive proof systems.
Theor. Comput. Sci., 2021

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

Reverse Firewalls for Adaptively Secure MPC without Setup.
IACR Cryptol. ePrint Arch., 2021

ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines.
IACR Cryptol. ePrint Arch., 2021

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

Balancing Privacy and Accountability in Blockchain Identity Management.
Proceedings of the Topics in Cryptology - CT-RSA 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
Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2020

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

2018
Proof-of-Stake Protocols for Privacy-Aware Blockchains.
IACR Cryptol. ePrint Arch., 2018

Efficient Adaptively Secure Zero-knowledge from Garbled Circuits.
IACR Cryptol. ePrint Arch., 2018

Proofs of Replicated Storage Without Timing Assumptions.
IACR Cryptol. ePrint Arch., 2018

Non-Interactive Zero-Knowledge Proofs for Composite Statements.
IACR Cryptol. ePrint Arch., 2018

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

Hashing Garbled Circuits for Free.
IACR Cryptol. ePrint Arch., 2017

2016
A Formal Treatment of Backdoored Pseudorandom Generators.
IACR Cryptol. ePrint Arch., 2016

Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials.
IACR Cryptol. ePrint Arch., 2016

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

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...