Micciancio, D., &; Walter, M. (2018). On the bit security of cryptographic primitives (Vol. 10820, pp. 3–28). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-319-78381-9_1 
LibreCat: https://research-explorer.ista.ac.at/record/300
DOI: 10.1007/978-3-319-78381-9_1
WoS: 000517097500001

Cohen, B., &; Pietrzak, K. Z. (2018). Simple proofs of sequential work (Vol. 10821, pp. 451–467). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-319-78375-8_15 
LibreCat: https://research-explorer.ista.ac.at/record/302
DOI: 10.1007/978-3-319-78375-8_15
WoS: 000517098700015

Alwen, J. F., Blocki, J., &; Pietrzak, K. Z. (2018). Sustained space complexity (Vol. 10821, pp. 99–130). Presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-319-78375-8_4 
LibreCat: https://research-explorer.ista.ac.at/record/298
DOI: 10.1007/978-3-319-78375-8_4
WoS: 000517098700004
arXiv: 1705.05313

Chatterjee, S., Kamath Hosdurg, C., &; Kumar, V. (2018). Private set-intersection with common set-up. American Institute of Mathematical Sciences. AIMS.https://doi.org/10.3934/amc.2018002 
LibreCat: https://research-explorer.ista.ac.at/record/5980
DOI: 10.3934/amc.2018002
WoS: 000430950400002

Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., &; Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature.https://doi.org/10.1007/978-3-662-58387-6_26 
LibreCat: https://research-explorer.ista.ac.at/record/6941
DOI: 10.1007/978-3-662-58387-6_26
WoS: 000540656400026

Alwen, J. F., De Rezende, S., Nordstrom, J., &; Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ITCS.2017.38 
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38

Brody, J., Dziembowski, S., Faust, S., &; Pietrzak, K. Z. (2017). Position based cryptography and multiparty communication complexity. In Y. Kalai &; L. Reyzin (Eds.) (Vol. 10677, pp. 56–81). Presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States: Springer.https://doi.org/10.1007/978-3-319-70500-2_3 
LibreCat: https://research-explorer.ista.ac.at/record/605
DOI: 10.1007/978-3-319-70500-2_3

Alwen, J. F., &; Tackmann, B. (2017). Moderately hard functions: Definition, instantiations, and applications. In Y. Kalai &; L. Reyzin (Eds.) (Vol. 10677, pp. 493–526). Presented at the TCC: Theory of Cryptography, Baltimore, MD, United States: Springer.https://doi.org/10.1007/978-3-319-70500-2_17 
LibreCat: https://research-explorer.ista.ac.at/record/609
DOI: 10.1007/978-3-319-70500-2_17

Alwen, J. F., Chen, B., Pietrzak, K. Z., Reyzin, L., &; Tessaro, S. (2017). Scrypt is maximally memory hard. In J.-S. Coron &; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 33–62). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer.https://doi.org/10.1007/978-3-319-56617-7_2 
LibreCat: https://research-explorer.ista.ac.at/record/635
DOI: 10.1007/978-3-319-56617-7_2

Alwen, J. F., Blocki, J., &; Pietrzak, K. Z. (2017). Depth-robust graphs and their cumulative memory complexity. In J.-S. Coron &; J. Buus Nielsen (Eds.) (Vol. 10212, pp. 3–32). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France: Springer.https://doi.org/10.1007/978-3-319-56617-7_1 
LibreCat: https://research-explorer.ista.ac.at/record/640
DOI: 10.1007/978-3-319-56617-7_1

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