Skórski, M. (2017). On the complexity of breaking pseudoentropy. In G. Jäger &; S. Steila (Eds.) (Vol. 10185, pp. 600–613). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer.https://doi.org/10.1007/978-3-319-55911-7_43 
LibreCat: https://research-explorer.ista.ac.at/record/648
DOI: 10.1007/978-3-319-55911-7_43

Skórski, M. (2017). A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds. In G. Jäger &; S. Steila (Eds.) (Vol. 10185, pp. 586–599). Presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland: Springer.https://doi.org/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, J. F., Blocki, J., &; Harsha, B. (2017). Practical graphs for optimal side-channel resistant memory-hard functions. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (pp. 1001–1017). Dallas, TX, USA: ACM Press.https://doi.org/10.1145/3133956.3134031 
LibreCat: https://research-explorer.ista.ac.at/record/6527
DOI: 10.1145/3133956.3134031

Skórski, M. (2017). On the complexity of estimating Rènyi divergences. In 2017 IEEE International Symposium on Information Theory (ISIT). Aachen, Germany: IEEE.https://doi.org/10.1109/isit.2017.8006529 
LibreCat: https://research-explorer.ista.ac.at/record/6526
DOI: 10.1109/isit.2017.8006529
arXiv: 1702.01666

Pietrzak, K. Z., &; Skórski, M. (2017). Non uniform attacks against pseudoentropy (Vol. 80). Presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2017.39 
LibreCat: https://research-explorer.ista.ac.at/record/697
DOI: 10.4230/LIPIcs.ICALP.2017.39

Obremski, M., &; Skórski, M. (2017). Renyi entropy estimation revisited (Vol. 81). Presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. (2017). (The exact security of) Message authentication codes. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:th_828 
LibreCat: https://research-explorer.ista.ac.at/record/838
DOI: 10.15479/AT:ISTA:th_828

Gazi, P., Pietrzak, K. Z., &; Rybar, M. (2017). The exact security of PMAC. IACR Transactions on Symmetric Cryptology. Ruhr University Bochum.https://doi.org/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, H. M., Alwen, J. F., Cohen, B., Khilko, D., Pietrzak, K. Z., &; Reyzin, L. (2017). Beyond Hellman’s time-memory trade-offs with applications to proofs of space (Vol. 10625, pp. 357–379). Presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China: Springer.https://doi.org/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, Z., Kamath Hosdurg, C., Klein, K., Komargodski, I., Pietrzak, K. Z., &; Wichs, D. (2017). Be adaptive avoid overcommitting. In J. Katz &; H. Shacham (Eds.) (Vol. 10401, pp. 133–163). Presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States: Springer.https://doi.org/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, M. (2017). Lower bounds on key derivation for square-friendly applications (Vol. 66). Presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, J. F., &; Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&;P: European Symposium on Security and Privacy, Paris, France: IEEE.https://doi.org/10.1109/EuroSP.2017.47 
LibreCat: https://research-explorer.ista.ac.at/record/1176
DOI: 10.1109/EuroSP.2017.47
WoS: 000424197300011

Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., &; Jain, A. (2017). Efficient authentication from hard learning problems. Journal of Cryptology. Springer.https://doi.org/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, C., &; Chatterjee, S. (2016). A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. Springer.https://doi.org/10.1007/s00453-015-9997-6 
LibreCat: https://research-explorer.ista.ac.at/record/1177
DOI: 10.1007/s00453-015-9997-6

Pietrzak, K. Z., &; Maciej, S. (2016). Pseudoentropy: Lower-bounds for chain rules and transformations (Vol. 9985, pp. 183–203). Presented at the TCC: Theory of Cryptography Conference, Beijing, China: Springer.https://doi.org/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, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., &; Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer.https://doi.org/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, G., Heuer, F., Kiltz, E., &; Pietrzak, K. Z. (2016). Standard security does imply security against selective opening for markov distributions (Vol. 9562, pp. 282–305). Presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel: Springer.https://doi.org/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, J. F., &; Blocki, J. (2016). Efficiently computing data-independent memory-hard functions (Vol. 9815, pp. 241–271). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA: Springer.https://doi.org/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, P., &; Tessaro, S. (2016). Provably robust sponge-based PRNGs and KDFs (Vol. 9665, pp. 87–116). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer.https://doi.org/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, M., Fuchsbauer, G., Groth, J., Haralambiev, K., &; Ohkubo, M. (2016). Structure preserving signatures and commitments to group elements. Journal of Cryptology. Springer.https://doi.org/10.1007/s00145-014-9196-7 
LibreCat: https://research-explorer.ista.ac.at/record/1592
DOI: 10.1007/s00145-014-9196-7