generated by bibbase.org
  2025 (4)
Fiat-Shamir Bulletproofs are Non-malleable (in the Random Oracle Model). Ganesh, C.; Orlandi, C.; Pancholi, M.; Takahashi, A.; and Tschudi, D. J. Cryptol., 38(1): 11. 2025.
Fiat-Shamir Bulletproofs are Non-malleable (in the Random Oracle Model) [link]Paper   doi   link   bibtex  
Samaritan: Linear-Time Prover SNARK from New Multilinear Polynomial Commitments. Ganesh, C.; Patranabis, S.; and Singh, N. In Hanaoka, G.; and Yang, B., editor(s), Advances in Cryptology - ASIACRYPT 2025 - 31st International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, VIC, Australia, December 8-12, 2025, Proceedings, Part V, of Lecture Notes in Computer Science, pages 456–489, 2025. Springer
Samaritan: Linear-Time Prover SNARK from New Multilinear Polynomial Commitments [link]Paper   doi   link   bibtex  
Universally Composable Non-interactive Zero-Knowledge from Sigma Protocols via a New Straight-Line Compiler. Chen, M.; Dey, P.; Ganesh, C.; Mukherjee, P.; Sarkar, P.; and Sasmal, S. In Jager, T.; and Pan, J., editor(s), Public-Key Cryptography - PKC 2025 - 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Røros, Norway, May 12-15, 2025, Proceedings, Part I, of Lecture Notes in Computer Science, pages 381–417, 2025. Springer
Universally Composable Non-interactive Zero-Knowledge from Sigma Protocols via a New Straight-Line Compiler [link]Paper   doi   link   bibtex  
Samaritan: Linear-time Prover SNARK from New Multilinear Polynomial Commitments. Ganesh, C.; Patranabis, S.; and Singh, N. IACR Cryptol. ePrint Arch., 2025: 419. 2025.
Samaritan: Linear-time Prover SNARK from New Multilinear Polynomial Commitments [link]Paper   link   bibtex  
  2024 (12)
How to Make Rational Arguments Practical and Extractable. Campanelli, M.; Ganesh, C.; and Gennaro, R. IACR Commun. Cryptol., 1(1): 19. 2024.
How to Make Rational Arguments Practical and Extractable [link]Paper   doi   link   bibtex  
Compute, but Verify: Efficient Multiparty Computation over Authenticated Inputs. Dutta, M.; Ganesh, C.; Patranabis, S.; and Singh, N. In Chung, K.; and Sasaki, Y., editor(s), Advances in Cryptology - ASIACRYPT 2024 - 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, December 9-13, 2024, Proceedings, Part VI, of Lecture Notes in Computer Science, pages 133–166, 2024. Springer
Compute, but Verify: Efficient Multiparty Computation over Authenticated Inputs [link]Paper   doi   link   bibtex  
Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs. Ganesh, C.; Nair, V.; and Sharma, A. In Luo, B.; Liao, X.; Xu, J.; Kirda, E.; and Lie, D., editor(s), Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, Salt Lake City, UT, USA, October 14-18, 2024, pages 884–898, 2024. ACM
Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs [link]Paper   doi   link   bibtex  
Secure Vickrey Auctions with Rational Parties. Ganesh, C.; Gupta, S.; Kanukurthi, B.; and Shankar, G. In Luo, B.; Liao, X.; Xu, J.; Kirda, E.; and Lie, D., editor(s), Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, Salt Lake City, UT, USA, October 14-18, 2024, pages 4062–4076, 2024. ACM
Secure Vickrey Auctions with Rational Parties [link]Paper   doi   link   bibtex  
Batching-Efficient RAM using Updatable Lookup Arguments. Dutta, M.; Ganesh, C.; Patranabis, S.; Prakash, S.; and Singh, N. In Luo, B.; Liao, X.; Xu, J.; Kirda, E.; and Lie, D., editor(s), Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, Salt Lake City, UT, USA, October 14-18, 2024, pages 4077–4091, 2024. ACM
Batching-Efficient RAM using Updatable Lookup Arguments [link]Paper   doi   link   bibtex  
Succinct Verification of Compressed Sigma Protocols in the Updatable SRS Setting. Dutta, M.; Ganesh, C.; and Jawalkar, N. In Tang, Q.; and Teague, V., editor(s), Public-Key Cryptography - PKC 2024 - 27th IACR International Conference on Practice and Theory of Public-Key Cryptography, Sydney, NSW, Australia, April 15-17, 2024, Proceedings, Part II, of Lecture Notes in Computer Science, pages 305–336, 2024. Springer
Succinct Verification of Compressed Sigma Protocols in the Updatable SRS Setting [link]Paper   doi   link   bibtex  
Succinct Verification of Compressed Sigma Protocols in the Updatable SRS setting. Dutta, M.; Ganesh, C.; and Jawalkar, N. IACR Cryptol. ePrint Arch., 2024: 75. 2024.
Succinct Verification of Compressed Sigma Protocols in the Updatable SRS setting [link]Paper   link   bibtex  
Batching-Efficient RAM using Updatable Lookup Arguments. Dutta, M.; Ganesh, C.; Patranabis, S.; Prakash, S.; and Singh, N. IACR Cryptol. ePrint Arch., 2024: 840. 2024.
Batching-Efficient RAM using Updatable Lookup Arguments [link]Paper   link   bibtex  
Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs. Ganesh, C.; Nair, V.; and Sharma, A. IACR Cryptol. ePrint Arch., 2024: 943. 2024.
Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs [link]Paper   link   bibtex  
Secure Vickrey Auctions with Rational Parties. Ganesh, C.; Gupta, S.; Kanukurthi, B.; and Shankar, G. IACR Cryptol. ePrint Arch., 2024: 1011. 2024.
Secure Vickrey Auctions with Rational Parties [link]Paper   link   bibtex  
GAPP: Generic Aggregation of Polynomial Protocols. Ganesh, C.; Patranabis, S.; Prakash, S.; and Singh, N. IACR Cryptol. ePrint Arch., 2024: 1685. 2024.
GAPP: Generic Aggregation of Polynomial Protocols [link]Paper   link   bibtex  
Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler. Chen, M.; Dey, P.; Ganesh, C.; Mukherjee, P.; Sarkar, P.; and Sasmal, S. IACR Cryptol. ePrint Arch., 2024: 1713. 2024.
Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler [link]Paper   link   bibtex  
  2023 (7)
