[{"has_accepted_license":"1","citation":{"ieee":"H. Riebler, T. Kenter, C. Plessl, and C. Sorge, “Reconstructing AES Key Schedules from Decayed Memory with FPGAs,” in <i>Proceedings of Field-Programmable Custom Computing Machines (FCCM)</i>, 2014, pp. 222–229, doi: <a href=\"https://doi.org/10.1109/FCCM.2014.67\">10.1109/FCCM.2014.67</a>.","chicago":"Riebler, Heinrich, Tobias Kenter, Christian Plessl, and Christoph Sorge. “Reconstructing AES Key Schedules from Decayed Memory with FPGAs.” In <i>Proceedings of Field-Programmable Custom Computing Machines (FCCM)</i>, 222–29. IEEE, 2014. <a href=\"https://doi.org/10.1109/FCCM.2014.67\">https://doi.org/10.1109/FCCM.2014.67</a>.","ama":"Riebler H, Kenter T, Plessl C, Sorge C. Reconstructing AES Key Schedules from Decayed Memory with FPGAs. In: <i>Proceedings of Field-Programmable Custom Computing Machines (FCCM)</i>. IEEE; 2014:222-229. doi:<a href=\"https://doi.org/10.1109/FCCM.2014.67\">10.1109/FCCM.2014.67</a>","bibtex":"@inproceedings{Riebler_Kenter_Plessl_Sorge_2014, title={Reconstructing AES Key Schedules from Decayed Memory with FPGAs}, DOI={<a href=\"https://doi.org/10.1109/FCCM.2014.67\">10.1109/FCCM.2014.67</a>}, booktitle={Proceedings of Field-Programmable Custom Computing Machines (FCCM)}, publisher={IEEE}, author={Riebler, Heinrich and Kenter, Tobias and Plessl, Christian and Sorge, Christoph}, year={2014}, pages={222–229} }","short":"H. Riebler, T. Kenter, C. Plessl, C. Sorge, in: Proceedings of Field-Programmable Custom Computing Machines (FCCM), IEEE, 2014, pp. 222–229.","mla":"Riebler, Heinrich, et al. “Reconstructing AES Key Schedules from Decayed Memory with FPGAs.” <i>Proceedings of Field-Programmable Custom Computing Machines (FCCM)</i>, IEEE, 2014, pp. 222–29, doi:<a href=\"https://doi.org/10.1109/FCCM.2014.67\">10.1109/FCCM.2014.67</a>.","apa":"Riebler, H., Kenter, T., Plessl, C., &#38; Sorge, C. (2014). Reconstructing AES Key Schedules from Decayed Memory with FPGAs. <i>Proceedings of Field-Programmable Custom Computing Machines (FCCM)</i>, 222–229. <a href=\"https://doi.org/10.1109/FCCM.2014.67\">https://doi.org/10.1109/FCCM.2014.67</a>"},"page":"222-229","date_updated":"2023-09-26T13:33:50Z","author":[{"id":"8961","full_name":"Riebler, Heinrich","last_name":"Riebler","first_name":"Heinrich"},{"last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias","first_name":"Tobias"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"},{"first_name":"Christoph","last_name":"Sorge","full_name":"Sorge, Christoph"}],"doi":"10.1109/FCCM.2014.67","type":"conference","status":"public","project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"_id":"14","name":"SFB 901 - Subprojekt C2","grant_number":"160364472"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","_id":"34","grant_number":"610996"}],"_id":"377","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"file_date_updated":"2018-03-20T07:14:20Z","quality_controlled":"1","year":"2014","publisher":"IEEE","date_created":"2017-10-17T12:42:05Z","title":"Reconstructing AES Key Schedules from Decayed Memory with FPGAs","publication":"Proceedings of Field-Programmable Custom Computing Machines (FCCM)","abstract":[{"lang":"eng","text":"In this paper, we study how AES key schedules can be reconstructed from decayed memory. This operation is a crucial and time consuming operation when trying to break encryption systems with cold-boot attacks. In software, the reconstruction of the AES master key can be performed using a recursive, branch-and-bound tree-search algorithm that exploits redundancies in the key schedule for constraining the search space. In this work, we investigate how this branch-and-bound algorithm can be accelerated with FPGAs. We translated the recursive search procedure to a state machine with an explicit stack for each recursion level and create optimized datapaths to accelerate in particular the processing of the most frequently accessed tree levels. We support two different decay models, of which especially the more realistic non-idealized asymmetric decay model causes very high runtimes in software. Our implementation on a Maxeler dataflow computing system outperforms a software implementation for this model by up to 27x, which makes cold-boot attacks against AES practical even for high error rates."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1003907,"file_name":"377-FCCM14.pdf","access_level":"closed","file_id":"1397","date_updated":"2018-03-20T07:14:20Z","date_created":"2018-03-20T07:14:20Z","creator":"florida"}],"ddc":["040"],"keyword":["coldboot"],"language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"Self-aware computing is a paradigm for structuring and simplifying the design and operation of computing systems that face unprecedented levels of system dynamics and thus require novel forms of adaptivity. The generality of the paradigm makes it applicable to many types of computing systems and, previously, researchers started to introduce concepts of self-awareness to multicore architectures. In our work we build on a recent reference architectural framework as a model for self-aware computing and instantiate it for an FPGA-based heterogeneous multicore running the ReconOS reconfigurable architecture and operating system. After presenting the model for self-aware computing and ReconOS, we demonstrate with a case study how a multicore application built on the principle of self-awareness, autonomously adapts to changes in the workload and system state. Our work shows that the reference architectural framework as a model for self-aware computing can be practically applied and allows us to structure and simplify the design process, which is essential for designing complex future computing systems."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":916052,"access_level":"closed","file_name":"365-plessl14_trets_01.pdf","file_id":"1406","date_updated":"2018-03-20T07:19:19Z","date_created":"2018-03-20T07:19:19Z","creator":"florida"}],"publication":"ACM Transactions on Reconfigurable Technology and Systems (TRETS)","ddc":["040"],"language":[{"iso":"eng"}],"year":"2014","quality_controlled":"1","issue":"2","title":"Self-awareness as a Model for Designing and Operating Heterogeneous Multicores","publisher":"ACM","date_created":"2017-10-17T12:42:03Z","status":"public","type":"journal_article","article_number":"13","file_date_updated":"2018-03-20T07:19:19Z","_id":"365","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"_id":"14","name":"SFB 901 - Subprojekt C2","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"grant_number":"257906","name":"Engineering Proprioception in Computing Systems","_id":"31"}],"department":[{"_id":"27"},{"_id":"78"},{"_id":"518"}],"user_id":"15278","intvolume":"         7","citation":{"bibtex":"@article{Agne_Happe_Lösch_Plessl_Platzner_2014, title={Self-awareness as a Model for Designing and Operating Heterogeneous Multicores}, volume={7}, DOI={<a href=\"https://doi.org/10.1145/2617596\">10.1145/2617596</a>}, number={213}, journal={ACM Transactions on Reconfigurable Technology and Systems (TRETS)}, publisher={ACM}, author={Agne, Andreas and Happe, Markus and Lösch, Achim and Plessl, Christian and Platzner, Marco}, year={2014} }","mla":"Agne, Andreas, et al. “Self-Awareness as a Model for Designing and Operating Heterogeneous Multicores.” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 7, no. 2, 13, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2617596\">10.1145/2617596</a>.","short":"A. Agne, M. Happe, A. Lösch, C. Plessl, M. Platzner, ACM Transactions on Reconfigurable Technology and Systems (TRETS) 7 (2014).","apa":"Agne, A., Happe, M., Lösch, A., Plessl, C., &#38; Platzner, M. (2014). Self-awareness as a Model for Designing and Operating Heterogeneous Multicores. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, <i>7</i>(2), Article 13. <a href=\"https://doi.org/10.1145/2617596\">https://doi.org/10.1145/2617596</a>","chicago":"Agne, Andreas, Markus Happe, Achim Lösch, Christian Plessl, and Marco Platzner. “Self-Awareness as a Model for Designing and Operating Heterogeneous Multicores.” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i> 7, no. 2 (2014). <a href=\"https://doi.org/10.1145/2617596\">https://doi.org/10.1145/2617596</a>.","ieee":"A. Agne, M. Happe, A. Lösch, C. Plessl, and M. Platzner, “Self-awareness as a Model for Designing and Operating Heterogeneous Multicores,” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 7, no. 2, Art. no. 13, 2014, doi: <a href=\"https://doi.org/10.1145/2617596\">10.1145/2617596</a>.","ama":"Agne A, Happe M, Lösch A, Plessl C, Platzner M. Self-awareness as a Model for Designing and Operating Heterogeneous Multicores. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>. 2014;7(2). doi:<a href=\"https://doi.org/10.1145/2617596\">10.1145/2617596</a>"},"has_accepted_license":"1","doi":"10.1145/2617596","date_updated":"2023-09-26T13:33:31Z","volume":7,"author":[{"full_name":"Agne, Andreas","last_name":"Agne","first_name":"Andreas"},{"first_name":"Markus","last_name":"Happe","full_name":"Happe, Markus"},{"first_name":"Achim","id":"43646","full_name":"Lösch, Achim","last_name":"Lösch"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}]},{"type":"journal_article","status":"public","project":[{"grant_number":"160364472","name":"SFB 901","_id":"1"},{"grant_number":"160364472","name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"},{"grant_number":"257906","name":"Engineering Proprioception in Computing Systems","_id":"31"}],"_id":"328","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"file_date_updated":"2018-03-20T07:31:40Z","has_accepted_license":"1","citation":{"short":"A. Agne, M. Happe, A. Keller, E. Lübbers, B. Plattner, M. Platzner, C. Plessl, IEEE Micro 34 (2014) 60–71.","mla":"Agne, Andreas, et al. “ReconOS - An Operating System Approach for Reconfigurable Computing.” <i>IEEE Micro</i>, vol. 34, no. 1, IEEE, 2014, pp. 60–71, doi:<a href=\"https://doi.org/10.1109/MM.2013.110\">10.1109/MM.2013.110</a>.","bibtex":"@article{Agne_Happe_Keller_Lübbers_Plattner_Platzner_Plessl_2014, title={ReconOS - An Operating System Approach for Reconfigurable Computing}, volume={34}, DOI={<a href=\"https://doi.org/10.1109/MM.2013.110\">10.1109/MM.2013.110</a>}, number={1}, journal={IEEE Micro}, publisher={IEEE}, author={Agne, Andreas and Happe, Markus and Keller, Ariane and Lübbers, Enno and Plattner, Bernhard and Platzner, Marco and Plessl, Christian}, year={2014}, pages={60–71} }","apa":"Agne, A., Happe, M., Keller, A., Lübbers, E., Plattner, B., Platzner, M., &#38; Plessl, C. (2014). ReconOS - An Operating System Approach for Reconfigurable Computing. <i>IEEE Micro</i>, <i>34</i>(1), 60–71. <a href=\"https://doi.org/10.1109/MM.2013.110\">https://doi.org/10.1109/MM.2013.110</a>","ieee":"A. Agne <i>et al.</i>, “ReconOS - An Operating System Approach for Reconfigurable Computing,” <i>IEEE Micro</i>, vol. 34, no. 1, pp. 60–71, 2014, doi: <a href=\"https://doi.org/10.1109/MM.2013.110\">10.1109/MM.2013.110</a>.","chicago":"Agne, Andreas, Markus Happe, Ariane Keller, Enno Lübbers, Bernhard Plattner, Marco Platzner, and Christian Plessl. “ReconOS - An Operating System Approach for Reconfigurable Computing.” <i>IEEE Micro</i> 34, no. 1 (2014): 60–71. <a href=\"https://doi.org/10.1109/MM.2013.110\">https://doi.org/10.1109/MM.2013.110</a>.","ama":"Agne A, Happe M, Keller A, et al. ReconOS - An Operating System Approach for Reconfigurable Computing. <i>IEEE Micro</i>. 2014;34(1):60-71. doi:<a href=\"https://doi.org/10.1109/MM.2013.110\">10.1109/MM.2013.110</a>"},"page":"60-71","intvolume":"        34","date_updated":"2023-09-26T13:32:31Z","author":[{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"full_name":"Happe, Markus","last_name":"Happe","first_name":"Markus"},{"full_name":"Keller, Ariane","last_name":"Keller","first_name":"Ariane"},{"full_name":"Lübbers, Enno","last_name":"Lübbers","first_name":"Enno"},{"first_name":"Bernhard","full_name":"Plattner, Bernhard","last_name":"Plattner"},{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"}],"volume":34,"doi":"10.1109/MM.2013.110","publication":"IEEE Micro","abstract":[{"text":"The ReconOS operating system for reconfigurable computing offers a unified multi-threaded programming model and operating system services for threads executing in software and threads mapped to reconfigurable hardware. The operating system interface allows hardware threads to interact with software threads using well-known mechanisms such as semaphores, mutexes, condition variables, and message queues. By semantically integrating hardware accelerators into a standard operating system environment, ReconOS allows for rapid design space exploration, supports a structured application development process and improves the portability of applications","lang":"eng"}],"file":[{"file_size":1877185,"file_id":"1426","access_level":"closed","file_name":"328-plessl14_micro_01.pdf","date_updated":"2018-03-20T07:31:40Z","creator":"florida","date_created":"2018-03-20T07:31:40Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"ddc":["040"],"language":[{"iso":"eng"}],"quality_controlled":"1","issue":"1","year":"2014","publisher":"IEEE","date_created":"2017-10-17T12:41:55Z","title":"ReconOS - An Operating System Approach for Reconfigurable Computing"},{"doi":"10.1109/ReConFig.2014.7032509","date_updated":"2023-09-26T13:37:02Z","author":[{"full_name":"Vaz, Gavin Francis","id":"30332","last_name":"Vaz","first_name":"Gavin Francis"},{"last_name":"Riebler","id":"8961","full_name":"Riebler, Heinrich","first_name":"Heinrich"},{"first_name":"Tobias","last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias"},{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982"}],"citation":{"ama":"Vaz GF, Riebler H, Kenter T, Plessl C. Deferring Accelerator Offloading Decisions to Application Runtime. In: <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2014:1-8. doi:<a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">10.1109/ReConFig.2014.7032509</a>","ieee":"G. F. Vaz, H. Riebler, T. Kenter, and C. Plessl, “Deferring Accelerator Offloading Decisions to Application Runtime,” in <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2014, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">10.1109/ReConFig.2014.7032509</a>.","chicago":"Vaz, Gavin Francis, Heinrich Riebler, Tobias Kenter, and Christian Plessl. “Deferring Accelerator Offloading Decisions to Application Runtime.” In <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. IEEE, 2014. <a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">https://doi.org/10.1109/ReConFig.2014.7032509</a>.","short":"G.F. Vaz, H. Riebler, T. Kenter, C. Plessl, in: Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2014, pp. 1–8.","bibtex":"@inproceedings{Vaz_Riebler_Kenter_Plessl_2014, title={Deferring Accelerator Offloading Decisions to Application Runtime}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">10.1109/ReConFig.2014.7032509</a>}, booktitle={Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Vaz, Gavin Francis and Riebler, Heinrich and Kenter, Tobias and Plessl, Christian}, year={2014}, pages={1–8} }","mla":"Vaz, Gavin Francis, et al. “Deferring Accelerator Offloading Decisions to Application Runtime.” <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2014, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">10.1109/ReConFig.2014.7032509</a>.","apa":"Vaz, G. F., Riebler, H., Kenter, T., &#38; Plessl, C. (2014). Deferring Accelerator Offloading Decisions to Application Runtime. <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. <a href=\"https://doi.org/10.1109/ReConFig.2014.7032509\">https://doi.org/10.1109/ReConFig.2014.7032509</a>"},"page":"1-8","has_accepted_license":"1","file_date_updated":"2018-03-16T11:29:52Z","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"grant_number":"160364472","name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"},{"grant_number":"610996","_id":"34","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures"}],"_id":"439","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"status":"public","type":"conference","title":"Deferring Accelerator Offloading Decisions to Application Runtime","publisher":"IEEE","date_created":"2017-10-17T12:42:17Z","year":"2014","quality_controlled":"1","ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"text":"Reconfigurable architectures provide an opportunityto accelerate a wide range of applications, frequentlyby exploiting data-parallelism, where the same operations arehomogeneously executed on a (large) set of data. However, whenthe sequential code is executed on a host CPU and only dataparallelloops are executed on an FPGA coprocessor, a sufficientlylarge number of loop iterations (trip counts) is required, such thatthe control- and data-transfer overheads to the coprocessor canbe amortized. However, the trip count of large data-parallel loopsis frequently not known at compile time, but only at runtime justbefore entering a loop. Therefore, we propose to generate codeboth for the CPU and the coprocessor, and to defer the decisionwhere to execute the appropriate code to the runtime of theapplication when the trip count of the loop can be determinedjust at runtime. We demonstrate how an LLVM compiler basedtoolflow can automatically insert appropriate decision blocks intothe application code. Analyzing popular benchmark suites, weshow that this kind of runtime decisions is often applicable. Thepractical feasibility of our approach is demonstrated by a toolflowthat automatically identifies loops suitable for vectorization andgenerates code for the FPGA coprocessor of a Convey HC-1. Thetoolflow adds decisions based on a comparison of the runtimecomputedtrip counts to thresholds for specific loops and alsoincludes support to move just the required data to the coprocessor.We evaluate the integrated toolflow with characteristic loopsexecuted on different input data sizes.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-16T11:29:52Z","date_updated":"2018-03-16T11:29:52Z","access_level":"closed","file_id":"1353","file_name":"439-plessl14a_reconfig.pdf","file_size":557362}],"publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)"},{"year":"2014","quality_controlled":"1","title":"Kernel-Centric Acceleration of High Accuracy Stereo-Matching","publisher":"IEEE","date_created":"2017-10-17T12:42:11Z","abstract":[{"text":"Stereo-matching algorithms recently received a lot of attention from the FPGA acceleration community. Presented solutions range from simple, very resource efficient systems with modest matching quality for small embedded systems to sophisticated algorithms with several processing steps, implemented on big FPGAs. In order to achieve high throughput, most implementations strongly focus on pipelining and data reuse between different computation steps. This approach leads to high efficiency, but limits the supported computation patterns and due the high integration of the implementation, adaptions to the algorithm are difficult. In this work, we present a stereo-matching implementation, that starts by offloading individual kernels from the CPU to the FPGA. Between subsequent compute steps on the FPGA, data is stored off-chip in on-board memory of the FPGA accelerator card. This enables us to accelerate the AD-census algorithm with cross-based aggregation and scanline optimization for the first time without algorithmic changes and for up to full HD image dimensions. Analyzing throughput and bandwidth requirements, we outline some trade-offs that are involved with this approach, compared to tighter integration of more kernel loops into one design.","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-16T11:37:42Z","date_updated":"2018-03-16T11:37:42Z","file_id":"1366","file_name":"406-ReConFig14.pdf","access_level":"closed","file_size":932852}],"publication":"Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)","ddc":["040"],"language":[{"iso":"eng"}],"page":"1-8","citation":{"apa":"Kenter, T., Schmitz, H., &#38; Plessl, C. (2014). Kernel-Centric Acceleration of High Accuracy Stereo-Matching. <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. <a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">https://doi.org/10.1109/ReConFig.2014.7032535</a>","bibtex":"@inproceedings{Kenter_Schmitz_Plessl_2014, title={Kernel-Centric Acceleration of High Accuracy Stereo-Matching}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">10.1109/ReConFig.2014.7032535</a>}, booktitle={Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)}, publisher={IEEE}, author={Kenter, Tobias and Schmitz, Henning and Plessl, Christian}, year={2014}, pages={1–8} }","short":"T. Kenter, H. Schmitz, C. Plessl, in: Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2014, pp. 1–8.","mla":"Kenter, Tobias, et al. “Kernel-Centric Acceleration of High Accuracy Stereo-Matching.” <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, IEEE, 2014, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">10.1109/ReConFig.2014.7032535</a>.","ama":"Kenter T, Schmitz H, Plessl C. Kernel-Centric Acceleration of High Accuracy Stereo-Matching. In: <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE; 2014:1-8. doi:<a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">10.1109/ReConFig.2014.7032535</a>","chicago":"Kenter, Tobias, Henning Schmitz, and Christian Plessl. “Kernel-Centric Acceleration of High Accuracy Stereo-Matching.” In <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 1–8. IEEE, 2014. <a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">https://doi.org/10.1109/ReConFig.2014.7032535</a>.","ieee":"T. Kenter, H. Schmitz, and C. Plessl, “Kernel-Centric Acceleration of High Accuracy Stereo-Matching,” in <i>Proceedings of the International Conference on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2014, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/ReConFig.2014.7032535\">10.1109/ReConFig.2014.7032535</a>."},"has_accepted_license":"1","doi":"10.1109/ReConFig.2014.7032535","date_updated":"2023-09-26T13:36:40Z","author":[{"first_name":"Tobias","last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias"},{"first_name":"Henning","last_name":"Schmitz","full_name":"Schmitz, Henning"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"}],"status":"public","type":"conference","file_date_updated":"2018-03-16T11:37:42Z","_id":"406","project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"_id":"14","name":"SFB 901 - Subprojekt C2","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"grant_number":"610996","name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","_id":"34"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"user_id":"15278"},{"title":"Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen","date_updated":"2022-01-06T07:01:19Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2017-10-17T12:42:23Z","author":[{"full_name":"Tezer, Alina","last_name":"Tezer","first_name":"Alina"}],"year":"2013","citation":{"ieee":"A. Tezer, <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","chicago":"Tezer, Alina. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","ama":"Tezer A. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn; 2013.","apa":"Tezer, A. (2013). <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn.","short":"A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen, Universität Paderborn, 2013.","bibtex":"@book{Tezer_2013, title={Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen}, publisher={Universität Paderborn}, author={Tezer, Alina}, year={2013} }","mla":"Tezer, Alina. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013."},"language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"_id":"471","user_id":"477","department":[{"_id":"64"}],"status":"public","type":"bachelorsthesis"},{"_id":"473","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-16T11:17:30Z","publication":"Data and Applications Security and Privacy XXVII","type":"conference","abstract":[{"text":"We present a solution to the problem of privacy invasion in a multiparty digital rights management scheme. (Roaming) users buy content licenses from a content provider and execute it at any nearby content distributor. Our approach, which does not need any trusted third party - in contrast to most related work on privacy-preserving DRM - is based on a re-encryption scheme that runs on any mobile Android device. Only a minor security-critical part needs to be performed on the device's smartcard which could, for instance, be a SIM card.","lang":"eng"}],"editor":[{"full_name":"Wang, Lingyu","last_name":"Wang","first_name":"Lingyu"},{"full_name":"Shafiq, Basit","last_name":"Shafiq","first_name":"Basit"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-16T11:17:30Z","creator":"florida","date_updated":"2018-03-16T11:17:30Z","access_level":"closed","file_name":"473-drm-general-1-camera-ready.pdf","file_id":"1330","file_size":286049}],"date_updated":"2022-01-06T07:01:19Z","date_created":"2017-10-17T12:42:24Z","author":[{"last_name":"Petrlic","full_name":"Petrlic, Ronald","first_name":"Ronald"},{"first_name":"Stephan","last_name":"Sekula","full_name":"Sekula, Stephan"}],"title":"Unlinkable content playbacks in a multiparty DRM system","doi":"10.1007/978-3-642-39256-6_21","has_accepted_license":"1","year":"2013","page":"289-296","citation":{"apa":"Petrlic, R., &#38; Sekula, S. (2013). Unlinkable content playbacks in a multiparty DRM system. In L. Wang &#38; B. Shafiq (Eds.), <i>Data and Applications Security and Privacy XXVII</i> (pp. 289–296). <a href=\"https://doi.org/10.1007/978-3-642-39256-6_21\">https://doi.org/10.1007/978-3-642-39256-6_21</a>","mla":"Petrlic, Ronald, and Stephan Sekula. “Unlinkable Content Playbacks in a Multiparty DRM System.” <i>Data and Applications Security and Privacy XXVII</i>, edited by Lingyu Wang and Basit Shafiq, 2013, pp. 289–96, doi:<a href=\"https://doi.org/10.1007/978-3-642-39256-6_21\">10.1007/978-3-642-39256-6_21</a>.","bibtex":"@inproceedings{Petrlic_Sekula_2013, series={Lecture Notes in Computer Science}, title={Unlinkable content playbacks in a multiparty DRM system}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-39256-6_21\">10.1007/978-3-642-39256-6_21</a>}, booktitle={Data and Applications Security and Privacy XXVII}, author={Petrlic, Ronald and Sekula, Stephan}, editor={Wang, Lingyu and Shafiq, BasitEditors}, year={2013}, pages={289–296}, collection={Lecture Notes in Computer Science} }","short":"R. Petrlic, S. Sekula, in: L. Wang, B. Shafiq (Eds.), Data and Applications Security and Privacy XXVII, 2013, pp. 289–296.","ama":"Petrlic R, Sekula S. Unlinkable content playbacks in a multiparty DRM system. In: Wang L, Shafiq B, eds. <i>Data and Applications Security and Privacy XXVII</i>. Lecture Notes in Computer Science. ; 2013:289-296. doi:<a href=\"https://doi.org/10.1007/978-3-642-39256-6_21\">10.1007/978-3-642-39256-6_21</a>","ieee":"R. Petrlic and S. Sekula, “Unlinkable content playbacks in a multiparty DRM system,” in <i>Data and Applications Security and Privacy XXVII</i>, 2013, pp. 289–296.","chicago":"Petrlic, Ronald, and Stephan Sekula. “Unlinkable Content Playbacks in a Multiparty DRM System.” In <i>Data and Applications Security and Privacy XXVII</i>, edited by Lingyu Wang and Basit Shafiq, 289–96. Lecture Notes in Computer Science, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39256-6_21\">https://doi.org/10.1007/978-3-642-39256-6_21</a>."}},{"year":"2013","page":"259-264","citation":{"ama":"Joshi N, Petrlic R. Towards practical privacy-preserving Digital Rights Management for Cloud Computing. In: <i>Proceedings of the 10th Annual IEEE Consumer Communications &#38; Networking Conference (CCNC)</i>. ; 2013:259-264. doi:<a href=\"https://doi.org/10.1109/CCNC.2013.6488456\">10.1109/CCNC.2013.6488456</a>","chicago":"Joshi, Nakul, and Ronald Petrlic. “Towards Practical Privacy-Preserving Digital Rights Management for Cloud Computing.” In <i>Proceedings of the 10th Annual IEEE Consumer Communications &#38; Networking Conference (CCNC)</i>, 259–64, 2013. <a href=\"https://doi.org/10.1109/CCNC.2013.6488456\">https://doi.org/10.1109/CCNC.2013.6488456</a>.","ieee":"N. Joshi and R. Petrlic, “Towards practical privacy-preserving Digital Rights Management for Cloud Computing,” in <i>Proceedings of the 10th Annual IEEE Consumer Communications &#38; Networking Conference (CCNC)</i>, 2013, pp. 259–264.","apa":"Joshi, N., &#38; Petrlic, R. (2013). Towards practical privacy-preserving Digital Rights Management for Cloud Computing. In <i>Proceedings of the 10th Annual IEEE Consumer Communications &#38; Networking Conference (CCNC)</i> (pp. 259–264). <a href=\"https://doi.org/10.1109/CCNC.2013.6488456\">https://doi.org/10.1109/CCNC.2013.6488456</a>","mla":"Joshi, Nakul, and Ronald Petrlic. “Towards Practical Privacy-Preserving Digital Rights Management for Cloud Computing.” <i>Proceedings of the 10th Annual IEEE Consumer Communications &#38; Networking Conference (CCNC)</i>, 2013, pp. 259–64, doi:<a href=\"https://doi.org/10.1109/CCNC.2013.6488456\">10.1109/CCNC.2013.6488456</a>.","short":"N. Joshi, R. Petrlic, in: Proceedings of the 10th Annual IEEE Consumer Communications &#38; Networking Conference (CCNC), 2013, pp. 259–264.","bibtex":"@inproceedings{Joshi_Petrlic_2013, title={Towards practical privacy-preserving Digital Rights Management for Cloud Computing}, DOI={<a href=\"https://doi.org/10.1109/CCNC.2013.6488456\">10.1109/CCNC.2013.6488456</a>}, booktitle={Proceedings of the 10th Annual IEEE Consumer Communications &#38; Networking Conference (CCNC)}, author={Joshi, Nakul and Petrlic, Ronald}, year={2013}, pages={259–264} }"},"has_accepted_license":"1","title":"Towards practical privacy-preserving Digital Rights Management for Cloud Computing","doi":"10.1109/CCNC.2013.6488456","date_updated":"2022-01-06T07:01:21Z","author":[{"full_name":"Joshi, Nakul","last_name":"Joshi","first_name":"Nakul"},{"full_name":"Petrlic, Ronald","last_name":"Petrlic","first_name":"Ronald"}],"date_created":"2017-10-17T12:42:24Z","abstract":[{"lang":"eng","text":"We propose a privacy-preserving digital rights management scheme for (future) cloud computing. Users buy software from software providers and execute it at computing centers. Our solution allows software providers to provide different license models, like execute at most n-times models. Users’ anonymity and unlinkability of actions are preserved and thus, profile building is not even possible under (a) pseudonym. Privacy protection in the honest-but-curious model is achieved by combining ring signatures with an anonymous recipient scheme.We employ secret sharing in a unique manner that allows the software provider to expose the user’s identity if the user commits fraud, e.g. by exceeding the execution limit n."}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-16T11:16:29Z","date_updated":"2018-03-16T11:16:29Z","file_name":"475-privacy-drm-cloud-5.pdf","access_level":"closed","file_id":"1328","file_size":370473}],"publication":"Proceedings of the 10th Annual IEEE Consumer Communications & Networking Conference (CCNC)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-16T11:16:29Z","_id":"475","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"user_id":"15504"},{"date_created":"2017-10-17T12:42:27Z","author":[{"last_name":"Otte","full_name":"Otte, Oliver","first_name":"Oliver"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_updated":"2022-01-06T07:01:27Z","publisher":"Universität Paderborn","title":"Seitenkanalresistenz paarungsbasierter Kryptographie","citation":{"ieee":"O. Otte, <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013.","chicago":"Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013.","ama":"Otte O. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn; 2013.","apa":"Otte, O. (2013). <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn.","mla":"Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013.","short":"O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie, Universität Paderborn, 2013.","bibtex":"@book{Otte_2013, title={Seitenkanalresistenz paarungsbasierter Kryptographie}, publisher={Universität Paderborn}, author={Otte, Oliver}, year={2013} }"},"year":"2013","department":[{"_id":"64"}],"user_id":"477","_id":"486","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"date_created":"2017-10-17T12:42:27Z","author":[{"first_name":"Jan","full_name":"Bobolz, Jan","id":"27207","last_name":"Bobolz"}],"oa":"1","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:28Z","title":"Security Proofs for Pairing-Based Cryptography in the Generic Group Model","has_accepted_license":"1","citation":{"apa":"Bobolz, J. (2013). <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn.","bibtex":"@book{Bobolz_2013, title={Security Proofs for Pairing-Based Cryptography in the Generic Group Model}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2013} }","short":"J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic Group Model, Universität Paderborn, 2013.","mla":"Bobolz, Jan. <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn, 2013.","ama":"Bobolz J. <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn; 2013.","ieee":"J. Bobolz, <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn, 2013.","chicago":"Bobolz, Jan. <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn, 2013."},"year":"2013","user_id":"27207","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"487","file_date_updated":"2018-06-29T09:56:54Z","ddc":["000"],"type":"bachelorsthesis","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2018-04-13T11:42:08Z","creator":"jbobolz","date_updated":"2018-06-29T09:56:54Z","file_name":"thesis_jbobolz_final.pdf","access_level":"open_access","file_id":"2346","file_size":874286}],"status":"public","urn":"4875"},{"_id":"488","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":"477","ddc":["040"],"file_date_updated":"2018-03-15T13:46:52Z","publication":"Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)","type":"conference","abstract":[{"text":"Unattended systems are key ingredients of various critical infrastruc-tures like networks of self service terminals or automated teller machines.For cost and efficiency reasons they should mostly run autonomously.Unattended systems are attractive and lucrative targets for various kindsof attacks, including attacks on the integrity of their components and thecommunication between components. In this paper, we propose a gen-eral cryptographic framework to protect unattended systems. We alsodemonstrate that instantiating the framework with techniques from iden-tity based cryptography is particularly well-suited to efficiently secureunattended systems.","lang":"eng"}],"status":"public","file":[{"date_created":"2018-03-15T13:46:52Z","creator":"florida","date_updated":"2018-03-15T13:46:52Z","access_level":"closed","file_name":"488-MACIS13.pdf","file_id":"1317","file_size":301962,"content_type":"application/pdf","relation":"main_file","success":1}],"date_updated":"2022-01-06T07:01:28Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Peter","last_name":"Günther","full_name":"Günther, Peter"},{"last_name":"Krummel","full_name":"Krummel, Volker","first_name":"Volker"}],"date_created":"2017-10-17T12:42:27Z","title":"Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study","has_accepted_license":"1","year":"2013","page":"98-105","citation":{"ama":"Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study. In: <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>. ; 2013:98-105.","chicago":"Blömer, Johannes, Peter Günther, and Volker Krummel. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” In <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 98–105, 2013.","ieee":"J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study,” in <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2013, pp. 98–105.","apa":"Blömer, J., Günther, P., &#38; Krummel, V. (2013). Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study. In <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i> (pp. 98–105).","bibtex":"@inproceedings{Blömer_Günther_Krummel_2013, title={Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study}, booktitle={Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker}, year={2013}, pages={98–105} }","short":"J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.","mla":"Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2013, pp. 98–105."}},{"user_id":"15504","project":[{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"489","type":"mastersthesis","status":"public","date_created":"2017-10-17T12:42:27Z","author":[{"last_name":"Knopf","full_name":"Knopf, Michael","first_name":"Michael"}],"date_updated":"2022-01-06T07:01:28Z","publisher":"Universität Paderborn","title":"Scheduling Variants with Speed-Scaling via the Primal-Dual Approach","citation":{"apa":"Knopf, M. (2013). <i>Scheduling Variants with Speed-Scaling via the Primal-Dual Approach</i>. Universität Paderborn.","bibtex":"@book{Knopf_2013, title={Scheduling Variants with Speed-Scaling via the Primal-Dual Approach}, publisher={Universität Paderborn}, author={Knopf, Michael}, year={2013} }","mla":"Knopf, Michael. <i>Scheduling Variants with Speed-Scaling via the Primal-Dual Approach</i>. Universität Paderborn, 2013.","short":"M. Knopf, Scheduling Variants with Speed-Scaling via the Primal-Dual Approach, Universität Paderborn, 2013.","ama":"Knopf M. <i>Scheduling Variants with Speed-Scaling via the Primal-Dual Approach</i>. Universität Paderborn; 2013.","chicago":"Knopf, Michael. <i>Scheduling Variants with Speed-Scaling via the Primal-Dual Approach</i>. Universität Paderborn, 2013.","ieee":"M. Knopf, <i>Scheduling Variants with Speed-Scaling via the Primal-Dual Approach</i>. Universität Paderborn, 2013."},"year":"2013"},{"abstract":[{"lang":"eng","text":"We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's competitiveness.Our results generalize and improve upon work by \\citet{Chan:2010}, which considers a single speed-scalable processor.Using significantly different techniques, we can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for our algorithm.In our scheduling problem, jobs arrive over time and are preemptable.They have different workloads, values, and deadlines.The scheduler may decide not to finish a job but instead to suffer a loss equaling the job's value.However, to process a job's workload until its deadline the scheduler must invest a certain amount of energy.The cost of a schedule is the sum of lost values and invested energy.In order to finish a job the scheduler has to determine which processors to use and set their speeds accordingly.A processor's energy consumption is power $\\Power{s}$ integrated over time, where $\\Power{s}=s^{\\alpha}$ is the power consumption when running at speed $s$.Since we consider the online variant of the problem, the scheduler has no knowledge about future jobs.This problem was introduced by~\\citet{Chan:2010} for the case of a single processor.They presented an online algorithm which is $\\alpha^{\\alpha}+2e\\alpha$-competitive.We provide an online algorithm for the case of multiple processors with an improved competitive ratio of $\\alpha^{\\alpha}$."}],"file":[{"file_name":"499-P._Kling__P._Pietryzk_-_Profitable_Scheduling_on_Multiple_Speed-scalable_Processors__2013_.pdf","access_level":"closed","file_id":"1310","file_size":558661,"date_created":"2018-03-15T13:40:02Z","creator":"florida","date_updated":"2018-03-15T13:40:02Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","ddc":["040"],"file_date_updated":"2018-03-15T13:40:02Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"499","user_id":"477","department":[{"_id":"63"}],"year":"2013","citation":{"short":"P. Kling, P. Pietrzyk, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 251–260.","mla":"Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable Processors.” <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 251–60, doi:<a href=\"https://doi.org/10.1145/2486159.2486183\">10.1145/2486159.2486183</a>.","bibtex":"@inproceedings{Kling_Pietrzyk_2013, title={Profitable Scheduling on Multiple Speed-Scalable Processors}, DOI={<a href=\"https://doi.org/10.1145/2486159.2486183\">10.1145/2486159.2486183</a>}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Kling, Peter and Pietrzyk, Peter}, year={2013}, pages={251–260} }","apa":"Kling, P., &#38; Pietrzyk, P. (2013). Profitable Scheduling on Multiple Speed-Scalable Processors. In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 251–260). <a href=\"https://doi.org/10.1145/2486159.2486183\">https://doi.org/10.1145/2486159.2486183</a>","ieee":"P. Kling and P. Pietrzyk, “Profitable Scheduling on Multiple Speed-Scalable Processors,” in <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 251–260.","chicago":"Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable Processors.” In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 251–60, 2013. <a href=\"https://doi.org/10.1145/2486159.2486183\">https://doi.org/10.1145/2486159.2486183</a>.","ama":"Kling P, Pietrzyk P. Profitable Scheduling on Multiple Speed-Scalable Processors. In: <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2013:251-260. doi:<a href=\"https://doi.org/10.1145/2486159.2486183\">10.1145/2486159.2486183</a>"},"page":"251-260 ","has_accepted_license":"1","title":"Profitable Scheduling on Multiple Speed-Scalable Processors","doi":"10.1145/2486159.2486183","date_updated":"2022-01-06T07:01:34Z","date_created":"2017-10-17T12:42:29Z","author":[{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"full_name":"Pietrzyk, Peter","last_name":"Pietrzyk","first_name":"Peter"}]},{"year":"2013","place":"Berlin","page":"220","citation":{"apa":"Happe, M. (2013). <i>Performance and thermal management on self-adaptive hybrid multi-cores</i>. Berlin: Logos Verlag Berlin GmbH.","mla":"Happe, Markus. <i>Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores</i>. Logos Verlag Berlin GmbH, 2013.","short":"M. Happe, Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores, Logos Verlag Berlin GmbH, Berlin, 2013.","bibtex":"@book{Happe_2013, place={Berlin}, title={Performance and thermal management on self-adaptive hybrid multi-cores}, publisher={Logos Verlag Berlin GmbH}, author={Happe, Markus}, year={2013} }","ama":"Happe M. <i>Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores</i>. Berlin: Logos Verlag Berlin GmbH; 2013.","ieee":"M. Happe, <i>Performance and thermal management on self-adaptive hybrid multi-cores</i>. Berlin: Logos Verlag Berlin GmbH, 2013.","chicago":"Happe, Markus. <i>Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores</i>. Berlin: Logos Verlag Berlin GmbH, 2013."},"publication_identifier":{"isbn":["978-3-8325-3425-7"]},"publication_status":"published","related_material":{"link":[{"url":"https://www.logos-verlag.de/cgi-bin/engbuchmid?isbn=3425&lng=deu&id=","relation":"confirmation"}]},"title":"Performance and thermal management on self-adaptive hybrid multi-cores","date_updated":"2022-01-06T07:01:34Z","publisher":"Logos Verlag Berlin GmbH","author":[{"full_name":"Happe, Markus","last_name":"Happe","first_name":"Markus"}],"supervisor":[{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"date_created":"2017-10-17T12:42:30Z","abstract":[{"lang":"eng","text":"Handling run-time dynamics on embedded system-on-chip architectures has become more challenging over the years. On the one hand, the impact of workload and physical dynamics on the system behavior has dramatically increased. On the other hand, embedded architectures have become more complex as they have evolved from single-processor systems over multi-processor systems to hybrid multi-core platforms.Static design-time techniques no longer provide suitable solutions to deal with the run-time dynamics of today's embedded systems. Therefore, system designers have to apply run-time solutions, which have hardly been investigated for hybrid multi-core platforms.In this thesis, we present fundamental work in the new area of run-time management on hybrid multi-core platforms. We propose a novel architecture, a self-adaptive hybrid multi-core system, that combines heterogeneous processors, reconfigurable hardware cores, and monitoring cores on a single chip. Using self-adaptation on thread-level, our hybrid multi-core systems can effectively perform performance and thermal management autonomously at run-time. "}],"status":"public","type":"dissertation","language":[{"iso":"eng"}],"_id":"501","project":[{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"78"}],"user_id":"477"},{"publication":"Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","status":"public","file":[{"file_size":554618,"file_name":"519-iris-spaa2013_01.pdf","access_level":"closed","file_id":"1299","date_updated":"2018-03-15T10:38:34Z","creator":"florida","date_created":"2018-03-15T10:38:34Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"In this work we present the first scalable distributed information system,i.e., a system with low storage overhead, that is provably robust againstDenial-of-Service (DoS) attacks by a current insider. We allow acurrent insider to have complete knowledge about the information systemand to have the power to block any \\epsilon-fraction of its serversby a DoS-attack, where \\epsilon can be chosen up to a constant. The taskof the system is to serve any collection of lookup requests with at most oneper non-blocked server in an efficient way despite this attack. Previously,scalable solutions were only known for DoS-attacks of past insiders, where apast insider only has complete knowledge about some past time pointt_0 of the information system. Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible to design an information system so that anyinformation that was inserted or last updated after t_0 is safe against a DoS-attack. But their constructions would not work at all for a current insider. The key idea behindour IRIS system is to make extensive use of coding. More precisely, we presenttwo alternative distributed coding strategies with an at most logarithmicstorage overhead that can handle up to a constant fraction of blocked servers.","lang":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"519","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-15T10:38:34Z","ddc":["040"],"has_accepted_license":"1","page":"119-129","citation":{"ama":"Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks. In: <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2013:119-129. doi:<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>","ieee":"M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS-Attacks,” in <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 119–129.","chicago":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 119–29, 2013. <a href=\"https://doi.org/10.1145/2486159.2486186\">https://doi.org/10.1145/2486159.2486186</a>.","bibtex":"@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information System Against Insider DoS-Attacks}, DOI={<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian}, year={2013}, pages={119–129} }","short":"M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.","mla":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 119–29, doi:<a href=\"https://doi.org/10.1145/2486159.2486186\">10.1145/2486159.2486186</a>.","apa":"Eikel, M., &#38; Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 119–129). <a href=\"https://doi.org/10.1145/2486159.2486186\">https://doi.org/10.1145/2486159.2486186</a>"},"year":"2013","date_created":"2017-10-17T12:42:33Z","author":[{"first_name":"Martina","full_name":"Eikel, Martina","last_name":"Eikel"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_updated":"2022-01-06T07:01:42Z","doi":"10.1145/2486159.2486186","title":"IRIS: A Robust Information System Against Insider DoS-Attacks"},{"keyword":["coldboot"],"language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"521","user_id":"477","department":[{"_id":"27"},{"_id":"518"}],"status":"public","type":"mastersthesis","title":"Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs","date_updated":"2022-01-06T07:01:46Z","publisher":"Universität Paderborn","author":[{"last_name":"Riebler","id":"8961","full_name":"Riebler, Heinrich","first_name":"Heinrich"}],"date_created":"2017-10-17T12:42:34Z","year":"2013","citation":{"ama":"Riebler H. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn; 2013.","chicago":"Riebler, Heinrich. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","ieee":"H. Riebler, <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","apa":"Riebler, H. (2013). <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn.","bibtex":"@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich}, year={2013} }","mla":"Riebler, Heinrich. <i>Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs</i>. Universität Paderborn, 2013.","short":"H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs, Universität Paderborn, 2013."}},{"title":"Entwurf eines datenschutzgerechten Reputationssystems","date_updated":"2022-01-06T07:01:49Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:35Z","author":[{"first_name":"Sascha","full_name":"Lutters, Sascha","last_name":"Lutters"}],"year":"2013","citation":{"mla":"Lutters, Sascha. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn, 2013.","bibtex":"@book{Lutters_2013, title={Entwurf eines datenschutzgerechten Reputationssystems}, publisher={Universität Paderborn}, author={Lutters, Sascha}, year={2013} }","short":"S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems, Universität Paderborn, 2013.","apa":"Lutters, S. (2013). <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn.","ama":"Lutters S. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn; 2013.","ieee":"S. Lutters, <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn, 2013.","chicago":"Lutters, Sascha. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn, 2013."},"language":[{"iso":"ger"}],"_id":"531","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"user_id":"477","status":"public","type":"mastersthesis"},{"title":"Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:01:49Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"publisher":"Universität Paderborn","_id":"532","date_created":"2017-10-17T12:42:36Z","user_id":"477","author":[{"last_name":"Hilleckes","full_name":"Hilleckes, Hendrik","first_name":"Hendrik"}],"year":"2013","citation":{"bibtex":"@book{Hilleckes_2013, title={Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme}, publisher={Universität Paderborn}, author={Hilleckes, Hendrik}, year={2013} }","mla":"Hilleckes, Hendrik. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.","short":"H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme, Universität Paderborn, 2013.","apa":"Hilleckes, H. (2013). <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn.","ama":"Hilleckes H. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn; 2013.","ieee":"H. Hilleckes, <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.","chicago":"Hilleckes, Hendrik. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013."},"status":"public","type":"bachelorsthesis"},{"file_date_updated":"2018-03-15T10:35:04Z","ddc":["040"],"user_id":"25078","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"538","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-15T10:35:04Z","date_updated":"2018-03-15T10:35:04Z","file_id":"1292","access_level":"closed","file_name":"538-AB-KEM_01.pdf","file_size":389797}],"status":"public","abstract":[{"text":"We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes: a key-policy attribute-based KEM that is based on Goyal's key-policy ABE and a ciphertext-policy attribute-based KEM that is based on Waters' ciphertext-policy ABE. To achieve our goals, we use an appropriate hash function and need to extend the public parameters and the ciphertexts of the underlying CPA-secure encryption schemes only by a single group element. Moreover, we use the same hardness assumptions as the underlying CPA-secure encryption schemes.","lang":"eng"}],"type":"preprint","main_file_link":[{"url":"https://eprint.iacr.org/2013/646","open_access":"1"}],"title":"Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"last_name":"Liske","full_name":"Liske, Gennadij","first_name":"Gennadij"}],"date_created":"2017-10-17T12:42:37Z","oa":"1","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","citation":{"mla":"Blömer, Johannes, and Gennadij Liske. <i>Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles</i>. Universität Paderborn, 2013.","bibtex":"@article{Blömer_Liske_2013, title={Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles}, publisher={Universität Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2013} }","short":"J. Blömer, G. Liske, (2013).","apa":"Blömer, J., &#38; Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.","chicago":"Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","ieee":"J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","ama":"Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 2013."},"year":"2013","has_accepted_license":"1"},{"has_accepted_license":"1","year":"2013","page":"537-549","citation":{"apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2013). CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i> (pp. 537–549). <a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">https://doi.org/10.1007/978-3-642-41527-2_37</a>","mla":"Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 2013, pp. 537–49, doi:<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS}, title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>}, booktitle={Proceedings of the 27th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={537–549}, collection={LNCS} }","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In: <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2013:537-549. doi:<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system,” in <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 2013, pp. 537–549.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” In <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 537–49. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">https://doi.org/10.1007/978-3-642-41527-2_37</a>."},"date_updated":"2022-01-06T07:01:53Z","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:42:38Z","title":"CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system","doi":"10.1007/978-3-642-41527-2_37","publication":"Proceedings of the 27th International Symposium on Distributed Computing (DISC)","type":"conference","abstract":[{"lang":"eng","text":"We consider the problem of managing a dynamic heterogeneous storagesystem in a distributed way so that the amount of data assigned to a hostin that system is related to its capacity. Two central problems have to be solvedfor this: (1) organizing the hosts in an overlay network with low degree and diameterso that one can efficiently check the correct distribution of the data androute between any two hosts, and (2) distributing the data among the hosts so thatthe distribution respects the capacities of the hosts and can easily be adapted asthe set of hosts or their capacities change. We present distributed protocols forthese problems that are self-stabilizing and that do not need any global knowledgeabout the system such as the number of nodes or the overall capacity of thesystem. Prior to this work no solution was known satisfying these properties."}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":262302,"file_name":"542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf","access_level":"closed","file_id":"1289","date_updated":"2018-03-15T10:32:48Z","creator":"florida","date_created":"2018-03-15T10:32:48Z"}],"_id":"542","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"}],"series_title":"LNCS","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-15T10:32:48Z"}]