---
_id: '45863'
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."
alternative_title:
- Collaborative Research Centre 901 (2011 – 2023)
author:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 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
apa: Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., & Wehrheim,
H. (2023). On-The-Fly Computing -- Individualized IT-services in dynamic markets
(Vol. 412). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.17619/UNIPB/1-1797
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={10.17619/UNIPB/1-1797}, 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}
}'
chicago: 'Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning
Wachsmuth, and Heike Wehrheim. On-The-Fly Computing -- Individualized IT-Services
in Dynamic Markets. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts.
Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.17619/UNIPB/1-1797.'
ieee: 'C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim,
On-The-Fly Computing -- Individualized IT-services in dynamic markets,
vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.'
mla: 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.
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.
date_created: 2023-07-05T07:16:51Z
date_updated: 2024-07-12T12:07:59Z
ddc:
- '000'
department:
- _id: '7'
- _id: '78'
- _id: '26'
doi: 10.17619/UNIPB/1-1797
file:
- access_level: open_access
content_type: application/pdf
creator: ups
date_created: 2023-07-05T07:15:55Z
date_updated: 2023-07-05T07:19:14Z
file_id: '45864'
file_name: SFB-Buch-Final.pdf
file_size: 15480050
relation: main_file
file_date_updated: 2023-07-05T07:19:14Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: '247'
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '82'
name: 'SFB 901 - T: SFB 901 - Project Area T'
- _id: '5'
grant_number: '160364472'
name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen (Subproject A1)'
- _id: '7'
grant_number: '160364472'
name: 'SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation
(Subproject A3)'
- _id: '8'
grant_number: '160364472'
name: 'SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen
(Subproject A4)'
- _id: '9'
grant_number: '160364472'
name: 'SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject
B1)'
- _id: '10'
grant_number: '160364472'
name: 'SFB 901 - B2: Konfiguration und Bewertung (B02)'
- _id: '11'
name: 'SFB 901 - B3: SFB 901 - Subproject B3'
- _id: '12'
name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '13'
grant_number: '160364472'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '14'
grant_number: '160364472'
name: 'SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen
(Subproject C2)'
- _id: '16'
grant_number: '160364472'
name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
- _id: '17'
name: 'SFB 901 - C5: SFB 901 - Subproject C5'
- _id: '83'
name: 'SFB 901 - T1: SFB 901 -Subproject T1'
- _id: '84'
grant_number: '160364472'
name: 'SFB 901 - T2: SFB 901 -Subproject T2'
publication_identifier:
unknown:
- 978-3-947647-31-6
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: On-The-Fly Computing -- Individualized IT-services in dynamic markets
type: book
user_id: '1112'
volume: 412
year: '2023'
...
---
_id: '40440'
author:
- first_name: Matthias
full_name: Pilot, Matthias
last_name: Pilot
citation:
ama: Pilot M. Updatable Privacy-Preserving Reputation System Based on Blockchain.;
2023.
apa: Pilot, M. (2023). Updatable Privacy-Preserving Reputation System based on
Blockchain.
bibtex: '@book{Pilot_2023, title={Updatable Privacy-Preserving Reputation System
based on Blockchain}, author={Pilot, Matthias}, year={2023} }'
chicago: Pilot, Matthias. Updatable Privacy-Preserving Reputation System Based
on Blockchain, 2023.
ieee: M. Pilot, Updatable Privacy-Preserving Reputation System based on Blockchain.
2023.
mla: Pilot, Matthias. Updatable Privacy-Preserving Reputation System Based on
Blockchain. 2023.
short: M. Pilot, Updatable Privacy-Preserving Reputation System Based on Blockchain,
2023.
date_created: 2023-01-26T16:07:19Z
date_updated: 2023-01-26T16:08:11Z
department:
- _id: '7'
- _id: '64'
extern: '1'
language:
- iso: eng
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'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Updatable Privacy-Preserving Reputation System based on Blockchain
type: mastersthesis
user_id: '27207'
year: '2023'
...
---
_id: '43374'
author:
- first_name: Patrick
full_name: Schürmann, Patrick
last_name: Schürmann
citation:
ama: Schürmann P. A Formal Comparison of Advanced Digital Signature Primitives.;
2023.
apa: Schürmann, P. (2023). A Formal Comparison of Advanced Digital Signature
Primitives.
bibtex: '@book{Schürmann_2023, title={ A Formal Comparison of Advanced Digital Signature
Primitives}, author={Schürmann, Patrick}, year={2023} }'
chicago: Schürmann, Patrick. A Formal Comparison of Advanced Digital Signature
Primitives, 2023.
ieee: P. Schürmann, A Formal Comparison of Advanced Digital Signature Primitives.
2023.
mla: Schürmann, Patrick. A Formal Comparison of Advanced Digital Signature Primitives.
2023.
short: P. Schürmann, A Formal Comparison of Advanced Digital Signature Primitives,
2023.
date_created: 2023-04-03T14:07:32Z
date_updated: 2023-04-25T22:43:21Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
content_type: application/pdf
creator: bhenrik
date_created: 2023-04-25T10:49:36Z
date_updated: 2023-04-25T10:49:36Z
file_id: '44177'
file_name: masters_thesis_schuermann.pdf
file_size: 1367369
relation: main_file
title: ' A Formal Comparison of Advanced Digital Signature Primitives'
file_date_updated: 2023-04-25T10:49:36Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
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'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: ' A Formal Comparison of Advanced Digital Signature Primitives'
type: mastersthesis
user_id: '41047'
year: '2023'
...
---
_id: '44855'
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.
author:
- first_name: Simon
full_name: Hemmrich, Simon
id: '83557'
last_name: Hemmrich
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Daniel
full_name: Beverungen, Daniel
id: '59677'
last_name: Beverungen
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
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: ECIS 2023 Research Papers. ; 2023.'
apa: Hemmrich, S., Bobolz, J., Beverungen, D., & Blömer, J. (2023). Designing
Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings
on a Blockchain. ECIS 2023 Research Papers. ECIS 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} }'
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 ECIS 2023 Research Papers, 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.
mla: Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method
for Issuing and Trading Monetary Ratings on a Blockchain.” ECIS 2023 Research
Papers, 2023.
short: 'S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, in: ECIS 2023 Research
Papers, 2023.'
conference:
name: ECIS 2023
date_created: 2023-05-16T08:31:27Z
date_updated: 2023-05-23T10:12:32Z
ddc:
- '330'
department:
- _id: '7'
- _id: '64'
- _id: '19'
- _id: '526'
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: jbobolz
date_created: 2023-05-23T10:11:03Z
date_updated: 2023-05-23T10:11:03Z
file_id: '45209'
file_name: A_Blockchain_Based_Reputation_Ecosystem_for_Business___Payments_as_Ratings.pdf
file_size: 958740
relation: main_file
success: 1
file_date_updated: 2023-05-23T10:11:03Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://aisel.aisnet.org/ecis2023_rp/344
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'
publication: ECIS 2023 Research Papers
status: public
title: Designing Business Reputation Ecosystems — A Method for Issuing and Trading
Monetary Ratings on a Blockchain
type: conference
user_id: '27207'
year: '2023'
...
---
_id: '45192'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Kristian
full_name: Hinnenthal, Kristian
id: '32229'
last_name: Hinnenthal
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Julian
full_name: Werthmann, Julian
id: '50024'
last_name: Werthmann
citation:
ama: 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
apa: Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (2023). Time-Optimal
Construction of Overlays. Distributed Computing. https://doi.org/10.1007/s00446-023-00442-4
bibtex: '@article{Götte_Hinnenthal_Scheideler_Werthmann_2023, title={Time-Optimal
Construction of Overlays}, DOI={https://doi.org/10.1007/s00446-023-00442-4},
journal={Distributed Computing}, author={Götte, Thorsten and Hinnenthal, Kristian
and Scheideler, Christian and Werthmann, Julian}, year={2023} }'
chicago: Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian
Werthmann. “Time-Optimal Construction of Overlays.” Distributed Computing,
2023. https://doi.org/10.1007/s00446-023-00442-4.
ieee: 'T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction
of Overlays,” Distributed Computing, 2023, doi: https://doi.org/10.1007/s00446-023-00442-4.'
mla: Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Distributed
Computing, 2023, doi:https://doi.org/10.1007/s00446-023-00442-4.
short: T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing
(2023).
date_created: 2023-05-22T14:34:34Z
date_updated: 2023-05-23T12:38:57Z
doi: https://doi.org/10.1007/s00446-023-00442-4
language:
- iso: eng
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'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Distributed Computing
status: public
title: Time-Optimal Construction of Overlays
type: journal_article
user_id: '477'
year: '2023'
...
---
_id: '43375'
author:
- first_name: Angelina
full_name: Koch, Angelina
last_name: Koch
citation:
ama: Koch A. Privacy-Preserving Collection and Evaluation of Log Files.;
2023.
apa: Koch, A. (2023). Privacy-Preserving Collection and Evaluation of Log Files.
bibtex: '@book{Koch_2023, title={Privacy-Preserving Collection and Evaluation of
Log Files}, author={Koch, Angelina}, year={2023} }'
chicago: Koch, Angelina. Privacy-Preserving Collection and Evaluation of Log
Files, 2023.
ieee: A. Koch, Privacy-Preserving Collection and Evaluation of Log Files.
2023.
mla: Koch, Angelina. Privacy-Preserving Collection and Evaluation of Log Files.
2023.
short: A. Koch, Privacy-Preserving Collection and Evaluation of Log Files, 2023.
date_created: 2023-04-03T14:09:14Z
date_updated: 2023-05-30T11:43:18Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
content_type: application/pdf
creator: feidens
date_created: 2023-05-26T07:07:39Z
date_updated: 2023-05-30T11:43:18Z
file_id: '45303'
file_name: thesis_koch.pdf
file_size: 2275949
relation: main_file
file_date_updated: 2023-05-30T11:43:18Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
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'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Privacy-Preserving Collection and Evaluation of Log Files
type: bachelorsthesis
user_id: '25078'
year: '2023'
...
---
_id: '45891'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
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.
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'
apa: Blömer, J., Eidens, F., Jager, T., Niehues, D., & Scheideler, C. (2023).
Robustness and Security. 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 (Vol. 412, pp. 145–164). Heinz Nixdorf Institut,
Universität Paderborn. https://doi.org/10.5281/zenodo.8068629
bibtex: '@inbook{Blömer_Eidens_Jager_Niehues_Scheideler_2023, place={Paderborn},
series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Robustness
and Security}, volume={412}, DOI={10.5281/zenodo.8068629},
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} }'
chicago: 'Blömer, Johannes, Fabian Eidens, Tibor Jager, David Niehues, and Christian
Scheideler. “Robustness and Security.” In On-The-Fly Computing -- Individualized
IT-Services in Dynamic Markets, 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. https://doi.org/10.5281/zenodo.8068629.'
ieee: 'J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness
and Security,” in On-The-Fly Computing -- Individualized IT-services in dynamic
markets, 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.'
mla: Blömer, Johannes, et al. “Robustness and Security.” 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.
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.'
date_created: 2023-07-07T08:08:47Z
date_updated: 2023-07-07T11:18:21Z
ddc:
- '004'
department:
- _id: '7'
doi: 10.5281/zenodo.8068629
editor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2023-07-07T08:08:37Z
date_updated: 2023-07-07T11:18:21Z
file_id: '45892'
file_name: C1-Chapter-SFB-Buch-Final.pdf
file_size: 320980
relation: main_file
file_date_updated: 2023-07-07T11:18:21Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: 145-164
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Robustness and Security
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '46053'
author:
- first_name: Fabian
full_name: Schneider, Fabian
last_name: Schneider
citation:
ama: Schneider F. Utilizing Redundancy in Distributed Heterogeneous Storage.;
2023.
apa: Schneider, F. (2023). Utilizing Redundancy in Distributed Heterogeneous
Storage.
bibtex: '@book{Schneider_2023, title={Utilizing Redundancy in Distributed Heterogeneous
Storage}, author={Schneider, Fabian}, year={2023} }'
chicago: Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous
Storage, 2023.
ieee: F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage.
2023.
mla: Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous Storage.
2023.
short: F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage,
2023.
date_created: 2023-07-13T12:46:28Z
date_updated: 2023-07-17T07:05:22Z
ddc:
- '004'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2023-07-17T07:05:05Z
date_updated: 2023-07-17T07:05:05Z
file_id: '46071'
file_name: BA-Schneider.pdf
file_size: 1977565
relation: main_file
success: 1
file_date_updated: 2023-07-17T07:05:05Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Utilizing Redundancy in Distributed Heterogeneous Storage
type: bachelorsthesis
user_id: '15504'
year: '2023'
...
---
_id: '35014'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Henrik
full_name: Bröcher, Henrik
id: '41047'
last_name: Bröcher
citation:
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., & Bröcher, H. (2023). On the impossibility of
surviving (iterated) deletion of weakly dominated strategies in rational MPC.
TCC 2023, Taipeh, Taiwan.
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} }'
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.
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.
mla: Blömer, Johannes, et al. On the Impossibility of Surviving (Iterated) Deletion
of Weakly Dominated Strategies in Rational MPC. 2023.
short: 'J. Blömer, J. Bobolz, H. Bröcher, in: 2023.'
conference:
end_date: 2023-12-02
location: Taipeh, Taiwan
name: TCC 2023
start_date: 2023-11-29
date_created: 2022-12-28T16:02:11Z
date_updated: 2023-09-07T10:01:00Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2022/1762
oa: '1'
project:
- _id: '1'
grant_number: '160364472'
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'
status: public
title: On the impossibility of surviving (iterated) deletion of weakly dominated strategies
in rational MPC
type: conference
user_id: '41047'
year: '2023'
...
---
_id: '43458'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Laurens Alexander
full_name: Porzenheim, Laurens Alexander
id: '47434'
last_name: Porzenheim
citation:
ama: 'Blömer J, Bobolz J, Porzenheim LA. A Generic Construction of an Anonymous
Reputation System and Instantiations from Lattices. In: ; 2023.'
apa: Blömer, J., Bobolz, J., & Porzenheim, L. A. (2023). A Generic Construction
of an Anonymous Reputation System and Instantiations from Lattices. Asiacrypt
2023, Guangzhou, China.
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} }'
chicago: Blömer, Johannes, Jan Bobolz, and Laurens Alexander Porzenheim. “A Generic
Construction of an Anonymous Reputation System and Instantiations from Lattices,”
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.
mla: Blömer, Johannes, et al. A Generic Construction of an Anonymous Reputation
System and Instantiations from Lattices. 2023.
short: 'J. Blömer, J. Bobolz, L.A. Porzenheim, in: 2023.'
conference:
end_date: 2023-12-08
location: Guangzhou, China
name: Asiacrypt 2023
start_date: 2023-12-04
date_created: 2023-04-12T08:18:41Z
date_updated: 2023-09-07T09:53:26Z
department:
- _id: '64'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2023/464
oa: '1'
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
status: public
title: A Generic Construction of an Anonymous Reputation System and Instantiations
from Lattices
type: conference
user_id: '47434'
year: '2023'
...
---
_id: '30198'
author:
- first_name: Sebastian
full_name: Korzeczek, Sebastian
last_name: Korzeczek
citation:
ama: Korzeczek S. Aufarbeitung Und Lmplementierung von DAG-Rider.; 2022.
apa: Korzeczek, S. (2022). Aufarbeitung und lmplementierung von DAG-Rider.
bibtex: '@book{Korzeczek_2022, title={Aufarbeitung und lmplementierung von DAG-Rider},
author={Korzeczek, Sebastian}, year={2022} }'
chicago: Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider,
2022.
ieee: S. Korzeczek, Aufarbeitung und lmplementierung von DAG-Rider. 2022.
mla: Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider.
2022.
short: S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.
date_created: 2022-03-03T07:47:00Z
date_updated: 2022-03-03T07:51:02Z
department:
- _id: '79'
language:
- iso: eng
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'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Aufarbeitung und lmplementierung von DAG-Rider
type: bachelorsthesis
user_id: '15504'
year: '2022'
...
---
_id: '32399'
author:
- first_name: Ella
full_name: Vahle, Ella
last_name: Vahle
citation:
ama: Vahle E. Modelling and Proving Security for a Secure MPC Protocol for Stable
Matching.; 2022.
apa: Vahle, E. (2022). Modelling and Proving Security for a Secure MPC Protocol
for Stable Matching.
bibtex: '@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC
Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }'
chicago: Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol
for Stable Matching, 2022.
ieee: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for
Stable Matching. 2022.
mla: Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol for
Stable Matching. 2022.
short: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable
Matching, 2022.
date_created: 2022-07-20T09:38:39Z
date_updated: 2022-07-26T14:31:54Z
department:
- _id: '64'
language:
- iso: eng
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'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Modelling and Proving Security for a Secure MPC Protocol for Stable Matching
type: bachelorsthesis
user_id: '25078'
year: '2022'
...
---
_id: '32602'
author:
- first_name: Andreas
full_name: Padalkin, Andreas
id: '88238'
last_name: Padalkin
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
citation:
ama: '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'
apa: Padalkin, A., Scheideler, C., & Warner, D. (2022). The Structural Power
of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge & S. F.
J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular
Programming (DNA 28) (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.DNA.28.8
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={10.4230/LIPIcs.DNA.28.8},
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)} }'
chicago: 'Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural
Power of Reconfigurable Circuits in the Amoebot Model.” In 28th International
Conference on DNA Computing and Molecular Programming (DNA 28), 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. https://doi.org/10.4230/LIPIcs.DNA.28.8.'
ieee: 'A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable
Circuits in the Amoebot Model,” in 28th International Conference on DNA Computing
and Molecular Programming (DNA 28), 2022, vol. 238, p. 8:1–8:22, doi: 10.4230/LIPIcs.DNA.28.8.'
mla: Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits
in the Amoebot Model.” 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.
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.'
date_created: 2022-08-08T17:32:19Z
date_updated: 2022-11-17T14:18:24Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.DNA.28.8
editor:
- first_name: Thomas E.
full_name: Ouldridge, Thomas E.
last_name: Ouldridge
- first_name: Shelley F. J.
full_name: Wickham, Shelley F. J.
last_name: Wickham
intvolume: ' 238'
language:
- iso: eng
page: 8:1–8:22
place: Dagstuhl, Germany
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'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: 28th International Conference on DNA Computing and Molecular Programming
(DNA 28)
publication_identifier:
isbn:
- 978-3-95977-253-2
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: The Structural Power of Reconfigurable Circuits in the Amoebot Model
type: conference
user_id: '477'
volume: 238
year: '2022'
...
---
_id: '32603'
author:
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
citation:
ama: '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'
apa: Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Fault-Tolerant Shape
Formation in the Amoebot Model. In T. E. Ouldridge & S. F. J. Wickham (Eds.),
28th International Conference on DNA Computing and Molecular Programming (DNA
28) (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.DNA.28.9
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={10.4230/LIPIcs.DNA.28.9},
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)} }'
chicago: 'Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant
Shape Formation in the Amoebot Model.” In 28th International Conference on
DNA Computing and Molecular Programming (DNA 28), 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. https://doi.org/10.4230/LIPIcs.DNA.28.9.'
ieee: 'I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation
in the Amoebot Model,” in 28th International Conference on DNA Computing and
Molecular Programming (DNA 28), 2022, vol. 238, p. 9:1–9:22, doi: 10.4230/LIPIcs.DNA.28.9.'
mla: Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.”
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.
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.'
date_created: 2022-08-08T17:42:43Z
date_updated: 2022-11-17T14:17:09Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.DNA.28.9
editor:
- first_name: Thomas E.
full_name: Ouldridge, Thomas E.
last_name: Ouldridge
- first_name: Shelley F. J.
full_name: Wickham, Shelley F. J.
last_name: Wickham
intvolume: ' 238'
language:
- iso: eng
page: 9:1–9:22
place: Dagstuhl, Germany
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'
publication: 28th International Conference on DNA Computing and Molecular Programming
(DNA 28)
publication_identifier:
isbn:
- 978-3-95977-253-2
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Fault-Tolerant Shape Formation in the Amoebot Model
type: conference
user_id: '477'
volume: 238
year: '2022'
...
---
_id: '32398'
author:
- first_name: Hanna
full_name: Siek, Hanna
last_name: Siek
citation:
ama: 'Siek H. Bringing Structure to Structure-Preserving Signatures: Overview,
Implementation and Comparison of Selected SPS Schemes.; 2022.'
apa: 'Siek, H. (2022). Bringing Structure to Structure-Preserving Signatures:
Overview, Implementation and Comparison of Selected SPS Schemes.'
bibtex: '@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures:
Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek,
Hanna}, year={2022} }'
chicago: 'Siek, Hanna. Bringing Structure to Structure-Preserving Signatures:
Overview, Implementation and Comparison of Selected SPS Schemes, 2022.'
ieee: 'H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview,
Implementation and Comparison of Selected SPS Schemes. 2022.'
mla: 'Siek, Hanna. Bringing Structure to Structure-Preserving Signatures: Overview,
Implementation and Comparison of Selected SPS Schemes. 2022.'
short: 'H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview,
Implementation and Comparison of Selected SPS Schemes, 2022.'
date_created: 2022-07-20T09:36:39Z
date_updated: 2022-11-18T09:38:04Z
department:
- _id: '64'
- _id: '7'
language:
- iso: eng
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'
- _id: '84'
name: 'SFB 901 - T2: SFB 901 -Subproject T2'
- _id: '82'
name: 'SFB 901 - T: SFB 901 - Project Area T'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: 'Bringing Structure to Structure-Preserving Signatures: Overview, Implementation
and Comparison of Selected SPS Schemes'
type: bachelorsthesis
user_id: '477'
year: '2022'
...
---
_id: '31485'
author:
- first_name: Paul
full_name: Kramer, Paul
id: '64594'
last_name: Kramer
citation:
ama: Kramer P. On Transforming Lattice-Based Cryptography to the Ring Setting.;
2022.
apa: Kramer, P. (2022). On Transforming Lattice-Based Cryptography to the Ring
Setting.
bibtex: '@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to
the Ring Setting}, author={Kramer, Paul}, year={2022} }'
chicago: Kramer, Paul. On Transforming Lattice-Based Cryptography to the Ring
Setting, 2022.
ieee: P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting.
2022.
mla: Kramer, Paul. On Transforming Lattice-Based Cryptography to the Ring Setting.
2022.
short: P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting,
2022.
date_created: 2022-05-28T08:07:40Z
date_updated: 2022-11-18T09:40:28Z
department:
- _id: '7'
- _id: '64'
extern: '1'
language:
- iso: eng
project:
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '1'
name: 'SFB 901: SFB 901'
status: public
title: On Transforming Lattice-Based Cryptography to the Ring Setting
type: mastersthesis
user_id: '477'
year: '2022'
...
---
_id: '29763'
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."
author:
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: Niehues D. More Efficient Techniques for Adaptively-Secure Cryptography.;
2022. doi:10.25926/rdtq-jw45
apa: Niehues, D. (2022). More Efficient Techniques for Adaptively-Secure Cryptography.
https://doi.org/10.25926/rdtq-jw45
bibtex: '@book{Niehues_2022, title={More Efficient Techniques for Adaptively-Secure
Cryptography}, DOI={10.25926/rdtq-jw45},
author={Niehues, David}, year={2022} }'
chicago: Niehues, David. More Efficient Techniques for Adaptively-Secure Cryptography,
2022. https://doi.org/10.25926/rdtq-jw45.
ieee: D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography.
2022.
mla: Niehues, David. More Efficient Techniques for Adaptively-Secure Cryptography.
2022, doi:10.25926/rdtq-jw45.
short: D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography,
2022.
date_created: 2022-02-07T13:29:07Z
date_updated: 2022-02-07T13:32:28Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.25926/rdtq-jw45
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2022-02-07T13:26:05Z
date_updated: 2022-02-07T13:26:05Z
file_id: '29764'
file_name: de2107.pdf
file_size: 1542089
relation: main_file
success: 1
file_date_updated: 2022-02-07T13:26:05Z
has_accepted_license: '1'
keyword:
- public-key cryptography
- lattices
- pairings
- verifiable random functions
- identity-based encryption
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf
oa: '1'
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'
publication_status: published
status: public
supervisor:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Anja
full_name: Lehmann, Anja
last_name: Lehmann
title: More Efficient Techniques for Adaptively-Secure Cryptography
type: dissertation
user_id: '36113'
year: '2022'
...
---
_id: '33240'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
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. 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'
apa: 'Götte, T., & Scheideler, C. (2022). Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion. 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 (pp. 99–101). ACM. https://doi.org/10.1145/3490148.3538556'
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={10.1145/3490148.3538556},
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} }'
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 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, 99–101. ACM, 2022. https://doi.org/10.1145/3490148.3538556.'
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 SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms
and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, 2022, pp. 99–101,
doi: 10.1145/3490148.3538556.'
mla: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion.” 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.'
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.'
date_created: 2022-09-01T07:55:00Z
date_updated: 2022-09-01T07:57:53Z
department:
- _id: '79'
doi: 10.1145/3490148.3538556
editor:
- first_name: Kunal
full_name: Agrawal, Kunal
last_name: Agrawal
- first_name: I-Ting Angelina
full_name: Lee, I-Ting Angelina
last_name: Lee
language:
- iso: eng
page: 99–101
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'
publication: 'SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Philadelphia, PA, USA, July 11 - 14, 2022'
publisher: ACM
status: public
title: 'Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous
Byzantine Reliable Broadcast with Improved Resilience through Collusion'
type: conference
user_id: '15504'
year: '2022'
...
---
_id: '30987'
author:
- first_name: Irina
full_name: Kostitsyna, Irina
last_name: Kostitsyna
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Daniel
full_name: Warner, Daniel
id: '3902'
last_name: Warner
citation:
ama: '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'
apa: 'Kostitsyna, I., Scheideler, C., & Warner, D. (2022). Brief Announcement:
Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes & O. Michail
(Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND
2022) (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SAND.2022.23'
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={10.4230/LIPIcs.SAND.2022.23},
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)} }'
chicago: 'Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Brief Announcement:
Fault-Tolerant Shape Formation in the Amoebot Model.” In 1st Symposium on Algorithmic
Foundations of Dynamic Networks (SAND 2022), 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. https://doi.org/10.4230/LIPIcs.SAND.2022.23.'
ieee: 'I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant
Shape Formation in the Amoebot Model,” in 1st Symposium on Algorithmic Foundations
of Dynamic Networks (SAND 2022), 2022, vol. 221, p. 23:1–23:3, doi: 10.4230/LIPIcs.SAND.2022.23.'
mla: 'Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation
in the Amoebot Model.” 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.'
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.'
date_created: 2022-05-03T00:13:06Z
date_updated: 2022-10-27T08:45:52Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.SAND.2022.23
editor:
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Othon
full_name: Michail, Othon
last_name: Michail
intvolume: ' 221'
language:
- iso: eng
page: 23:1–23:3
place: Dagstuhl, Germany
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'
publication: 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)
publication_identifier:
isbn:
- 978-3-95977-224-2
issn:
- 1868-8969
publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: 'Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model'
type: conference
user_id: '15504'
volume: 221
year: '2022'
...
---
_id: '34962'
author:
- first_name: A
full_name: Anonymous, A
last_name: Anonymous
citation:
ama: Anonymous A. Evaluating Database Systems Relying on Secure Multiparty Computation.;
2022.
apa: Anonymous, A. (2022). Evaluating database systems relying on secure multiparty
computation.
bibtex: '@book{Anonymous_2022, title={Evaluating database systems relying on secure
multiparty computation}, author={Anonymous, A}, year={2022} }'
chicago: Anonymous, A. Evaluating Database Systems Relying on Secure Multiparty
Computation, 2022.
ieee: A. Anonymous, Evaluating database systems relying on secure multiparty
computation. 2022.
mla: Anonymous, A. Evaluating Database Systems Relying on Secure Multiparty Computation.
2022.
short: A. Anonymous, Evaluating Database Systems Relying on Secure Multiparty Computation,
2022.
date_created: 2022-12-24T00:14:34Z
date_updated: 2023-01-10T10:31:35Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
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'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Evaluating database systems relying on secure multiparty computation
type: bachelorsthesis
user_id: '41047'
year: '2022'
...