Abusalah, Hamza M. “Proof Systems for Sustainable Decentralized Cryptocurrencies.”https://doi.org/10.15479/AT:ISTA:TH_1046__Institute of Science and Technology Austria, 2018.https://doi.org/10.15479/AT:ISTA:TH_1046 .

Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,”https://doi.org/10.1109/ISIT.2018.8437654__Vol. 2018. IEEE, 2018.https://doi.org/10.1109/ISIT.2018.8437654 .

Dziembowski, Stefan, Krzysztof Z Pietrzak, and Daniel Wichs. “Non-Malleable Codes.”https://doi.org/10.1145/3178432__Journal of the ACM. ACM, 2018.https://doi.org/10.1145/3178432 .

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.”https://doi.org/10.1145/3196494.3196534__In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018.https://doi.org/10.1145/3196494.3196534 .

Micciancio, Daniele, and Michael Walter. “On the Bit Security of Cryptographic Primitives,”https://doi.org/10.1007/978-3-319-78381-9_1__10820:3–28. Springer, 2018.https://doi.org/10.1007/978-3-319-78381-9_1 .

Cohen, Bram, and Krzysztof Z Pietrzak. “Simple Proofs of Sequential Work,”https://doi.org/10.1007/978-3-319-78375-8_15__10821:451–67. Springer, 2018.https://doi.org/10.1007/978-3-319-78375-8_15 .

Alwen, Joel F, Jeremiah Blocki, and Krzysztof Z Pietrzak. “Sustained Space Complexity,”https://doi.org/10.1007/978-3-319-78375-8_4__10821:99–130. Springer, 2018.https://doi.org/10.1007/978-3-319-78375-8_4 .

Chatterjee, Sanjit, Chethan Kamath Hosdurg, and Vikas Kumar. “Private Set-Intersection with Common Set-Up.”https://doi.org/10.3934/amc.2018002__American Institute of Mathematical Sciences. AIMS, 2018.https://doi.org/10.3934/amc.2018002 .

Park, Sunoo, Albert Kwon, Georg Fuchsbauer, Peter Gazi, Joel F Alwen, and Krzysztof Z Pietrzak. “SpaceMint: A Cryptocurrency Based on Proofs of Space.”https://doi.org/10.1007/978-3-662-58387-6_26__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 .

Alwen, Joel F, Susanna De Rezende, Jakob Nordstrom, and Marc Vinyals. “Cumulative Space in Black-White Pebbling and Resolution.”https://doi.org/10.4230/LIPIcs.ITCS.2017.38__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 .

Brody, Joshua, Stefan Dziembowski, Sebastian Faust, and Krzysztof Z Pietrzak. “Position Based Cryptography and Multiparty Communication Complexity.”https://doi.org/10.1007/978-3-319-70500-2_3__edited by Yael Kalai and Leonid Reyzin, 10677:56–81. Springer, 2017.https://doi.org/10.1007/978-3-319-70500-2_3 .

Alwen, Joel F, and Björn Tackmann. “Moderately Hard Functions: Definition, Instantiations, and Applications.”https://doi.org/10.1007/978-3-319-70500-2_17__edited by Yael Kalai and Leonid Reyzin, 10677:493–526. Springer, 2017.https://doi.org/10.1007/978-3-319-70500-2_17 .

Alwen, Joel F, Binchi Chen, Krzysztof Z Pietrzak, Leonid Reyzin, and Stefano Tessaro. “Scrypt Is Maximally Memory Hard.”https://doi.org/10.1007/978-3-319-56617-7_2__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 .

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 .