Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.”https://doi.org/10.1016/j.tcs.2023.114353__Theoretical Computer Science. Elsevier, 2024.https://doi.org/10.1016/j.tcs.2023.114353 .

Alpos, Orestis, Ignacio Amores-Sesar, Christian Cachin, and Michelle X Yeo. “Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks.”https://doi.org/10.4230/LIPIcs.OPODIS.2023.12__In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.https://doi.org/10.4230/LIPIcs.OPODIS.2023.12 .

Auerbach, Benedikt, Christoph Ullrich Günther, and Krzysztof Z Pietrzak. “Trapdoor Memory-Hard Functions.”https://doi.org/10.1007/978-3-031-58734-4_11__In 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, 14653:315–44. Springer Nature, 2024.https://doi.org/10.1007/978-3-031-58734-4_11 .

Hoffmann, Charlotte, Pavel Hubádek, Chethan Kamath, and Krzysztof Z Pietrzak. “Certifying Giant Nonprimes.”https://doi.org/10.1007/978-3-031-31368-4_19__In Public-Key Cryptography - PKC 2023, 13940:530–53. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-31368-4_19 .

Baig, Mirza Ahad, Danny Hendler, Alessia Milani, and Corentin Travers. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.”https://doi.org/10.1007/s00446-022-00439-5__Distributed Computing. Springer Nature, 2023.https://doi.org/10.1007/s00446-022-00439-5 .

Dodis, Yevgeniy, Niels Ferguson, Eli Goldin, Peter Hall, and Krzysztof Z Pietrzak. “Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance.”https://doi.org/10.1007/978-3-031-38545-2_17__In 43rd Annual International Cryptology Conference, 14082:514–46. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-38545-2_17 .

Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient Secret Sharing.”https://doi.org/10.1007/978-3-031-44469-2_11__In 8th International Conference on Cryptology and Information Security in Latin America, 14168:215–28. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-44469-2_11 .

Schmid, Stefan, Jakub Svoboda, and Michelle X Yeo. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.”https://doi.org/10.1007/978-3-031-32733-9_26__In SIROCCO 2023: Structural Information and Communication Complexity , 13892:576–94. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-32733-9_26 .

Yeo, Michelle X. “Advances in Efficiency and Privacy in Payment Channel Network Analysis.”https://doi.org/10.15479/14506__Institute of Science and Technology Austria, 2023.https://doi.org/10.15479/14506 .

Avarikioti, Zeta, Tomasz Lizurej, Tomasz Michalak, and Michelle X Yeo. “Lightning Creation Games.”https://doi.org/10.1109/ICDCS57875.2023.00037__In 43rd International Conference on Distributed Computing Systems, 2023:603–13. IEEE, 2023.https://doi.org/10.1109/ICDCS57875.2023.00037 .

Hoffmann, Charlotte, Pavel Hubádek, Chethan Kamath, and Tomás Krák. “(Verifiable) Delay Functions from Lucas Sequences.”https://doi.org/10.1007/978-3-031-48624-1_13__In 21st International Conference on Theory of Cryptography, 14372:336–62. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-48624-1_13 .

Auerbach, Benedikt, Miguel Cueto Noval, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “On the Cost of Post-Compromise Security in Concurrent Continuous Group-Key Agreement.”https://doi.org/10.1007/978-3-031-48621-0_10__In 21st International Conference on Theory of Cryptography, 14371:271–300. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-48621-0_10 .

Auerbach, Benedikt, Charlotte Hoffmann, and Guillermo Pascual Perez. “Generic-Group Lower Bounds via Reductions between Geometric-Search Problems: With and without Preprocessing.”https://doi.org/10.1007/978-3-031-48621-0_11__In 21st International Conference on Theory of Cryptography, 14371:301–30. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-48621-0_11 .

Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “: Boosting Liquidity in Payment Channel Networks with Online Admission Control.”https://doi.org/10.1007/978-3-031-47754-6_18__In 27th International Conference on Financial Cryptography and Data Security, 13950:309–25. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-47754-6_18 .

Alwen, Joël, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, and Michael Walter. “CoCoA: Concurrent Continuous Group Key Agreement.”https://doi.org/10.1007/978-3-031-07085-3_28__In Advances in Cryptology – EUROCRYPT 2022, 13276:815–844. Cham: Springer Nature, 2022.https://doi.org/10.1007/978-3-031-07085-3_28 .

Bogdanov, Andrej, Miguel Cueto Noval, Charlotte Hoffmann, and Alon Rosen. “Public-Key Encryption from Homogeneous CLWE.”https://doi.org/10.1007/978-3-031-22365-5_20__In Theory of Cryptography, 13748:565–92. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-22365-5_20 .

Avarikioti, Georgia, Krzysztof Z Pietrzak, Iosif Salem, Stefan Schmid, Samarth Tiwari, and Michelle X Yeo. “Hide &; Seek: Privacy-Preserving Rebalancing on Payment Channel Networks.”https://doi.org/10.1007/978-3-031-18283-9_17__In Financial Cryptography and Data Security, 13411:358–73. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-18283-9_17 .

Hoffmann, Charlotte, Pavel Hubádek, Chethan Kamath, Karen Klein, and Krzysztof Z Pietrzak. “Practical Statistically-Sound Proofs of Exponentiation in Any Group.”https://doi.org/10.1007/978-3-031-15979-4_13__In Advances in Cryptology – CRYPTO 2022, 13508:370–99. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-15979-4_13 .

Walter, Michael. “The Convergence of Slide-Type Reductions.”https://doi.org/10.1007/978-3-030-75245-3_3__In Public-Key Cryptography – PKC 2021, 12710:45–67. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-75245-3_3 .

Auerbach, Benedikt, Suvradip Chakraborty, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, Michael Walter, and Michelle X Yeo. “Inverse-Sybil Attacks in Automated Contact Tracing.”https://doi.org/10.1007/978-3-030-75539-3_17__In Topics in Cryptology – CT-RSA 2021, 12704:399–421. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-75539-3_17 .

Laarhoven, Thijs, and Michael Walter. “Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).”https://doi.org/10.1007/978-3-030-75539-3_20__In Topics in Cryptology – CT-RSA 2021, 12704:478–502. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-75539-3_20 .

Chakraborty, Suvradip, Stefan Dziembowski, Magorzata Gazka, Tomasz Lizurej, Krzysztof Z Pietrzak, and Michelle X Yeo. “Trojan-Resilience without Cryptography,”https://doi.org/10.1007/978-3-030-90453-1_14__13043:397–428. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-90453-1_14 .

Alwen, Joel F, Benedikt Auerbach, Mirza Ahad Baig, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, and Michael Walter. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.”https://doi.org/10.1007/978-3-030-90456-2_8__In 19th International Conference, 13044:222–53. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-90456-2_8 .

Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.”https://doi.org/10.1007/978-3-030-90453-1_17__In 19th International Conference, 13043:486–517. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-90453-1_17 .

Chakraborty, Suvradip, Chaya Ganesh, Mahak Pancholi, and Pratik Sarkar. “Reverse Firewalls for Adaptively Secure MPC without Setup.”https://doi.org/10.1007/978-3-030-92075-3_12__In 27th International Conference on the Theory and Application of Cryptology and Information Security, 13091:335–64. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-92075-3_12 .

Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Daniel Wichs. “Limits on the Adaptive Security of Yao’s Garbling.”https://doi.org/10.1007/978-3-030-84245-1_17__In 41st Annual International Cryptology Conference, Part II , 12826:486–515. Cham: Springer Nature, 2021.https://doi.org/10.1007/978-3-030-84245-1_17 .

Klein, Karen, Guillermo Pascual Perez, Michael Walter, Chethan Kamath Hosdurg, Margarita Capretto, Miguel Cueto Noval, Ilia Markov, Michelle X Yeo, Joel F Alwen, and Krzysztof Z Pietrzak. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.”https://doi.org/10.1109/sp40001.2021.00035__In 2021 IEEE Symposium on Security and Privacy , 268–84. IEEE, 2021.https://doi.org/10.1109/sp40001.2021.00035 .

Kamath Hosdurg, Chethan, Karen Klein, and Krzysztof Z Pietrzak. “On Treewidth, Separators and Yao’s Garbling.” In 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research, 2021.

Klein, Karen. “On the Adaptive Security of Graph-Based Games.”https://doi.org/10.15479/at:ista:10035__Institute of Science and Technology Austria, 2021.https://doi.org/10.15479/at:ista:10035 .

Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “The Cost of Adaptivity in Security Games on Graphs.”https://doi.org/10.1007/978-3-030-90453-1_19__In 19th International Conference, 13043:550–81. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-90453-1_19 .

Kamath Hosdurg, Chethan, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “The Cost of Adaptivity in Security Games on Graphs.” In 19th Theory of Cryptography Conference 2021. International Association for Cryptologic Research, 2021.

Pietrzak, Krzysztof Z, Iosif Salem, Stefan Schmid, and Michelle X Yeo. “LightPIR: Privacy-Preserving Route Discovery for Payment Channel Networks.”https://doi.org/10.23919/IFIPNetworking52078.2021.9472205__IEEE, 2021.https://doi.org/10.23919/IFIPNetworking52078.2021.9472205 .

Chakraborty, Suvradip, Stefan Dziembowski, and Jesper Buus Nielsen. “Reverse Firewalls for Actively Secure MPCs.”https://doi.org/10.1007/978-3-030-56880-1_26__In Advances in Cryptology – CRYPTO 2020, 12171:732–62. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-56880-1_26 .

Genise, Nicholas, Daniele Micciancio, Chris Peikert, and Michael Walter. “Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography.”https://doi.org/10.1007/978-3-030-45374-9_21__In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, 12110:623–51. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-45374-9_21 .

Pietrzak, Krzysztof Z. “Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing.”https://doi.org/10.1007/978-3-030-65277-7_1__In Progress in Cryptology, 12578:3–15. LNCS. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-65277-7_1 .

Auerbach, Benedikt, Federico Giacon, and Eike Kiltz. “Everybody’s a Target: Scalability in Public-Key Encryption.”https://doi.org/10.1007/978-3-030-45727-3_16__In Advances in Cryptology – EUROCRYPT 2020, 12107:475–506. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-45727-3_16 .

Kamath Hosdurg, Chethan. “On the Average-Case Hardness of Total Search Problems.”https://doi.org/10.15479/AT:ISTA:7896__Institute of Science and Technology Austria, 2020.https://doi.org/10.15479/AT:ISTA:7896 .

Demay, Gregory, Peter Gazi, Ueli Maurer, and Bjorn Tackmann. “Per-Session Security: Password-Based Cryptography Revisited.”https://doi.org/10.3233/JCS-181131__Journal of Computer Security. IOS Press, 2019.https://doi.org/10.3233/JCS-181131 .

Pietrzak, Krzysztof Z. “Simple Verifiable Delay Functions.”https://doi.org/10.4230/LIPICS.ITCS.2019.60__In 10th Innovations in Theoretical Computer Science Conference, Vol. 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.ITCS.2019.60 .

Walter, Michael. “Sampling the Integers with Low Relative Error.”https://doi.org/10.1007/978-3-030-23696-0_9__In Progress in Cryptology – AFRICACRYPT 2019, edited by J Buchmann, A Nitaj, and T Rachidi, 11627:157–80. LNCS. Cham: Springer Nature, 2019.https://doi.org/10.1007/978-3-030-23696-0_9 .

