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

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

136 Publications


2018 | Published | Conference Paper | IST-REx-ID: 7407 | OA
Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.ITCS.2019.59.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2018 | Published | Conference Paper | IST-REx-ID: 193 | OA
Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.” In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018. https://doi.org/10.1145/3196494.3196534.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 6941 | OA
Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.” In 22nd International Conference on Financial Cryptography and Data Security, 10957:480–99. Springer Nature, 2018. https://doi.org/10.1007/978-3-662-58387-6_26.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 559 | OA
Abusalah, Hamza M, Joel F Alwen, Bram Cohen, Danylo Khilko, Krzysztof Z Pietrzak, and Leonid Reyzin. “Beyond Hellman’s Time-Memory Trade-Offs with Applications to Proofs of Space,” 10625:357–79. Springer, 2017. https://doi.org/10.1007/978-3-319-70697-9_13.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 637 | OA
Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski, Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.” edited by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63688-7_5.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 1174 | OA
Skórski, Maciej. “Lower Bounds on Key Derivation for Square-Friendly Applications,” Vol. 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.STACS.2017.57.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 1175 | OA
Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.” edited by Christos Papadimitriou, 67:38:1-38-21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ITCS.2017.38.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 1176 | OA
Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i and Balloon Hashing.” IEEE, 2017. https://doi.org/10.1109/EuroSP.2017.47.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1187 | OA
Kiltz, Eike, Krzysztof Z Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. “Efficient Authentication from Hard Learning Problems.” Journal of Cryptology. Springer, 2017. https://doi.org/10.1007/s00145-016-9247-3.
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 605 | OA
Brody, Joshua, Stefan Dziembowski, Sebastian Faust, and Krzysztof Z Pietrzak. “Position Based Cryptography and Multiparty Communication Complexity.” edited by Yael Kalai and Leonid Reyzin, 10677:56–81. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_3.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 609 | OA
Alwen, Joel F, and Björn Tackmann. “Moderately Hard Functions: Definition, Instantiations, and Applications.” edited by Yael Kalai and Leonid Reyzin, 10677:493–526. Springer, 2017. https://doi.org/10.1007/978-3-319-70500-2_17.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Thesis | IST-REx-ID: 838 | OA
Rybar, Michal. “(The Exact Security of) Message Authentication Codes.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_828.
[Published Version] View | Files available | DOI
 

2017 | Published | Journal Article | IST-REx-ID: 6196 | OA
Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact Security of PMAC.” IACR Transactions on Symmetric Cryptology. Ruhr University Bochum, 2017. https://doi.org/10.13154/TOSC.V2016.I2.145-161.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 635 | OA
Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano Tessaro. “Scrypt Is Maximally Memory Hard.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:33–62. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_2.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 640 | OA
Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust Graphs and Their Cumulative Memory Complexity.” edited by Jean-Sébastien Coron and Jesper Buus Nielsen, 10212:3–32. Springer, 2017. https://doi.org/10.1007/978-3-319-56617-7_1.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 648 | OA
Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.” edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_43.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 650 | OA
Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.” edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017. https://doi.org/10.1007/978-3-319-55911-7_42.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 6526 | OA
Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.” In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. https://doi.org/10.1109/isit.2017.8006529.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 6527 | OA
Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.” In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 1001–17. ACM Press, 2017. https://doi.org/10.1145/3133956.3134031.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 697 | OA
Pietrzak, Krzysztof Z, and Maciej Skórski. “Non Uniform Attacks against Pseudoentropy,” Vol. 80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.ICALP.2017.39.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=KrPi

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed