Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




92 Publications

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
 
2020 | Conference Paper | IST-REx-ID: 7966   OA
Everybody’s a target: Scalability in public-key encryption
B. Auerbach, F. Giacon, E. Kiltz, in:, Advances in Cryptology – EUROCRYPT 2020, Springer Nature, 2020, pp. 475–506.
View | DOI | Download (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6528   OA
Simple verifiable delay functions
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
View | Files available | DOI | Download (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6430
Adaptively secure proxy re-encryption
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer Nature, 2019, pp. 317–346.
View | DOI
 
2019 | Book Chapter | IST-REx-ID: 6726
Sampling the integers with low relative error
M. Walter, in:, J. Buchmann, A. Nitaj, T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019, Springer Nature, Cham, 2019, pp. 157–180.
View | DOI
 
2019 | Journal Article | IST-REx-ID: 5887
Per-session security: Password-based cryptography revisited
G. Demay, P. Gazi, U. Maurer, B. Tackmann, Journal of Computer Security 27 (2019) 75–111.
View | DOI
 
2019 | Conference Paper | IST-REx-ID: 7136   OA
Strong chain rules for min-entropy under few bits spoiled
M. Skórski, in:, 2019 IEEE International Symposium on Information Theory, IEEE, 2019.
View | DOI | Download (ext.) | arXiv
 
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 (ext.)
 
2019 | Conference Paper | IST-REx-ID: 6677
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
 
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 (ext.)
 

Search

Filter Publications

Display / Sort

Export / Embed