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.
127 Publications
2020 | Thesis | IST-REx-ID: 7896 | 
Kamath Hosdurg, C. (2020). On the average-case hardness of total search problems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:7896
[Published Version]
View
| Files available
| DOI
2019 | Journal Article | IST-REx-ID: 5887 |
Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security. IOS Press. https://doi.org/10.3233/JCS-181131
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 | Conference Paper | IST-REx-ID: 6528 |
Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ITCS.2019.60
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2019 | Book Chapter | IST-REx-ID: 6726 |
Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, & T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature. https://doi.org/10.1007/978-3-030-23696-0_9
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 | Conference Paper | IST-REx-ID: 7136 |
Skórski, M. (2019). Strong chain rules for min-entropy under few bits spoiled. In 2019 IEEE International Symposium on Information Theory. Paris, France: IEEE. https://doi.org/10.1109/isit.2019.8849240
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv