@book{45863,
  abstract     = {{In the proposal for our CRC in 2011, we formulated a vision of markets for
IT services that describes an approach to the provision of such services
that was novel at that time and, to a large extent, remains so today:
„Our vision of on-the-fly computing is that of IT services individually and
automatically configured and brought to execution from flexibly combinable
services traded on markets. At the same time, we aim at organizing
markets whose participants maintain a lively market of services through
appropriate entrepreneurial actions.“
Over the last 12 years, we have developed methods and techniques to
address problems critical to the convenient, efficient, and secure use of
on-the-fly computing. Among other things, we have made the description
of services more convenient by allowing natural language input,
increased the quality of configured services through (natural language)
interaction and more efficient configuration processes and analysis
procedures, made the quality of (the products of) providers in the
marketplace transparent through reputation systems, and increased the
resource efficiency of execution through reconfigurable heterogeneous
computing nodes and an integrated treatment of service description and
configuration. We have also developed network infrastructures that have
a high degree of adaptivity, scalability, efficiency, and reliability, and
provide cryptographic guarantees of anonymity and security for market
participants and their products and services.
To demonstrate the pervasiveness of the OTF computing approach, we
have implemented a proof-of-concept for OTF computing that can run
typical scenarios of an OTF market. We illustrated the approach using
a cutting-edge application scenario – automated machine learning (AutoML).
Finally, we have been pushing our work for the perpetuation of
On-The-Fly Computing beyond the SFB and sharing the expertise gained
in the SFB in events with industry partners as well as transfer projects.
This work required a broad spectrum of expertise. Computer scientists
and economists with research interests such as computer networks and
distributed algorithms, security and cryptography, software engineering
and verification, configuration and machine learning, computer engineering
and HPC, microeconomics and game theory, business informatics
and management have successfully collaborated here.}},
  author       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{247}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{On-The-Fly Computing -- Individualized IT-services in dynamic markets}}},
  doi          = {{10.17619/UNIPB/1-1797}},
  volume       = {{412}},
  year         = {{2023}},
}

@misc{40440,
  author       = {{Pilot, Matthias}},
  title        = {{{Updatable Privacy-Preserving Reputation System based on Blockchain}}},
  year         = {{2023}},
}

@misc{43374,
  author       = {{Schürmann, Patrick}},
  title        = {{{ A Formal Comparison of Advanced Digital Signature Primitives}}},
  year         = {{2023}},
}

@inproceedings{44855,
  abstract     = {{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.}},
  author       = {{Hemmrich, Simon and Bobolz, Jan and Beverungen, Daniel and Blömer, Johannes}},
  booktitle    = {{ECIS 2023 Research Papers}},
  title        = {{{Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain}}},
  year         = {{2023}},
}

@article{45192,
  author       = {{Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}},
  journal      = {{Distributed Computing}},
  title        = {{{Time-Optimal Construction of Overlays}}},
  doi          = {{https://doi.org/10.1007/s00446-023-00442-4}},
  year         = {{2023}},
}

@misc{43375,
  author       = {{Koch, Angelina}},
  title        = {{{Privacy-Preserving Collection and Evaluation of Log Files}}},
  year         = {{2023}},
}

@inbook{45891,
  author       = {{Blömer, Johannes and Eidens, Fabian and Jager, Tibor and Niehues, David and Scheideler, Christian}},
  booktitle    = {{On-The-Fly Computing -- Individualized IT-services in dynamic markets}},
  editor       = {{Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}},
  pages        = {{145--164}},
  publisher    = {{Heinz Nixdorf Institut, Universität Paderborn}},
  title        = {{{Robustness and Security}}},
  doi          = {{10.5281/zenodo.8068629}},
  volume       = {{412}},
  year         = {{2023}},
}

@misc{46053,
  author       = {{Schneider, Fabian}},
  title        = {{{Utilizing Redundancy in Distributed Heterogeneous Storage}}},
  year         = {{2023}},
}

@inproceedings{35014,
  author       = {{Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik}},
  location     = {{Taipeh, Taiwan}},
  title        = {{{On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC}}},
  year         = {{2023}},
}

@inproceedings{43458,
  author       = {{Blömer, Johannes and Bobolz, Jan and Porzenheim, Laurens Alexander}},
  location     = {{Guangzhou, China}},
  title        = {{{A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices}}},
  year         = {{2023}},
}

@misc{30198,
  author       = {{Korzeczek, Sebastian}},
  title        = {{{Aufarbeitung und lmplementierung von DAG-Rider}}},
  year         = {{2022}},
}

@misc{32399,
  author       = {{Vahle, Ella}},
  title        = {{{Modelling and Proving Security for a Secure MPC Protocol for Stable Matching}}},
  year         = {{2022}},
}

@inproceedings{32602,
  author       = {{Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}},
  booktitle    = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}},
  editor       = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}},
  isbn         = {{978-3-95977-253-2}},
  issn         = {{1868-8969}},
  pages        = {{8:1–8:22}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{The Structural Power of Reconfigurable Circuits in the Amoebot Model}}},
  doi          = {{10.4230/LIPIcs.DNA.28.8}},
  volume       = {{238}},
  year         = {{2022}},
}

@inproceedings{32603,
  author       = {{Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}},
  booktitle    = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}},
  editor       = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}},
  isbn         = {{978-3-95977-253-2}},
  issn         = {{1868-8969}},
  pages        = {{9:1–9:22}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{Fault-Tolerant Shape Formation in the Amoebot Model}}},
  doi          = {{10.4230/LIPIcs.DNA.28.9}},
  volume       = {{238}},
  year         = {{2022}},
}

@misc{32398,
  author       = {{Siek, Hanna}},
  title        = {{{Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes}}},
  year         = {{2022}},
}

@misc{31485,
  author       = {{Kramer, Paul}},
  title        = {{{On Transforming Lattice-Based Cryptography to the Ring Setting}}},
  year         = {{2022}},
}

@phdthesis{29763,
  abstract     = {{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.
Different 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.
While 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.}},
  author       = {{Niehues, David}},
  keywords     = {{public-key cryptography, lattices, pairings, verifiable random functions, identity-based encryption}},
  title        = {{{More Efficient Techniques for Adaptively-Secure Cryptography}}},
  doi          = {{10.25926/rdtq-jw45}},
  year         = {{2022}},
}

@inproceedings{33240,
  author       = {{Götte, Thorsten and Scheideler, Christian}},
  booktitle    = {{SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}},
  editor       = {{Agrawal, Kunal and Lee, I-Ting Angelina}},
  pages        = {{99–101}},
  publisher    = {{ACM}},
  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}},
}

@inproceedings{30987,
  author       = {{Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}},
  booktitle    = {{1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}},
  editor       = {{Aspnes, James and Michail, Othon}},
  isbn         = {{978-3-95977-224-2}},
  issn         = {{1868-8969}},
  pages        = {{23:1–23:3}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}}},
  doi          = {{10.4230/LIPIcs.SAND.2022.23}},
  volume       = {{221}},
  year         = {{2022}},
}

@misc{34962,
  author       = {{Anonymous, A}},
  title        = {{{Evaluating database systems relying on secure multiparty computation}}},
  year         = {{2022}},
}