Rinocchio: SNARKs for Ring Arithmetic. Ganesh, C.; Nitulescu, A.; and Soria-Vazquez, E. J. Cryptol., 36(4): 41. 2023.
Rinocchio: SNARKs for Ring Arithmetic [link]Paper   doi   link   bibtex  
Impossibilities in Succinct Arguments: Black-Box Extraction and More. Campanelli, M.; Ganesh, C.; Khoshakhlagh, H.; and Siim, J. In Mrabet, N. E.; Feo, L. D.; and Duquesne, S., editor(s), Progress in Cryptology - AFRICACRYPT 2023 - 14th International Conference on Cryptology in Africa, Sousse, Tunisia, July 19-21, 2023, Proceedings, of Lecture Notes in Computer Science, pages 465–489, 2023. Springer
Impossibilities in Succinct Arguments: Black-Box Extraction and More [link]Paper   doi   link   bibtex  
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge. Chakraborty, S.; Ganesh, C.; and Sarkar, P. In Hazay, C.; and Stam, M., editor(s), Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part I, of Lecture Notes in Computer Science, pages 239–270, 2023. Springer
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge [link]Paper   doi   link   bibtex  
Witness-Succinct Universally-Composable SNARKs. Ganesh, C.; Kondi, Y.; Orlandi, C.; Pancholi, M.; Takahashi, A.; and Tschudi, D. In Hazay, C.; and Stam, M., editor(s), Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part II, of Lecture Notes in Computer Science, pages 315–346, 2023. Springer
Witness-Succinct Universally-Composable SNARKs [link]Paper   doi   link   bibtex  
Dew: A Transparent Constant-Sized Polynomial Commitment Scheme. Arun, A.; Ganesh, C.; Lokam, S. V.; Mopuri, T.; and Sridhar, S. In Boldyreva, A.; and Kolesnikov, V., editor(s), Public-Key Cryptography - PKC 2023 - 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7-10, 2023, Proceedings, Part II, of Lecture Notes in Computer Science, pages 542–571, 2023. Springer
Dew: A Transparent Constant-Sized Polynomial Commitment Scheme [link]Paper   doi   link   bibtex  
Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model). Ganesh, C.; Orlandi, C.; Pancholi, M.; Takahashi, A.; and Tschudi, D. IACR Cryptol. ePrint Arch., 2023: 147. 2023.
Fiat-Shamir Bulletproofs are Non-Malleable (in the Random Oracle Model) [link]Paper   link   bibtex  
How to Make Rational Arguments Practical and Extractable. Campanelli, M.; Ganesh, C.; and Gennaro, R. IACR Cryptol. ePrint Arch., 2023: 1966. 2023.
How to Make Rational Arguments Practical and Extractable [link]Paper   link   bibtex  
  2022 (14)
Secure Auctions in the Presence of Rational Adversaries. Ganesh, C.; Kanukurthi, B.; and Shankar, G. In Yin, H.; Stavrou, A.; Cremers, C.; and Shi, E., editor(s), Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022, pages 1173–1186, 2022. ACM
Secure Auctions in the Presence of Rational Adversaries [link]Paper   doi   link   bibtex  
Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). Ganesh, C.; Orlandi, C.; Pancholi, M.; Takahashi, A.; and Tschudi, D. In Dunkelman, O.; and Dziembowski, S., editor(s), Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part II, of Lecture Notes in Computer Science, pages 397–426, 2022. Springer
Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model) [link]Paper   doi   link   bibtex  
Achieving Almost All Blockchain Functionalities with Polylogarithmic Storage. Hegde, P.; Streit, R.; Georghiades, Y.; Ganesh, C.; and Vishwanath, S. In Eyal, I.; and Garay, J. A., editor(s), Financial Cryptography and Data Security - 26th International Conference, FC 2022, Grenada, May 2-6, 2022, Revised Selected Papers, of Lecture Notes in Computer Science, pages 642–660, 2022. Springer
Achieving Almost All Blockchain Functionalities with Polylogarithmic Storage [link]Paper   doi   link   bibtex  
ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines. Aranha, D. F.; Bennedsen, E. M.; Campanelli, M.; Ganesh, C.; Orlandi, C.; and Takahashi, A. In Hanaoka, G.; Shikata, J.; and Watanabe, Y., editor(s), Public-Key Cryptography - PKC 2022 - 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8-11, 2022, Proceedings, Part I, of Lecture Notes in Computer Science, pages 584–614, 2022. Springer
ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines [link]Paper   doi   link   bibtex  
NIWI and New Notions of Extraction for Algebraic Languages. Ganesh, C.; Khoshakhlagh, H.; and Parisella, R. In Galdi, C.; and Jarecki, S., editor(s), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Amalfi, Italy, September 12-14, 2022, Proceedings, of Lecture Notes in Computer Science, pages 687–710, 2022. Springer
NIWI and New Notions of Extraction for Algebraic Languages [link]Paper   doi   link   bibtex  
What Makes Fiat-Shamir zkSNARKs (Updatable SRS) Simulation Extractable?. Ganesh, C.; Khoshakhlagh, H.; Kohlweiss, M.; Nitulescu, A.; and Zajac, M. In Galdi, C.; and Jarecki, S., editor(s), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Amalfi, Italy, September 12-14, 2022, Proceedings, of Lecture Notes in Computer Science, pages 735–760, 2022. Springer
What Makes Fiat-Shamir zkSNARKs (Updatable SRS) Simulation Extractable? [link]Paper   doi   link   bibtex  
Achieving Almost All Blockchain Functionalities with Polylogarithmic Storage. Hegde, P.; Streit, R.; Georghiades, Y.; Ganesh, C.; and Vishwanath, S. CoRR, abs/2207.05869. 2022.
Achieving Almost All Blockchain Functionalities with Polylogarithmic Storage [link]Paper   doi   link   bibtex  
Dew: Transparent Constant-sized zkSNARKs. Arun, A.; Ganesh, C.; Lokam, S. V.; Mopuri, T.; and Sridhar, S. IACR Cryptol. ePrint Arch., 2022: 419. 2022.
Dew: Transparent Constant-sized zkSNARKs [link]Paper   link   bibtex  
Impossibilities in Succinct Arguments: Black-box Extraction and More. Campanelli, M.; Ganesh, C.; Khoshakhlagh, H.; and Siim, J. IACR Cryptol. ePrint Arch., 2022: 638. 2022.
Impossibilities in Succinct Arguments: Black-box Extraction and More [link]Paper   link   bibtex  
NIWI and New Notions of Extraction for Algebraic Languages. Ganesh, C.; Khoshakhlagh, H.; and Parisella, R. IACR Cryptol. ePrint Arch., 2022: 851. 2022.
NIWI and New Notions of Extraction for Algebraic Languages [link]Paper   link   bibtex  
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge. Chakraborty, S.; Ganesh, C.; and Sarkar, P. IACR Cryptol. ePrint Arch., 2022: 1535. 2022.
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge [link]Paper   link   bibtex  
Secure Auctions in the Presence of Rational Adversaries. Ganesh, C.; Kanukurthi, B.; and Shankar, G. IACR Cryptol. ePrint Arch., 2022: 1541. 2022.
Secure Auctions in the Presence of Rational Adversaries [link]Paper   link   bibtex  
Witness-Succinct Universally-Composable SNARKs. Ganesh, C.; Kondi, Y.; Orlandi, C.; Pancholi, M.; Takahashi, A.; and Tschudi, D. IACR Cryptol. ePrint Arch., 2022: 1618. 2022.
Witness-Succinct Universally-Composable SNARKs [link]Paper   link   bibtex  
Compute, but Verify: Efficient Multiparty Computation over Authenticated Inputs. Dutta, M.; Ganesh, C.; Patranabis, S.; and Singh, N. IACR Cryptol. ePrint Arch., 2022: 1648. 2022.
Compute, but Verify: Efficient Multiparty Computation over Authenticated Inputs [link]Paper   link   bibtex  
  2021 (10)
Optimal extension protocols for byzantine broadcast and agreement. Ganesh, C.; and Patra, A. Distributed Comput., 34(1): 59–77. 2021.
Optimal extension protocols for byzantine broadcast and agreement [link]Paper   doi   link   bibtex  
Cryptographic reverse firewalls for interactive proof systems. Ganesh, C.; Magri, B.; and Venturi, D. Theor. Comput. Sci., 855: 104–132. 2021.
Cryptographic reverse firewalls for interactive proof systems [link]Paper   doi   link   bibtex  
Fairness in the Eyes of the Data: Certifying Machine-Learning Models. Segal, S.; Adi, Y.; Pinkas, B.; Baum, C.; Ganesh, C.; and Keshet, J. In Fourcade, M.; Kuipers, B.; Lazar, S.; and Mulligan, D. K., editor(s), AIES '21: AAAI/ACM Conference on AI, Ethics, and Society, Virtual Event, USA, May 19-21, 2021, pages 926–935, 2021. ACM
Fairness in the Eyes of the Data: Certifying Machine-Learning Models [link]Paper   doi   link   bibtex  
Reverse Firewalls for Adaptively Secure MPC Without Setup. Chakraborty, S.; Ganesh, C.; Pancholi, M.; and Sarkar, P. In Tibouchi, M.; and Wang, H., editor(s), Advances in Cryptology - ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6-10, 2021, Proceedings, Part II, of Lecture Notes in Computer Science, pages 335–364, 2021. Springer
Reverse Firewalls for Adaptively Secure MPC Without Setup [link]Paper   doi   link   bibtex  
Balancing Privacy and Accountability in Blockchain Identity Management. Damgård, I.; Ganesh, C.; Khoshakhlagh, H.; Orlandi, C.; and Siniscalchi, L. In Paterson, K. G., editor(s), Topics in Cryptology - CT-RSA 2021 - Cryptographers' Track at the RSA Conference 2021, Virtual Event, May 17-20, 2021, Proceedings, of Lecture Notes in Computer Science, pages 552–576, 2021. Springer
Balancing Privacy and Accountability in Blockchain Identity Management [link]Paper   doi   link   bibtex  
Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. Ganesh, C.; Orlandi, C.; Tschudi, D.; and Zohar, A. In García-Alfaro, J.; Muñoz-Tapia, J. L.; Navarro-Arribas, G.; and Soriano, M., editor(s), Data Privacy Management, Cryptocurrencies and Blockchain Technology - ESORICS 2021 International Workshops, DPM 2021 and CBT 2021, Darmstadt, Germany, October 8, 2021, Revised Selected Papers, of Lecture Notes in Computer Science, pages 173–191, 2021. Springer
Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies [link]Paper   doi   link   bibtex  
Rinocchio: SNARKs for Ring Arithmetic. Ganesh, C.; Nitulescu, A.; and Soria-Vazquez, E. IACR Cryptol. ePrint Arch., 2021: 322. 2021.
Rinocchio: SNARKs for Ring Arithmetic [link]Paper   link   bibtex  
ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines. Aranha, D. F.; Bennedsen, E. M.; Campanelli, M.; Ganesh, C.; Orlandi, C.; and Takahashi, A. IACR Cryptol. ePrint Arch., 2021: 934. 2021.
ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines [link]Paper   link   bibtex  
Reverse Firewalls for Adaptively Secure MPC without Setup. Chakraborty, S.; Ganesh, C.; Pancholi, M.; and Sarkar, P. IACR Cryptol. ePrint Arch., 2021: 1262. 2021.
Reverse Firewalls for Adaptively Secure MPC without Setup [link]Paper   link   bibtex  
Fiatâ€"Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model). Ganesh, C.; Orlandi, C.; Pancholi, M.; Takahashi, A.; and Tschudi, D. IACR Cryptol. ePrint Arch., 2021: 1393. 2021.
Fiatâ€"Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model) [link]Paper   link   bibtex  
  2020 (5)
Cryptographic Reverse Firewalls for Interactive Proof Systems. Ganesh, C.; Magri, B.; and Venturi, D. In Czumaj, A.; Dawar, A.; and Merelli, E., editor(s), 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, Saarbrücken, Germany (Virtual Conference), July 8-11, 2020, of LIPIcs, pages 55:1–55:16, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Cryptographic Reverse Firewalls for Interactive Proof Systems [link]Paper   doi   link   bibtex   5 downloads  
Fairness in the Eyes of the Data: Certifying Machine-Learning Models. Segal, S.; Adi, Y.; Pinkas, B.; Baum, C.; Ganesh, C.; and Keshet, J. CoRR, abs/2009.01534. 2020.
Fairness in the Eyes of the Data: Certifying Machine-Learning Models [link]Paper   link   bibtex  
Cryptographic Reverse Firewalls for Interactive Proof Systems. Ganesh, C.; Magri, B.; and Venturi, D. IACR Cryptol. ePrint Arch., 2020: 204. 2020.
Cryptographic Reverse Firewalls for Interactive Proof Systems [link]Paper   link   bibtex   5 downloads  
Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. Ganesh, C.; Orlandi, C.; Tschudi, D.; and Zohar, A. IACR Cryptol. ePrint Arch., 2020: 791. 2020.
Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies [link]Paper   link   bibtex  
Balancing Privacy and Accountability in Blockchain Transactions. Damgård, I.; Ganesh, C.; Khoshakhlagh, H.; Orlandi, C.; and Siniscalchi, L. IACR Cryptol. ePrint Arch., 2020: 1511. 2020.
Balancing Privacy and Accountability in Blockchain Transactions [link]Paper   link   bibtex  
  2019 (2)
Proofs of Replicated Storage Without Timing Assumptions. Damgård, I.; Ganesh, C.; and Orlandi, C. In Boldyreva, A.; and Micciancio, D., editor(s), Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I, of Lecture Notes in Computer Science, pages 355–380, 2019. Springer
Proofs of Replicated Storage Without Timing Assumptions [link]Paper   doi   link   bibtex  
Proof-of-Stake Protocols for Privacy-Aware Blockchains. Ganesh, C.; Orlandi, C.; and Tschudi, D. In Ishai, Y.; and Rijmen, V., editor(s), Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part I, of Lecture Notes in Computer Science, pages 690–719, 2019. Springer
Proof-of-Stake Protocols for Privacy-Aware Blockchains [link]Paper   doi   link   bibtex  
  2018 (6)
Non-Interactive Zero-Knowledge Proofs for Composite Statements. Agrawal, S.; Ganesh, C.; and Mohassel, P. In Shacham, H.; and Boldyreva, A., editor(s), Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part III, of Lecture Notes in Computer Science, pages 643–673, 2018. Springer
Non-Interactive Zero-Knowledge Proofs for Composite Statements [link]Paper   doi   link   bibtex  
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits. Ganesh, C.; Kondi, Y.; Patra, A.; and Sarkar, P. In Abdalla, M.; and Dahab, R., editor(s), Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part II, of Lecture Notes in Computer Science, pages 499–529, 2018. Springer
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits [link]Paper   doi   link   bibtex  
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. Ganesh, C.; Kondi, Y.; Patra, A.; and Sarkar, P. IACR Cryptol. ePrint Arch., 2018: 43. 2018.
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits [link]Paper   link   bibtex  
Non-Interactive Zero-Knowledge Proofs for Composite Statements. Agrawal, S.; Ganesh, C.; and Mohassel, P. IACR Cryptol. ePrint Arch., 2018: 557. 2018.
Non-Interactive Zero-Knowledge Proofs for Composite Statements [link]Paper   link   bibtex  
Proofs of Replicated Storage Without Timing Assumptions. Damgård, I.; Ganesh, C.; and Orlandi, C. IACR Cryptol. ePrint Arch., 2018: 654. 2018.
Proofs of Replicated Storage Without Timing Assumptions [link]Paper   link   bibtex  
Proof-of-Stake Protocols for Privacy-Aware Blockchains. Ganesh, C.; Orlandi, C.; and Tschudi, D. IACR Cryptol. ePrint Arch., 2018: 1105. 2018.
Proof-of-Stake Protocols for Privacy-Aware Blockchains [link]Paper   link   bibtex  
  2017 (4)