Skórski, Maciej. “Strong Chain Rules for Min-Entropy under Few Bits Spoiled.”https://doi.org/10.1109/isit.2019.8849240__In 2019 IEEE International Symposium on Information Theory. IEEE, 2019.https://doi.org/10.1109/isit.2019.8849240 .

Abusalah, Hamza M, Chethan Kamath Hosdurg, Karen Klein, Krzysztof Z Pietrzak, and Michael Walter. “Reversible Proofs of Sequential Work.”https://doi.org/10.1007/978-3-030-17656-3_10__In Advances in Cryptology – EUROCRYPT 2019, 11477:277–91. Springer International Publishing, 2019.https://doi.org/10.1007/978-3-030-17656-3_10 .

Choudhuri, Arka Rai, Pavel Hubádek, Chethan Kamath Hosdurg, Krzysztof Z Pietrzak, Alon Rosen, and Guy N. Rothblum. “Finding a Nash Equilibrium Is No Easier than Breaking Fiat-Shamir.”https://doi.org/10.1145/3313276.3316400__In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019, 1103–14. ACM Press, 2019.https://doi.org/10.1145/3313276.3316400 .

Fuchsbauer, Georg, Chethan Kamath Hosdurg, Karen Klein, and Krzysztof Z Pietrzak. “Adaptively Secure Proxy Re-Encryption,”https://doi.org/10.1007/978-3-030-17259-6_11__11443:317–46. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-17259-6_11 .

Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.”https://doi.org/10.13154/tches.v2018.i3.214-242__IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research, 2018.https://doi.org/10.13154/tches.v2018.i3.214-242 .

Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.”https://doi.org/10.4230/LIPICS.ITCS.2019.59__In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), 124:59:1-59:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPICS.ITCS.2019.59 .

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 .

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 .

Abe, Masayuki, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, and Miyako Ohkubo. “Structure Preserving Signatures and Commitments to Group Elements.”https://doi.org/10.1007/s00145-014-9196-7__Journal of Cryptology. Springer, 2016.https://doi.org/10.1007/s00145-014-9196-7 .

Fuchsbauer, Georg, Christian Hanser, Chethan Kamath Hosdurg, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions,”https://doi.org/10.1007/978-3-319-44618-9_21__9841:391–408. Springer, 2016.https://doi.org/10.1007/978-3-319-44618-9_21 .

Okamoto, Tatsuaki, Krzysztof Z Pietrzak, Brent Waters, and Daniel Wichs. “New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators,”https://doi.org/10.1007/978-3-662-48797-6_6__9452:121–45. Springer, 2016.https://doi.org/10.1007/978-3-662-48797-6_6 .

Krenn, Stephan, Krzysztof Z Pietrzak, Akshay Wadia, and Daniel Wichs. “A Counterexample to the Chain Rule for Conditional HILL Entropy.”https://doi.org/10.1007/s00037-015-0120-9__Computational Complexity. Springer, 2016.https://doi.org/10.1007/s00037-015-0120-9 .

Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Offline Witness Encryption,”https://doi.org/10.1007/978-3-319-39555-5_16__9696:285–303. Springer, 2016.https://doi.org/10.1007/978-3-319-39555-5_16 .

Abusalah, Hamza M, Georg Fuchsbauer, and Krzysztof Z Pietrzak. “Constrained PRFs for Unbounded Inputs,”https://doi.org/10.1007/978-3-319-29485-8_24__9610:413–28. Springer, 2016.https://doi.org/10.1007/978-3-319-29485-8_24 .

Abusalah, Hamza M, and Georg Fuchsbauer. “Constrained PRFs for Unbounded Inputs with Short Keys,”https://doi.org/10.1007/978-3-319-39555-5_24__9696:445–63. Springer, 2016.https://doi.org/10.1007/978-3-319-39555-5_24 .

Ferrara, Anna, Georg Fuchsbauer, Bin Liu, and Bogdan Warinschi. “Policy Privacy in Cryptographic Access Control,”https://doi.org/10.1109/CSF.2015.11__46–60. IEEE, 2015.https://doi.org/10.1109/CSF.2015.11 .

