Chethan Kamath


Display Picture
E-mail: ckamath at protonmail dot com

I will be joining the CSE department at IITB as an assistant professor in Spring'24!

My primary field of research is cryptography, particularly its foundations. But my interests extend beyond to computational complexity theory and theoretical computer science in general.


Prior positions

Internships/Short-term visits

Publications

  1. (Verifiable) Delay Functions from Lucas Sequences
    with Charlotte Hoffmann, Pavel Hubáček and Tomáš Krňák
    TCC 2023, to appear
    [Synopsis] [Paper]

  2. Batch Proofs are Statistically Hiding
    with Nir Bitansky, Omer Paneth, Ron Rothblum and Prashant Nalini Vasudevan
    Preprint, 2023
    [Synopsis] [Paper] [Slides] [Talk by Prashant]

  3. Certifying Giant Nonprimes
    with Charlotte Hoffman, Pavel Hubáček and Krzysztof Pietrzak
    PKC 2023
    [Synopsis] [Paper] [Slides by Charlotte] [Talk by Charlotte]

  4. PPAD is as Hard as LWE and Iterated Squaring
    with Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Alex Lombardi, Omer Paneth and Ron Rothblum
    TCC 2022
    [Synopsis] [Paper] [Slides] [Talk]

  5. Practical Statistically-Sound Proofs of Exponentiation in Any Group
    with Charlotte Hoffman, Pavel Hubáček, Karen Klein and Krzysztof Pietrzak
    Crypto 2022
    [Synopsis] [Paper] [Slides by Charlotte] [Talk by Charlotte]

  6. Limits on the Adaptive Security of Yao’s Garbling
    with Karen Klein, Krzysztof Pietrzak and Daniel Wichs
    Crypto 2021
    [Synopsis] [Paper] [Slides by Karen] [Talk by Karen]

  7. On Treewidth, Separators and Yao’s Garbling
    with Karen Klein and Krzysztof Pietrzak
    TCC 2021
    [Synopsis] [Paper] [Slides] [Talk]

  8. On the Cost of Adaptivity in Security Games on Graphs
    with Karen Klein, Krzysztof Pietrzak and Michael Walter
    TCC 2021
    [Synopsis] [Paper] [Slides by Karen] [Talk by Karen]

  9. Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Group Key Agreement Protocol
    with Joël Alwen, Margarita Capretto, Miguel Cueto, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak and Michael Walter
    S&P 2021
    [Synopsis] [Paper] [Slides by Guillermo] [Talk by Guillermo]

  10. On Average-Case Hardness in TFNP from One-Way Functions
    with Pavel Hubáček, Karel Král and Veronika Slívová
    TCC 2020
    [Synopsis] [Paper] [Slides by Veronika] [Talk by Veronika]

  11. Finding a Nash Equilibrium is no Easier than Breaking Fiat-Shamir
    with Arka Rai Choudhuri, Pavel Hubáček, Krzysztof Pietrzak, Alon Rosen and Guy Rothblum
    STOC 2019
    [Synopsis] [Paper] [Slides] [Talk by Alon]

  12. PPAD-Hardness via Iterated Squaring Modulo a Composite
    with Arka Rai Choudhuri, Pavel Hubáček, Krzysztof Pietrzak, Alon Rosen and Guy Rothblum
    Preprint 2019
    [Synopsis] [Paper]

  13. Reversible Proofs of Sequential Work
    with Hamza Abusalah, Karen Klein, Krzysztof Pietrzak and Michael Walter
    Eurocrypt 2019
    [Synopsis] [Paper] [Talk by Hamza]

  14. Adaptively-Secure Proxy Re-encryption
    with Georg Fuchsbauer, Karen Klein and Krzysztof Pietrzak
    PKC 2019
    [Synopsis] [Paper]

  15. On the Memory-Hardness of Data-Independent Password-Hashing Functions
    with Joël Alwen, Peter Gaži, Karen Klein, Georg Osang, Krzysztof Pietrzak, Leonid Reyzin, Michal Rolínek and Michal Rybár
    AsiaCCS 2018
    [Synopsis] [Paper]

  16. Private Set-Intersection with Common Set-up
    with Sanjit Chatterjee and Vikas Kumar
    AIMC 2018, 12(1)
    [Synopsis] [Paper]

  17. Be Adaptive, Avoid Overcommitting
    with Zahra Jafargholi, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak and Daniel Wichs
    Crypto 2017
    [Synopsis] [Paper] [Slides by Ilan] [Talk by Ilan]

  18. Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
    with Georg Fuchsbauer, Christian Hanser and Daniel Slamanig
    SCN 2016
    [Synopsis] [Paper] [Slides]

  19. A Closer Look at Multiple-Forking: Leveraging (In)dependence for a Tighter Bound
    with Sanjit Chatterjee
    Algorithmica 2016, 74(4)
    [Synopsis] [Paper] [Slides]

  20. From Selective-ID to Full-ID IBS without Random Oracles
    with Sanjit Chatterjee
    SPACE 2013
    [Synopsis] [Paper] [Slides]

  21. Galindo-Garcia IBS, Improved
    with Sanjit Chatterjee
    Preprint, 2012
    [Synopsis] [Paper]

  22. Galindo-Garcia IBS, Revisited
    with Sanjit Chatterjee and Vikas Kumar
    ICISC 2012
    [Synopsis] [Paper] [Slides]

Theses

  • On the Average-Case Hardness of Total Search Problems
    PhD Thesis, 2020
    [PDF] [Slides]
  • Constructing Provably Secure Identity-Based Signature Schemes
    Master's Thesis, 2015
    [PDF] [Slides]

PCs

External Reviews

  • ACNS 2017
  • Asiacrypt 2014, 2016
  • Crypto 2017-21, 2023
  • Eurocrypt 2016-18, 2021, 2023-24
  • ICITS 2017
  • ITCS 2020, 2022-23
  • IWSEC 2012
  • MFCS 2020
  • ProvSec 2014
  • STOC 2020, 2023
  • TCC 2016-B, 2017, 2020, 2022

Teaching

  • Undergraduate Cryptography (TU Wien), TA: Fall 2018 and 2019