Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Depth-Robust Graphs and Their Cumulative Memory Complexity.”https://doi.org/10.1007/978-3-319-56617-7_1__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 .

Skórski, Maciej. “On the Complexity of Breaking Pseudoentropy.”https://doi.org/10.1007/978-3-319-55911-7_43__edited by Gerhard Jäger and Silvia Steila, 10185:600–613. Springer, 2017.https://doi.org/10.1007/978-3-319-55911-7_43 .

Skórski, Maciej. “A Cryptographic View of Regularity Lemmas: Simpler Unified Proofs and Refined Bounds.”https://doi.org/10.1007/978-3-319-55911-7_42__edited by Gerhard Jäger and Silvia Steila, 10185:586–99. Springer, 2017.https://doi.org/10.1007/978-3-319-55911-7_42 .

Alwen, Joel F, Jeremiah Blocki, and Ben Harsha. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.”https://doi.org/10.1145/3133956.3134031__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 .

Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.”https://doi.org/10.1109/isit.2017.8006529__In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017.https://doi.org/10.1109/isit.2017.8006529 .

Pietrzak, Krzysztof Z, and Maciej Skórski. “Non Uniform Attacks against Pseudoentropy,”https://doi.org/10.4230/LIPIcs.ICALP.2017.39__Vol. 80. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.ICALP.2017.39 .

Obremski, Maciej, and Maciej Skórski. “Renyi Entropy Estimation Revisited,”https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20__Vol. 81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.20 .

Rybar, Michal. “(The Exact Security of) Message Authentication Codes.”https://doi.org/10.15479/AT:ISTA:th_828__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:th_828 .

Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact Security of PMAC.”https://doi.org/10.13154/TOSC.V2016.I2.145-161__IACR Transactions on Symmetric Cryptology. Ruhr University Bochum, 2017.https://doi.org/10.13154/TOSC.V2016.I2.145-161 .

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,”https://doi.org/10.1007/978-3-319-70697-9_13__10625:357–79. Springer, 2017.https://doi.org/10.1007/978-3-319-70697-9_13 .

Jafargholi, Zahra, Chethan Kamath Hosdurg, Karen Klein, Ilan Komargodski, Krzysztof Z Pietrzak, and Daniel Wichs. “Be Adaptive Avoid Overcommitting.”https://doi.org/10.1007/978-3-319-63688-7_5__edited by Jonathan Katz and Hovav Shacham, 10401:133–63. Springer, 2017.https://doi.org/10.1007/978-3-319-63688-7_5 .

Skórski, Maciej. “Lower Bounds on Key Derivation for Square-Friendly Applications,”https://doi.org/10.4230/LIPIcs.STACS.2017.57__Vol. 66. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.STACS.2017.57 .

Alwen, Joel F, and Jeremiah Blocki. “Towards Practical Attacks on Argon2i and Balloon Hashing.”https://doi.org/10.1109/EuroSP.2017.47__IEEE, 2017.https://doi.org/10.1109/EuroSP.2017.47 .

Kiltz, Eike, Krzysztof Z Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. “Efficient Authentication from Hard Learning Problems.”https://doi.org/10.1007/s00145-016-9247-3__Journal of Cryptology. Springer, 2017.https://doi.org/10.1007/s00145-016-9247-3 .

Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.”https://doi.org/10.1007/s00453-015-9997-6__Algorithmica. Springer, 2016.https://doi.org/10.1007/s00453-015-9997-6 .

Pietrzak, Krzysztof Z, and Skorski Maciej. “Pseudoentropy: Lower-Bounds for Chain Rules and Transformations,”https://doi.org/10.1007/978-3-662-53641-4_8__9985:183–203. Springer, 2016.https://doi.org/10.1007/978-3-662-53641-4_8 .

Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,”https://doi.org/10.1007/978-3-662-49896-5_13__9666:358–87. Springer, 2016.https://doi.org/10.1007/978-3-662-49896-5_13 .

Fuchsbauer, Georg, Felix Heuer, Eike Kiltz, and Krzysztof Z Pietrzak. “Standard Security Does Imply Security against Selective Opening for Markov Distributions,”https://doi.org/10.1007/978-3-662-49096-9_12__9562:282–305. Springer, 2016.https://doi.org/10.1007/978-3-662-49096-9_12 .

Alwen, Joel F, and Jeremiah Blocki. “Efficiently Computing Data-Independent Memory-Hard Functions,”https://doi.org/10.1007/978-3-662-53008-5_9__9815:241–71. Springer, 2016.https://doi.org/10.1007/978-3-662-53008-5_9 .

Gazi, Peter, and Stefano Tessaro. “Provably Robust Sponge-Based PRNGs and KDFs,”https://doi.org/10.1007/978-3-662-49890-3_4__9665:87–116. Springer, 2016.https://doi.org/10.1007/978-3-662-49890-3_4 .