Zero-knowledge Proofs: Efficient Techniques for Combination Statements and their Applications. Ganesh, C. Ph.D. Thesis, New York University, USA, 2017.
Zero-knowledge Proofs: Efficient Techniques for Combination Statements and their Applications [pdf]Paper   link   bibtex  
Hashing Garbled Circuits for Free. Fan, X.; Ganesh, C.; and Kolesnikov, V. In Coron, J.; and Nielsen, J. B., editor(s), Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part III, of Lecture Notes in Computer Science, pages 456–485, 2017.
Hashing Garbled Circuits for Free [link]Paper   doi   link   bibtex  
Optimal Extension Protocols for Byzantine Broadcast and Agreement. Ganesh, C.; and Patra, A. IACR Cryptol. ePrint Arch., 2017: 63. 2017.
Optimal Extension Protocols for Byzantine Broadcast and Agreement [link]Paper   link   bibtex  
Hashing Garbled Circuits for Free. Fan, X.; Ganesh, C.; and Kolesnikov, V. IACR Cryptol. ePrint Arch., 2017: 135. 2017.
Hashing Garbled Circuits for Free [link]Paper   link   bibtex  
  2016 (4)
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials. Chase, M.; Ganesh, C.; and Mohassel, P. In Robshaw, M.; and Katz, J., editor(s), Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part III, of Lecture Notes in Computer Science, pages 499–530, 2016. Springer
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials [link]Paper   doi   link   bibtex  
Broadcast Extensions with Optimal Communication and Round Complexity. Ganesh, C.; and Patra, A. In Giakkoupis, G., editor(s), Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016, pages 371–380, 2016. ACM
Broadcast Extensions with Optimal Communication and Round Complexity [link]Paper   doi   link   bibtex  
A Formal Treatment of Backdoored Pseudorandom Generators. Dodis, Y.; Ganesh, C.; Golovnev, A.; Juels, A.; and Ristenpart, T. IACR Cryptol. ePrint Arch., 2016: 306. 2016.
A Formal Treatment of Backdoored Pseudorandom Generators [link]Paper   link   bibtex  
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials. Chase, M.; Ganesh, C.; and Mohassel, P. IACR Cryptol. ePrint Arch., 2016: 583. 2016.
Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials [link]Paper   link   bibtex  
  2015 (1)
A Formal Treatment of Backdoored Pseudorandom Generators. Dodis, Y.; Ganesh, C.; Golovnev, A.; Juels, A.; and Ristenpart, T. In Oswald, E.; and Fischlin, M., editor(s), Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part I, of Lecture Notes in Computer Science, pages 101–126, 2015. Springer
A Formal Treatment of Backdoored Pseudorandom Generators [link]Paper   doi   link   bibtex  
  2012 (2)
On-Line/Off-Line Leakage Resilient Secure Computation Protocols. Ganesh, C.; Goyal, V.; and Lokam, S. V. In Galbraith, S. D.; and Nandi, M., editor(s), Progress in Cryptology - INDOCRYPT 2012, 13th International Conference on Cryptology in India, Kolkata, India, December 9-12, 2012. Proceedings, of Lecture Notes in Computer Science, pages 100–119, 2012. Springer
On-Line/Off-Line Leakage Resilient Secure Computation Protocols [link]Paper   doi   link   bibtex  
Optimal Parameters for Efficient Two-Party Computation Protocols. Ganesh, C.; and Rangan, C. P. In Askoxylakis, I. G.; Pöhls, H. C.; and Posegga, J., editor(s), Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems - 6th IFIP WG 11.2 International Workshop, WISTP 2012, Egham, UK, June 20-22, 2012. Proceedings, of Lecture Notes in Computer Science, pages 128–143, 2012. Springer
Optimal Parameters for Efficient Two-Party Computation Protocols [link]Paper   doi   link   bibtex