Baig, Mirza Ahad, et al. “Long-Lived Counters with Polylogarithmic Amortized Step Complexity.”10.1007/s00446-022-00439-5__Distributed Computing, vol. 36, Springer Nature, 2023, pp. 29–43, doi:10.1007/s00446-022-00439-5.

Dodis, Yevgeniy, et al. “Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance.”10.1007/978-3-031-38545-2_17__43rd Annual International Cryptology Conference, vol. 14082, Springer Nature, 2023, pp. 514–46, doi:10.1007/978-3-031-38545-2_17.

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

Schmid, Stefan, et al. “Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.”10.1007/978-3-031-32733-9_26__SIROCCO 2023: Structural Information and Communication Complexity , vol. 13892, Springer Nature, 2023, pp. 576–94, doi:10.1007/978-3-031-32733-9_26.

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

Avarikioti, Zeta, et al. “Lightning Creation Games.”10.1109/ICDCS57875.2023.00037__43rd International Conference on Distributed Computing Systems, vol. 2023, IEEE, 2023, pp. 603–13, doi:10.1109/ICDCS57875.2023.00037.

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.