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
2021 | Conference Paper | IST-REx-ID: 10407 | 
Chakraborty, Suvradip, et al. Trojan-Resilience without Cryptography. Vol. 13043, Springer Nature, 2021, pp. 397–428, doi:10.1007/978-3-030-90453-1_14.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10408 |
Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.” 19th International Conference, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:10.1007/978-3-030-90456-2_8.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10409 |
Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:10.1007/978-3-030-90453-1_17.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10609 |
Chakraborty, Suvradip, et al. “Reverse Firewalls for Adaptively Secure MPC without Setup.” 27th International Conference on the Theory and Application of Cryptology and Information Security, vol. 13091, Springer Nature, 2021, pp. 335–64, doi:10.1007/978-3-030-92075-3_12.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10041 |
Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.” 41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 | Conference Paper | IST-REx-ID: 10049 |
Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.” 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 | Conference Paper | IST-REx-ID: 10044 |
Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th Theory of Cryptography Conference 2021, 2021/926, International Association for Cryptologic Research, 2021.
[Preprint]
View
| Files available
| Download Preprint (ext.)
2021 | Thesis | IST-REx-ID: 10035 |
Klein, Karen. On the Adaptive Security of Graph-Based Games. Institute of Science and Technology Austria, 2021, doi:10.15479/at:ista:10035.
[Published Version]
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10410 |
Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th International Conference, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:10.1007/978-3-030-90453-1_19.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10048 |
Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.” 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.
[Preprint]
View
| Files available
| Download Preprint (ext.)
2021 | Conference Paper | IST-REx-ID: 9969 |
Pietrzak, Krzysztof Z., et al. LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks. IEEE, 2021, doi:10.23919/IFIPNetworking52078.2021.9472205.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2020 | Conference Paper | IST-REx-ID: 8322 |
Chakraborty, Suvradip, et al. “Reverse Firewalls for Actively Secure MPCs.” Advances in Cryptology – CRYPTO 2020, vol. 12171, Springer Nature, 2020, pp. 732–62, doi:10.1007/978-3-030-56880-1_26.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2020 | Conference Paper | IST-REx-ID: 8339 |
Genise, Nicholas, et al. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.” 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, vol. 12110, Springer Nature, 2020, pp. 623–51, doi:10.1007/978-3-030-45374-9_21.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2020 | Conference Paper | IST-REx-ID: 8987 |
Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.” Progress in Cryptology, vol. 12578, Springer Nature, 2020, pp. 3–15, doi:10.1007/978-3-030-65277-7_1.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2020 | Conference Paper | IST-REx-ID: 7966 |
Auerbach, Benedikt, et al. “Everybody’s a Target: Scalability in Public-Key Encryption.” Advances in Cryptology – EUROCRYPT 2020, vol. 12107, Springer Nature, 2020, pp. 475–506, doi:10.1007/978-3-030-45727-3_16.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
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, doi:10.15479/AT:ISTA:7896.
[Published Version]
View
| Files available
| DOI
2019 | Journal Article | IST-REx-ID: 5887 |
Demay, Gregory, et al. “Per-Session Security: Password-Based Cryptography Revisited.” Journal of Computer Security, vol. 27, no. 1, IOS Press, 2019, pp. 75–111, doi:10.3233/JCS-181131.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 | Conference Paper | IST-REx-ID: 6528 |
Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.” 10th Innovations in Theoretical Computer Science Conference, vol. 124, 60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi: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.” Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann et al., vol. 11627, Springer Nature, 2019, pp. 157–80, doi: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.” 2019 IEEE International Symposium on Information Theory, 8849240, IEEE, 2019, doi:10.1109/isit.2019.8849240.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
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.)
2017 | Conference Paper | IST-REx-ID: 650 |
Skórski, Maciej. A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds. Edited by Gerhard Jäger and Silvia Steila, vol. 10185, Springer, 2017, pp. 586–99, doi:10.1007/978-3-319-55911-7_42.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 6527 |
Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–17, doi:10.1145/3133956.3134031.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 6526 |
Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” 2017 IEEE International Symposium on Information Theory (ISIT), 8006529, IEEE, 2017, doi:10.1109/isit.2017.8006529.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 697 |
Pietrzak, Krzysztof Z., and Maciej Skórski. Non Uniform Attacks against Pseudoentropy. Vol. 80, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.ICALP.2017.39.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 710 |
Obremski, Maciej, and Maciej Skórski. Renyi Entropy Estimation Revisited. Vol. 81, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.APPROX-RANDOM.2017.20.
[Published Version]
View
| Files available
| DOI
2017 | Thesis | IST-REx-ID: 838 |
Rybar, Michal. (The Exact Security of) Message Authentication Codes. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_828.
[Published Version]
View
| Files available
| DOI
2017 | Journal Article | IST-REx-ID: 6196 |
Gazi, Peter, et al. “The Exact Security of PMAC.” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2, Ruhr University Bochum, 2017, pp. 145–61, doi:10.13154/TOSC.V2016.I2.145-161.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 559 |
Abusalah, Hamza M., et al. Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space. Vol. 10625, Springer, 2017, pp. 357–79, doi:10.1007/978-3-319-70697-9_13.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 637 |
Jafargholi, Zahra, et al. Be Adaptive Avoid Overcommitting. Edited by Jonathan Katz and Hovav Shacham, vol. 10401, Springer, 2017, pp. 133–63, doi:10.1007/978-3-319-63688-7_5.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 1174 |
Skórski, Maciej. Lower Bounds on Key Derivation for Square-Friendly Applications. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.STACS.2017.57.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS