Hoffmann, Charlotte, et al. “(Verifiable) Delay Functions from Lucas Sequences.”10.1007/978-3-031-48624-1_13__21st International Conference on Theory of Cryptography, vol. 14372, Springer Nature, 2023, pp. 336–62, doi:10.1007/978-3-031-48624-1_13.

Auerbach, Benedikt, et al. “On the Cost of Post-Compromise Security in Concurrent Continuous Group-Key Agreement.”10.1007/978-3-031-48621-0_10__21st International Conference on Theory of Cryptography, vol. 14371, Springer Nature, 2023, pp. 271–300, doi:10.1007/978-3-031-48621-0_10.

Auerbach, Benedikt, et al. “Generic-Group Lower Bounds via Reductions between Geometric-Search Problems: With and without Preprocessing.”10.1007/978-3-031-48621-0_11__21st International Conference on Theory of Cryptography, vol. 14371, Springer Nature, 2023, pp. 301–30, doi:10.1007/978-3-031-48621-0_11.

Bastankhah, Mahsa, et al. “: Boosting Liquidity in Payment Channel Networks with Online Admission Control.”10.1007/978-3-031-47754-6_18__27th International Conference on Financial Cryptography and Data Security, vol. 13950, Springer Nature, 2023, pp. 309–25, doi:10.1007/978-3-031-47754-6_18.

Alwen, Joël, et al. “CoCoA: Concurrent Continuous Group Key Agreement.”10.1007/978-3-031-07085-3_28__Advances in Cryptology – EUROCRYPT 2022, vol. 13276, Springer Nature, 2022, pp. 815–844, doi:10.1007/978-3-031-07085-3_28.

Bogdanov, Andrej, et al. “Public-Key Encryption from Homogeneous CLWE.”10.1007/978-3-031-22365-5_20__Theory of Cryptography, vol. 13748, Springer Nature, 2022, pp. 565–92, doi:10.1007/978-3-031-22365-5_20.

Avarikioti, Georgia, et al. “Hide &; Seek: Privacy-Preserving Rebalancing on Payment Channel Networks.”10.1007/978-3-031-18283-9_17__Financial Cryptography and Data Security, vol. 13411, Springer Nature, 2022, pp. 358–73, doi:10.1007/978-3-031-18283-9_17.

Hoffmann, Charlotte, et al. “Practical Statistically-Sound Proofs of Exponentiation in Any Group.”10.1007/978-3-031-15979-4_13__Advances in Cryptology – CRYPTO 2022, vol. 13508, Springer Nature, 2022, pp. 370–99, doi:10.1007/978-3-031-15979-4_13.

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

Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.”10.1007/978-3-030-75539-3_17__Topics in Cryptology – CT-RSA 2021, vol. 12704, Springer Nature, 2021, pp. 399–421, doi:10.1007/978-3-030-75539-3_17.

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

Chakraborty, Suvradip, et al. Trojan-Resilience without Cryptography. Vol. 13043, Springer Nature, 2021, pp. 397–428, doi:10.1007/978-3-030-90453-1_14.

Alwen, Joel F., et al. “Grafting Key Trees: Efficient Key Management for Overlapping Groups.”10.1007/978-3-030-90456-2_8__19th International Conference, vol. 13044, Springer Nature, 2021, pp. 222–53, doi:10.1007/978-3-030-90456-2_8.

Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.”10.1007/978-3-030-90453-1_17__19th International Conference, vol. 13043, Springer Nature, 2021, pp. 486–517, doi:10.1007/978-3-030-90453-1_17.

Chakraborty, Suvradip, et al. “Reverse Firewalls for Adaptively Secure MPC without Setup.”10.1007/978-3-030-92075-3_12__27th International Conference on the Theory and Application of Cryptology and Information Security, vol. 13091, Springer Nature, 2021, pp. 335–64, doi:10.1007/978-3-030-92075-3_12.

Kamath Hosdurg, Chethan, et al. “Limits on the Adaptive Security of Yao’s Garbling.”10.1007/978-3-030-84245-1_17__41st Annual International Cryptology Conference, Part II , vol. 12826, Springer Nature, 2021, pp. 486–515, doi:10.1007/978-3-030-84245-1_17.

Klein, Karen, et al. “Keep the Dirt: Tainted TreeKEM, Adaptively and Actively Secure Continuous Group Key Agreement.”10.1109/sp40001.2021.00035__2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–84, doi:10.1109/sp40001.2021.00035.

Kamath Hosdurg, Chethan, et al. “On Treewidth, Separators and Yao’s Garbling.” 19th Theory of Cryptography Conference 2021, 2021/926, International Association for Cryptologic Research, 2021.

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

Kamath Hosdurg, Chethan, et al. “The Cost of Adaptivity in Security Games on Graphs.”10.1007/978-3-030-90453-1_19__19th International Conference, vol. 13043, Springer Nature, 2021, pp. 550–81, doi:10.1007/978-3-030-90453-1_19.