[{"file_date_updated":"2018-03-15T10:30:42Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"546","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:30:42Z","creator":"florida","date_created":"2018-03-15T10:30:42Z","file_size":244841,"file_name":"546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf","access_level":"closed","file_id":"1286"}],"abstract":[{"lang":"eng","text":"Self-stabilization is the property of a system to transfer itself regardless of the initial state into a legitimate state. Chord as a simple, decentralized and scalable distributed hash table is an ideal showcase to introduce self-stabilization for p2p overlays. In this paper, we present Re-Chord, a self-stabilizing version of Chord. We show, that the stabilization process is functional, but prone to strong churn. For that, we present Ca-Re-Chord, a churn resistant version of Re-Chord, that allows the creation of a useful DHT in any kind of graph regardless of the initial state. Simulation results attest the churn resistance and good performance of Ca-Re-Chord."}],"publication":"Proceedings of the Conference on Networked Systems (NetSys)","type":"conference","doi":"10.1109/NetSys.2013.11","title":"Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network","date_created":"2017-10-17T12:42:38Z","author":[{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"},{"full_name":"Benter, Markus","last_name":"Benter","first_name":"Markus"},{"first_name":"Mohammad","full_name":"Divband, Mohammad","last_name":"Divband"},{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"}],"date_updated":"2022-01-06T07:01:55Z","page":"27-34","citation":{"apa":"Graffi, K., Benter, M., Divband, M., Kniesburges, S., &#38; Koutsopoulos, A. (2013). Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In <i>Proceedings of the Conference on Networked Systems (NetSys)</i> (pp. 27–34). <a href=\"https://doi.org/10.1109/NetSys.2013.11\">https://doi.org/10.1109/NetSys.2013.11</a>","bibtex":"@inproceedings{Graffi_Benter_Divband_Kniesburges_Koutsopoulos_2013, title={Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network}, DOI={<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Graffi, Kalman and Benter, Markus and Divband, Mohammad and Kniesburges, Sebastian and Koutsopoulos, Andreas}, year={2013}, pages={27–34} }","short":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, A. Koutsopoulos, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.","mla":"Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 27–34, doi:<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>.","chicago":"Graffi, Kalman, Markus Benter, Mohammad Divband, Sebastian Kniesburges, and Andreas Koutsopoulos. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” In <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 27–34, 2013. <a href=\"https://doi.org/10.1109/NetSys.2013.11\">https://doi.org/10.1109/NetSys.2013.11</a>.","ieee":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, and A. Koutsopoulos, “Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network,” in <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 27–34.","ama":"Graffi K, Benter M, Divband M, Kniesburges S, Koutsopoulos A. Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:27-34. doi:<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>"},"year":"2013","has_accepted_license":"1"},{"year":"2013","citation":{"apa":"Bick, C. (2013). <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn.","bibtex":"@book{Bick_2013, title={Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner}, publisher={Universität Paderborn}, author={Bick, Christian}, year={2013} }","short":"C. Bick, Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner, Universität Paderborn, 2013.","mla":"Bick, Christian. <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn, 2013.","ama":"Bick C. <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn; 2013.","ieee":"C. Bick, <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn, 2013.","chicago":"Bick, Christian. <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn, 2013."},"date_updated":"2022-01-06T07:01:56Z","publisher":"Universität Paderborn","author":[{"first_name":"Christian","full_name":"Bick, Christian","last_name":"Bick"}],"date_created":"2017-10-17T12:42:39Z","title":"Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner","type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"549","user_id":"477","language":[{"iso":"ger"}]},{"author":[{"first_name":"Julian","last_name":"Meschede","full_name":"Meschede, Julian"}],"date_created":"2017-10-17T12:42:39Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:56Z","title":"Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen","citation":{"apa":"Meschede, J. (2013). <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn.","mla":"Meschede, Julian. <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn, 2013.","bibtex":"@book{Meschede_2013, title={Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen}, publisher={Universität Paderborn}, author={Meschede, Julian}, year={2013} }","short":"J. Meschede, Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen, Universität Paderborn, 2013.","ama":"Meschede J. <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn; 2013.","ieee":"J. Meschede, <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn, 2013.","chicago":"Meschede, Julian. <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn, 2013."},"year":"2013","user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"550","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"title":"Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise","date_updated":"2022-01-06T07:01:57Z","publisher":"Universität Paderborn","supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"author":[{"first_name":"Kathlén","last_name":"Kohn","full_name":"Kohn, Kathlén"}],"date_created":"2017-10-17T12:42:40Z","year":"2013","citation":{"mla":"Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.","short":"K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise, Universität Paderborn, 2013.","bibtex":"@book{Kohn_2013, title={Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}, publisher={Universität Paderborn}, author={Kohn, Kathlén}, year={2013} }","apa":"Kohn, K. (2013). <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn.","ieee":"K. Kohn, <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.","chicago":"Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.","ama":"Kohn K. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn; 2013."},"language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"553","user_id":"477","department":[{"_id":"64"}],"status":"public","type":"bachelorsthesis"},{"year":"2013","citation":{"chicago":"Hallmann, Corinna. <i>An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation</i>. Universität Paderborn, 2013.","ieee":"C. Hallmann, <i>An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation</i>. Universität Paderborn, 2013.","ama":"Hallmann C. <i>An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation</i>. Universität Paderborn; 2013.","apa":"Hallmann, C. (2013). <i>An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation</i>. Universität Paderborn.","short":"C. Hallmann, An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation, Universität Paderborn, 2013.","bibtex":"@book{Hallmann_2013, title={An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation}, publisher={Universität Paderborn}, author={Hallmann, Corinna}, year={2013} }","mla":"Hallmann, Corinna. <i>An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation</i>. Universität Paderborn, 2013."},"has_accepted_license":"1","title":"An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:59Z","author":[{"full_name":"Hallmann, Corinna","last_name":"Hallmann","first_name":"Corinna"}],"date_created":"2017-10-17T12:42:40Z","abstract":[{"lang":"eng","text":"Since the last two decades, the water consumption in Germany is decreasing, which causes the water tanks and pipes in a water supply system to work inefficiently. This paper proposes an approach for a decision support system, which helps to decide how to plan new water tanks and resize existing tanks in water supply systems. The approach uses a combination of network reduction, mathematical optimization and hydraulic simulation. The mathematical optimization model is a nonconvex Mixed Integer Quadratically Constrained Program (MIQCP), which is solved by a piecewise linearization. As this may lead to many binary variables and therefore high computational times, the size of the water supply system model is reduced before building the optimization model. By applying several network reduction techniques there may occur some hydraulic differences between the original network model and the reduced network model. To make sure that the solution obtained in the optimization process is feasible in the original water supply system, the solution is verified by a hydraulic simulation tool."}],"file":[{"creator":"florida","date_created":"2018-03-15T10:27:58Z","date_updated":"2018-03-15T10:27:58Z","file_id":"1283","access_level":"closed","file_name":"557-Hal13.pdf","file_size":271038,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"report","ddc":["040"],"file_date_updated":"2018-03-15T10:27:58Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"557","user_id":"15504"},{"publisher":"InderScience","date_updated":"2022-01-06T07:02:07Z","author":[{"full_name":"Petrlic, Ronald","last_name":"Petrlic","first_name":"Ronald"},{"last_name":"Sekula","full_name":"Sekula, Stephan","first_name":"Stephan"},{"last_name":"Sorge","full_name":"Sorge, Christoph","first_name":"Christoph"}],"date_created":"2017-10-17T12:42:41Z","title":"A privacy-friendly Architecture for future Cloud Computing","main_file_link":[{"url":"http://www.inderscience.com/offer.php?id=57120"}],"doi":"10.1504/IJGUC.2013.057120","has_accepted_license":"1","issue":"4","year":"2013","citation":{"bibtex":"@article{Petrlic_Sekula_Sorge_2013, title={A privacy-friendly Architecture for future Cloud Computing}, DOI={<a href=\"https://doi.org/10.1504/IJGUC.2013.057120\">10.1504/IJGUC.2013.057120</a>}, number={4}, journal={International Journal of Grid and Utility Computing}, publisher={InderScience}, author={Petrlic, Ronald and Sekula, Stephan and Sorge, Christoph}, year={2013}, pages={265–277} }","short":"R. Petrlic, S. Sekula, C. Sorge, International Journal of Grid and Utility Computing (2013) 265–277.","mla":"Petrlic, Ronald, et al. “A Privacy-Friendly Architecture for Future Cloud Computing.” <i>International Journal of Grid and Utility Computing</i>, no. 4, InderScience, 2013, pp. 265–77, doi:<a href=\"https://doi.org/10.1504/IJGUC.2013.057120\">10.1504/IJGUC.2013.057120</a>.","apa":"Petrlic, R., Sekula, S., &#38; Sorge, C. (2013). A privacy-friendly Architecture for future Cloud Computing. <i>International Journal of Grid and Utility Computing</i>, (4), 265–277. <a href=\"https://doi.org/10.1504/IJGUC.2013.057120\">https://doi.org/10.1504/IJGUC.2013.057120</a>","ama":"Petrlic R, Sekula S, Sorge C. A privacy-friendly Architecture for future Cloud Computing. <i>International Journal of Grid and Utility Computing</i>. 2013;(4):265-277. doi:<a href=\"https://doi.org/10.1504/IJGUC.2013.057120\">10.1504/IJGUC.2013.057120</a>","ieee":"R. Petrlic, S. Sekula, and C. Sorge, “A privacy-friendly Architecture for future Cloud Computing,” <i>International Journal of Grid and Utility Computing</i>, no. 4, pp. 265–277, 2013.","chicago":"Petrlic, Ronald, Stephan Sekula, and Christoph Sorge. “A Privacy-Friendly Architecture for Future Cloud Computing.” <i>International Journal of Grid and Utility Computing</i>, no. 4 (2013): 265–77. <a href=\"https://doi.org/10.1504/IJGUC.2013.057120\">https://doi.org/10.1504/IJGUC.2013.057120</a>."},"page":"265-277","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"561","user_id":"477","ddc":["040"],"file_date_updated":"2018-03-15T10:26:14Z","type":"journal_article","publication":"International Journal of Grid and Utility Computing","abstract":[{"text":"We present a privacy-friendly architecture for a future cloud computing scenario where software licensing and software payment plays a major role. We show how digital rights management as a technical solution for software licensing can be achieved in a privacy-friendly manner. In our scenario, users who buy software from software providers and execute it at computing centres stay anonymous. At the same time, our approach guarantees that software licenses are bound to users and that their validity is checked before execution. Thus, DRM constitutes an incentive for software providers to take part in such a future cloud computing scenario. We employ a software re-encryption scheme so that computing centres are not able to build profiles of their users – not even under a pseudonym. We make sure that malicious users are unable to relay software to others. ","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1280","file_name":"561-authorFinalVersion.pdf","file_size":1036554,"creator":"florida","date_created":"2018-03-15T10:26:14Z","date_updated":"2018-03-15T10:26:14Z"}],"status":"public"},{"year":"2013","citation":{"mla":"Riebler, Heinrich, et al. “FPGA-Accelerated Key Search for Cold-Boot Attacks against AES.” <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, IEEE, 2013, pp. 386–89, doi:<a href=\"https://doi.org/10.1109/FPT.2013.6718394\">10.1109/FPT.2013.6718394</a>.","bibtex":"@inproceedings{Riebler_Kenter_Sorge_Plessl_2013, title={FPGA-accelerated Key Search for Cold-Boot Attacks against AES}, DOI={<a href=\"https://doi.org/10.1109/FPT.2013.6718394\">10.1109/FPT.2013.6718394</a>}, booktitle={Proceedings of the International Conference on Field-Programmable Technology (FPT)}, publisher={IEEE}, author={Riebler, Heinrich and Kenter, Tobias and Sorge, Christoph and Plessl, Christian}, year={2013}, pages={386–389} }","short":"H. Riebler, T. Kenter, C. Sorge, C. Plessl, in: Proceedings of the International Conference on Field-Programmable Technology (FPT), IEEE, 2013, pp. 386–389.","apa":"Riebler, H., Kenter, T., Sorge, C., &#38; Plessl, C. (2013). FPGA-accelerated Key Search for Cold-Boot Attacks against AES. <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, 386–389. <a href=\"https://doi.org/10.1109/FPT.2013.6718394\">https://doi.org/10.1109/FPT.2013.6718394</a>","ama":"Riebler H, Kenter T, Sorge C, Plessl C. FPGA-accelerated Key Search for Cold-Boot Attacks against AES. In: <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>. IEEE; 2013:386-389. doi:<a href=\"https://doi.org/10.1109/FPT.2013.6718394\">10.1109/FPT.2013.6718394</a>","chicago":"Riebler, Heinrich, Tobias Kenter, Christoph Sorge, and Christian Plessl. “FPGA-Accelerated Key Search for Cold-Boot Attacks against AES.” In <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, 386–89. IEEE, 2013. <a href=\"https://doi.org/10.1109/FPT.2013.6718394\">https://doi.org/10.1109/FPT.2013.6718394</a>.","ieee":"H. Riebler, T. Kenter, C. Sorge, and C. Plessl, “FPGA-accelerated Key Search for Cold-Boot Attacks against AES,” in <i>Proceedings of the International Conference on Field-Programmable Technology (FPT)</i>, 2013, pp. 386–389, doi: <a href=\"https://doi.org/10.1109/FPT.2013.6718394\">10.1109/FPT.2013.6718394</a>."},"page":"386-389","quality_controlled":"1","has_accepted_license":"1","title":"FPGA-accelerated Key Search for Cold-Boot Attacks against AES","doi":"10.1109/FPT.2013.6718394","publisher":"IEEE","date_updated":"2023-09-26T13:37:35Z","date_created":"2017-10-17T12:42:35Z","author":[{"last_name":"Riebler","full_name":"Riebler, Heinrich","id":"8961","first_name":"Heinrich"},{"first_name":"Tobias","last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias"},{"first_name":"Christoph","full_name":"Sorge, Christoph","last_name":"Sorge"},{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl"}],"abstract":[{"text":"Cold-boot attacks exploit the fact that DRAM contents are not immediately lost when a PC is powered off. Instead the contents decay rather slowly, in particular if the DRAM chips are cooled to low temperatures. This effect opens an attack vector on cryptographic applications that keep decrypted keys in DRAM. An attacker with access to the target computer can reboot it or remove the RAM modules and quickly copy the RAM contents to non-volatile memory. By exploiting the known cryptographic structure of the cipher and layout of the key data in memory, in our application an AES key schedule with redundancy, the resulting memory image can be searched for sections that could correspond to decayed cryptographic keys; then, the attacker can attempt to reconstruct the original key. However, the runtime of these algorithms grows rapidly with increasing memory image size, error rate and complexity of the bit error model, which limits the practicability of the approach.In this work, we study how the algorithm for key search can be accelerated with custom computing machines. We present an FPGA-based architecture on a Maxeler dataflow computing system that outperforms a software implementation up to 205x, which significantly improves the practicability of cold-attacks against AES.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:36:08Z","date_created":"2018-03-15T10:36:08Z","creator":"florida","file_size":822680,"file_id":"1294","access_level":"closed","file_name":"528-plessl13_fpt.pdf"}],"status":"public","type":"conference","publication":"Proceedings of the International Conference on Field-Programmable Technology (FPT)","ddc":["040"],"keyword":["coldboot"],"file_date_updated":"2018-03-15T10:36:08Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"grant_number":"160364472","name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"610996","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","_id":"34"}],"_id":"528","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}]},{"date_updated":"2023-09-26T13:38:20Z","publisher":"IEEE","author":[{"first_name":"Markus","last_name":"Happe","full_name":"Happe, Markus"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_created":"2017-10-17T12:42:30Z","title":"On-The-Fly Computing: A Novel Paradigm for Individualized IT Services","doi":"10.1109/ISORC.2013.6913232","has_accepted_license":"1","quality_controlled":"1","year":"2013","citation":{"apa":"Happe, M., Kling, P., Plessl, C., Platzner, M., &#38; Meyer auf der Heide, F. (2013). On-The-Fly Computing: A Novel Paradigm for Individualized IT Services. <i>Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS)</i>. <a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">https://doi.org/10.1109/ISORC.2013.6913232</a>","mla":"Happe, Markus, et al. “On-The-Fly Computing: A Novel Paradigm for Individualized IT Services.” <i>Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS)</i>, IEEE, 2013, doi:<a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">10.1109/ISORC.2013.6913232</a>.","short":"M. Happe, P. Kling, C. Plessl, M. Platzner, F. Meyer auf der Heide, in: Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS), IEEE, 2013.","bibtex":"@inproceedings{Happe_Kling_Plessl_Platzner_Meyer auf der Heide_2013, title={On-The-Fly Computing: A Novel Paradigm for Individualized IT Services}, DOI={<a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">10.1109/ISORC.2013.6913232</a>}, booktitle={Proceedings of the 9th IEEE Workshop on Software Technology for Future embedded and Ubiquitous Systems (SEUS)}, publisher={IEEE}, author={Happe, Markus and Kling, Peter and Plessl, Christian and Platzner, Marco and Meyer auf der Heide, Friedhelm}, year={2013} }","ama":"Happe M, Kling P, Plessl C, Platzner M, Meyer auf der Heide F. On-The-Fly Computing: A Novel Paradigm for Individualized IT Services. In: <i>Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS)</i>. IEEE; 2013. doi:<a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">10.1109/ISORC.2013.6913232</a>","ieee":"M. Happe, P. Kling, C. Plessl, M. Platzner, and F. Meyer auf der Heide, “On-The-Fly Computing: A Novel Paradigm for Individualized IT Services,” 2013, doi: <a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">10.1109/ISORC.2013.6913232</a>.","chicago":"Happe, Markus, Peter Kling, Christian Plessl, Marco Platzner, and Friedhelm Meyer auf der Heide. “On-The-Fly Computing: A Novel Paradigm for Individualized IT Services.” In <i>Proceedings of the 9th IEEE Workshop on Software Technology for Future Embedded and Ubiquitous Systems (SEUS)</i>. IEEE, 2013. <a href=\"https://doi.org/10.1109/ISORC.2013.6913232\">https://doi.org/10.1109/ISORC.2013.6913232</a>."},"_id":"505","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"_id":"14","name":"SFB 901 - Subprojekt C2","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"},{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T13:38:56Z","publication":"Proceedings of the 9th IEEE Workshop on Software Technology for Future embedded and Ubiquitous Systems (SEUS)","type":"conference","abstract":[{"text":"In this paper we introduce “On-The-Fly Computing”, our vision of future IT services that will be provided by assembling modular software components available on world-wide markets. After suitable components have been found, they are automatically integrated, configured and brought to execution in an On-The-Fly Compute Center. We envision that these future compute centers will continue to leverage three current trends in large scale computing which are an increasing amount of parallel processing, a trend to use heterogeneous computing resources, and—in the light of rising energy cost—energy-efficiency as a primary goal in the design and operation of computing systems. In this paper, we point out three research challenges and our current work in these areas.","lang":"eng"}],"status":"public","file":[{"date_updated":"2018-03-15T13:38:56Z","date_created":"2018-03-15T13:38:56Z","creator":"florida","file_size":1040834,"access_level":"closed","file_name":"505-Plessl13_seus.pdf","file_id":"1308","content_type":"application/pdf","success":1,"relation":"main_file"}]},{"title":"Stereo Matching on a Convey HC-1 Hybrid Core Computer","_id":"576","date_updated":"2022-01-06T07:02:38Z","publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"user_id":"15504","date_created":"2017-10-17T12:42:44Z","author":[{"full_name":"Schmitz, Henning","last_name":"Schmitz","first_name":"Henning"}],"year":"2012","status":"public","citation":{"ama":"Schmitz H. <i>Stereo Matching on a Convey HC-1 Hybrid Core Computer</i>. Universität Paderborn; 2012.","ieee":"H. Schmitz, <i>Stereo Matching on a Convey HC-1 Hybrid Core Computer</i>. Universität Paderborn, 2012.","chicago":"Schmitz, Henning. <i>Stereo Matching on a Convey HC-1 Hybrid Core Computer</i>. Universität Paderborn, 2012.","short":"H. Schmitz, Stereo Matching on a Convey HC-1 Hybrid Core Computer, Universität Paderborn, 2012.","bibtex":"@book{Schmitz_2012, title={Stereo Matching on a Convey HC-1 Hybrid Core Computer}, publisher={Universität Paderborn}, author={Schmitz, Henning}, year={2012} }","mla":"Schmitz, Henning. <i>Stereo Matching on a Convey HC-1 Hybrid Core Computer</i>. Universität Paderborn, 2012.","apa":"Schmitz, H. (2012). <i>Stereo Matching on a Convey HC-1 Hybrid Core Computer</i>. Universität Paderborn."},"type":"bachelorsthesis"},{"file_date_updated":"2018-03-21T13:09:19Z","ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"577","file":[{"date_updated":"2018-03-21T13:09:19Z","creator":"florida","date_created":"2018-03-21T13:09:19Z","file_size":169564,"file_id":"1569","access_level":"closed","file_name":"577-SSS2012Richa-Scheideler.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","text":"SSS is an international forum for researchers and practitioners in the design and development of distributed systems with self-properties: (classical) self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. Research in distributed systems is now at a crucialpoint in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. The theory of self-stabilization has been enriched in the last 30 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-properties in fault-tolerant distributed systems."}],"editor":[{"full_name":"Richa, Andrea W.","last_name":"Richa","first_name":"Andrea W."},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"type":"conference_editor","conference":{"end_date":"2012-10-04","location":"Paderborn, Germany","name":"Stabilization, Safety, and Security of Distributed Systems (SSS)","start_date":"2012-10-01"},"doi":"10.1007/978-3-642-33536-5","title":"Stabilization, Safety, and Security of Distributed Systems","date_created":"2017-10-17T12:42:44Z","date_updated":"2022-01-06T07:02:39Z","citation":{"bibtex":"@book{Richa_Scheideler_2012, title={Stabilization, Safety, and Security of Distributed Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>}, year={2012} }","short":"A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed Systems, 2012.","mla":"Richa, Andrea W., and Christian Scheideler, editors. <i>Stabilization, Safety, and Security of Distributed Systems</i>. 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>.","apa":"Richa, A. W., &#38; Scheideler, C. (Eds.). (2012). <i>Stabilization, Safety, and Security of Distributed Systems</i>. Presented at the Stabilization, Safety, and Security of Distributed Systems (SSS), Paderborn, Germany. <a href=\"https://doi.org/10.1007/978-3-642-33536-5\">https://doi.org/10.1007/978-3-642-33536-5</a>","chicago":"Richa, Andrea W., and Christian Scheideler, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33536-5\">https://doi.org/10.1007/978-3-642-33536-5</a>.","ieee":"A. W. Richa and C. Scheideler, Eds., <i>Stabilization, Safety, and Security of Distributed Systems</i>. 2012.","ama":"Richa AW, Scheideler C, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>.; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>"},"year":"2012","has_accepted_license":"1"},{"date_updated":"2022-01-06T07:02:42Z","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Fredrik","full_name":"Mallmann Trenn, Fredrik","last_name":"Mallmann Trenn"}],"date_created":"2017-10-17T12:42:45Z","title":"Slow Down & Sleep for Profit in Online Deadline Scheduling","doi":"10.1007/978-3-642-34862-4_17","has_accepted_license":"1","year":"2012","citation":{"mla":"Cord-Landwehr, Andreas, et al. “Slow Down &#38; Sleep for Profit in Online Deadline Scheduling.” <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>, edited by Guy Even and Dror Rawitz, 2012, pp. 218–31, doi:<a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">10.1007/978-3-642-34862-4_17</a>.","bibtex":"@inproceedings{Cord-Landwehr_Kling_Mallmann Trenn_2012, series={LNCS}, title={Slow Down &#38; Sleep for Profit in Online Deadline Scheduling}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">10.1007/978-3-642-34862-4_17</a>}, booktitle={Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)}, author={Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik}, editor={Even, Guy and Rawitz, DrorEditors}, year={2012}, pages={218–231}, collection={LNCS} }","short":"A. Cord-Landwehr, P. Kling, F. Mallmann Trenn, in: G. Even, D. Rawitz (Eds.), Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012, pp. 218–231.","apa":"Cord-Landwehr, A., Kling, P., &#38; Mallmann Trenn, F. (2012). Slow Down &#38; Sleep for Profit in Online Deadline Scheduling. In G. Even &#38; D. Rawitz (Eds.), <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i> (pp. 218–231). <a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">https://doi.org/10.1007/978-3-642-34862-4_17</a>","chicago":"Cord-Landwehr, Andreas, Peter Kling, and Fredrik Mallmann Trenn. “Slow Down &#38; Sleep for Profit in Online Deadline Scheduling.” In <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>, edited by Guy Even and Dror Rawitz, 218–31. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">https://doi.org/10.1007/978-3-642-34862-4_17</a>.","ieee":"A. Cord-Landwehr, P. Kling, and F. Mallmann Trenn, “Slow Down &#38; Sleep for Profit in Online Deadline Scheduling,” in <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>, 2012, pp. 218–231.","ama":"Cord-Landwehr A, Kling P, Mallmann Trenn F. Slow Down &#38; Sleep for Profit in Online Deadline Scheduling. In: Even G, Rawitz D, eds. <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>. LNCS. ; 2012:218-231. doi:<a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">10.1007/978-3-642-34862-4_17</a>"},"page":"218-231","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"580","series_title":"LNCS","user_id":"477","department":[{"_id":"63"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T09:03:39Z","type":"conference","publication":"Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)","abstract":[{"text":"We present and study a new model for energy-aware and profit-oriented scheduling on a single processor.The processor features dynamic speed scaling as well as suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different sizes, values, and deadlines.On the arrival of a new job, the scheduler may either accept or reject the job.Accepted jobs need a certain energy investment to be finished in time, while rejected jobs cause costs equal to their values.Here, power consumption at speed $s$ is given by $P(s)=s^{\\alpha}+\\beta$ and the energy investment is power integrated over time.Additionally, the scheduler may decide to suspend the processor to a sleep mode in which no energy is consumed, though awaking entails fixed transition costs $\\gamma$.The objective is to minimize the total value of rejected jobs plus the total energy.Our model combines aspects from advanced energy conservation techniques (namely speed scaling and sleep states) and profit-oriented scheduling models.We show that \\emph{rejection-oblivious} schedulers (whose rejection decisions are not based on former decisions) have – in contrast to the model without sleep states – an unbounded competitive ratio.It turns out that the jobs' value densities (the ratio between a job's value and its work) are crucial for the performance of such schedulers.We give an algorithm whose competitiveness nearly matches the lower bound w.r.t\\text{.} the maximum value density.If the maximum value density is not too large, the competitiveness becomes $\\alpha^{\\alpha}+2e\\alpha$.Also, we show that it suffices to restrict the value density of low-value jobs only.Using a technique from \\cite{Chan:2010} we transfer our results to processors with a fixed maximum speed.","lang":"eng"}],"editor":[{"last_name":"Even","full_name":"Even, Guy","first_name":"Guy"},{"first_name":"Dror","last_name":"Rawitz","full_name":"Rawitz, Dror"}],"file":[{"access_level":"closed","file_id":"1265","file_name":"580-P._Kling__F._Mallmann-Trenn__A._Cord-Landwehr_-_Slow_Down___Sleep_for_Profit_in_Online_Deadline_Scheduling.pdf","file_size":325939,"date_created":"2018-03-15T09:03:39Z","creator":"florida","date_updated":"2018-03-15T09:03:39Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public"},{"year":"2012","citation":{"apa":"Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., &#38; Scheideler, C. (2012). Self-Organizing Particle Systems. In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1272–1283). <a href=\"https://doi.org/10.1109/IPDPS.2012.116\">https://doi.org/10.1109/IPDPS.2012.116</a>","bibtex":"@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012, title={Self-Organizing Particle Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1272–1283} }","short":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.","mla":"Drees, Maximilian, et al. “Self-Organizing Particle Systems.” <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–83, doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>.","ieee":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–1283.","chicago":"Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos, and Christian Scheideler. “Self-Organizing Particle Systems.” In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 1272–83, 2012. <a href=\"https://doi.org/10.1109/IPDPS.2012.116\">https://doi.org/10.1109/IPDPS.2012.116</a>.","ama":"Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing Particle Systems. In: <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2012:1272-1283. doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>"},"page":"1272-1283","has_accepted_license":"1","title":"Self-Organizing Particle Systems","doi":"10.1109/IPDPS.2012.116","date_updated":"2022-01-06T07:02:42Z","author":[{"first_name":"Maximilian","last_name":"Drees","full_name":"Drees, Maximilian"},{"full_name":"Hüllmann (married name: Eikel), Martina","last_name":"Hüllmann (married name: Eikel)","first_name":"Martina"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-10-17T12:42:45Z","abstract":[{"text":"Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots.","lang":"eng"}],"file":[{"date_updated":"2018-03-15T08:39:33Z","date_created":"2018-03-15T08:39:33Z","creator":"florida","file_size":373131,"file_name":"581-IPDPS2012-Scheideler_Huellmann.pdf","access_level":"closed","file_id":"1263","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference","publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","ddc":["040"],"file_date_updated":"2018-03-15T08:39:33Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"581","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}]},{"title":"Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme","doi":"10.1007/978-3-642-35362-8_16","date_updated":"2022-01-06T07:02:43Z","author":[{"last_name":"Petrlic","full_name":"Petrlic, Ronald","first_name":"Ronald"}],"date_created":"2017-10-17T12:42:46Z","year":"2012","page":"194-211","citation":{"ama":"Petrlic R. Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme. In: <i>Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)</i>. LNCS. ; 2012:194-211. doi:<a href=\"https://doi.org/10.1007/978-3-642-35362-8_16\">10.1007/978-3-642-35362-8_16</a>","chicago":"Petrlic, Ronald. “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme.” In <i>Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)</i>, 194–211. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-35362-8_16\">https://doi.org/10.1007/978-3-642-35362-8_16</a>.","ieee":"R. Petrlic, “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme,” in <i>Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)</i>, 2012, pp. 194–211.","apa":"Petrlic, R. (2012). Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme. In <i>Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)</i> (pp. 194–211). <a href=\"https://doi.org/10.1007/978-3-642-35362-8_16\">https://doi.org/10.1007/978-3-642-35362-8_16</a>","short":"R. Petrlic, in: Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS), 2012, pp. 194–211.","bibtex":"@inproceedings{Petrlic_2012, series={LNCS}, title={Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-35362-8_16\">10.1007/978-3-642-35362-8_16</a>}, booktitle={Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)}, author={Petrlic, Ronald}, year={2012}, pages={194–211}, collection={LNCS} }","mla":"Petrlic, Ronald. “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme.” <i>Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)</i>, 2012, pp. 194–211, doi:<a href=\"https://doi.org/10.1007/978-3-642-35362-8_16\">10.1007/978-3-642-35362-8_16</a>."},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-15T08:38:58Z","_id":"585","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"series_title":"LNCS","user_id":"15504","abstract":[{"text":"In a cloud-computing scenario where users buy software from software providers and execute it at computing centers, a digital rights management (DRM) system has to be in place to check the software licenses during each software execution. However, the exposure of users to privacy invasion in the presence of DRM systems is problematic.We come up with a concept that unites software providers' and users' demands for a secure and privacy-preserving DRM system for cloud computing. The employment of proxy re-encryption allows for a prevention of profile building (under pseudonym) of users by any party.","lang":"eng"}],"status":"public","file":[{"date_updated":"2018-03-15T08:38:58Z","creator":"florida","date_created":"2018-03-15T08:38:58Z","file_size":582557,"access_level":"closed","file_name":"585-privacy-drm-cloud-1-css-camera-ready.pdf","file_id":"1262","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)","type":"conference"},{"publisher":"Awareness Magazine","date_updated":"2022-01-06T07:02:44Z","author":[{"first_name":"Christian","full_name":"Plessl, Christian","id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"full_name":"Agne, Andreas","last_name":"Agne","first_name":"Andreas"},{"last_name":"Happe","full_name":"Happe, Markus","first_name":"Markus"},{"last_name":"Lübbers","full_name":"Lübbers, Enno","first_name":"Enno"}],"date_created":"2017-10-17T12:42:46Z","title":"Programming models for reconfigurable heterogeneous multi-cores","has_accepted_license":"1","year":"2012","citation":{"ieee":"C. Plessl, M. Platzner, A. Agne, M. Happe, and E. Lübbers, <i>Programming models for reconfigurable heterogeneous multi-cores</i>. Awareness Magazine, 2012.","chicago":"Plessl, Christian, Marco Platzner, Andreas Agne, Markus Happe, and Enno Lübbers. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine, 2012.","ama":"Plessl C, Platzner M, Agne A, Happe M, Lübbers E. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine; 2012.","bibtex":"@book{Plessl_Platzner_Agne_Happe_Lübbers_2012, title={Programming models for reconfigurable heterogeneous multi-cores}, publisher={Awareness Magazine}, author={Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus and Lübbers, Enno}, year={2012} }","mla":"Plessl, Christian, et al. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine, 2012.","short":"C. Plessl, M. Platzner, A. Agne, M. Happe, E. Lübbers, Programming Models for Reconfigurable Heterogeneous Multi-Cores, Awareness Magazine, 2012.","apa":"Plessl, C., Platzner, M., Agne, A., Happe, M., &#38; Lübbers, E. (2012). <i>Programming models for reconfigurable heterogeneous multi-cores</i>. Awareness Magazine."},"_id":"587","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"398","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T08:37:02Z","type":"misc","status":"public","file":[{"date_updated":"2018-03-15T08:37:02Z","date_created":"2018-03-15T08:37:02Z","creator":"florida","file_size":353057,"file_name":"587-2012_plessl_awareness_magazine.pdf","access_level":"closed","file_id":"1260","content_type":"application/pdf","success":1,"relation":"main_file"}]},{"abstract":[{"text":"We come up with a digital rights management (DRM) concept for cloud computing and show how license management for software within the cloud can be achieved in a privacy-friendly manner. In our scenario, users who buy software from software providers stay anonymous. At the same time, our approach guarantees that software licenses are bound to users and their validity is checked before execution. We employ a software re-encryption scheme so that computing centers which execute users’ software are not able to build user profiles—not even under pseudonym—of their users. We combine secret sharing and homomorphic encryption. We make sure that malicious users are unable to relay software to others. DRM constitutes an incentive for software providers to take part in a future cloud computing scenario.We make this scenario more attractive for users by preserving their privacy.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"588-drm0-published_01.pdf","file_id":"1259","file_size":194323,"date_created":"2018-03-15T08:36:16Z","creator":"florida","date_updated":"2018-03-15T08:36:16Z"}],"status":"public","type":"conference","publication":"Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)","ddc":["040"],"file_date_updated":"2018-03-15T08:36:16Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"588","user_id":"15504","year":"2012","citation":{"chicago":"Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.” In <i>Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)</i>, 1286–91, 2012. <a href=\"https://doi.org/10.1109/WAINA.2012.92\">https://doi.org/10.1109/WAINA.2012.92</a>.","ieee":"R. Petrlic and C. Sorge, “Privacy-Preserving DRM for Cloud Computing,” in <i>Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)</i>, 2012, pp. 1286–1291.","ama":"Petrlic R, Sorge C. Privacy-Preserving DRM for Cloud Computing. In: <i>Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)</i>. ; 2012:1286-1291. doi:<a href=\"https://doi.org/10.1109/WAINA.2012.92\">10.1109/WAINA.2012.92</a>","apa":"Petrlic, R., &#38; Sorge, C. (2012). Privacy-Preserving DRM for Cloud Computing. In <i>Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)</i> (pp. 1286–1291). <a href=\"https://doi.org/10.1109/WAINA.2012.92\">https://doi.org/10.1109/WAINA.2012.92</a>","mla":"Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.” <i>Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)</i>, 2012, pp. 1286–91, doi:<a href=\"https://doi.org/10.1109/WAINA.2012.92\">10.1109/WAINA.2012.92</a>.","bibtex":"@inproceedings{Petrlic_Sorge_2012, title={Privacy-Preserving DRM for Cloud Computing}, DOI={<a href=\"https://doi.org/10.1109/WAINA.2012.92\">10.1109/WAINA.2012.92</a>}, booktitle={Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)}, author={Petrlic, Ronald and Sorge, Christoph}, year={2012}, pages={1286–1291} }","short":"R. Petrlic, C. Sorge, in: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–1291."},"page":"1286-1291","has_accepted_license":"1","title":"Privacy-Preserving DRM for Cloud Computing","doi":"10.1109/WAINA.2012.92","date_updated":"2022-01-06T07:02:45Z","author":[{"first_name":"Ronald","last_name":"Petrlic","full_name":"Petrlic, Ronald"},{"first_name":"Christoph","last_name":"Sorge","full_name":"Sorge, Christoph"}],"date_created":"2017-10-17T12:42:46Z"},{"doi":"10.1109/TrustCom.2012.225","title":"Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment","author":[{"first_name":"Ronald","full_name":"Petrlic, Ronald","last_name":"Petrlic"}],"date_created":"2017-10-17T12:42:47Z","date_updated":"2022-01-06T07:02:45Z","page":"958-963","citation":{"bibtex":"@inproceedings{Petrlic_2012, title={Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment}, DOI={<a href=\"https://doi.org/10.1109/TrustCom.2012.225\">10.1109/TrustCom.2012.225</a>}, booktitle={Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)}, author={Petrlic, Ronald}, year={2012}, pages={958–963} }","short":"R. Petrlic, in: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2012, pp. 958–963.","mla":"Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment.” <i>Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</i>, 2012, pp. 958–63, doi:<a href=\"https://doi.org/10.1109/TrustCom.2012.225\">10.1109/TrustCom.2012.225</a>.","apa":"Petrlic, R. (2012). Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment. In <i>Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</i> (pp. 958–963). <a href=\"https://doi.org/10.1109/TrustCom.2012.225\">https://doi.org/10.1109/TrustCom.2012.225</a>","ieee":"R. Petrlic, “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment,” in <i>Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</i>, 2012, pp. 958–963.","chicago":"Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment.” In <i>Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</i>, 958–63, 2012. <a href=\"https://doi.org/10.1109/TrustCom.2012.225\">https://doi.org/10.1109/TrustCom.2012.225</a>.","ama":"Petrlic R. Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment. In: <i>Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</i>. ; 2012:958-963. doi:<a href=\"https://doi.org/10.1109/TrustCom.2012.225\">10.1109/TrustCom.2012.225</a>"},"year":"2012","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T08:40:15Z","ddc":["040"],"user_id":"477","_id":"589","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T08:40:15Z","creator":"florida","date_updated":"2018-03-15T08:40:15Z","access_level":"closed","file_name":"589-published-trustcom.pdf","file_id":"1264","file_size":179985}],"abstract":[{"lang":"eng","text":"We present a privacy-preserving DRM scheme for a (future) cloud computing software market. In such a market, applications are packed into virtual machines (VMs) by software providers and the VMs can be executed at any computing center within the cloud. We propose the introduction of a software TPM as a container for VM-specific keys within the VM that moves around with the VM within the cloud. The software TPM is coupled to a virtual TPM at a computing center to constitute the root of trust for a local DRM enforcement system within the VM that checks the license before each application execution. This allows flexible price models, e.g. execute at most n timeslike models. Users have proof that their personally identifiable information, stored and processed within the VM at a computing center, cannot be obtained by the computing center. A feature of our solution is that neither software provider nor computing center are able to build usage profiles of the software executions."}],"publication":"Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)","type":"conference"},{"status":"public","type":"bachelorsthesis","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"595","user_id":"15504","year":"2012","citation":{"short":"F. Mallmann Trenn, On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down, Universität Paderborn, 2012.","bibtex":"@book{Mallmann Trenn_2012, title={On scheduling with multi-core and multi-speed processors using power down}, publisher={Universität Paderborn}, author={Mallmann Trenn, Frederik}, year={2012} }","mla":"Mallmann Trenn, Frederik. <i>On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down</i>. Universität Paderborn, 2012.","apa":"Mallmann Trenn, F. (2012). <i>On scheduling with multi-core and multi-speed processors using power down</i>. Universität Paderborn.","ama":"Mallmann Trenn F. <i>On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down</i>. Universität Paderborn; 2012.","ieee":"F. Mallmann Trenn, <i>On scheduling with multi-core and multi-speed processors using power down</i>. Universität Paderborn, 2012.","chicago":"Mallmann Trenn, Frederik. <i>On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down</i>. Universität Paderborn, 2012."},"title":"On scheduling with multi-core and multi-speed processors using power down","date_updated":"2022-01-06T07:02:48Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:48Z","author":[{"full_name":"Mallmann Trenn, Frederik","last_name":"Mallmann Trenn","first_name":"Frederik"}]},{"title":"Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","date_created":"2017-10-17T12:42:49Z","author":[{"first_name":"Henrik","full_name":"Seier, Henrik","last_name":"Seier"}],"year":"2012","citation":{"ama":"Seier H. <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn; 2012.","chicago":"Seier, Henrik. <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn, 2012.","ieee":"H. Seier, <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn, 2012.","mla":"Seier, Henrik. <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn, 2012.","bibtex":"@book{Seier_2012, title={Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen}, publisher={Universität Paderborn}, author={Seier, Henrik}, year={2012} }","short":"H. Seier, Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen, Universität Paderborn, 2012.","apa":"Seier, H. (2012). <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn."},"language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"604","user_id":"477","status":"public","type":"mastersthesis"},{"title":"Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung","date_created":"2017-10-17T12:42:50Z","author":[{"last_name":"Isenberg","full_name":"Isenberg, Florian","first_name":"Florian"}],"date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn","citation":{"apa":"Isenberg, F. (2012). <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn.","mla":"Isenberg, Florian. <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn, 2012.","bibtex":"@book{Isenberg_2012, title={Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung}, publisher={Universität Paderborn}, author={Isenberg, Florian}, year={2012} }","short":"F. Isenberg, Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung, Universität Paderborn, 2012.","ama":"Isenberg F. <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn; 2012.","chicago":"Isenberg, Florian. <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn, 2012.","ieee":"F. Isenberg, <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn, 2012."},"year":"2012","language":[{"iso":"ger"}],"user_id":"477","_id":"605","project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","type":"mastersthesis"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"606","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"13703","year":"2012","citation":{"ama":"Löken N. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn; 2012.","ieee":"N. Löken, <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","chicago":"Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","apa":"Löken, N. (2012). <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn.","bibtex":"@book{Löken_2012, title={Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2012} }","short":"N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas, Universität Paderborn, 2012.","mla":"Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012."},"title":"Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas","date_updated":"2022-01-06T07:02:51Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:50Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"first_name":"Nils","last_name":"Löken","full_name":"Löken, Nils","id":"13703"}]}]