Hemmrich S, Bobolz J, Beverungen D, Blömer J. Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. In: ECIS 2023 Research Papers. ; 2023.
LibreCat: /record/44855

Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. Distributed Computing. Published online 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 J, Eidens F, Jager T, Niehues D, Scheideler C. Robustness and Security. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:145-164. doi:10.5281/zenodo.8068629
LibreCat: /record/45891
DOI: 10.5281/zenodo.8068629

Blömer J, Bobolz J, Bröcher H. On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. In: ; 2023.
LibreCat: /record/35014

Blömer J, Bobolz J, Porzenheim LA. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. In: ; 2023.
LibreCat: /record/43458

Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Heinz Nixdorf Institut, Universität Paderborn; 2023. doi:10.17619/UNIPB/1-1797
LibreCat: /record/45863
DOI: 10.17619/UNIPB/1-1797

Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:10.4230/LIPIcs.DNA.28.8
LibreCat: /record/32602
DOI: 10.4230/LIPIcs.DNA.28.8

Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. 28th International Conference on DNA Computing and Molecular Programming (DNA 28). Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:9:1–9:22. doi:10.4230/LIPIcs.DNA.28.9
LibreCat: /record/32603
DOI: 10.4230/LIPIcs.DNA.28.9

Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In: Agrawal K, Lee I-TA, eds. SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022. ACM; 2022:99–101. doi:10.1145/3490148.3538556
LibreCat: /record/33240
DOI: 10.1145/3490148.3538556

Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:10.4230/LIPIcs.SAND.2022.23
LibreCat: /record/30987
DOI: 10.4230/LIPIcs.SAND.2022.23

Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM. doi:10.1145/3465084.3467932
LibreCat: /record/22283
DOI: 10.1145/3465084.3467932

Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In: Public-Key Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75245-3_22
LibreCat: /record/22057
DOI: 10.1007/978-3-030-75245-3_22

Niehues D. Verifiable Random Functions with Optimal Tightness. In: Public-Key Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75248-4_3
LibreCat: /record/22059
DOI: 10.1007/978-3-030-75248-4_3

Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 2021.
LibreCat: /record/26645

Bobolz J, Eidens F, Krenn S, Ramacher S, Samelin K. Issuer-Hiding Attribute-Based Credentials. In: 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 R. Efficient Forward-Secure Threshold Public Key Encryption. In: K. Liu J, Cui H, eds. Information Security and Privacy - 25th Australasian Conference, ACISP 2020, Perth, WA, Australia, November 30 - December 2, 2020, Proceedings. Vol 12248. Lecture Notes in Computer Science. Springer; 2020:330-349. doi:10.1007/978-3-030-55304-3‑17
LibreCat: /record/19551
DOI: 10.1007/978-3-030-55304-3‑17

Kurek R. Efficient Forward-Secure Threshold Signatures. In: Aoki K, Kanaoka A, eds. Advances in Information and Computer Security - 15th International Workshop on Security, IWSEC 2020, Fukui, Japan, September 2-4, 2020, Proceedings. Vol 12231. Lecture Notes in Computer Science. Springer; 2020:239-260. doi:10.1007/978-3-030-58208-1‑14
LibreCat: /record/19553
DOI: 10.1007/978-3-030-58208-1‑14

Jager T, Niehues D. On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In: Lecture Notes in Computer Science. Cham; 2020. doi:10.1007/978-3-030-38471-5_13
LibreCat: /record/21396
DOI: 10.1007/978-3-030-38471-5_13

Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. Business &; Information Systems Engineering. 2020;62(6):467-481. doi:10.1007/s12599-019-00627-x
LibreCat: /record/13770
DOI: 10.1007/s12599-019-00627-x

Götte T, Vijayalakshmi VR, Scheideler C. Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary. In: Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19). IEEE.
LibreCat: /record/6976