Chethan Kamath

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 39

Top Topics

Statistically Significantly

Nash Equilibrium

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan
Batch Proofs Are Statistically Hiding. STOC (2024)
Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan
Batch Proofs are Statistically Hiding. IACR Cryptol. ePrint Arch. 2023 (2023)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak
Certifying Giant Nonprimes. Public Key Cryptography (1) (2023)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak
Certifying Giant Nonprimes. IACR Cryptol. ePrint Arch. 2023 (2023)
Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan
Batch Proofs are Statistically Hiding. Electron. Colloquium Comput. Complex. (2023)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák
(Verifiable) Delay Functions from Lucas Sequences. TCC (4) (2023)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák
(Verifiable) Delay Functions from Lucas Sequences. IACR Cryptol. ePrint Arch. 2023 (2023)
Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum
PPAD is as Hard as LWE and Iterated Squaring. IACR Cryptol. ePrint Arch. 2022 (2022)
Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum
PPAD is as Hard as LWE and Iterated Squaring. TCC (2) (2022)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak
Practical Statistically-Sound Proofs of Exponentiation in Any Group. CRYPTO (2) (2022)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak
Practical Statistically-Sound Proofs of Exponentiation in any Group. IACR Cryptol. ePrint Arch. 2022 (2022)
Chethan Kamath, Karen Klein, Krzysztof Pietrzak
On Treewidth, Separators and Yao's Garbling. IACR Cryptol. ePrint Arch. 2021 (2021)
Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs
Limits on the Adaptive Security of Yao's Garbling. CRYPTO (2) (2021)
Chethan Kamath, Karen Klein, Krzysztof Pietrzak
On Treewidth, Separators and Yao's Garbling. TCC (2) (2021)
Karen Klein, Guillermo Pascual-Perez, Michael Walter, Chethan Kamath, Margarita Capretto, Miguel Cueto, Ilia Markov, Michelle Yeo, Joël Alwen, Krzysztof Pietrzak
Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement. IEEE Symposium on Security and Privacy (2021)
Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter
The Cost of Adaptivity in Security Games on Graphs. TCC (2) (2021)
Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter
On the Cost of Adaptivity in Graph-Based Games. IACR Cryptol. ePrint Arch. 2021 (2021)
Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs
Limits on the Adaptive Security of Yao's Garbling. IACR Cryptol. ePrint Arch. 2021 (2021)
Pavel Hubácek, Chethan Kamath, Karel Král, Veronika Slívová
On Average-Case Hardness in TFNP from One-Way Functions. IACR Cryptol. ePrint Arch. 2020 (2020)
Pavel Hubácek, Chethan Kamath, Karel Král, Veronika Slívová
On Average-Case Hardness in TFNP from One-Way Functions. TCC (3) (2020)
Georg Fuchsbauer, Chethan Kamath, Karen Klein, Krzysztof Pietrzak
Adaptively Secure Proxy Re-encryption. Public Key Cryptography (2) (2019)
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. STOC (2019)
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
PPAD-Hardness via Iterated Squaring Modulo a Composite. IACR Cryptol. ePrint Arch. 2019 (2019)
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. Electron. Colloquium Comput. Complex. 26 (2019)
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. IACR Cryptol. ePrint Arch. 2019 (2019)
Joël Alwen, Margarita Capretto, Miguel Cueto, Chethan Kamath, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter
Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol. IACR Cryptol. ePrint Arch. 2019 (2019)
Hamza Abusalah, Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter
Reversible Proofs of Sequential Work. EUROCRYPT (2) (2019)
Hamza Abusalah, Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter
Reversible Proofs of Sequential Work. IACR Cryptol. ePrint Arch. 2019 (2019)
Joël Alwen, Peter Gazi, Chethan Kamath, Karen Klein, Georg Osang, Krzysztof Pietrzak, Leonid Reyzin, Michal Rolinek, Michal Rybár
On the Memory-Hardness of Data-Independent Password-Hashing Functions. AsiaCCS (2018)
Georg Fuchsbauer, Chethan Kamath, Karen Klein, Krzysztof Pietrzak
Adaptively Secure Proxy Re-encryption. IACR Cryptol. ePrint Arch. 2018 (2018)
Sanjit Chatterjee, Chethan Kamath, Vikas Kumar
Private set-intersection with common set-up. Adv. Math. Commun. 12 (1) (2018)
Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs
Be Adaptive, Avoid Overcommitting. CRYPTO (1) (2017)
Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs
Be Adaptive, Avoid Overcommitting. IACR Cryptol. ePrint Arch. 2017 (2017)
Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. EUROCRYPT (2) (2016)
Georg Fuchsbauer, Christian Hanser, Chethan Kamath, Daniel Slamanig
Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions. IACR Cryptol. ePrint Arch. 2016 (2016)
Georg Fuchsbauer, Christian Hanser, Chethan Kamath, Daniel Slamanig
Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions. SCN (2016)
Sanjit Chatterjee, Chethan Kamath
A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound. Algorithmica 74 (4) (2016)
Joël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro
On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. IACR Cryptol. ePrint Arch. 2016 (2016)
Joël Alwen, Peter Gazi, Chethan Kamath, Karen Klein, Georg Osang, Krzysztof Pietrzak, Leonid Reyzin, Michal Rolínek, Michal Rybár
On the Memory-Hardness of Data-Independent Password-Hashing Functions. IACR Cryptol. ePrint Arch. 2016 (2016)
Sanjit Chatterjee, Chethan Kamath
A Closer Look at Multiple-Forking: Leveraging (In)dependence for a Tighter Bound. IACR Cryptol. ePrint Arch. 2013 (2013)
Sanjit Chatterjee, Chethan Kamath
From Selective-ID to Full-ID IBS without Random Oracles. SPACE (2013)
Sanjit Chatterjee, Chethan Kamath, Vikas Kumar
Galindo-Garcia Identity-Based Signature Revisited. IACR Cryptol. ePrint Arch. 2012 (2012)
Sanjit Chatterjee, Chethan Kamath, Vikas Kumar
Galindo-Garcia Identity-Based Signature Revisited. ICISC (2012)