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, Chethan. “On the Average-Case Hardness of Total Search Problems.” Institute of Science and Technology Austria, 2020. https://doi.org/10.15479/AT:ISTA:7896.
[Published Version]
View
| Files available
| DOI
2019 | Journal Article | IST-REx-ID: 5887 |
Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security. IOS Press, 2019. https://doi.org/10.3233/JCS-181131.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 | Conference Paper | IST-REx-ID: 6528 |
Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. 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, Michael. “Sampling the Integers with Low Relative Error.” In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019. 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, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.” In 2019 IEEE International Symposium on Information Theory. IEEE, 2019. https://doi.org/10.1109/isit.2019.8849240.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv