Chethan Kamath Hosdurg

Pietrzak Group

16 Publications

Mark all

[16]
2021 | Conference Paper | IST-REx-ID: 10409 | OA
Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:10.1007/978-3-030-90453-1_17.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[15]
2021 | Conference Paper | IST-REx-ID: 10041 | OA
Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” 41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[14]
2021 | Conference Paper | IST-REx-ID: 10049 | OA
Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[13]
2021 | Conference Paper | IST-REx-ID: 10044 | OA
Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th Theory of Cryptography Conference 2021, 2021/926, International Association for Cryptologic Research, 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[12]
2021 | Conference Paper | IST-REx-ID: 10410 | OA
Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:10.1007/978-3-030-90453-1_19.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[11]
2021 | Conference Paper | IST-REx-ID: 10048 | OA
Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[10]
2020 | Thesis | IST-REx-ID: 7896 | OA
Kamath Hosdurg, Chethan. On the Average-Case Hardness of Total Search Problems. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7896.
[Published Version] View | Files available | DOI
 
[9]
2019 | Conference Paper | IST-REx-ID: 7411 | OA
Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” Advances in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi:10.1007/978-3-030-17656-3_10.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[8]
2019 | Conference Paper | IST-REx-ID: 6677 | OA
Choudhuri, Arka Rai, et al. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 1103–14, doi:10.1145/3313276.3316400.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[7]
2019 | Conference Paper | IST-REx-ID: 6430 | OA
Fuchsbauer, Georg, et al. Adaptively Secure Proxy Re-Encryption. Vol. 11443, Springer Nature, 2019, pp. 317–46, doi:10.1007/978-3-030-17259-6_11.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[6]
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[5]
2018 | Journal Article | IST-REx-ID: 5980
Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences, vol. 12, no. 1, AIMS, 2018, pp. 17–47, doi:10.3934/amc.2018002.
View | DOI | WoS
 
[4]
2017 | Conference Paper | IST-REx-ID: 637 | OA
Jafargholi, Zahra, et al. Be Adaptive Avoid Overcommitting. Edited by Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:10.1007/978-3-319-63688-7_5.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[3]
2016 | Journal Article | IST-REx-ID: 1177 | OA
Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.” Algorithmica, vol. 74, no. 4, Springer, 2016, pp. 1321–62, doi:10.1007/s00453-015-9997-6.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[2]
2016 | Conference Paper | IST-REx-ID: 1231 | OA
Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[1]
2016 | Conference Paper | IST-REx-ID: 1225 | OA
Fuchsbauer, Georg, et al. Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions. Vol. 9841, Springer, 2016, pp. 391–408, doi:10.1007/978-3-319-44618-9_21.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: MLA

    Export / Embed

16 Publications

Mark all

[16]
2021 | Conference Paper | IST-REx-ID: 10409 | OA
Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:10.1007/978-3-030-90453-1_17.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[15]
2021 | Conference Paper | IST-REx-ID: 10041 | OA
Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” 41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[14]
2021 | Conference Paper | IST-REx-ID: 10049 | OA
Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[13]
2021 | Conference Paper | IST-REx-ID: 10044 | OA
Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th Theory of Cryptography Conference 2021, 2021/926, International Association for Cryptologic Research, 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[12]
2021 | Conference Paper | IST-REx-ID: 10410 | OA
Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:10.1007/978-3-030-90453-1_19.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[11]
2021 | Conference Paper | IST-REx-ID: 10048 | OA
Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[10]
2020 | Thesis | IST-REx-ID: 7896 | OA
Kamath Hosdurg, Chethan. On the Average-Case Hardness of Total Search Problems. Institute of Science and Technology Austria, 2020, doi:10.15479/AT:ISTA:7896.
[Published Version] View | Files available | DOI
 
[9]
2019 | Conference Paper | IST-REx-ID: 7411 | OA
Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” Advances in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi:10.1007/978-3-030-17656-3_10.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[8]
2019 | Conference Paper | IST-REx-ID: 6677 | OA
Choudhuri, Arka Rai, et al. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 1103–14, doi:10.1145/3313276.3316400.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[7]
2019 | Conference Paper | IST-REx-ID: 6430 | OA
Fuchsbauer, Georg, et al. Adaptively Secure Proxy Re-Encryption. Vol. 11443, Springer Nature, 2019, pp. 317–46, doi:10.1007/978-3-030-17259-6_11.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[6]
2018 | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[5]
2018 | Journal Article | IST-REx-ID: 5980
Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences, vol. 12, no. 1, AIMS, 2018, pp. 17–47, doi:10.3934/amc.2018002.
View | DOI | WoS
 
[4]
2017 | Conference Paper | IST-REx-ID: 637 | OA
Jafargholi, Zahra, et al. Be Adaptive Avoid Overcommitting. Edited by Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:10.1007/978-3-319-63688-7_5.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[3]
2016 | Journal Article | IST-REx-ID: 1177 | OA
Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.” Algorithmica, vol. 74, no. 4, Springer, 2016, pp. 1321–62, doi:10.1007/s00453-015-9997-6.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[2]
2016 | Conference Paper | IST-REx-ID: 1231 | OA
Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[1]
2016 | Conference Paper | IST-REx-ID: 1225 | OA
Fuchsbauer, Georg, et al. Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions. Vol. 9841, Springer, 2016, pp. 391–408, doi:10.1007/978-3-319-44618-9_21.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: MLA

    Export / Embed