[{"place":"Paderborn","page":"247","intvolume":"       412","citation":{"chicago":"Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>.","ieee":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.","ama":"Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Heinz Nixdorf Institut, Universität Paderborn; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>","apa":"Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., &#38; Wehrheim, H. (2023). <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>","bibtex":"@book{Haake_Meyer auf der Heide_Platzner_Wachsmuth_Wehrheim_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, volume={412}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Haake, Claus-Jochen, et al. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>.","short":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim, On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023."},"has_accepted_license":"1","publication_identifier":{"unknown":["978-3-947647-31-6"]},"doi":"10.17619/UNIPB/1-1797","oa":"1","date_updated":"2024-07-12T12:07:59Z","volume":412,"author":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"status":"public","type":"book","file_date_updated":"2023-07-05T07:19:14Z","alternative_title":["Collaborative Research Centre 901 (2011 – 2023)"],"_id":"45863","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"grant_number":"160364472","_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"},{"grant_number":"160364472","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)","_id":"7"},{"grant_number":"160364472","name":"SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)","_id":"8"},{"grant_number":"160364472","_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)"},{"grant_number":"160364472","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","_id":"10"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"grant_number":"160364472","name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen (Subproject C2)"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"},{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"grant_number":"160364472","name":"SFB 901 - T2: SFB 901 -Subproject T2","_id":"84"}],"department":[{"_id":"7"},{"_id":"78"},{"_id":"26"}],"user_id":"1112","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","year":"2023","title":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-05T07:16:51Z","abstract":[{"lang":"eng","text":"In the proposal for our CRC in 2011, we formulated a vision of markets for\r\nIT services that describes an approach to the provision of such services\r\nthat was novel at that time and, to a large extent, remains so today:\r\n„Our vision of on-the-fly computing is that of IT services individually and\r\nautomatically configured and brought to execution from flexibly combinable\r\nservices traded on markets. At the same time, we aim at organizing\r\nmarkets whose participants maintain a lively market of services through\r\nappropriate entrepreneurial actions.“\r\nOver the last 12 years, we have developed methods and techniques to\r\naddress problems critical to the convenient, efficient, and secure use of\r\non-the-fly computing. Among other things, we have made the description\r\nof services more convenient by allowing natural language input,\r\nincreased the quality of configured services through (natural language)\r\ninteraction and more efficient configuration processes and analysis\r\nprocedures, made the quality of (the products of) providers in the\r\nmarketplace transparent through reputation systems, and increased the\r\nresource efficiency of execution through reconfigurable heterogeneous\r\ncomputing nodes and an integrated treatment of service description and\r\nconfiguration. We have also developed network infrastructures that have\r\na high degree of adaptivity, scalability, efficiency, and reliability, and\r\nprovide cryptographic guarantees of anonymity and security for market\r\nparticipants and their products and services.\r\nTo demonstrate the pervasiveness of the OTF computing approach, we\r\nhave implemented a proof-of-concept for OTF computing that can run\r\ntypical scenarios of an OTF market. We illustrated the approach using\r\na cutting-edge application scenario – automated machine learning (AutoML).\r\nFinally, we have been pushing our work for the perpetuation of\r\nOn-The-Fly Computing beyond the SFB and sharing the expertise gained\r\nin the SFB in events with industry partners as well as transfer projects.\r\nThis work required a broad spectrum of expertise. Computer scientists\r\nand economists with research interests such as computer networks and\r\ndistributed algorithms, security and cryptography, software engineering\r\nand verification, configuration and machine learning, computer engineering\r\nand HPC, microeconomics and game theory, business informatics\r\nand management have successfully collaborated here."}],"file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2023-07-05T07:19:14Z","creator":"ups","date_created":"2023-07-05T07:15:55Z","file_size":15480050,"access_level":"open_access","file_name":"SFB-Buch-Final.pdf","file_id":"45864"}],"ddc":["000"],"language":[{"iso":"eng"}]},{"title":"Updatable Privacy-Preserving Reputation System based on Blockchain","date_updated":"2023-01-26T16:08:11Z","date_created":"2023-01-26T16:07:19Z","supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"author":[{"last_name":"Pilot","full_name":"Pilot, Matthias","first_name":"Matthias"}],"year":"2023","citation":{"mla":"Pilot, Matthias. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>. 2023.","bibtex":"@book{Pilot_2023, title={Updatable Privacy-Preserving Reputation System based on Blockchain}, author={Pilot, Matthias}, year={2023} }","short":"M. Pilot, Updatable Privacy-Preserving Reputation System Based on Blockchain, 2023.","apa":"Pilot, M. (2023). <i>Updatable Privacy-Preserving Reputation System based on Blockchain</i>.","chicago":"Pilot, Matthias. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>, 2023.","ieee":"M. Pilot, <i>Updatable Privacy-Preserving Reputation System based on Blockchain</i>. 2023.","ama":"Pilot M. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>.; 2023."},"extern":"1","language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"40440","user_id":"27207","department":[{"_id":"7"},{"_id":"64"}],"status":"public","type":"mastersthesis"},{"user_id":"41047","department":[{"_id":"64"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"43374","file_date_updated":"2023-04-25T10:49:36Z","language":[{"iso":"eng"}],"ddc":["000"],"type":"mastersthesis","file":[{"title":" A Formal Comparison of Advanced Digital Signature Primitives","file_size":1367369,"access_level":"open_access","file_name":"masters_thesis_schuermann.pdf","file_id":"44177","date_updated":"2023-04-25T10:49:36Z","creator":"bhenrik","date_created":"2023-04-25T10:49:36Z","relation":"main_file","content_type":"application/pdf"}],"status":"public","supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"author":[{"last_name":"Schürmann","full_name":"Schürmann, Patrick","first_name":"Patrick"}],"date_created":"2023-04-03T14:07:32Z","oa":"1","date_updated":"2023-04-25T22:43:21Z","title":" A Formal Comparison of Advanced Digital Signature Primitives","has_accepted_license":"1","citation":{"ieee":"P. Schürmann, <i> A Formal Comparison of Advanced Digital Signature Primitives</i>. 2023.","chicago":"Schürmann, Patrick. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>, 2023.","ama":"Schürmann P. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>.; 2023.","apa":"Schürmann, P. (2023). <i> A Formal Comparison of Advanced Digital Signature Primitives</i>.","short":"P. Schürmann,  A Formal Comparison of Advanced Digital Signature Primitives, 2023.","mla":"Schürmann, Patrick. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>. 2023.","bibtex":"@book{Schürmann_2023, title={ A Formal Comparison of Advanced Digital Signature Primitives}, author={Schürmann, Patrick}, year={2023} }"},"year":"2023"},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"_id":"44855","user_id":"27207","department":[{"_id":"7"},{"_id":"64"},{"_id":"19"},{"_id":"526"}],"ddc":["330"],"language":[{"iso":"eng"}],"file_date_updated":"2023-05-23T10:11:03Z","extern":"1","type":"conference","publication":"ECIS 2023 Research Papers","abstract":[{"lang":"eng","text":"Market transactions are subject to information asymmetry about the delivered value proposition, causing transaction costs and adverse market effects among buyers and sellers. Information systems research has investigated how review systems can reduce information asymmetry in business-to-consumer markets. However, these systems cannot be readily applied to business-to-business markets, are vulnerable to manipulation, and suffer from conceptual weak spots since they use textual data or star ratings. Building on design science research, we conceptualize a new class of reputation systems based on monetary-based payments as quantitative ratings for each transaction stored on a blockchain. Using cryptography, we show that our system assures content confidentiality so that buyers can share and sell their ratings selectively, establishing a reputation ecosystem. Our prescriptive insights advance the design of reputation systems and offer new paths to understanding the antecedents, dynamics, and consequences to reduce information asymmetry in B2B transactions."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":958740,"file_name":"A_Blockchain_Based_Reputation_Ecosystem_for_Business___Payments_as_Ratings.pdf","file_id":"45209","access_level":"closed","date_updated":"2023-05-23T10:11:03Z","date_created":"2023-05-23T10:11:03Z","creator":"jbobolz"}],"status":"public","date_updated":"2023-05-23T10:12:32Z","author":[{"last_name":"Hemmrich","full_name":"Hemmrich, Simon","id":"83557","first_name":"Simon"},{"last_name":"Bobolz","full_name":"Bobolz, Jan","id":"27207","first_name":"Jan"},{"full_name":"Beverungen, Daniel","id":"59677","last_name":"Beverungen","first_name":"Daniel"},{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2023-05-16T08:31:27Z","title":"Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain","main_file_link":[{"url":"https://aisel.aisnet.org/ecis2023_rp/344"}],"conference":{"name":"ECIS 2023"},"has_accepted_license":"1","year":"2023","citation":{"apa":"Hemmrich, S., Bobolz, J., Beverungen, D., &#38; Blömer, J. (2023). Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. <i>ECIS 2023 Research Papers</i>. ECIS 2023.","short":"S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, in: ECIS 2023 Research Papers, 2023.","mla":"Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” <i>ECIS 2023 Research Papers</i>, 2023.","bibtex":"@inproceedings{Hemmrich_Bobolz_Beverungen_Blömer_2023, title={Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain}, booktitle={ECIS 2023 Research Papers}, author={Hemmrich, Simon and Bobolz, Jan and Beverungen, Daniel and Blömer, Johannes}, year={2023} }","ama":"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: <i>ECIS 2023 Research Papers</i>. ; 2023.","chicago":"Hemmrich, Simon, Jan Bobolz, Daniel Beverungen, and Johannes Blömer. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” In <i>ECIS 2023 Research Papers</i>, 2023.","ieee":"S. Hemmrich, J. Bobolz, D. Beverungen, and J. Blömer, “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain,” presented at the ECIS 2023, 2023."}},{"title":"Time-Optimal Construction of Overlays","doi":"https://doi.org/10.1007/s00446-023-00442-4","date_updated":"2023-05-23T12:38:57Z","date_created":"2023-05-22T14:34:34Z","author":[{"full_name":"Götte, Thorsten","id":"34727","last_name":"Götte","first_name":"Thorsten"},{"last_name":"Hinnenthal","full_name":"Hinnenthal, Kristian","id":"32229","first_name":"Kristian"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Werthmann","full_name":"Werthmann, Julian","id":"50024","first_name":"Julian"}],"year":"2023","citation":{"chicago":"Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” <i>Distributed Computing</i>, 2023. <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>.","ieee":"T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” <i>Distributed Computing</i>, 2023, doi: <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>.","ama":"Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. <i>Distributed Computing</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>","apa":"Götte, T., Hinnenthal, K., Scheideler, C., &#38; Werthmann, J. (2023). Time-Optimal Construction of Overlays. <i>Distributed Computing</i>. <a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>","bibtex":"@article{Götte_Hinnenthal_Scheideler_Werthmann_2023, title={Time-Optimal Construction of Overlays}, DOI={<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>}, journal={Distributed Computing}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, year={2023} }","mla":"Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” <i>Distributed Computing</i>, 2023, doi:<a href=\"https://doi.org/10.1007/s00446-023-00442-4\">https://doi.org/10.1007/s00446-023-00442-4</a>.","short":"T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023)."},"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"45192","user_id":"477","status":"public","type":"journal_article","publication":"Distributed Computing"},{"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2023-05-26T07:07:39Z","creator":"feidens","date_updated":"2023-05-30T11:43:18Z","access_level":"open_access","file_name":"thesis_koch.pdf","file_id":"45303","file_size":2275949}],"type":"bachelorsthesis","ddc":["000"],"file_date_updated":"2023-05-30T11:43:18Z","language":[{"iso":"eng"}],"_id":"43375","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"64"}],"user_id":"25078","year":"2023","citation":{"apa":"Koch, A. (2023). <i>Privacy-Preserving Collection and Evaluation of Log Files</i>.","mla":"Koch, Angelina. <i>Privacy-Preserving Collection and Evaluation of Log Files</i>. 2023.","bibtex":"@book{Koch_2023, title={Privacy-Preserving Collection and Evaluation of Log Files}, author={Koch, Angelina}, year={2023} }","short":"A. Koch, Privacy-Preserving Collection and Evaluation of Log Files, 2023.","ama":"Koch A. <i>Privacy-Preserving Collection and Evaluation of Log Files</i>.; 2023.","ieee":"A. Koch, <i>Privacy-Preserving Collection and Evaluation of Log Files</i>. 2023.","chicago":"Koch, Angelina. <i>Privacy-Preserving Collection and Evaluation of Log Files</i>, 2023."},"has_accepted_license":"1","title":"Privacy-Preserving Collection and Evaluation of Log Files","oa":"1","date_updated":"2023-05-30T11:43:18Z","date_created":"2023-04-03T14:09:14Z","author":[{"full_name":"Koch, Angelina","last_name":"Koch","first_name":"Angelina"}],"supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}]},{"ddc":["004"],"language":[{"iso":"eng"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"relation":"main_file","content_type":"application/pdf","file_size":320980,"file_name":"C1-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","file_id":"45892","date_updated":"2023-07-07T11:18:21Z","date_created":"2023-07-07T08:08:37Z","creator":"florida"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-07T08:08:47Z","title":"Robustness and Security","year":"2023","_id":"45891","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"department":[{"_id":"7"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","file_date_updated":"2023-07-07T11:18:21Z","type":"book_chapter","editor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"status":"public","oa":"1","date_updated":"2023-07-07T11:18:21Z","volume":412,"author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"id":"25078","full_name":"Eidens, Fabian","last_name":"Eidens","first_name":"Fabian"},{"last_name":"Jager","id":"64669","full_name":"Jager, Tibor","first_name":"Tibor"},{"first_name":"David","last_name":"Niehues","id":"36113","full_name":"Niehues, David"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"doi":"10.5281/zenodo.8068629","has_accepted_license":"1","place":"Paderborn","intvolume":"       412","page":"145-164","citation":{"ama":"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. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:145-164. doi:<a href=\"https://doi.org/10.5281/zenodo.8068629\">10.5281/zenodo.8068629</a>","ieee":"J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness and Security,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–164.","chicago":"Blömer, Johannes, Fabian Eidens, Tibor Jager, David Niehues, and Christian Scheideler. “Robustness and Security.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:145–64. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068629\">https://doi.org/10.5281/zenodo.8068629</a>.","short":"J. Blömer, F. Eidens, T. Jager, D. Niehues, C. Scheideler, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 145–164.","mla":"Blömer, Johannes, et al. “Robustness and Security.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64, doi:<a href=\"https://doi.org/10.5281/zenodo.8068629\">10.5281/zenodo.8068629</a>.","bibtex":"@inbook{Blömer_Eidens_Jager_Niehues_Scheideler_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Robustness and Security}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068629\">10.5281/zenodo.8068629</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Blömer, Johannes and Eidens, Fabian and Jager, Tibor and Niehues, David and Scheideler, Christian}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={145–164}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","apa":"Blömer, J., Eidens, F., Jager, T., Niehues, D., &#38; Scheideler, C. (2023). Robustness and Security. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 145–164). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068629\">https://doi.org/10.5281/zenodo.8068629</a>"}},{"type":"bachelorsthesis","status":"public","file":[{"date_updated":"2023-07-17T07:05:05Z","creator":"florida","date_created":"2023-07-17T07:05:05Z","file_size":1977565,"file_id":"46071","access_level":"closed","file_name":"BA-Schneider.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"46053","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"file_date_updated":"2023-07-17T07:05:05Z","language":[{"iso":"eng"}],"ddc":["004"],"has_accepted_license":"1","citation":{"ama":"Schneider F. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>.; 2023.","chicago":"Schneider, Fabian. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>, 2023.","ieee":"F. Schneider, <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>. 2023.","apa":"Schneider, F. (2023). <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>.","bibtex":"@book{Schneider_2023, title={Utilizing Redundancy in Distributed Heterogeneous Storage}, author={Schneider, Fabian}, year={2023} }","mla":"Schneider, Fabian. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>. 2023.","short":"F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage, 2023."},"year":"2023","author":[{"last_name":"Schneider","full_name":"Schneider, Fabian","first_name":"Fabian"}],"supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2023-07-13T12:46:28Z","date_updated":"2023-07-17T07:05:22Z","title":"Utilizing Redundancy in Distributed Heterogeneous Storage"},{"user_id":"41047","department":[{"_id":"34"},{"_id":"64"}],"project":[{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"_id":"35014","language":[{"iso":"eng"}],"type":"conference","status":"public","date_created":"2022-12-28T16:02:11Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Jan","last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan"},{"id":"41047","full_name":"Bröcher, Henrik","last_name":"Bröcher","first_name":"Henrik"}],"oa":"1","date_updated":"2023-09-07T10:01:00Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2022/1762"}],"conference":{"name":"TCC 2023","start_date":"2023-11-29","end_date":"2023-12-02","location":"Taipeh, Taiwan"},"title":"On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC","citation":{"ieee":"J. Blömer, J. Bobolz, and H. Bröcher, “On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC,” presented at the TCC 2023, Taipeh, Taiwan, 2023.","chicago":"Blömer, Johannes, Jan Bobolz, and Henrik Bröcher. “On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC,” 2023.","ama":"Blömer J, Bobolz J, Bröcher H. On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. In: ; 2023.","apa":"Blömer, J., Bobolz, J., &#38; Bröcher, H. (2023). <i>On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC</i>. TCC 2023, Taipeh, Taiwan.","mla":"Blömer, Johannes, et al. <i>On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC</i>. 2023.","short":"J. Blömer, J. Bobolz, H. Bröcher, in: 2023.","bibtex":"@inproceedings{Blömer_Bobolz_Bröcher_2023, title={On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC}, author={Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik}, year={2023} }"},"year":"2023"},{"year":"2023","citation":{"mla":"Blömer, Johannes, et al. <i>A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices</i>. 2023.","short":"J. Blömer, J. Bobolz, L.A. Porzenheim, in: 2023.","bibtex":"@inproceedings{Blömer_Bobolz_Porzenheim_2023, title={A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices}, author={Blömer, Johannes and Bobolz, Jan and Porzenheim, Laurens Alexander}, year={2023} }","apa":"Blömer, J., Bobolz, J., &#38; Porzenheim, L. A. (2023). <i>A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices</i>. Asiacrypt 2023, Guangzhou, China.","ama":"Blömer J, Bobolz J, Porzenheim LA. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. In: ; 2023.","ieee":"J. Blömer, J. Bobolz, and L. A. Porzenheim, “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” presented at the Asiacrypt 2023, Guangzhou, China, 2023.","chicago":"Blömer, Johannes, Jan Bobolz, and Laurens Alexander Porzenheim. “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” 2023."},"date_updated":"2023-09-07T09:53:26Z","oa":"1","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Jan","last_name":"Bobolz","full_name":"Bobolz, Jan","id":"27207"},{"first_name":"Laurens Alexander","id":"47434","full_name":"Porzenheim, Laurens Alexander","last_name":"Porzenheim"}],"date_created":"2023-04-12T08:18:41Z","title":"A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices","conference":{"start_date":"2023-12-04","name":"Asiacrypt 2023","location":"Guangzhou, China","end_date":"2023-12-08"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2023/464"}],"type":"conference","status":"public","_id":"43458","project":[{"name":"SFB 901: SFB 901","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"47434","language":[{"iso":"eng"}]},{"citation":{"apa":"Korzeczek, S. (2022). <i>Aufarbeitung und lmplementierung von DAG-Rider</i>.","short":"S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.","bibtex":"@book{Korzeczek_2022, title={Aufarbeitung und lmplementierung von DAG-Rider}, author={Korzeczek, Sebastian}, year={2022} }","mla":"Korzeczek, Sebastian. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>. 2022.","chicago":"Korzeczek, Sebastian. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>, 2022.","ieee":"S. Korzeczek, <i>Aufarbeitung und lmplementierung von DAG-Rider</i>. 2022.","ama":"Korzeczek S. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>.; 2022."},"year":"2022","title":"Aufarbeitung und lmplementierung von DAG-Rider","supervisor":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2022-03-03T07:47:00Z","author":[{"first_name":"Sebastian","full_name":"Korzeczek, Sebastian","last_name":"Korzeczek"}],"date_updated":"2022-03-03T07:51:02Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"30198","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}]},{"date_updated":"2022-07-26T14:31:54Z","date_created":"2022-07-20T09:38:39Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"author":[{"full_name":"Vahle, Ella","last_name":"Vahle","first_name":"Ella"}],"title":"Modelling and Proving Security for a Secure MPC Protocol for Stable Matching","year":"2022","citation":{"bibtex":"@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }","mla":"Vahle, Ella. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>. 2022.","short":"E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable Matching, 2022.","apa":"Vahle, E. (2022). <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>.","ieee":"E. Vahle, <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>. 2022.","chicago":"Vahle, Ella. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>, 2022.","ama":"Vahle E. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>.; 2022."},"_id":"32399","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"department":[{"_id":"64"}],"user_id":"25078","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"32602","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"477","department":[{"_id":"79"}],"editor":[{"first_name":"Thomas E.","last_name":"Ouldridge","full_name":"Ouldridge, Thomas E."},{"first_name":"Shelley F. J.","full_name":"Wickham, Shelley F. J.","last_name":"Wickham"}],"status":"public","type":"conference","doi":"10.4230/LIPIcs.DNA.28.8","date_updated":"2022-11-17T14:18:24Z","author":[{"last_name":"Padalkin","id":"88238","full_name":"Padalkin, Andreas","first_name":"Andreas"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"last_name":"Warner","full_name":"Warner, Daniel","id":"3902","first_name":"Daniel"}],"volume":238,"place":"Dagstuhl, Germany","citation":{"apa":"Padalkin, A., Scheideler, C., &#38; Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge &#38; S. F. J. Wickham (Eds.), <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i> (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>","short":"A. Padalkin, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 8:1–8:22.","bibtex":"@inproceedings{Padalkin_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Structural Power of Reconfigurable Circuits in the Amoebot Model}, volume={238}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={8:1–8:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","mla":"Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 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:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","ama":"Padalkin A, Scheideler C, Warner D. The Structural Power of Reconfigurable Circuits in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>. Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:8:1–8:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>","ieee":"A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 8:1–8:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">10.4230/LIPIcs.DNA.28.8</a>.","chicago":"Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.” In <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.8\">https://doi.org/10.4230/LIPIcs.DNA.28.8</a>."},"page":"8:1–8:22","intvolume":"       238","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"language":[{"iso":"eng"}],"publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","title":"The Structural Power of Reconfigurable Circuits in the Amoebot Model","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","date_created":"2022-08-08T17:32:19Z","year":"2022"},{"title":"Fault-Tolerant Shape Formation in the Amoebot Model","date_created":"2022-08-08T17:42:43Z","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","year":"2022","language":[{"iso":"eng"}],"publication":"28th International Conference on DNA Computing and Molecular Programming (DNA 28)","doi":"10.4230/LIPIcs.DNA.28.9","author":[{"first_name":"Irina","full_name":"Kostitsyna, Irina","last_name":"Kostitsyna"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Warner, Daniel","id":"3902","last_name":"Warner","first_name":"Daniel"}],"volume":238,"date_updated":"2022-11-17T14:17:09Z","citation":{"apa":"Kostitsyna, I., Scheideler, C., &#38; Warner, D. (2022). Fault-Tolerant Shape Formation in the Amoebot Model. In T. E. Ouldridge &#38; S. F. J. Wickham (Eds.), <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i> (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">https://doi.org/10.4230/LIPIcs.DNA.28.9</a>","mla":"Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.” <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 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:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>.","bibtex":"@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Fault-Tolerant Shape Formation in the Amoebot Model}, volume={238}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>}, booktitle={28th International Conference on DNA Computing and Molecular Programming (DNA 28)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Ouldridge, Thomas E. and Wickham, Shelley F. J.}, year={2022}, pages={9:1–9:22}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"I. Kostitsyna, C. Scheideler, D. Warner, in: T.E. Ouldridge, S.F.J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 9:1–9:22.","ama":"Kostitsyna I, Scheideler C, Warner D. Fault-Tolerant Shape Formation in the Amoebot Model. In: Ouldridge TE, Wickham SFJ, eds. <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>. Vol 238. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:9:1–9:22. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant Shape Formation in the Amoebot Model.” In <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:9:1–9:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">https://doi.org/10.4230/LIPIcs.DNA.28.9</a>.","ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,” in <i>28th International Conference on DNA Computing and Molecular Programming (DNA 28)</i>, 2022, vol. 238, p. 9:1–9:22, doi: <a href=\"https://doi.org/10.4230/LIPIcs.DNA.28.9\">10.4230/LIPIcs.DNA.28.9</a>."},"page":"9:1–9:22","intvolume":"       238","place":"Dagstuhl, Germany","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-253-2"]},"user_id":"477","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","department":[{"_id":"79"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"_id":"32603","status":"public","editor":[{"full_name":"Ouldridge, Thomas E.","last_name":"Ouldridge","first_name":"Thomas E."},{"first_name":"Shelley F. J.","full_name":"Wickham, Shelley F. J.","last_name":"Wickham"}],"type":"conference"},{"title":"Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes","date_updated":"2022-11-18T09:38:04Z","date_created":"2022-07-20T09:36:39Z","author":[{"last_name":"Siek","full_name":"Siek, Hanna","first_name":"Hanna"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"year":"2022","citation":{"bibtex":"@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek, Hanna}, year={2022} }","mla":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022.","short":"H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes, 2022.","apa":"Siek, H. (2022). <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.","ama":"Siek H. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>.; 2022.","chicago":"Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>, 2022.","ieee":"H. Siek, <i>Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes</i>. 2022."},"language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - T2: SFB 901 -Subproject T2","_id":"84"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"}],"_id":"32398","user_id":"477","department":[{"_id":"64"},{"_id":"7"}],"status":"public","type":"bachelorsthesis"},{"status":"public","type":"mastersthesis","extern":"1","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"7"},{"_id":"64"}],"project":[{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"name":"SFB 901: SFB 901","_id":"1"}],"_id":"31485","citation":{"bibtex":"@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to the Ring Setting}, author={Kramer, Paul}, year={2022} }","mla":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022.","short":"P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.","apa":"Kramer, P. (2022). <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.","ama":"Kramer P. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.; 2022.","chicago":"Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>, 2022.","ieee":"P. Kramer, <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>. 2022."},"year":"2022","title":"On Transforming Lattice-Based Cryptography to the Ring Setting","date_created":"2022-05-28T08:07:40Z","author":[{"last_name":"Kramer","full_name":"Kramer, Paul","id":"64594","first_name":"Paul"}],"date_updated":"2022-11-18T09:40:28Z"},{"status":"public","type":"dissertation","file_date_updated":"2022-02-07T13:26:05Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"_id":"29763","user_id":"36113","department":[{"_id":"558"}],"citation":{"ieee":"D. Niehues, <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 2022.","chicago":"Niehues, David. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>, 2022. <a href=\"https://doi.org/10.25926/rdtq-jw45\">https://doi.org/10.25926/rdtq-jw45</a>.","ama":"Niehues D. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>.; 2022. doi:<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>","short":"D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography, 2022.","mla":"Niehues, David. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 2022, doi:<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>.","bibtex":"@book{Niehues_2022, title={More Efficient Techniques for Adaptively-Secure Cryptography}, DOI={<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>}, author={Niehues, David}, year={2022} }","apa":"Niehues, D. (2022). <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. <a href=\"https://doi.org/10.25926/rdtq-jw45\">https://doi.org/10.25926/rdtq-jw45</a>"},"publication_status":"published","has_accepted_license":"1","main_file_link":[{"url":"https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf","open_access":"1"}],"doi":"10.25926/rdtq-jw45","oa":"1","date_updated":"2022-02-07T13:32:28Z","supervisor":[{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"first_name":"Anja","last_name":"Lehmann","full_name":"Lehmann, Anja"}],"author":[{"first_name":"David","last_name":"Niehues","id":"36113","full_name":"Niehues, David"}],"abstract":[{"lang":"eng","text":"Modern-day communication has become more and more digital. While this comes with many advantages such as a more efficient economy, it has also created more and more opportunities for various adversaries to manipulate communication or eavesdrop on it. The Snowden revelations in 2013 further highlighted the seriousness of these threats. To protect the communication of people, companies, and states from such threats, we require cryptography with strong security guarantees.\r\nDifferent applications may require different security properties from cryptographic schemes. For most applications, however, so-called adaptive security is considered a reasonable minimal requirement of security. Cryptographic schemes with adaptive security remain secure in the presence of an adversary that can corrupt communication partners to respond to messages of the adversaries choice, while the adversary may choose the messages based on previously observed interactions.\r\nWhile cryptography is associated the most with encryption, this is only one of many primitives that are essential for the security of digital interactions. This thesis presents novel identity-based encryption (IBE) schemes and verifiable random functions (VRFs) that achieve adaptive security as outlined above. Moreover, the cryptographic schemes presented in this thesis are proven secure in the standard model. That is without making use of idealized models like the random oracle model."}],"file":[{"file_id":"29764","access_level":"closed","file_name":"de2107.pdf","file_size":1542089,"creator":"davnie","date_created":"2022-02-07T13:26:05Z","date_updated":"2022-02-07T13:26:05Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","ddc":["000"],"keyword":["public-key cryptography","lattices","pairings","verifiable random functions","identity-based encryption"],"language":[{"iso":"eng"}],"year":"2022","title":"More Efficient Techniques for Adaptively-Secure Cryptography","date_created":"2022-02-07T13:29:07Z"},{"_id":"33240","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}],"publication":"SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022","type":"conference","editor":[{"last_name":"Agrawal","full_name":"Agrawal, Kunal","first_name":"Kunal"},{"first_name":"I-Ting Angelina","last_name":"Lee","full_name":"Lee, I-Ting Angelina"}],"status":"public","publisher":"ACM","date_updated":"2022-09-01T07:57:53Z","author":[{"first_name":"Thorsten","id":"34727","full_name":"Götte, Thorsten","last_name":"Götte"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2022-09-01T07:55:00Z","title":"Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion","doi":"10.1145/3490148.3538556","year":"2022","page":"99–101","citation":{"ama":"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. <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>. ACM; 2022:99–101. doi:<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>","chicago":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” In <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. <a href=\"https://doi.org/10.1145/3490148.3538556\">https://doi.org/10.1145/3490148.3538556</a>.","ieee":"T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion,” in <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, 2022, pp. 99–101, doi: <a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>.","bibtex":"@inproceedings{Götte_Scheideler_2022, title={Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion}, DOI={<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>}, booktitle={SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}, publisher={ACM}, author={Götte, Thorsten and Scheideler, Christian}, editor={Agrawal, Kunal and Lee, I-Ting Angelina}, year={2022}, pages={99–101} }","mla":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>.","short":"T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.","apa":"Götte, T., &#38; Scheideler, C. (2022). Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In K. Agrawal &#38; I.-T. A. Lee (Eds.), <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i> (pp. 99–101). ACM. <a href=\"https://doi.org/10.1145/3490148.3538556\">https://doi.org/10.1145/3490148.3538556</a>"}},{"page":"23:1–23:3","intvolume":"       221","citation":{"bibtex":"@inproceedings{Kostitsyna_Scheideler_Warner_2022, place={Dagstuhl, Germany}, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}, volume={221}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, publisher={Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, author={Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={23:1–23:3}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","short":"I. Kostitsyna, C. Scheideler, D. Warner, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022, p. 23:1–23:3.","mla":"Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>.","apa":"Kostitsyna, I., Scheideler, C., &#38; Warner, D. (2022). Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes &#38; O. Michail (Eds.), <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i> (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">https://doi.org/10.4230/LIPIcs.SAND.2022.23</a>","ama":"Kostitsyna I, Scheideler C, Warner D. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In: Aspnes J, Michail O, eds. <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>. Vol 221. Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2022:23:1–23:3. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>","ieee":"I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, 2022, vol. 221, p. 23:1–23:3, doi: <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">10.4230/LIPIcs.SAND.2022.23</a>.","chicago":"Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)</i>, edited by James Aspnes and Othon Michail, 221:23:1–23:3. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.23\">https://doi.org/10.4230/LIPIcs.SAND.2022.23</a>."},"place":"Dagstuhl, Germany","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-224-2"]},"doi":"10.4230/LIPIcs.SAND.2022.23","volume":221,"author":[{"last_name":"Kostitsyna","full_name":"Kostitsyna, Irina","first_name":"Irina"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Daniel","id":"3902","full_name":"Warner, Daniel","last_name":"Warner"}],"date_updated":"2022-10-27T08:45:52Z","status":"public","editor":[{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"full_name":"Michail, Othon","last_name":"Michail","first_name":"Othon"}],"type":"conference","department":[{"_id":"79"}],"series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","user_id":"15504","_id":"30987","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"year":"2022","title":"Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model","date_created":"2022-05-03T00:13:06Z","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)","language":[{"iso":"eng"}]},{"date_updated":"2023-01-10T10:31:35Z","author":[{"first_name":"A","last_name":"Anonymous","full_name":"Anonymous, A"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_created":"2022-12-24T00:14:34Z","title":"Evaluating database systems relying on secure multiparty computation","year":"2022","citation":{"short":"A. Anonymous, Evaluating Database Systems Relying on Secure Multiparty Computation, 2022.","bibtex":"@book{Anonymous_2022, title={Evaluating database systems relying on secure multiparty computation}, author={Anonymous, A}, year={2022} }","mla":"Anonymous, A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>. 2022.","apa":"Anonymous, A. (2022). <i>Evaluating database systems relying on secure multiparty computation</i>.","ieee":"A. Anonymous, <i>Evaluating database systems relying on secure multiparty computation</i>. 2022.","chicago":"Anonymous, A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>, 2022.","ama":"Anonymous A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>.; 2022."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"_id":"34962","user_id":"41047","department":[{"_id":"34"},{"_id":"64"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"}]