default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChethan Kamath
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Nir Bitansky
, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan:
Batch Proofs Are Statistically Hiding. STOC 2024: 435-443- 2023
- [c18]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak:
Certifying Giant Nonprimes. Public Key Cryptography (1) 2023: 530-553 - [c17]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák:
(Verifiable) Delay Functions from Lucas Sequences. TCC (4) 2023: 336-362 - [i22]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan:
Batch Proofs are Statistically Hiding. Electron. Colloquium Comput. Complex. TR23 (2023) - [i21]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak:
Certifying Giant Nonprimes. IACR Cryptol. ePrint Arch. 2023: 238 (2023) - [i20]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan:
Batch Proofs are Statistically Hiding. IACR Cryptol. ePrint Arch. 2023: 754 (2023) - [i19]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák:
(Verifiable) Delay Functions from Lucas Sequences. IACR Cryptol. ePrint Arch. 2023: 1404 (2023) - 2022
- [c16]Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
Practical Statistically-Sound Proofs of Exponentiation in Any Group. CRYPTO (2) 2022: 370-399 - [c15]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: 593-622 - [i18]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: 1021 (2022) - [i17]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: 1272 (2022) - 2021
- [c14]Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs:
Limits on the Adaptive Security of Yao's Garbling. CRYPTO (2) 2021: 486-515 - [c13]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. SP 2021: 268-284 - [c12]Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
On Treewidth, Separators and Yao's Garbling. TCC (2) 2021: 486-517 - [c11]Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
The Cost of Adaptivity in Security Games on Graphs. TCC (2) 2021: 550-581 - [i16]Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
On the Cost of Adaptivity in Graph-Based Games. IACR Cryptol. ePrint Arch. 2021: 59 (2021) - [i15]Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
On Treewidth, Separators and Yao's Garbling. IACR Cryptol. ePrint Arch. 2021: 926 (2021) - [i14]Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs:
Limits on the Adaptive Security of Yao's Garbling. IACR Cryptol. ePrint Arch. 2021: 945 (2021) - 2020
- [c10]Pavel Hubácek, Chethan Kamath, Karel Král, Veronika Slívová:
On Average-Case Hardness in TFNP from One-Way Functions. TCC (3) 2020: 614-638 - [i13]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: 1162 (2020)
2010 – 2019
- 2019
- [c9]Hamza Abusalah, Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
Reversible Proofs of Sequential Work. EUROCRYPT (2) 2019: 277-291 - [c8]Georg Fuchsbauer, Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
Adaptively Secure Proxy Re-encryption. Public Key Cryptography (2) 2019: 317-346 - [c7]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: 1103-1114 - [i12]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. TR19 (2019) - [i11]Hamza Abusalah, Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
Reversible Proofs of Sequential Work. IACR Cryptol. ePrint Arch. 2019: 252 (2019) - [i10]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: 549 (2019) - [i9]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: 667 (2019) - [i8]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: 1489 (2019) - 2018
- [j2]Sanjit Chatterjee, Chethan Kamath, Vikas Kumar:
Private set-intersection with common set-up. Adv. Math. Commun. 12(1): 17-47 (2018) - [c6]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. AsiaCCS 2018: 51-65 - [i7]Georg Fuchsbauer, Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
Adaptively Secure Proxy Re-encryption. IACR Cryptol. ePrint Arch. 2018: 426 (2018) - 2017
- [c5]Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs:
Be Adaptive, Avoid Overcommitting. CRYPTO (1) 2017: 133-163 - [i6]Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs:
Be Adaptive, Avoid Overcommitting. IACR Cryptol. ePrint Arch. 2017: 515 (2017) - 2016
- [j1]Sanjit Chatterjee, Chethan Kamath:
A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound. Algorithmica 74(4): 1321-1362 (2016) - [c4]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: 358-387 - [c3]Georg Fuchsbauer, Christian Hanser, Chethan Kamath, Daniel Slamanig:
Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions. SCN 2016: 391-408 - [i5]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: 100 (2016) - [i4]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: 662 (2016) - [i3]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: 783 (2016) - 2013
- [c2]Sanjit Chatterjee, Chethan Kamath:
From Selective-ID to Full-ID IBS without Random Oracles. SPACE 2013: 172-190 - [i2]Sanjit Chatterjee, Chethan Kamath:
A Closer Look at Multiple-Forking: Leveraging (In)dependence for a Tighter Bound. IACR Cryptol. ePrint Arch. 2013: 651 (2013) - 2012
- [c1]Sanjit Chatterjee, Chethan Kamath, Vikas Kumar:
Galindo-Garcia Identity-Based Signature Revisited. ICISC 2012: 456-471 - [i1]Sanjit Chatterjee, Chethan Kamath, Vikas Kumar:
Galindo-Garcia Identity-Based Signature Revisited. IACR Cryptol. ePrint Arch. 2012: 646 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