Banerjee, Abishek, Georg Fuchsbauer, Chris Peikert, Krzysztof Z Pietrzak, and Sophie Stevens. “Key-Homomorphic Constrained Pseudorandom Functions.”https://doi.org/10.1007/978-3-662-46497-7_2__In 12th Theory of Cryptography Conference, 9015:31–60. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-46497-7_2 .

Fuchsbauer, Georg, Zahra Jafargholi, and Krzysztof Z Pietrzak. “A Quasipolynomial Reduction for Generalized Selective Decryption on Trees,”https://doi.org/10.1007/978-3-662-47989-6_29__9215:601–20. Springer, 2015.https://doi.org/10.1007/978-3-662-47989-6_29 .

Benhamouda, Fabrice, Stephan Krenn, Vadim Lyubashevsky, and Krzysztof Z Pietrzak. “Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings.”https://doi.org/10.1007/978-3-319-24174-6_16__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-319-24174-6_16 .

Demay, Grégory, Peter Gazi, Ueli Maurer, and Björn Tackmann. “Query-Complexity Amplification for Random Oracles,”https://doi.org/10.1007/978-3-319-17470-9_10__9063:159–80. Springer, 2015.https://doi.org/10.1007/978-3-319-17470-9_10 .

Fuchsbauer, Georg, Christian Hanser, and Daniel Slamanig. “Practical Round-Optimal Blind Signatures in the Standard Model,”https://doi.org/10.1007/978-3-662-48000-7_12__9216:233–53. Springer, 2015.https://doi.org/10.1007/978-3-662-48000-7_12 .

Gazi, Peter, and Stefano Tessaro. “Secret-Key Cryptography from Ideal Primitives: A Systematic Verview.”https://doi.org/10.1109/ITW.2015.7133163__In 2015 IEEE Information Theory Workshop. IEEE, 2015.https://doi.org/10.1109/ITW.2015.7133163 .

Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “Generic Security of NMAC and HMAC with Input Whitening.”https://doi.org/10.1007/978-3-662-48800-3_4__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-662-48800-3_4 .

Skórski, Maciej, Alexander Golovnev, and Krzysztof Z Pietrzak. “Condensed Unpredictability ,”https://doi.org/10.1007/978-3-662-47672-7_85__9134:1046–57. Springer, 2015.https://doi.org/10.1007/978-3-662-47672-7_85 .

Baldimtsi, Foteini, Melissa Chase, Georg Fuchsbauer, and Markulf Kohlweiss. “Anonymous Transferable E-Cash.”https://doi.org/10.1007/978-3-662-46447-2_5__In Public-Key Cryptography - PKC 2015, 9020:101–24. Springer, 2015.https://doi.org/10.1007/978-3-662-46447-2_5 .

Alwen, Joel F, and Vladimir Serbinenko. “High Parallel Complexity Graphs and Memory-Hard Functions.”https://doi.org/10.1145/2746539.2746622__In Proceedings of the 47th Annual ACM Symposium on Theory of Computing, 595–603. ACM, 2015.https://doi.org/10.1145/2746539.2746622 .

Alwen, Joel F, Rafail Ostrovsky, Hongsheng Zhou, and Vassilis Zikas. “Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting.”https://doi.org/10.1007/978-3-662-48000-7_37__In Advances in Cryptology - CRYPTO 2015, 9216:763–80. Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-662-48000-7_37 .

Pietrzak, Krzysztof Z, and Maciej Skórski. “The Chain Rule for HILL Pseudoentropy, Revisited.”https://doi.org/10.1007/978-3-319-22174-8_5__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-319-22174-8_5 .

Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC,”https://doi.org/10.1007/978-3-662-47989-6_18__9215:368–87. Springer, 2015.https://doi.org/10.1007/978-3-662-47989-6_18 .

