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.
LibreCat: https://research-explorer.ista.ac.at/record/650
DOI: 10.1007/978-3-319-55911-7_42

Alwen, Joel F., et al. “Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.”10.1145/3133956.3134031__Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–17, doi:10.1145/3133956.3134031.
LibreCat: https://research-explorer.ista.ac.at/record/6527
DOI: 10.1145/3133956.3134031

Skórski, Maciej. “On the Complexity of Estimating Rènyi Divergences.”10.1109/isit.2017.8006529__2017 IEEE International Symposium on Information Theory (ISIT), 8006529, IEEE, 2017, doi:10.1109/isit.2017.8006529.
LibreCat: https://research-explorer.ista.ac.at/record/6526
DOI: 10.1109/isit.2017.8006529
arXiv: 1702.01666

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.
LibreCat: https://research-explorer.ista.ac.at/record/697
DOI: 10.4230/LIPIcs.ICALP.2017.39

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.
LibreCat: https://research-explorer.ista.ac.at/record/710
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.20

Rybar, Michal. (The Exact Security of) Message Authentication Codes. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_828.
LibreCat: https://research-explorer.ista.ac.at/record/838
DOI: 10.15479/AT:ISTA:th_828

Gazi, Peter, et al. “The Exact Security of PMAC.”10.13154/TOSC.V2016.I2.145-161__IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2, Ruhr University Bochum, 2017, pp. 145–61, doi:10.13154/TOSC.V2016.I2.145-161.
LibreCat: https://research-explorer.ista.ac.at/record/6196
DOI: 10.13154/TOSC.V2016.I2.145-161

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.
LibreCat: https://research-explorer.ista.ac.at/record/559
DOI: 10.1007/978-3-319-70697-9_13

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.
LibreCat: https://research-explorer.ista.ac.at/record/637
DOI: 10.1007/978-3-319-63688-7_5

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.
LibreCat: https://research-explorer.ista.ac.at/record/1174
DOI: 10.4230/LIPIcs.STACS.2017.57
WoS: 000521077300057

Alwen, Joel F., and Jeremiah Blocki. Towards Practical Attacks on Argon2i and Balloon Hashing. 7961977, IEEE, 2017, doi:10.1109/EuroSP.2017.47.
LibreCat: https://research-explorer.ista.ac.at/record/1176
DOI: 10.1109/EuroSP.2017.47
WoS: 000424197300011

Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.”10.1007/s00145-016-9247-3__Journal of Cryptology, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:10.1007/s00145-016-9247-3.
LibreCat: https://research-explorer.ista.ac.at/record/1187
DOI: 10.1007/s00145-016-9247-3
WoS: 000410788600007

Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.”10.1007/s00453-015-9997-6__Algorithmica, vol. 74, no. 4, Springer, 2016, pp. 1321–62, doi:10.1007/s00453-015-9997-6.
LibreCat: https://research-explorer.ista.ac.at/record/1177
DOI: 10.1007/s00453-015-9997-6

Pietrzak, Krzysztof Z., and Skorski Maciej. Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. Vol. 9985, Springer, 2016, pp. 183–203, doi:10.1007/978-3-662-53641-4_8.
LibreCat: https://research-explorer.ista.ac.at/record/1179
DOI: 10.1007/978-3-662-53641-4_8

Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
LibreCat: https://research-explorer.ista.ac.at/record/1231
DOI: 10.1007/978-3-662-49896-5_13

Fuchsbauer, Georg, et al. Standard Security Does Imply Security against Selective Opening for Markov Distributions. Vol. 9562, Springer, 2016, pp. 282–305, doi:10.1007/978-3-662-49096-9_12.
LibreCat: https://research-explorer.ista.ac.at/record/1233
DOI: 10.1007/978-3-662-49096-9_12

Alwen, Joel F., and Jeremiah Blocki. Efficiently Computing Data-Independent Memory-Hard Functions. Vol. 9815, Springer, 2016, pp. 241–71, doi:10.1007/978-3-662-53008-5_9.
LibreCat: https://research-explorer.ista.ac.at/record/1365
DOI: 10.1007/978-3-662-53008-5_9

Gazi, Peter, and Stefano Tessaro. Provably Robust Sponge-Based PRNGs and KDFs. Vol. 9665, Springer, 2016, pp. 87–116, doi:10.1007/978-3-662-49890-3_4.
LibreCat: https://research-explorer.ista.ac.at/record/1366
DOI: 10.1007/978-3-662-49890-3_4

Abe, Masayuki, et al. “Structure Preserving Signatures and Commitments to Group Elements.”10.1007/s00145-014-9196-7__Journal of Cryptology, vol. 29, no. 2, Springer, 2016, pp. 363–421, doi:10.1007/s00145-014-9196-7.
LibreCat: https://research-explorer.ista.ac.at/record/1592
DOI: 10.1007/s00145-014-9196-7

Fuchsbauer, Georg, et al. Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions. Vol. 9841, Springer, 2016, pp. 391–408, doi:10.1007/978-3-319-44618-9_21.
LibreCat: https://research-explorer.ista.ac.at/record/1225
DOI: 10.1007/978-3-319-44618-9_21