Chethan Kamath


CP370, Blavatnik School of Computer Science, Tel Aviv University
E-mail: ckamath at protonmail dot com
PGP Key (identity: e-mail address)







Short Bio

I am a post-doc at Tel Aviv University, hosted by Nir Bitansky and Omer Paneth and supported by an Azrieli fellowship.

Research Interests

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

Publications

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


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


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


  4. 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] [Talk by Guillermo]


  5. 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] [Talk by Veronika]


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


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


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


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


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


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


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


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


  14. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model
    with Joël Alwen, Binyi Chen, Vladimir Kolmogorov, Krzysztof Pietrzak and Stefano Tessaro
    Eurocrypt 2016
    [Synopsis] [Paper] [Talk by Binyi]


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


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


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


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


External Reviews

Internships/Visits

Misc.