Gazi, Peter, Jooyoung Lee, Yannick Seurin, John Steinberger, and Stefano Tessaro. “Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes.”https://doi.org/10.1007/978-3-662-48116-5_16__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-662-48116-5_16 .

Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. “Proofs of Space.”https://doi.org/10.1007/978-3-662-48000-7_29__In 35th Annual Cryptology Conference, 9216:585–605. Springer, 2015.https://doi.org/10.1007/978-3-662-48000-7_29 .

Fuchsbauer, Georg. “Constrained Verifiable Random Functions .”https://doi.org/10.1007/978-3-319-10879-7_7__In SCN 2014, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer, 2014.https://doi.org/10.1007/978-3-319-10879-7_7 .

Demay, Grégory, Peter Gazi, Ueli Maurer, and Björn Tackmann. “Optimality of Non-Adaptive Strategies: The Case of Parallel Games.”https://doi.org/10.1109/ISIT.2014.6875125__In IEEE International Symposium on Information Theory. IEEE, 2014.https://doi.org/10.1109/ISIT.2014.6875125 .

Dachman Soled, Dana, Georg Fuchsbauer, Payman Mohassel, and Adam O’Neill. “Enhanced Chosen-Ciphertext Security and Applications.”https://doi.org/10.1007/978-3-642-54631-0_19__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, 8383:329–44. Springer, 2014.https://doi.org/10.1007/978-3-642-54631-0_19 .

Yu, Fei, Michal Rybar, Caroline Uhler, and Stephen Fienberg. “Differentially-Private Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.”https://doi.org/10.1007/978-3-319-11257-2_14__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Josep Domingo Ferrer, 8744:170–84. Springer, 2014.https://doi.org/10.1007/978-3-319-11257-2_14 .

Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.”https://doi.org/10.1007/978-3-642-54631-0_30__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, 8383:520–37. Springer, 2014.https://doi.org/10.1007/978-3-642-54631-0_30 .

Dodis, Yevgeniy, Krzysztof Z Pietrzak, and Daniel Wichs. “Key Derivation without Entropy Waste.”https://doi.org/10.1007/978-3-642-55220-5_6__edited by Phong Nguyen and Elisabeth Oswald, 8441:93–110. Springer, 2014.https://doi.org/10.1007/978-3-642-55220-5_6 .

Kiltz, Eike, Daniel Masny, and Krzysztof Z Pietrzak. “Simple Chosen-Ciphertext Security from Low Noise LPN,”https://doi.org/10.1007/978-3-642-54631-0_1__8383:1–18. Springer, 2014.https://doi.org/10.1007/978-3-642-54631-0_1 .

Jetchev, Dimitar, and Krzysztof Z Pietrzak. “How to Fake Auxiliary Input.”https://doi.org/10.1007/978-3-642-54242-8_24__edited by Yehuda Lindell, 8349:566–90. Springer, 2014.https://doi.org/10.1007/978-3-642-54242-8_24 .

Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property Combiners for Hash Functions.”https://doi.org/10.1007/s00145-013-9148-7__Journal of Cryptology. Springer, 2014.https://doi.org/10.1007/s00145-013-9148-7 .

Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact PRF-Security of NMAC and HMAC.”https://doi.org/10.1007/978-3-662-44371-2_7__edited by Juan Garay and Rosario Gennaro, 8616:113–30. Springer, 2014.https://doi.org/10.1007/978-3-662-44371-2_7 .

Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs. “Learning with Rounding, Revisited: New Reduction Properties and Applications.”https://doi.org/10.1007/978-3-642-40041-4_4__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-40041-4_4 .

Kiltz, Eike, Krzysztof Z Pietrzak, and Mario Szegedy. “Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions.”https://doi.org/10.1007/978-3-642-40041-4_31__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-40041-4_31 .

Bernhard, David, Georg Fuchsbauer, and Essam Ghadafi. “Efficient Signatures of Knowledge and DAA in the Standard Model.”https://doi.org/10.1007/978-3-642-38980-1_33__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-38980-1_33 .

