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 .

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 .

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 .

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 .

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 .

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 .

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 .

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.

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 .

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 .

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 .

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 .