Chethan Kamath

According to our database1, Chethan Kamath authored at least 24 papers between 2012 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Certifying Giant Nonprimes.
IACR Cryptol. ePrint Arch., 2023

(Verifiable) Delay Functions from Lucas Sequences.
IACR Cryptol. ePrint Arch., 2023

Batch Proofs are Statistically Hiding.
Electron. Colloquium Comput. Complex., 2023

2022
Practical Statistically-Sound Proofs of Exponentiation in any Group.
IACR Cryptol. ePrint Arch., 2022

PPAD is as Hard as LWE and Iterated Squaring.
IACR Cryptol. ePrint Arch., 2022

2021
Limits on the Adaptive Security of Yao's Garbling.
IACR Cryptol. ePrint Arch., 2021

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

On Treewidth, Separators and Yao's Garbling.
IACR Cryptol. ePrint Arch., 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

2020
On Average-Case Hardness in TFNP from One-Way Functions.
IACR Cryptol. ePrint Arch., 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

Reversible Proofs of Sequential Work.
IACR Cryptol. ePrint Arch., 2019

Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir.
Electron. Colloquium Comput. Complex., 2019

2018
Adaptively Secure Proxy Re-encryption.
IACR Cryptol. ePrint Arch., 2018

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

2017
Be Adaptive, Avoid Overcommitting.
IACR Cryptol. ePrint Arch., 2017

2016
Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions.
IACR Cryptol. ePrint Arch., 2016

On the Memory-Hardness of Data-Independent Password-Hashing Functions.
IACR Cryptol. ePrint Arch., 2016

On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model.
IACR Cryptol. ePrint Arch., 2016

A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound.
Algorithmica, 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.
IACR Cryptol. ePrint Arch., 2012


  Loading...