Ferrara, Anna, Georg Fuchsbauer, and Bogdan Warinschi. “Cryptographically Enforced RBAC,”https://doi.org/10.1109/CSF.2013.15__115–29. IEEE, 2013.https://doi.org/10.1109/CSF.2013.15 .

Krenn, Stephan, Krzysztof Z Pietrzak, and Akshay Wadia. “A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It.”https://doi.org/10.1007/978-3-642-36594-2_2__edited by Amit Sahai, 7785:23–39. Springer, 2013.https://doi.org/10.1007/978-3-642-36594-2_2 .

Blazy, Olivier, Georg Fuchsbauer, David Pointcheval, and Damien Vergnaud. “Short Blind Signatures.”https://doi.org/10.3233/JCS-130477__Journal of Computer Security. IOS Press, 2013.https://doi.org/10.3233/JCS-130477 .

Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. Proofs of Space. IST Austria, 2013.

Faust, Sebastian, Krzysztof Z Pietrzak, and Joachim Schipper. “Practical Leakage-Resilient Symmetric Cryptography.”https://doi.org/10.1007/978-3-642-33027-8_13__In https://doi.org/10.1007/978-3-642-33027-8_13__Conference Proceedings CHES 2012, 7428:213–32. Springer, 2012.https://doi.org/10.1007/978-3-642-33027-8_13 .

Heyse, Stefan, Eike Kiltz, Vadim Lyubashevsky, Christof Paar, and Krzysztof Z Pietrzak. “Lapin: An Efficient Authentication Protocol Based on Ring-LPN.”https://doi.org/10.1007/978-3-642-34047-5_20__In https://doi.org/10.1007/978-3-642-34047-5_20__Conference Proceedings FSE 2012, 7549:346–65. Springer, 2012.https://doi.org/10.1007/978-3-642-34047-5_20 .

Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.”https://doi.org/10.1145/2382196.2382249__In Proceedings of the 2012 ACM Conference on Computer and Communications Security, 488–500. ACM, 2012.https://doi.org/10.1145/2382196.2382249 .

Jain, Abhishek, Stephan Krenn, Krzysztof Z Pietrzak, and Aris Tentes. “Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise.”https://doi.org/10.1007/978-3-642-34961-4_40__edited by Xiaoyun Wang and Kazue Sako, 7658:663–80. Springer, 2012.https://doi.org/10.1007/978-3-642-34961-4_40 .

Pietrzak, Krzysztof Z. “Cryptography from Learning Parity with Noise,”https://doi.org/10.1007/978-3-642-27660-6_9__7147:99–114. Springer, 2012.https://doi.org/10.1007/978-3-642-27660-6_9 .

Dodis, Yevgeniy, Krzysztof Z Pietrzak, Eike Kiltz, and Daniel Wichs. “Message Authentication, Revisited,”https://doi.org/10.1007/978-3-642-29011-4_22__7237:355–74. Springer, 2012.https://doi.org/10.1007/978-3-642-29011-4_22 .

Pietrzak, Krzysztof Z. “Subspace LWE,”https://doi.org/10.1007/978-3-642-28914-9_31__7194:548–63. Springer, 2012.https://doi.org/10.1007/978-3-642-28914-9_31 .

Pietrzak, Krzysztof Z, Alon Rosen, and Gil Segev. “Lossy Functions Do Not Amplify Well,”https://doi.org/10.1007/978-3-642-28914-9_26__7194:458–75. Springer, 2012.https://doi.org/10.1007/978-3-642-28914-9_26 .

Jain, Abhishek, Krzysztof Z Pietrzak, and Aris Tentes. “Hardness Preserving Constructions of Pseudorandom Functions,”https://doi.org/10.1007/978-3-642-28914-9_21__7194:369–82. Springer, 2012.https://doi.org/10.1007/978-3-642-28914-9_21 .