9 Publications

Mark all

[9]
2019 | Conference Paper | IST-REx-ID: 6430
Fuchsbauer, Georg, Chethan Kamath Hosdurg, Karen Klein, and Krzysztof Z Pietrzak. “Adaptively Secure Proxy Re-Encryption,” 11443:317–46. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-17259-6_11.
View | DOI
 
[8]
2019 | Conference Paper | IST-REx-ID: 6677
Choudhuri, Arka Rai, Pavel Hubáček, Chethan Kamath Hosdurg, Krzysztof Z Pietrzak, Alon Rosen, and Guy N. Rothblum. “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, 1103–14. ACM Press, 2019. https://doi.org/10.1145/3313276.3316400.
View | DOI
 
[7]
2019 | Conference Paper | IST-REx-ID: 7411   OA
Abusalah, Hamza M, Chethan Kamath Hosdurg, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “Reversible Proofs of Sequential Work.” In Advances in Cryptology – EUROCRYPT 2019, 11477:277–91. Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-17656-3_10.
View | DOI | Download (ext.)
 
[6]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.” In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018. https://doi.org/10.1145/3196494.3196534.
View | DOI | Download (ext.)
 
[5]
2018 | Journal Article | IST-REx-ID: 5980
Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences 12, no. 1 (2018): 17–47. https://doi.org/10.3934/amc.2018002.
View | DOI
 
[4]
2017 | Conference Paper | IST-REx-ID: 637   OA
Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski, Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.” edited by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63688-7_5.
View | DOI | Download (ext.)
 
[3]
2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,” 9666:358–87. Springer, 2016. https://doi.org/10.1007/978-3-662-49896-5_13.
View | DOI | Download (ext.)
 
[2]
2016 | Conference Paper | IST-REx-ID: 1225
Fuchsbauer, Georg, Christian Hanser, Chethan Kamath Hosdurg, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions,” 9841:391–408. Springer, 2016. https://doi.org/10.1007/978-3-319-44618-9_21.
View | Files available | DOI | Download (ext.)
 
[1]
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 74, no. 4 (2016): 1321–62. https://doi.org/10.1007/s00453-015-9997-6.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

9 Publications

Mark all

[9]
2019 | Conference Paper | IST-REx-ID: 6430
Fuchsbauer, Georg, Chethan Kamath Hosdurg, Karen Klein, and Krzysztof Z Pietrzak. “Adaptively Secure Proxy Re-Encryption,” 11443:317–46. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-17259-6_11.
View | DOI
 
[8]
2019 | Conference Paper | IST-REx-ID: 6677
Choudhuri, Arka Rai, Pavel Hubáček, Chethan Kamath Hosdurg, Krzysztof Z Pietrzak, Alon Rosen, and Guy N. Rothblum. “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, 1103–14. ACM Press, 2019. https://doi.org/10.1145/3313276.3316400.
View | DOI
 
[7]
2019 | Conference Paper | IST-REx-ID: 7411   OA
Abusalah, Hamza M, Chethan Kamath Hosdurg, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “Reversible Proofs of Sequential Work.” In Advances in Cryptology – EUROCRYPT 2019, 11477:277–91. Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-17656-3_10.
View | DOI | Download (ext.)
 
[6]
2018 | Conference Paper | IST-REx-ID: 193   OA
Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.” In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018. https://doi.org/10.1145/3196494.3196534.
View | DOI | Download (ext.)
 
[5]
2018 | Journal Article | IST-REx-ID: 5980
Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences 12, no. 1 (2018): 17–47. https://doi.org/10.3934/amc.2018002.
View | DOI
 
[4]
2017 | Conference Paper | IST-REx-ID: 637   OA
Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski, Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.” edited by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63688-7_5.
View | DOI | Download (ext.)
 
[3]
2016 | Conference Paper | IST-REx-ID: 1231   OA
Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,” 9666:358–87. Springer, 2016. https://doi.org/10.1007/978-3-662-49896-5_13.
View | DOI | Download (ext.)
 
[2]
2016 | Conference Paper | IST-REx-ID: 1225
Fuchsbauer, Georg, Christian Hanser, Chethan Kamath Hosdurg, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions,” 9841:391–408. Springer, 2016. https://doi.org/10.1007/978-3-319-44618-9_21.
View | Files available | DOI | Download (ext.)
 
[1]
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 74, no. 4 (2016): 1321–62. https://doi.org/10.1007/s00453-015-9997-6.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed