14 Publications

Mark all

[14]
2021 | Conference Paper | IST-REx-ID: 10044 | OA
On treewidth, separators and Yao's garbling
C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, n.d.
View | Download Preprint (ext.)
 
[13]
2021 | Conference Paper | IST-REx-ID: 10041 | OA
Limits on the Adaptive Security of Yao’s Garbling
C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515.
View | Files available | DOI | Download Preprint (ext.)
 
[12]
2021 | Conference Paper | IST-REx-ID: 10049 | OA
Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
View | Files available | DOI | Download Preprint (ext.)
 
[11]
2021 | Conference Paper | IST-REx-ID: 10048 | OA
The cost of adaptivity in security games on graphs
C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, n.d.
View | Files available | Download Preprint (ext.)
 
[10]
2020 | Thesis | IST-REx-ID: 7896 | OA
On the average-case hardness of total search problems
C. Kamath Hosdurg, On the Average-Case Hardness of Total Search Problems, IST Austria, 2020.
View | Files available | DOI
 
[9]
2019 | Conference Paper | IST-REx-ID: 7411 | OA
Reversible proofs of sequential work
H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019, pp. 277–291.
View | DOI | Download Submitted Version (ext.)
 
[8]
2019 | Conference Paper | IST-REx-ID: 6677 | OA
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
A.R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K.Z. Pietrzak, A. Rosen, G.N. Rothblum, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 1103–1114.
View | Files available | DOI | Download Preprint (ext.)
 
[7]
2019 | Conference Paper | IST-REx-ID: 6430 | OA
Adaptively secure proxy re-encryption
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer Nature, 2019, pp. 317–346.
View | Files available | DOI | Download Preprint (ext.)
 
[6]
2018 | Conference Paper | IST-REx-ID: 193 | OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View | DOI | Download Submitted Version (ext.)
 
[5]
2018 | Journal Article | IST-REx-ID: 5980
Private set-intersection with common set-up
S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47.
View | DOI
 
[4]
2017 | Conference Paper | IST-REx-ID: 637 | OA
Be adaptive avoid overcommitting
Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak, D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.
View | Files available | DOI | Download Submitted Version (ext.)
 
[3]
2016 | Journal Article | IST-REx-ID: 1177 | OA
A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound
C. Kamath Hosdurg, S. Chatterjee, Algorithmica 74 (2016) 1321–1362.
View | DOI | Download Submitted Version (ext.)
 
[2]
2016 | Conference Paper | IST-REx-ID: 1225 | OA
Practical round-optimal blind signatures in the standard model from weaker assumptions
G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, D. Slamanig, in:, Springer, 2016, pp. 391–408.
View | Files available | DOI | Download Submitted Version (ext.)
 
[1]
2016 | Conference Paper | IST-REx-ID: 1231 | OA
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
View | DOI | Download Submitted Version (ext.)
 

Search

Filter Publications

14 Publications

Mark all

[14]
2021 | Conference Paper | IST-REx-ID: 10044 | OA
On treewidth, separators and Yao's garbling
C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, n.d.
View | Download Preprint (ext.)
 
[13]
2021 | Conference Paper | IST-REx-ID: 10041 | OA
Limits on the Adaptive Security of Yao’s Garbling
C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, D. Wichs, in:, 41st Annual International Cryptology Conference, Part II , Springer Nature, Cham, 2021, pp. 486–515.
View | Files available | DOI | Download Preprint (ext.)
 
[12]
2021 | Conference Paper | IST-REx-ID: 10049 | OA
Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
View | Files available | DOI | Download Preprint (ext.)
 
[11]
2021 | Conference Paper | IST-REx-ID: 10048 | OA
The cost of adaptivity in security games on graphs
C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, n.d.
View | Files available | Download Preprint (ext.)
 
[10]
2020 | Thesis | IST-REx-ID: 7896 | OA
On the average-case hardness of total search problems
C. Kamath Hosdurg, On the Average-Case Hardness of Total Search Problems, IST Austria, 2020.
View | Files available | DOI
 
[9]
2019 | Conference Paper | IST-REx-ID: 7411 | OA
Reversible proofs of sequential work
H.M. Abusalah, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, M. Walter, in:, Advances in Cryptology – EUROCRYPT 2019, Springer International Publishing, 2019, pp. 277–291.
View | DOI | Download Submitted Version (ext.)
 
[8]
2019 | Conference Paper | IST-REx-ID: 6677 | OA
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
A.R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K.Z. Pietrzak, A. Rosen, G.N. Rothblum, in:, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, ACM Press, 2019, pp. 1103–1114.
View | Files available | DOI | Download Preprint (ext.)
 
[7]
2019 | Conference Paper | IST-REx-ID: 6430 | OA
Adaptively secure proxy re-encryption
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer Nature, 2019, pp. 317–346.
View | Files available | DOI | Download Preprint (ext.)
 
[6]
2018 | Conference Paper | IST-REx-ID: 193 | OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View | DOI | Download Submitted Version (ext.)
 
[5]
2018 | Journal Article | IST-REx-ID: 5980
Private set-intersection with common set-up
S. Chatterjee, C. Kamath Hosdurg, V. Kumar, American Institute of Mathematical Sciences 12 (2018) 17–47.
View | DOI
 
[4]
2017 | Conference Paper | IST-REx-ID: 637 | OA
Be adaptive avoid overcommitting
Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak, D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.
View | Files available | DOI | Download Submitted Version (ext.)
 
[3]
2016 | Journal Article | IST-REx-ID: 1177 | OA
A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound
C. Kamath Hosdurg, S. Chatterjee, Algorithmica 74 (2016) 1321–1362.
View | DOI | Download Submitted Version (ext.)
 
[2]
2016 | Conference Paper | IST-REx-ID: 1225 | OA
Practical round-optimal blind signatures in the standard model from weaker assumptions
G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, D. Slamanig, in:, Springer, 2016, pp. 391–408.
View | Files available | DOI | Download Submitted Version (ext.)
 
[1]
2016 | Conference Paper | IST-REx-ID: 1231 | OA
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
View | DOI | Download Submitted Version (ext.)
 

Search

Filter Publications