Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation
S. Schmid, J. Svoboda, M.X. Yeo, Theoretical Computer Science 989 (2024).
LibreCat: https://research-explorer.ista.ac.at/record/14820
DOI: 10.1016/j.tcs.2023.114353

Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks
O. Alpos, I. Amores-Sesar, C. Cachin, M.X. Yeo, in:, 27th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
LibreCat: https://research-explorer.ista.ac.at/record/15007
DOI: 10.4230/LIPIcs.OPODIS.2023.12
arXiv: 2307.02954

Certifying giant nonprimes
C. Hoffmann, P. Hubádek, C. Kamath, K.Z. Pietrzak, in:, Public-Key Cryptography - PKC 2023, Springer Nature, 2023, pp. 530–553.
LibreCat: https://research-explorer.ista.ac.at/record/13143
DOI: 10.1007/978-3-031-31368-4_19

Long-lived counters with polylogarithmic amortized step complexity
M.A. Baig, D. Hendler, A. Milani, C. Travers, Distributed Computing 36 (2023) 29–43.
LibreCat: https://research-explorer.ista.ac.at/record/12164
DOI: 10.1007/s00446-022-00439-5
WoS: 000890138700001

Random oracle combiners: Breaking the concatenation barrier for collision-resistance
Y. Dodis, N. Ferguson, E. Goldin, P. Hall, K.Z. Pietrzak, in:, 43rd Annual International Cryptology Conference, Springer Nature, 2023, pp. 514–546.
LibreCat: https://research-explorer.ista.ac.at/record/14428
DOI: 10.1007/978-3-031-38545-2_17