Chethan Kamath Hosdurg

Pietrzak Group

16 Publications

Mark all

[16]
2021 | Published | Conference Paper | IST-REx-ID: 10041 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security of Yao’s Garbling. In: 41st Annual International Cryptology Conference, Part II . Vol 12826. Cham: Springer Nature; 2021:486-515. doi:10.1007/978-3-030-84245-1_17
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[15]
2021 | Published | Conference Paper | IST-REx-ID: 10044 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research; 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[14]
2021 | Published | Conference Paper | IST-REx-ID: 10048 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in security games on graphs. In: 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research; 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[13]
2021 | Published | Conference Paper | IST-REx-ID: 10049 | OA
Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: 2021 IEEE Symposium on Security and Privacy . IEEE; 2021:268-284. doi:10.1109/sp40001.2021.00035
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[12]
2021 | Published | Conference Paper | IST-REx-ID: 10409 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: 19th International Conference. Vol 13043. Springer Nature; 2021:486-517. doi:10.1007/978-3-030-90453-1_17
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[11]
2021 | Published | Conference Paper | IST-REx-ID: 10410 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in security games on graphs. In: 19th International Conference. Vol 13043. Springer Nature; 2021:550-581. doi:10.1007/978-3-030-90453-1_19
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[10]
2020 | Published | Thesis | IST-REx-ID: 7896 | OA
Kamath Hosdurg C. On the average-case hardness of total search problems. 2020. doi:10.15479/AT:ISTA:7896
[Published Version] View | Files available | DOI
 
[9]
2019 | Published | Conference Paper | IST-REx-ID: 6430 | OA
Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. Adaptively secure proxy re-encryption. In: Vol 11443. Springer Nature; 2019:317-346. doi:10.1007/978-3-030-17259-6_11
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[8]
2019 | Published | Conference Paper | IST-REx-ID: 6677 | OA
Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019. ACM Press; 2019:1103-1114. doi:10.1145/3313276.3316400
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[7]
2019 | Published | Conference Paper | IST-REx-ID: 7411 | OA
Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. Reversible proofs of sequential work. In: Advances in Cryptology – EUROCRYPT 2019. Vol 11477. Springer International Publishing; 2019:277-291. doi:10.1007/978-3-030-17656-3_10
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[6]
2018 | Published | Journal Article | IST-REx-ID: 5980
Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 2018;12(1):17-47. doi:10.3934/amc.2018002
View | DOI | WoS
 
[5]
2018 | Published | Conference Paper | IST-REx-ID: 193 | OA
Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[4]
2017 | Published | Conference Paper | IST-REx-ID: 637 | OA
Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. Be adaptive avoid overcommitting. In: Katz J, Shacham H, eds. Vol 10401. Springer; 2017:133-163. doi:10.1007/978-3-319-63688-7_5
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[3]
2016 | Published | Conference Paper | IST-REx-ID: 1225 | OA
Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. Practical round-optimal blind signatures in the standard model from weaker assumptions. In: Vol 9841. Springer; 2016:391-408. doi:10.1007/978-3-319-44618-9_21
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[2]
2016 | Published | Conference Paper | IST-REx-ID: 1231 | OA
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:10.1007/978-3-662-49896-5_13
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[1]
2016 | Published | Journal Article | IST-REx-ID: 1177 | OA
Kamath Hosdurg C, Chatterjee S. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. 2016;74(4):1321-1362. doi:10.1007/s00453-015-9997-6
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

Grants


16 Publications

Mark all

[16]
2021 | Published | Conference Paper | IST-REx-ID: 10041 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. Limits on the Adaptive Security of Yao’s Garbling. In: 41st Annual International Cryptology Conference, Part II . Vol 12826. Cham: Springer Nature; 2021:486-515. doi:10.1007/978-3-030-84245-1_17
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[15]
2021 | Published | Conference Paper | IST-REx-ID: 10044 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research; 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[14]
2021 | Published | Conference Paper | IST-REx-ID: 10048 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in security games on graphs. In: 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research; 2021.
[Preprint] View | Files available | Download Preprint (ext.)
 
[13]
2021 | Published | Conference Paper | IST-REx-ID: 10049 | OA
Klein K, Pascual Perez G, Walter M, et al. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In: 2021 IEEE Symposium on Security and Privacy . IEEE; 2021:268-284. doi:10.1109/sp40001.2021.00035
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[12]
2021 | Published | Conference Paper | IST-REx-ID: 10409 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ. On treewidth, separators and Yao’s garbling. In: 19th International Conference. Vol 13043. Springer Nature; 2021:486-517. doi:10.1007/978-3-030-90453-1_17
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[11]
2021 | Published | Conference Paper | IST-REx-ID: 10410 | OA
Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. The cost of adaptivity in security games on graphs. In: 19th International Conference. Vol 13043. Springer Nature; 2021:550-581. doi:10.1007/978-3-030-90453-1_19
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[10]
2020 | Published | Thesis | IST-REx-ID: 7896 | OA
Kamath Hosdurg C. On the average-case hardness of total search problems. 2020. doi:10.15479/AT:ISTA:7896
[Published Version] View | Files available | DOI
 
[9]
2019 | Published | Conference Paper | IST-REx-ID: 6430 | OA
Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. Adaptively secure proxy re-encryption. In: Vol 11443. Springer Nature; 2019:317-346. doi:10.1007/978-3-030-17259-6_11
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[8]
2019 | Published | Conference Paper | IST-REx-ID: 6677 | OA
Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019. ACM Press; 2019:1103-1114. doi:10.1145/3313276.3316400
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
[7]
2019 | Published | Conference Paper | IST-REx-ID: 7411 | OA
Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. Reversible proofs of sequential work. In: Advances in Cryptology – EUROCRYPT 2019. Vol 11477. Springer International Publishing; 2019:277-291. doi:10.1007/978-3-030-17656-3_10
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[6]
2018 | Published | Journal Article | IST-REx-ID: 5980
Chatterjee S, Kamath Hosdurg C, Kumar V. Private set-intersection with common set-up. American Institute of Mathematical Sciences. 2018;12(1):17-47. doi:10.3934/amc.2018002
View | DOI | WoS
 
[5]
2018 | Published | Conference Paper | IST-REx-ID: 193 | OA
Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
[4]
2017 | Published | Conference Paper | IST-REx-ID: 637 | OA
Jafargholi Z, Kamath Hosdurg C, Klein K, Komargodski I, Pietrzak KZ, Wichs D. Be adaptive avoid overcommitting. In: Katz J, Shacham H, eds. Vol 10401. Springer; 2017:133-163. doi:10.1007/978-3-319-63688-7_5
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[3]
2016 | Published | Conference Paper | IST-REx-ID: 1225 | OA
Fuchsbauer G, Hanser C, Kamath Hosdurg C, Slamanig D. Practical round-optimal blind signatures in the standard model from weaker assumptions. In: Vol 9841. Springer; 2016:391-408. doi:10.1007/978-3-319-44618-9_21
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[2]
2016 | Published | Conference Paper | IST-REx-ID: 1231 | OA
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:10.1007/978-3-662-49896-5_13
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[1]
2016 | Published | Journal Article | IST-REx-ID: 1177 | OA
Kamath Hosdurg C, Chatterjee S. A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. 2016;74(4):1321-1362. doi:10.1007/s00453-015-9997-6
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed