Chethan Kamath

Orcid: 0009-0006-6812-7317

According to our database1, Chethan Kamath authored at least 28 papers between 2012 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Impossibility of VDFs in the ROM: The Complete Picture.
IACR Cryptol. ePrint Arch., 2025

On Verifiable Delay Functions from Time-Lock Puzzles.
IACR Cryptol. ePrint Arch., 2025

Securely Instantiating 'Half Gates' Garbling in the Standard Model.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

On the Adaptive Security of Free-XOR-Based Garbling Schemes in the Plain Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
Batch Proofs Are Statistically Hiding.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
(Verifiable) Delay Functions from Lucas Sequences.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Certifying Giant Nonprimes.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

2022
PPAD is as Hard as LWE and Iterated Squaring.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Practical Statistically-Sound Proofs of Exponentiation in Any Group.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021
On the Cost of Adaptivity in Graph-Based Games.
IACR Cryptol. ePrint Arch., 2021

On Treewidth, Separators and Yao's Garbling.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

The Cost of Adaptivity in Security Games on Graphs.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

Limits on the Adaptive Security of Yao's Garbling.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
On Average-Case Hardness in TFNP from One-Way Functions.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019
PPAD-Hardness via Iterated Squaring Modulo a Composite.
IACR Cryptol. ePrint Arch., 2019

Keep the Dirt: Tainted TreeKEM, an Efficient and Provably Secure Continuous Group Key Agreement Protocol.
IACR Cryptol. ePrint Arch., 2019

Finding a Nash equilibrium is no easier than breaking Fiat-Shamir.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Adaptively Secure Proxy Re-encryption.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Reversible Proofs of Sequential Work.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
Private set-intersection with common set-up.
Adv. Math. Commun., 2018

On the Memory-Hardness of Data-Independent Password-Hashing Functions.
Proceedings of the 2018 on Asia Conference on Computer and Communications Security, 2018

2017
Be Adaptive, Avoid Overcommitting.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound.
Algorithmica, 2016

Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2013
From Selective-ID to Full-ID IBS without Random Oracles.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2013

2012
Galindo-Garcia Identity-Based Signature Revisited.
Proceedings of the Information Security and Cryptology - ICISC 2012, 2012


  Loading...