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
2019 | Conference Paper | IST-REx-ID: 7411 | 
Abusalah, Hamza M., et al. “Reversible Proofs of Sequential Work.” Advances in Cryptology – EUROCRYPT 2019, vol. 11477, Springer International Publishing, 2019, pp. 277–91, doi:10.1007/978-3-030-17656-3_10.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2019 | Conference Paper | IST-REx-ID: 6677 |
Choudhuri, Arka Rai, et al. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.” Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, ACM Press, 2019, pp. 1103–14, doi:10.1145/3313276.3316400.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2019 | Conference Paper | IST-REx-ID: 6430 |
Fuchsbauer, Georg, et al. Adaptively Secure Proxy Re-Encryption. Vol. 11443, Springer Nature, 2019, pp. 317–46, doi:10.1007/978-3-030-17259-6_11.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2018 | Journal Article | IST-REx-ID: 10286 |
Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018, no. 3, International Association for Cryptologic Research, 2018, pp. 214–42, doi:10.13154/tches.v2018.i3.214-242.
[Published Version]
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 7407 |
Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2018 | Thesis | IST-REx-ID: 83 |
Abusalah, Hamza M. Proof Systems for Sustainable Decentralized Cryptocurrencies. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:TH_1046.
[Published Version]
View
| Files available
| DOI
2018 | Conference Paper | IST-REx-ID: 108 |
Obremski, Marciej, and Maciej Skórski. Inverted Leftover Hash Lemma. Vol. 2018, IEEE, 2018, doi:10.1109/ISIT.2018.8437654.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Journal Article | IST-REx-ID: 107 |
Dziembowski, Stefan, et al. “Non-Malleable Codes.” Journal of the ACM, vol. 65, no. 4, 20, ACM, 2018, doi:10.1145/3178432.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2018 | Conference Paper | IST-REx-ID: 193 |
Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.” Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Conference Paper | IST-REx-ID: 300 |
Micciancio, Daniele, and Michael Walter. On the Bit Security of Cryptographic Primitives. Vol. 10820, Springer, 2018, pp. 3–28, doi:10.1007/978-3-319-78381-9_1.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Conference Paper | IST-REx-ID: 302 |
Cohen, Bram, and Krzysztof Z. Pietrzak. Simple Proofs of Sequential Work. Vol. 10821, Springer, 2018, pp. 451–67, doi:10.1007/978-3-319-78375-8_15.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Conference Paper | IST-REx-ID: 298 |
Alwen, Joel F., et al. Sustained Space Complexity. Vol. 10821, Springer, 2018, pp. 99–130, doi:10.1007/978-3-319-78375-8_4.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 5980
Chatterjee, Sanjit, et al. “Private Set-Intersection with Common Set-Up.” American Institute of Mathematical Sciences, vol. 12, no. 1, AIMS, 2018, pp. 17–47, doi:10.3934/amc.2018002.
View
| DOI
| WoS
2018 | Conference Paper | IST-REx-ID: 6941 |
Park, Sunoo, et al. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” 22nd International Conference on Financial Cryptography and Data Security, vol. 10957, Springer Nature, 2018, pp. 480–99, doi:10.1007/978-3-662-58387-6_26.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Conference Paper | IST-REx-ID: 1175 |
Alwen, Joel F., et al. Cumulative Space in Black-White Pebbling and Resolution. Edited by Christos Papadimitriou, vol. 67, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21, doi:10.4230/LIPIcs.ITCS.2017.38.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 605 |
Brody, Joshua, et al. Position Based Cryptography and Multiparty Communication Complexity. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 56–81, doi:10.1007/978-3-319-70500-2_3.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 609 |
Alwen, Joel F., and Björn Tackmann. Moderately Hard Functions: Definition, Instantiations, and Applications. Edited by Yael Kalai and Leonid Reyzin, vol. 10677, Springer, 2017, pp. 493–526, doi:10.1007/978-3-319-70500-2_17.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 635 |
Alwen, Joel F., et al. Scrypt Is Maximally Memory Hard. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 33–62, doi:10.1007/978-3-319-56617-7_2.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 640 |
Alwen, Joel F., et al. Depth-Robust Graphs and Their Cumulative Memory Complexity. Edited by Jean-Sébastien Coron and Jesper Buus Nielsen, vol. 10212, Springer, 2017, pp. 3–32, doi:10.1007/978-3-319-56617-7_1.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 648 |
Skórski, Maciej. On the Complexity of Breaking Pseudoentropy. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 600–13, doi:10.1007/978-3-319-55911-7_43.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)