Chethan Kamath

Employment

• Tel Aviv University Post-doc researcher
  2021 - 2023
• Northeastern University Post-doc researcher
  2021 - 2021
• Charles University Post-doc researcher
  2020 - 2021
• Institute of Science and Technology Austria PhD student
  2014 - 2021
• Indian Institute of Science Bangalore MS student
  2010 - 2013
• Indian Institute of Technology Bombay

Education

Education history is unavailable.

Projects & Funding

Projects & funding information is unavailable.

Publications (22)

• Batch Proofs Are Statistically Hiding
  ACM Symposium on Theory of Computing -- STOC 2024 2024 DOI: 10.1145/3618260.3649775
  +Save
• (Verifiable) Delay Functions from Lucas Sequences
  Theory of Cryptography -- TCC 2023 2023 DOI: 10.1007/978-3-031-48624-1_13
  +Save
• Certifying Giant Nonprimes
  Public Key Cryptography -- PKC 2023 2023 DOI: 10.1007/978-3-031-31368-4_19
  +Save
• PPAD is as Hard as LWE and Iterated Squaring
  Theory of Cryptography -- TCC 2022 2022 DOI: 10.1007/978-3-031-22365-5_21
  +Save
• Practical Statistically-Sound Proofs of Exponentiation in Any Group
  Advances in Cryptology – CRYPTO 2022 2022 DOI: 10.1007/978-3-031-15979-4_13
  +Save
• Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement
  IEEE Symposium on Security and Privacy -- S&P 2021 2021 DOI: 10.1109/sp40001.2021.00035
  +Save
• Limits on the Adaptive Security of Yao’s Garbling
  Advances in Cryptology – CRYPTO 2021 2021 DOI: 10.1007/978-3-030-84245-1_17
  +Save
• On Treewidth, Separators and Yao’s Garbling
  Theory of Cryptography -- TCC 2021 2021 DOI: 10.1007/978-3-030-90453-1_17
  +Save
• The Cost of Adaptivity in Security Games on Graphs
  Theory of Cryptography -- TCC 2021 2021 DOI: 10.1007/978-3-030-90453-1_19
  +Save
• On Average-Case Hardness in TFNP from One-Way Functions
  Theory of Cryptography -- TCC 2020 2020 DOI: 10.1007/978-3-030-64381-2_22
  +Save