Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” ECIS 2023 Research Papers, 2023.
LibreCat: /record/44855

Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.”https://doi.org/10.1007/s00446-023-00442-4__Distributed Computing, 2023, doi:https://doi.org/10.1007/s00446-023-00442-4.
LibreCat: /record/45192
DOI: https://doi.org/10.1007/s00446-023-00442-4

Blömer, Johannes, et al. “Robustness and Security.”10.5281/zenodo.8068629__On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64, doi:10.5281/zenodo.8068629.
LibreCat: /record/45891
DOI: 10.5281/zenodo.8068629

Blömer, Johannes, et al. On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC. 2023.
LibreCat: /record/35014

Blömer, Johannes, et al. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. 2023.
LibreCat: /record/43458

Haake, Claus-Jochen, et al. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:10.17619/UNIPB/1-1797.
LibreCat: /record/45863
DOI: 10.17619/UNIPB/1-1797

Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.”10.4230/LIPIcs.DNA.28.8__28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8.
LibreCat: /record/32602
DOI: 10.4230/LIPIcs.DNA.28.8

Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.”10.4230/LIPIcs.DNA.28.9__28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9.
LibreCat: /record/32603
DOI: 10.4230/LIPIcs.DNA.28.9

Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.”10.1145/3490148.3538556__SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:10.1145/3490148.3538556.
LibreCat: /record/33240
DOI: 10.1145/3490148.3538556

Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.”10.4230/LIPIcs.SAND.2022.23__1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23.
LibreCat: /record/30987
DOI: 10.4230/LIPIcs.SAND.2022.23

Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.”10.1145/3465084.3467932__Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.
LibreCat: /record/22283
DOI: 10.1145/3465084.3467932

Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.”10.1007/978-3-030-75245-3_22__Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75245-3_22.
LibreCat: /record/22057
DOI: 10.1007/978-3-030-75245-3_22

Niehues, David. “Verifiable Random Functions with Optimal Tightness.”10.1007/978-3-030-75248-4_3__Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75248-4_3.
LibreCat: /record/22059
DOI: 10.1007/978-3-030-75248-4_3

Bobolz, Jan, et al. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. IACR eprint, 2021.
LibreCat: /record/26645

Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.”10.1007/978-3-030-92548-2_9__Cryptology and Network Security, Springer International Publishing, 2021, doi:10.1007/978-3-030-92548-2_9.
LibreCat: /record/29566
DOI: 10.1007/978-3-030-92548-2_9

Kurek, Rafael. “Efficient Forward-Secure Threshold Public Key Encryption.”10.1007/978-3-030-55304-3‑17__Information Security and Privacy - 25th Australasian Conference, ACISP 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings, edited by Joseph K. Liu and Hui Cui, vol. 12248, Springer, 2020, pp. 330–49, doi:10.1007/978-3-030-55304-3‑17.
LibreCat: /record/19551
DOI: 10.1007/978-3-030-55304-3‑17

Kurek, Rafael. “Efficient Forward-Secure Threshold Signatures.”10.1007/978-3-030-58208-1‑14__Advances in Information and Computer Security - 15th International Workshop on Security, IWSEC 2020, Fukui, Japan, September 2-4, 2020, Proceedings, edited by Kazumaro Aoki and Akira Kanaoka, vol. 12231, Springer, 2020, pp. 239–60, doi:10.1007/978-3-030-58208-1‑14.
LibreCat: /record/19553
DOI: 10.1007/978-3-030-58208-1‑14

Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.”10.1007/978-3-030-38471-5_13__Lecture Notes in Computer Science, 2020, doi:10.1007/978-3-030-38471-5_13.
LibreCat: /record/21396
DOI: 10.1007/978-3-030-38471-5_13

Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.”10.1007/s12599-019-00627-x__Business &; Information Systems Engineering, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:10.1007/s12599-019-00627-x.
LibreCat: /record/13770
DOI: 10.1007/s12599-019-00627-x

Götte, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE.
LibreCat: /record/6976