generated by bibbase.org
  2021 (9)
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, volume 13091, 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\aard, 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, volume 12704, of Lecture Notes in Computer Science, pages 552–576, 2021. Springer
Balancing Privacy and Accountability in Blockchain Identity Management [link]Paper   doi   link   bibtex  
Rinocchio: SNARKs for Ring Arithmetic. Ganesh, C.; Nitulescu, A.; and Soria-Vazquez, E. IACR Cryptol. ePrint Arch.,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.,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.,1262. 2021.
Reverse Firewalls for Adaptively Secure MPC without Setup [link]Paper   link   bibtex  
Fiat\^a\mbox\texteuro"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.,1393. 2021.
Fiat\^a\mbox\texteuro"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, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference), volume 168, 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  
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.,204. 2020.
Cryptographic Reverse Firewalls for Interactive Proof Systems [link]Paper   link   bibtex  
Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies. Ganesh, C.; Orlandi, C.; Tschudi, D.; and Zohar, A. IACR Cryptol. ePrint Arch.,791. 2020.
Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptocurrencies [link]Paper   link   bibtex  
Balancing Privacy and Accountability in Blockchain Transactions. Damg\aard, I.; Ganesh, C.; Khoshakhlagh, H.; Orlandi, C.; and Siniscalchi, L. IACR Cryptol. ePrint Arch.,1511. 2020.
Balancing Privacy and Accountability in Blockchain Transactions [link]Paper   link   bibtex  
  2019 (2)
Proofs of Replicated Storage Without Timing Assumptions. Damg\aard, 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, volume 11692, 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, volume 11476, 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, volume 10993, 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, volume 10770, 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.,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.,557. 2018.
Non-Interactive Zero-Knowledge Proofs for Composite Statements [link]Paper   link   bibtex  
Proofs of Replicated Storage Without Timing Assumptions. Damg\aard, I.; Ganesh, C.; and Orlandi, C. IACR Cryptol. ePrint Arch.,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.,1105. 2018.
Proof-of-Stake Protocols for Privacy-Aware Blockchains [link]Paper   link   bibtex  
  2017 (3)
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, volume 10212, 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.,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.,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, volume 9816, 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.,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.,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, volume 9056, 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, volume 7668, 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, volume 7322, of Lecture Notes in Computer Science, pages 128–143, 2012. Springer
Optimal Parameters for Efficient Two-Party Computation Protocols [link]Paper   doi   link   bibtex