[{"type":"bachelorsthesis","status":"public","_id":"334","project":[{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"user_id":"477","year":"2014","citation":{"apa":"Wagener, P. (2014). <i>Vertical Thread Migration in FPGA based Sound Localization</i>. Universität Paderborn.","bibtex":"@book{Wagener_2014, title={Vertical Thread Migration in FPGA based Sound Localization}, publisher={Universität Paderborn}, author={Wagener, Peter}, year={2014} }","short":"P. Wagener, Vertical Thread Migration in FPGA Based Sound Localization, Universität Paderborn, 2014.","mla":"Wagener, Peter. <i>Vertical Thread Migration in FPGA Based Sound Localization</i>. Universität Paderborn, 2014.","chicago":"Wagener, Peter. <i>Vertical Thread Migration in FPGA Based Sound Localization</i>. Universität Paderborn, 2014.","ieee":"P. Wagener, <i>Vertical Thread Migration in FPGA based Sound Localization</i>. Universität Paderborn, 2014.","ama":"Wagener P. <i>Vertical Thread Migration in FPGA Based Sound Localization</i>. Universität Paderborn; 2014."},"date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","author":[{"first_name":"Peter","full_name":"Wagener, Peter","last_name":"Wagener"}],"date_created":"2017-10-17T12:41:57Z","title":"Vertical Thread Migration in FPGA based Sound Localization"},{"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":334101,"file_name":"346-service_computation_2014_3_10_10005.pdf","file_id":"1418","access_level":"closed","date_updated":"2018-03-20T07:26:49Z","date_created":"2018-03-20T07:26:49Z","creator":"florida"}],"status":"public","abstract":[{"text":"One future goal of service-oriented computing is to realize global markets of composed services. On such markets, service providers offer services that can be flexibly combined with each other. However, most often, market participants are not able to individually estimate the quality of traded services in advance. As a consequence, even potentially profitable transactions between customers and providers might not take place. In the worst case, this can induce a market failure. To overcome this problem, we propose the incorporation of reputation information as an indicator for expected service quality. We address On-The-Fly Computing as a representative environment of markets of composed services. In this environment, customers provide feedback on transactions. We present a conceptual design of a reputation system which collects and processes user feedback, and provides it to participants in the market. Our contribution includes the identification of requirements for such a reputation system from a technical and an economic perspective. Based on these requirements, we propose a flexible solution that facilitates the incorporation of reputation information into markets of composed services while simultaneously preserving privacy of customers who provide feedback. The requirements we formulate in this paper have just been partially met in literature. An integrated approach, however, has not been addressed yet.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)","file_date_updated":"2018-03-20T07:26:49Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","department":[{"_id":"205"},{"_id":"76"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"346","citation":{"chicago":"Brangewitz, Sonja, Alexander Jungmann, Ronald Petrlic, and Marie Christin Platenius. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” In <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 49–57, 2014.","ieee":"S. Brangewitz, A. Jungmann, R. Petrlic, and M. C. Platenius, “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services,” in <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.","ama":"Brangewitz S, Jungmann A, Petrlic R, Platenius MC. Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services. In: <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>. ; 2014:49-57.","apa":"Brangewitz, S., Jungmann, A., Petrlic, R., &#38; Platenius, M. C. (2014). Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services. In <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i> (pp. 49–57).","mla":"Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.” <i>Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.","short":"S. Brangewitz, A. Jungmann, R. Petrlic, M.C. Platenius, in: Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2014, pp. 49–57.","bibtex":"@inproceedings{Brangewitz_Jungmann_Petrlic_Platenius_2014, title={Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services}, booktitle={Proceedings of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Brangewitz, Sonja and Jungmann, Alexander and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={49–57} }"},"page":"49-57","year":"2014","has_accepted_license":"1","title":"Towards a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services","date_created":"2017-10-17T12:41:59Z","author":[{"last_name":"Brangewitz","full_name":"Brangewitz, Sonja","first_name":"Sonja"},{"last_name":"Jungmann","full_name":"Jungmann, Alexander","first_name":"Alexander"},{"first_name":"Ronald","full_name":"Petrlic, Ronald","last_name":"Petrlic"},{"last_name":"Platenius","full_name":"Platenius, Marie Christin","first_name":"Marie Christin"}],"date_updated":"2022-01-06T06:59:18Z"},{"file_date_updated":"2018-03-20T07:26:16Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"347","user_id":"398","series_title":"Lecture Notes in Computer Science","department":[{"_id":"78"}],"editor":[{"first_name":"Diana","full_name":"Goehringer, Diana","last_name":"Goehringer"},{"full_name":"Santambrogio, MarcoDomenico","last_name":"Santambrogio","first_name":"MarcoDomenico"},{"full_name":"Cardoso, JoãoM.P.","last_name":"Cardoso","first_name":"JoãoM.P."},{"last_name":"Bertels","full_name":"Bertels, Koen","first_name":"Koen"}],"status":"public","type":"conference","doi":"10.1007/978-3-319-05960-0_30","date_updated":"2022-01-06T06:59:18Z","author":[{"full_name":"Meisner, Sebastian","last_name":"Meisner","first_name":"Sebastian"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"}],"citation":{"chicago":"Meisner, Sebastian, and Marco Platzner. “Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-Cores for Error Detection.” In <i>Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)</i>, edited by Diana Goehringer, MarcoDomenico Santambrogio, JoãoM.P. Cardoso, and Koen Bertels, 283–90. Lecture Notes in Computer Science. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_30\">https://doi.org/10.1007/978-3-319-05960-0_30</a>.","ieee":"S. Meisner and M. Platzner, “Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection,” in <i>Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)</i>, 2014, pp. 283–290.","ama":"Meisner S, Platzner M. Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection. In: Goehringer D, Santambrogio M, Cardoso JP, Bertels K, eds. <i>Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)</i>. Lecture Notes in Computer Science. Springer; 2014:283-290. doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_30\">10.1007/978-3-319-05960-0_30</a>","short":"S. Meisner, M. Platzner, in: D. Goehringer, M. Santambrogio, J.P. Cardoso, K. Bertels (Eds.), Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC), Springer, 2014, pp. 283–290.","bibtex":"@inproceedings{Meisner_Platzner_2014, series={Lecture Notes in Computer Science}, title={Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-05960-0_30\">10.1007/978-3-319-05960-0_30</a>}, booktitle={Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)}, publisher={Springer}, author={Meisner, Sebastian and Platzner, Marco}, editor={Goehringer, Diana and Santambrogio, MarcoDomenico and Cardoso, JoãoM.P. and Bertels, KoenEditors}, year={2014}, pages={283–290}, collection={Lecture Notes in Computer Science} }","mla":"Meisner, Sebastian, and Marco Platzner. “Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-Cores for Error Detection.” <i>Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)</i>, edited by Diana Goehringer et al., Springer, 2014, pp. 283–90, doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_30\">10.1007/978-3-319-05960-0_30</a>.","apa":"Meisner, S., &#38; Platzner, M. (2014). Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection. In D. Goehringer, M. Santambrogio, J. P. Cardoso, &#38; K. Bertels (Eds.), <i>Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)</i> (pp. 283–290). Springer. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_30\">https://doi.org/10.1007/978-3-319-05960-0_30</a>"},"page":"283-290","has_accepted_license":"1","ddc":["040"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Dynamic thread duplication is a known redundancy technique for multi-cores. The approach duplicates a thread under observation for some time period and compares the signatures of the two threads to detect errors. Hybrid multi-cores, typically implemented on platform FPGAs, enable the unique option of running the thread under observation and its copy in different modalities, i.e., software and hardware. We denote our dynamic redundancy technique on hybrid multi-cores as thread shadowing. In this paper we present the concept of thread shadowing and an implementation on a multi-threaded hybrid multi-core architecture. We report on experiments with a block-processing application and demonstrate the overheads, detection latencies and coverage for a range of thread shadowing modes. The results show that trans-modal thread shadowing, although bearing long detection latencies, offers attractive coverage at a low overhead."}],"file":[{"date_created":"2018-03-20T07:26:16Z","creator":"florida","date_updated":"2018-03-20T07:26:16Z","file_id":"1417","access_level":"closed","file_name":"347-meisner13_xx_SFB1__1_.pdf","file_size":1168877,"content_type":"application/pdf","relation":"main_file","success":1}],"publication":"Proceedings of the 10th International Symposium on Applied Reconfigurable Computing (ARC)","title":"Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error Detection","publisher":"Springer","date_created":"2017-10-17T12:41:59Z","year":"2014"},{"citation":{"apa":"Rüthing, C. (2014). <i>The Xilinx Zynq Architecture as a Platform for Reconfigurable Heterogeneous Multi-Cores</i>. Universität Paderborn.","bibtex":"@book{Rüthing_2014, title={The Xilinx Zynq Architecture as a Platform for Reconfigurable Heterogeneous Multi-Cores}, publisher={Universität Paderborn}, author={Rüthing, Christoph}, year={2014} }","short":"C. Rüthing, The Xilinx Zynq Architecture as a Platform for Reconfigurable Heterogeneous Multi-Cores, Universität Paderborn, 2014.","mla":"Rüthing, Christoph. <i>The Xilinx Zynq Architecture as a Platform for Reconfigurable Heterogeneous Multi-Cores</i>. Universität Paderborn, 2014.","chicago":"Rüthing, Christoph. <i>The Xilinx Zynq Architecture as a Platform for Reconfigurable Heterogeneous Multi-Cores</i>. Universität Paderborn, 2014.","ieee":"C. Rüthing, <i>The Xilinx Zynq Architecture as a Platform for Reconfigurable Heterogeneous Multi-Cores</i>. Universität Paderborn, 2014.","ama":"Rüthing C. <i>The Xilinx Zynq Architecture as a Platform for Reconfigurable Heterogeneous Multi-Cores</i>. Universität Paderborn; 2014."},"year":"2014","title":"The Xilinx Zynq Architecture as a Platform for Reconfigurable Heterogeneous Multi-Cores","author":[{"last_name":"Rüthing","full_name":"Rüthing, Christoph","first_name":"Christoph"}],"date_created":"2017-10-17T12:41:59Z","date_updated":"2022-01-06T06:59:18Z","publisher":"Universität Paderborn","status":"public","type":"bachelorsthesis","user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"348"},{"file":[{"date_updated":"2018-03-21T13:08:36Z","creator":"florida","date_created":"2018-03-21T13:08:36Z","file_size":232052,"access_level":"closed","file_name":"349-CompLawSorge14.pdf","file_id":"1568","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"lang":"eng","text":"Identity-based cryptography has attracted attention in the cryptographic research communityin recent years. Despite the importance of cryptographic schemes for applicationsin business and law, the legal implications of identity-based cryptography have not yetbeen discussed. We investigate how identity-based signatures fit into the legal framework.We focus on the European Signature Directive, but also take the UNCITRAL Model Law onElectronic Signatures into account. In contrast to previous assumptions, identity-basedsignature schemes can, in principle, be used even for qualified electronic signatures,which can replace handwritten signatures in the member states of the European Union.We derive requirements to be taken into account in the development of future identitybasedsignature schemes."}],"type":"report","file_date_updated":"2018-03-21T13:08:36Z","ddc":["040"],"user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"349","citation":{"apa":"Sorge, C. (2014). <i>The Legal Classification of Identity-Based Signatures</i>.","bibtex":"@book{Sorge_2014, title={The Legal Classification of Identity-Based Signatures}, author={Sorge, Christoph}, year={2014} }","short":"C. Sorge, The Legal Classification of Identity-Based Signatures, 2014.","mla":"Sorge, Christoph. <i>The Legal Classification of Identity-Based Signatures</i>. 2014.","ieee":"C. Sorge, <i>The Legal Classification of Identity-Based Signatures</i>. 2014.","chicago":"Sorge, Christoph. <i>The Legal Classification of Identity-Based Signatures</i>, 2014.","ama":"Sorge C. <i>The Legal Classification of Identity-Based Signatures</i>.; 2014."},"year":"2014","related_material":{"link":[{"relation":"confirmation","url":"https://eprint.iacr.org/2013/271"}]},"has_accepted_license":"1","title":"The Legal Classification of Identity-Based Signatures","author":[{"last_name":"Sorge","full_name":"Sorge, Christoph","first_name":"Christoph"}],"date_created":"2017-10-17T12:42:00Z","date_updated":"2022-01-06T06:59:19Z"},{"page":"1--7","citation":{"bibtex":"@inproceedings{Blömer_Günther_Liske_2014, title={Tampering attacks in pairing-based cryptography}, DOI={<a href=\"https://doi.org/10.1109/FDTC.2014.10\">10.1109/FDTC.2014.10</a>}, booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}, author={Blömer, Johannes and Günther, Peter and Liske, Gennadij}, year={2014}, pages={1--7} }","mla":"Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.” <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 1--7, doi:<a href=\"https://doi.org/10.1109/FDTC.2014.10\">10.1109/FDTC.2014.10</a>.","short":"J. Blömer, P. Günther, G. Liske, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.","apa":"Blömer, J., Günther, P., &#38; Liske, G. (2014). Tampering attacks in pairing-based cryptography. In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i> (pp. 1--7). <a href=\"https://doi.org/10.1109/FDTC.2014.10\">https://doi.org/10.1109/FDTC.2014.10</a>","ieee":"J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,” in <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014, pp. 1--7.","chicago":"Blömer, Johannes, Peter Günther, and Gennadij Liske. “Tampering Attacks in Pairing-Based Cryptography.” In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 1--7, 2014. <a href=\"https://doi.org/10.1109/FDTC.2014.10\">https://doi.org/10.1109/FDTC.2014.10</a>.","ama":"Blömer J, Günther P, Liske G. Tampering attacks in pairing-based cryptography. In: <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>. ; 2014:1--7. doi:<a href=\"https://doi.org/10.1109/FDTC.2014.10\">10.1109/FDTC.2014.10</a>"},"year":"2014","has_accepted_license":"1","doi":"10.1109/FDTC.2014.10","title":"Tampering attacks in pairing-based cryptography","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Peter","full_name":"Günther, Peter","last_name":"Günther"},{"full_name":"Liske, Gennadij","last_name":"Liske","first_name":"Gennadij"}],"date_created":"2017-10-17T12:42:01Z","date_updated":"2022-01-06T06:59:23Z","status":"public","file":[{"date_created":"2018-03-20T07:22:29Z","creator":"florida","date_updated":"2018-03-20T07:22:29Z","file_id":"1412","access_level":"closed","file_name":"355-Bloemer2014.pdf","file_size":293394,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"In the last decade pairings have become an important, and often indispensable, ingredient in the construction of identity-based and attribute-based cryptosystems, as well as group signatures and credential systems. Consequently, the applicability of timing, power, or fault attacks to implementations of pairings is an important research topic. We will review some of the known results in this area."}],"publication":"Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)","type":"conference","file_date_updated":"2018-03-20T07:22:29Z","ddc":["040"],"department":[{"_id":"64"}],"user_id":"25078","_id":"355","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}]},{"has_accepted_license":"1","citation":{"short":"R. Petrlic, A. Jungmann, M.C. Platenius, W. Schäfer, C. Sorge, in: Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014), 2014, pp. 131–142.","bibtex":"@inproceedings{Petrlic_Jungmann_Platenius_Schäfer_Sorge_2014, title={Security and Privacy Challenges in On-The-Fly Computing}, booktitle={Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)}, author={Petrlic, Ronald and Jungmann, Alexander and Platenius, Marie Christin and Schäfer, Wilhelm and Sorge, Christoph}, year={2014}, pages={131–142} }","mla":"Petrlic, Ronald, et al. “Security and Privacy Challenges in On-The-Fly Computing.” <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>, 2014, pp. 131–42.","apa":"Petrlic, R., Jungmann, A., Platenius, M. C., Schäfer, W., &#38; Sorge, C. (2014). Security and Privacy Challenges in On-The-Fly Computing. In <i>Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)</i> (pp. 131–142).","ieee":"R. Petrlic, A. Jungmann, M. C. Platenius, W. Schäfer, and C. Sorge, “Security and Privacy Challenges in On-The-Fly Computing,” in <i>Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)</i>, 2014, pp. 131–142.","chicago":"Petrlic, Ronald, Alexander Jungmann, Marie Christin Platenius, Wilhelm Schäfer, and Christoph Sorge. “Security and Privacy Challenges in On-The-Fly Computing.” In <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>, 131–42, 2014.","ama":"Petrlic R, Jungmann A, Platenius MC, Schäfer W, Sorge C. Security and Privacy Challenges in On-The-Fly Computing. In: <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>. ; 2014:131-142."},"page":"131-142","year":"2014","author":[{"first_name":"Ronald","full_name":"Petrlic, Ronald","last_name":"Petrlic"},{"first_name":"Alexander","full_name":"Jungmann, Alexander","last_name":"Jungmann"},{"first_name":"Marie Christin","last_name":"Platenius","full_name":"Platenius, Marie Christin"},{"last_name":"Schäfer","full_name":"Schäfer, Wilhelm","first_name":"Wilhelm"},{"first_name":"Christoph","full_name":"Sorge, Christoph","last_name":"Sorge"}],"date_created":"2017-10-17T12:42:03Z","date_updated":"2022-01-06T06:59:29Z","title":"Security and Privacy Challenges in On-The-Fly Computing","type":"conference","publication":"Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP 2014)","file":[{"creator":"florida","date_created":"2018-03-20T07:18:47Z","date_updated":"2018-03-20T07:18:47Z","file_name":"366-otf-security-privacy-final.pdf","access_level":"closed","file_id":"1405","file_size":74488,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"lang":"eng","text":"On-The-Fly (OTF) Computing constitutes an approach towards highly dynamic and individualized software markets. Based on service-oriented computing, OTF Computing is about realizing global markets of services that can be flexibly combined. We report on our current research activities, the security and privacy implications thereof, and our approaches to tackle the challenges. Furthermore, we discuss how the security and privacy challenges are addressed in research projects similar to OTF Computing."}],"user_id":"477","department":[{"_id":"76"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"_id":"366","file_date_updated":"2018-03-20T07:18:47Z","language":[{"iso":"eng"}],"ddc":["040"]},{"date_created":"2017-10-17T12:42:03Z","author":[{"full_name":"Brinkmann, Andre","last_name":"Brinkmann","first_name":"Andre"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Lars","full_name":"Nagel, Lars","last_name":"Nagel"},{"full_name":"Riechers, Sören","last_name":"Riechers","first_name":"Sören"},{"last_name":"Suess","full_name":"Suess, Tim ","first_name":"Tim "}],"date_updated":"2022-01-06T06:59:30Z","doi":"10.1145/2612669.2612698","title":"Scheduling Shared Continuous Resources on Many-Cores","has_accepted_license":"1","page":"128-137","citation":{"apa":"Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S., &#38; Suess, T. (2014). Scheduling Shared Continuous Resources on Many-Cores. <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 128–137. <a href=\"https://doi.org/10.1145/2612669.2612698\">https://doi.org/10.1145/2612669.2612698</a>","mla":"Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.” <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2014, pp. 128–37, doi:<a href=\"https://doi.org/10.1145/2612669.2612698\">10.1145/2612669.2612698</a>.","bibtex":"@inproceedings{Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Suess_2014, title={Scheduling Shared Continuous Resources on Many-Cores}, DOI={<a href=\"https://doi.org/10.1145/2612669.2612698\">10.1145/2612669.2612698</a>}, booktitle={Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim }, year={2014}, pages={128–137} }","short":"A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, T. Suess, in: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2014, pp. 128–137.","chicago":"Brinkmann, Andre, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, and Tim  Suess. “Scheduling Shared Continuous Resources on Many-Cores.” In <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 128–37, 2014. <a href=\"https://doi.org/10.1145/2612669.2612698\">https://doi.org/10.1145/2612669.2612698</a>.","ieee":"A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, and T. Suess, “Scheduling Shared Continuous Resources on Many-Cores,” in <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2014, pp. 128–137, doi: <a href=\"https://doi.org/10.1145/2612669.2612698\">10.1145/2612669.2612698</a>.","ama":"Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Suess T. Scheduling Shared Continuous Resources on Many-Cores. In: <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2014:128-137. doi:<a href=\"https://doi.org/10.1145/2612669.2612698\">10.1145/2612669.2612698</a>"},"year":"2014","department":[{"_id":"63"}],"user_id":"15415","_id":"368","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-20T07:17:38Z","language":[{"iso":"eng"}],"ddc":["040"],"publication":"Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","status":"public","file":[{"file_size":485767,"file_name":"368-BKMNRS14.pdf","access_level":"closed","file_id":"1403","date_updated":"2018-03-20T07:17:38Z","date_created":"2018-03-20T07:17:38Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We consider the problem of scheduling a number of jobs on $m$ identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement r_j \\in {0,1}. The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their \\emph{processing speeds}, have been studied under the term discrete-continuous scheduling. Known results are either very pessimistic or heuristic in nature.In this paper, we suggest and analyze a slightly simplified model. It focuses on the assignment of shared continuous resources to the processors. The job assignment to processors and the ordering of the jobs have already been fixed. It is shown that, even for unit size jobs, finding an optimal solution is NP-hard if the number of processors is part of the input. Positive results for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover, we prove that balanced schedules yield a 2-1/m-approximation for a fixed number of processors. Such schedules are computed by our GreedyBalance algorithm, for which the bound is tight."}]},{"year":"2014","citation":{"short":"T. Rath, RSA-Full Domain Hash Revisited, Universität Paderborn, 2014.","bibtex":"@book{Rath_2014, title={RSA-Full Domain Hash Revisited}, publisher={Universität Paderborn}, author={Rath, Timo}, year={2014} }","mla":"Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","apa":"Rath, T. (2014). <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn.","ieee":"T. Rath, <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","chicago":"Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.","ama":"Rath T. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn; 2014."},"date_updated":"2022-01-06T06:59:30Z","publisher":"Universität Paderborn","author":[{"full_name":"Rath, Timo","last_name":"Rath","first_name":"Timo"}],"supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"date_created":"2017-10-17T12:42:04Z","title":"RSA-Full Domain Hash Revisited","type":"bachelorsthesis","abstract":[{"lang":"eng","text":"RSA Full Domain Hash ist im Zufallsorakelmodell ein EUF-CMA sicheres Signaturverfahren (existentially unforgeable under chosen-message attacks). Der Sicherheitsbeweis wird unter anderem in der Vorlesung Einf{\\\"u}hrung in die Kryptographie vorgestellt. Auch bei einer genaueren Analyse verliert man bei der Reduktion einen Faktor \\nicefrac{1}{q_{s}}(wobei q_{s}die Anzahl der Anfragen an das Signaturorakel darstellt), was f{\\\"u}r die Praxis in relativ großen Systemparametern (RSA-Modul) resultiert [1].Seit der Ver{\\\"o}ffentlichung von [2] wurde geglaubt, dass der Faktor \\nicefrac{1}{q_{s}}optimal ist. Erst zehn Jahre sp{\\\"a}ter offenbarten die Autoren von [3] einen Fehler in [2] und zeigten eine bessere Reduktion allerdings unter einer etwas st{\\\"a}rkeren Sicherheitsannahme.Die Ergebnisse aus [3] lassen sich auf PSS-Verfahren (Probabilistic Signature Scheme), das z.B. in PKCS #1 benutzt wird, {\\\"u}bertragen und sind somit von großer Bedeutung f{\\\"u}r die Praxis. Weiterhin sind die in den Beweisen verwendete Techniken n{\\\"u}tzlich auch bei anderen kryptographischen Verfahren.In Rahmen dieser Arbeit sollen die entsprechenden Sicherheitsbeweise aufgearbeitet und dessen Auswirkungen f{\\\"u}r die Praxis analysiert werden.[1] J.S. Coron, “On the Exact Security of Full Domain Hash”, CRYPTO 2000. LNCS 1880, pp. 229-235, 2000.[2] J.S. Coron, “Optimal security proofs for PPS and other signature schemes”, EUROCRYPT 2002. LNCS 2332, pp 272-287, 2002.[3] S.A. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited”, in EUROCRYPT 2012. LNCS 7237, pp 537-553, 2012."}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"369","user_id":"477","department":[{"_id":"64"}]},{"series_title":"LNCS","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":"371","file_date_updated":"2018-03-20T07:16:32Z","ddc":["040"],"type":"conference","publication":"Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":269941,"access_level":"closed","file_name":"371-RoBuSt-OPODIS.pdf","file_id":"1401","date_updated":"2018-03-20T07:16:32Z","date_created":"2018-03-20T07:16:32Z","creator":"florida"}],"status":"public","abstract":[{"text":"In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive adversary, i.e., for each batch of requests the adversary can decide based on the entire system state which servers will be unavailable for that batch of requests. Despite up to \\gamma n^{1/\\log\\log n} crashed servers, with \\gamma>0 constant and n denoting the number of servers, our system can correctly process any batch of lookup and write requests (with at most a polylogarithmic number of requests issued at each non-crashed server) in at most a polylogarithmic number of communication rounds, with at most polylogarithmic time and work at each server and only a logarithmic storage overhead. Our system is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS, a distributed information system that is provably robust against the same kind of crash failures. However, IRIS is only able to serve lookup requests. Handling both lookup and write requests has turned out to require major changes in the design of IRIS.","lang":"eng"}],"date_created":"2017-10-17T12:42:04Z","author":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108"},{"last_name":"Eikel","full_name":"Eikel, Martina","first_name":"Martina"}],"date_updated":"2022-01-06T06:59:31Z","doi":"10.1007/978-3-319-14472-6_8","title":"RoBuSt: A Crash-Failure-Resistant Distributed Storage System","has_accepted_license":"1","citation":{"ieee":"C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant Distributed Storage System,” in <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122.","chicago":"Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” In <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 107--122. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">https://doi.org/10.1007/978-3-319-14472-6_8</a>.","ama":"Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In: <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>. LNCS. ; 2014:107--122. doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>","apa":"Scheideler, C., Setzer, A., &#38; Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i> (pp. 107--122). <a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">https://doi.org/10.1007/978-3-319-14472-6_8</a>","mla":"Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.” <i>Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)</i>, 2014, pp. 107--122, doi:<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>.","bibtex":"@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt: A Crash-Failure-Resistant Distributed Storage System}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-14472-6_8\">10.1007/978-3-319-14472-6_8</a>}, booktitle={Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel, Martina}, year={2014}, pages={107--122}, collection={LNCS} }","short":"C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122."},"page":"107--122","year":"2014"},{"file_date_updated":"2018-03-20T07:15:59Z","ddc":["040"],"user_id":"15504","series_title":"LNCS","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"374","file":[{"date_updated":"2018-03-20T07:15:59Z","date_created":"2018-03-20T07:15:59Z","creator":"florida","file_size":818625,"file_name":"374-2014_wold_arc.pdf","access_level":"closed","file_id":"1400","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","editor":[{"full_name":"Goehringer, Diana","last_name":"Goehringer","first_name":"Diana"},{"first_name":"MarcoDomenico","full_name":"Santambrogio, MarcoDomenico","last_name":"Santambrogio"},{"last_name":"Cardoso","full_name":"Cardoso, JoãoM.P.","first_name":"JoãoM.P."},{"first_name":"Koen","full_name":"Bertels, Koen","last_name":"Bertels"}],"abstract":[{"lang":"eng","text":"Run-time reconfiguration provides an opportunity to increase performance, reduce cost and improve energy efficiency in FPGA-based systems. However, run-time reconfigurable systems are more complex to implement than static only systems. This increases time to market, and introduces run-time overhead into the system. Our research aims to raise the abstraction level to develop run-time reconfigurable systems. We present operating system extensions which enable seamless integration of run-time reconfigurable hardware threads into applications. To improve resource utilization, the hardware threads are placed on a fine granularity tile grid. We take advantage of a relocatable module placer targeting modern FPGA to manage the reconfigurable area. The module placer accurately models the FPGA resources to compute feasible placement locations for the hardware threads at run-time. Finally, we evaluate our work by means of a case study that consists of a synthetic application to validate the functionality and performance of the implementation. The results show a reduction in reconfiguration time of up to 42% and more than double resource utilization."}],"type":"conference","publication":"Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications","doi":"10.1007/978-3-319-05960-0_6","title":"Relocatable Hardware Threads in Run-Time Reconfigurable Systems","date_created":"2017-10-17T12:42:05Z","author":[{"full_name":"Wold, Alexander","last_name":"Wold","first_name":"Alexander"},{"first_name":"Andreas","last_name":"Agne","full_name":"Agne, Andreas"},{"first_name":"Jim","full_name":"Torresen, Jim","last_name":"Torresen"}],"date_updated":"2022-01-06T06:59:32Z","citation":{"ieee":"A. Wold, A. Agne, and J. Torresen, “Relocatable Hardware Threads in Run-Time Reconfigurable Systems,” in <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>, 2014, pp. 61–72.","chicago":"Wold, Alexander, Andreas Agne, and Jim Torresen. “Relocatable Hardware Threads in Run-Time Reconfigurable Systems.” In <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>, edited by Diana Goehringer, MarcoDomenico Santambrogio, JoãoM.P. Cardoso, and Koen Bertels, 61–72. LNCS, 2014. <a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">https://doi.org/10.1007/978-3-319-05960-0_6</a>.","ama":"Wold A, Agne A, Torresen J. Relocatable Hardware Threads in Run-Time Reconfigurable Systems. In: Goehringer D, Santambrogio M, Cardoso JP, Bertels K, eds. <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>. LNCS. ; 2014:61-72. doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">10.1007/978-3-319-05960-0_6</a>","apa":"Wold, A., Agne, A., &#38; Torresen, J. (2014). Relocatable Hardware Threads in Run-Time Reconfigurable Systems. In D. Goehringer, M. Santambrogio, J. P. Cardoso, &#38; K. Bertels (Eds.), <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i> (pp. 61–72). <a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">https://doi.org/10.1007/978-3-319-05960-0_6</a>","mla":"Wold, Alexander, et al. “Relocatable Hardware Threads in Run-Time Reconfigurable Systems.” <i>Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications</i>, edited by Diana Goehringer et al., 2014, pp. 61–72, doi:<a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">10.1007/978-3-319-05960-0_6</a>.","short":"A. Wold, A. Agne, J. Torresen, in: D. Goehringer, M. Santambrogio, J.P. Cardoso, K. Bertels (Eds.), Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications, 2014, pp. 61–72.","bibtex":"@inproceedings{Wold_Agne_Torresen_2014, series={LNCS}, title={Relocatable Hardware Threads in Run-Time Reconfigurable Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-05960-0_6\">10.1007/978-3-319-05960-0_6</a>}, booktitle={Proceedings of the 10th International Symposium on Reconfigurable Computing: Architectures, Tools, and Applications}, author={Wold, Alexander and Agne, Andreas and Torresen, Jim}, editor={Goehringer, Diana and Santambrogio, MarcoDomenico and Cardoso, JoãoM.P. and Bertels, KoenEditors}, year={2014}, pages={61–72}, collection={LNCS} }"},"page":"61-72","year":"2014","has_accepted_license":"1"},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-20T07:13:36Z","date_updated":"2018-03-20T07:13:36Z","access_level":"closed","file_id":"1396","file_name":"378-re-chord_journal.pdf","file_size":310961}],"status":"public","abstract":[{"lang":"eng","text":"The Chord peer-to-peer system is considered, together with CAN, Tapestry and Pastry, as one of the pioneering works on peer-to-peer distributed hash tables (DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer systems in general. Chord, in particular, has been studied thoroughly, and many variants of Chord have been presented that optimize various criteria. Also, several implementations of Chord are available on various platforms. Though Chord is known to be very efficient and scalable and it can handle churn quite well, no protocol is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network can be recovered from any initial state in which the network is still weakly connected. This is not too surprising since it is known that the Chord network is not locally checkable for its current topology. We present a slight extension of the Chord network, called Re-Chord (reactive Chord), that turns out to be locally checkable, and we present a self-stabilizing distributed protocol for it that can recover the Re-Chord network from any initial state, in which the n peers are weakly connected, in O(nlogn) communication rounds. We also show that our protocol allows a new peer to join or an old peer to leave an already stable Re-Chord network so that within O(logn)^2) communication rounds the Re-Chord network is stable again."}],"type":"journal_article","publication":"Theory of Computing Systems","file_date_updated":"2018-03-20T07:13:36Z","ddc":["040"],"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"378","citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing Chord Overlay Network,” <i>Theory of Computing Systems</i>, no. 3, pp. 591–612, 2014.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3 (2014): 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>. 2014;(3):591-612. doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems (2014) 591–612.","bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing Chord Overlay Network}, DOI={<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>}, number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612} }","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>Theory of Computing Systems</i>, no. 3, Springer, 2014, pp. 591–612, doi:<a href=\"https://doi.org/10.1007/s00224-012-9431-2\">10.1007/s00224-012-9431-2</a>.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2014). Re-Chord: A Self-stabilizing Chord Overlay Network. <i>Theory of Computing Systems</i>, (3), 591–612. <a href=\"https://doi.org/10.1007/s00224-012-9431-2\">https://doi.org/10.1007/s00224-012-9431-2</a>"},"page":"591-612","year":"2014","issue":"3","has_accepted_license":"1","doi":"10.1007/s00224-012-9431-2","title":"Re-Chord: A Self-stabilizing Chord Overlay Network","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:05Z","publisher":"Springer","date_updated":"2022-01-06T06:59:35Z"},{"has_accepted_license":"1","year":"2014","citation":{"ama":"Petrlic R, Lutters S, Sorge C. Privacy-Preserving Reputation Management. In: <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>. ; 2014:1712-1718. doi:<a href=\"https://doi.org/10.1145/2554850.2554881\">10.1145/2554850.2554881</a>","chicago":"Petrlic, Ronald, Sascha Lutters, and Christoph Sorge. “Privacy-Preserving Reputation Management.” In <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>, 1712–18, 2014. <a href=\"https://doi.org/10.1145/2554850.2554881\">https://doi.org/10.1145/2554850.2554881</a>.","ieee":"R. Petrlic, S. Lutters, and C. Sorge, “Privacy-Preserving Reputation Management,” in <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>, 2014, pp. 1712–1718.","bibtex":"@inproceedings{Petrlic_Lutters_Sorge_2014, title={Privacy-Preserving Reputation Management}, DOI={<a href=\"https://doi.org/10.1145/2554850.2554881\">10.1145/2554850.2554881</a>}, booktitle={Proceedings of the 29th Symposium On Applied Computing (SAC)}, author={Petrlic, Ronald and Lutters, Sascha and Sorge, Christoph}, year={2014}, pages={1712–1718} }","mla":"Petrlic, Ronald, et al. “Privacy-Preserving Reputation Management.” <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i>, 2014, pp. 1712–18, doi:<a href=\"https://doi.org/10.1145/2554850.2554881\">10.1145/2554850.2554881</a>.","short":"R. Petrlic, S. Lutters, C. Sorge, in: Proceedings of the 29th Symposium On Applied Computing (SAC), 2014, pp. 1712–1718.","apa":"Petrlic, R., Lutters, S., &#38; Sorge, C. (2014). Privacy-Preserving Reputation Management. In <i>Proceedings of the 29th Symposium On Applied Computing (SAC)</i> (pp. 1712–1718). <a href=\"https://doi.org/10.1145/2554850.2554881\">https://doi.org/10.1145/2554850.2554881</a>"},"page":"1712-1718","date_updated":"2022-01-06T06:59:42Z","date_created":"2017-10-17T12:42:06Z","author":[{"first_name":"Ronald","full_name":"Petrlic, Ronald","last_name":"Petrlic"},{"first_name":"Sascha","full_name":"Lutters, Sascha","last_name":"Lutters"},{"last_name":"Sorge","full_name":"Sorge, Christoph","first_name":"Christoph"}],"title":"Privacy-Preserving Reputation Management","doi":"10.1145/2554850.2554881","type":"conference","publication":"Proceedings of the 29th Symposium On Applied Computing (SAC)","abstract":[{"text":"Reputation systems provide reputation values of rated parties to users. These reputation values, typically aggregations of individual user ratings, shall be reliable, i.e. should enable a realistic assessment of the probability that the rated party behaves as expected in a transaction. In order for the reputation values to stay reliable and, thus, for the reputation system to provide a benefit, the system needs to be resistant against manipulations by users, the rated parties trying to improve their reputation values, and even against competitors trying to worsen a reputation value. At the same time, a reputation system shall provide privacy protection for users: rated parties shall not be able to learn who provided a certain rating. Otherwise users might not take part in the system as they fear bad feedback in revenge for bad ratings, or users do not want to be connected to certain transactions based on their provided ratings. In this paper we come up with a solution that provides both, reliability of reputation values on the one hand, and privacy protection for users on the other hand. In contrast to related work, our solution only makes use of a single reputation provider that needs to be trusted (to a certain extent) and does not require any bulletin boards to be present in the system. We make use of the Paillier cryptosystem to provide an aggregation of individual user ratings in a way that no party can learn which user provided a certain rating.","lang":"eng"}],"file":[{"file_id":"1391","access_level":"closed","file_name":"384-reputationsystem_01.pdf","file_size":505927,"creator":"florida","date_created":"2018-03-20T07:04:20Z","date_updated":"2018-03-20T07:04:20Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"384","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-20T07:04:20Z"},{"type":"dissertation","file":[{"access_level":"closed","file_name":"385-arbeit1.pdf","file_id":"1390","file_size":2962042,"creator":"florida","date_created":"2018-03-20T07:03:37Z","date_updated":"2018-03-20T07:03:37Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"385","file_date_updated":"2018-03-20T07:03:37Z","language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","citation":{"short":"R. Petrlic, Privacy-Preserving Multiparty Digital Rights Management, Universität Paderborn, 2014.","bibtex":"@book{Petrlic_2014, title={Privacy-Preserving Multiparty Digital Rights Management}, publisher={Universität Paderborn}, author={Petrlic, Ronald}, year={2014} }","mla":"Petrlic, Ronald. <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn, 2014.","apa":"Petrlic, R. (2014). <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn.","ama":"Petrlic R. <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn; 2014.","chicago":"Petrlic, Ronald. <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn, 2014.","ieee":"R. Petrlic, <i>Privacy-Preserving Multiparty Digital Rights Management</i>. Universität Paderborn, 2014."},"year":"2014","date_created":"2017-10-17T12:42:07Z","author":[{"last_name":"Petrlic","full_name":"Petrlic, Ronald","first_name":"Ronald"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:45Z","title":"Privacy-Preserving Multiparty Digital Rights Management"},{"citation":{"short":"R. Petrlic, C. Sorge, in: Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS), 2014, pp. 1–5.","bibtex":"@inproceedings{Petrlic_Sorge_2014, title={Privacy-Preserving Digital Rights Management based on Attribute-based Encryption}, DOI={<a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">10.1109/NTMS.2014.6814044</a>}, booktitle={Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)}, author={Petrlic, Ronald and Sorge, Christoph}, year={2014}, pages={1–5} }","mla":"Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving Digital Rights Management Based on Attribute-Based Encryption.” <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>, 2014, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">10.1109/NTMS.2014.6814044</a>.","apa":"Petrlic, R., &#38; Sorge, C. (2014). Privacy-Preserving Digital Rights Management based on Attribute-based Encryption. In <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i> (pp. 1–5). <a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">https://doi.org/10.1109/NTMS.2014.6814044</a>","ama":"Petrlic R, Sorge C. Privacy-Preserving Digital Rights Management based on Attribute-based Encryption. In: <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>. ; 2014:1-5. doi:<a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">10.1109/NTMS.2014.6814044</a>","chicago":"Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving Digital Rights Management Based on Attribute-Based Encryption.” In <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>, 1–5, 2014. <a href=\"https://doi.org/10.1109/NTMS.2014.6814044\">https://doi.org/10.1109/NTMS.2014.6814044</a>.","ieee":"R. Petrlic and C. Sorge, “Privacy-Preserving Digital Rights Management based on Attribute-based Encryption,” in <i>Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)</i>, 2014, pp. 1–5."},"page":"1-5","year":"2014","has_accepted_license":"1","doi":"10.1109/NTMS.2014.6814044","title":"Privacy-Preserving Digital Rights Management based on Attribute-based Encryption","author":[{"full_name":"Petrlic, Ronald","last_name":"Petrlic","first_name":"Ronald"},{"full_name":"Sorge, Christoph","last_name":"Sorge","first_name":"Christoph"}],"date_created":"2017-10-17T12:42:07Z","date_updated":"2022-01-06T06:59:46Z","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:03:02Z","creator":"florida","date_updated":"2018-03-20T07:03:02Z","file_name":"386-NTMS14.pdf","file_id":"1389","access_level":"closed","file_size":216843}],"status":"public","abstract":[{"lang":"eng","text":"We present a privacy-preserving multiparty DRM scheme that does not need a trusted third party. Users anonymously buy content from content providers and anonymously execute it at content execution centers. The executions are unlinkable to each other. The license check is performed as part of the used ciphertext-policy attribute-based encryption (CP-ABE) and, thus, access control is cryptographically enforced. The problem of authorization proof towards the key center in an ABE scheme is solved by a combination with anonymous payments."}],"type":"conference","publication":"Proceedings of the Sixth IFIP International Conference on New Technologies, Mobility and Security (NTMS)","file_date_updated":"2018-03-20T07:03:02Z","ddc":["040"],"user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"386"},{"file_date_updated":"2018-03-20T07:02:33Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"477","_id":"387","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1388","file_name":"387-a24-awerbuch_2_.pdf","file_size":521454,"date_created":"2018-03-20T07:02:33Z","creator":"florida","date_updated":"2018-03-20T07:02:33Z"}],"abstract":[{"text":"This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing.","lang":"eng"}],"publication":"Transactions on Algorithms","type":"journal_article","doi":"10.1145/2635818","title":"Principles of Robust Medium Access and an Application to Leader Election","date_created":"2017-10-17T12:42:07Z","author":[{"full_name":"Awerbuch, Baruch","last_name":"Awerbuch","first_name":"Baruch"},{"full_name":"Richa, Andrea W.","last_name":"Richa","first_name":"Andrea W."},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"}],"publisher":"ACM","date_updated":"2022-01-06T06:59:47Z","citation":{"mla":"Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>.","bibtex":"@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles of Robust Medium Access and an Application to Leader Election}, DOI={<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>}, number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch, Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2014} }","short":"B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions on Algorithms (2014).","apa":"Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2014). Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>, (4). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>","ieee":"B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles of Robust Medium Access and an Application to Leader Election,” <i>Transactions on Algorithms</i>, no. 4, 2014.","chicago":"Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4 (2014). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>.","ama":"Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>. 2014;(4). doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>"},"year":"2014","issue":"4","has_accepted_license":"1"},{"ddc":["040"],"file_date_updated":"2018-03-20T07:01:29Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"389","user_id":"15504","abstract":[{"lang":"eng","text":"This article presents a new approach for representing and processing abstract optimization models. Confronted with model and data integration tasks for distributed Decision Support Systems which are especially composed out of software services, we describe model constituents such as constraints both structurally and semantically. Within our approach, typed model constituents can be integrated into complete models and the instantiation of model constituents itself with data and data models can be wrapped into semantic software services. Besides others, this supports the automated generation of adaptors and the search for and composition of services. The basic idea of our approach is to represent the optimization models as instance knowledge of different ontologies for both optimization and application domains. By separating the model expression structure from the goal and constraint conceptualizations predefined modeling constructs can be reused, where we do not only separate the model structure from data, but can also abstract the structure from a specific data model. We present an XML and ontology-query based approach for this separation and demonstrate the resulting flexible model integration procedure out of reusable goal and constraint types on a network flow problem."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":595852,"file_name":"389-201x_-_Stapel__Suhl_-_Ontology-based_Representation_of_Optimization_Models.pdf","access_level":"closed","file_id":"1386","date_updated":"2018-03-20T07:01:29Z","creator":"florida","date_created":"2018-03-20T07:01:29Z"}],"status":"public","type":"report","title":"Ontology-based Representation of Optimization Models","date_updated":"2022-01-06T06:59:49Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:07Z","author":[{"first_name":"Florian","full_name":"Stapel, Florian","last_name":"Stapel"},{"last_name":"Suhl","full_name":"Suhl, Lena","first_name":"Lena"}],"year":"2014","citation":{"ieee":"F. Stapel and L. Suhl, <i>Ontology-based Representation of Optimization Models</i>. Universität Paderborn, 2014.","chicago":"Stapel, Florian, and Lena Suhl. <i>Ontology-Based Representation of Optimization Models</i>. Universität Paderborn, 2014.","ama":"Stapel F, Suhl L. <i>Ontology-Based Representation of Optimization Models</i>. Universität Paderborn; 2014.","mla":"Stapel, Florian, and Lena Suhl. <i>Ontology-Based Representation of Optimization Models</i>. Universität Paderborn, 2014.","bibtex":"@book{Stapel_Suhl_2014, title={Ontology-based Representation of Optimization Models}, publisher={Universität Paderborn}, author={Stapel, Florian and Suhl, Lena}, year={2014} }","short":"F. Stapel, L. Suhl, Ontology-Based Representation of Optimization Models, Universität Paderborn, 2014.","apa":"Stapel, F., &#38; Suhl, L. (2014). <i>Ontology-based Representation of Optimization Models</i>. Universität Paderborn."},"has_accepted_license":"1"},{"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"18001","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","date_created":"2020-08-17T08:16:07Z","author":[{"full_name":"Luo, Linghui","last_name":"Luo","first_name":"Linghui"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","title":"Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen","citation":{"ama":"Luo L. <i>Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn; 2014.","chicago":"Luo, Linghui. <i>Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.","ieee":"L. Luo, <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014.","apa":"Luo, L. (2014). <i>Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn.","short":"L. Luo, Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem in Skip+ Graphen, Universität Paderborn, 2014.","bibtex":"@book{Luo_2014, title={Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen}, publisher={Universität Paderborn}, author={Luo, Linghui}, year={2014} }","mla":"Luo, Linghui. <i>Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem in Skip+ Graphen</i>. Universität Paderborn, 2014."},"year":"2014"},{"date_created":"2017-10-17T12:42:17Z","author":[{"full_name":"Sorge, Christoph","last_name":"Sorge","first_name":"Christoph"},{"last_name":"Petrlic","full_name":"Petrlic, Ronald","first_name":"Ronald"}],"date_updated":"2022-01-06T07:01:02Z","title":"Datenschutz im Future Internet: rechtliche Aspekte und technische Maßnahmen","has_accepted_license":"1","citation":{"ama":"Sorge C, Petrlic R. Datenschutz im Future Internet: rechtliche Aspekte und technische Maßnahmen. In: <i>Tagungsband Des 17. Internationalen Rechtsinformatik Symposions</i>. ; 2014.","chicago":"Sorge, Christoph, and Ronald Petrlic. “Datenschutz Im Future Internet: Rechtliche Aspekte Und Technische Maßnahmen.” In <i>Tagungsband Des 17. Internationalen Rechtsinformatik Symposions</i>, 2014.","ieee":"C. Sorge and R. Petrlic, “Datenschutz im Future Internet: rechtliche Aspekte und technische Maßnahmen,” in <i>Tagungsband des 17. Internationalen Rechtsinformatik Symposions</i>, 2014.","mla":"Sorge, Christoph, and Ronald Petrlic. “Datenschutz Im Future Internet: Rechtliche Aspekte Und Technische Maßnahmen.” <i>Tagungsband Des 17. Internationalen Rechtsinformatik Symposions</i>, 2014.","short":"C. Sorge, R. Petrlic, in: Tagungsband Des 17. Internationalen Rechtsinformatik Symposions, 2014.","bibtex":"@inproceedings{Sorge_Petrlic_2014, title={Datenschutz im Future Internet: rechtliche Aspekte und technische Maßnahmen}, booktitle={Tagungsband des 17. Internationalen Rechtsinformatik Symposions}, author={Sorge, Christoph and Petrlic, Ronald}, year={2014} }","apa":"Sorge, C., &#38; Petrlic, R. (2014). Datenschutz im Future Internet: rechtliche Aspekte und technische Maßnahmen. In <i>Tagungsband des 17. Internationalen Rechtsinformatik Symposions</i>."},"year":"2014","user_id":"15504","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"441","file_date_updated":"2018-03-16T11:29:22Z","ddc":["040"],"type":"conference","publication":"Tagungsband des 17. Internationalen Rechtsinformatik Symposions","file":[{"file_id":"1352","access_level":"closed","file_name":"441-sorge-petrlic-iris2014_01.pdf","file_size":207583,"date_created":"2018-03-16T11:29:22Z","creator":"florida","date_updated":"2018-03-16T11:29:22Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"Das Future Internet soll den Anforderungen heutiger und zuk{\\\"u}nftiger daten-intensiver Internet-Anwendungen besser gerecht werden als dies heute der Fall ist. Seit einigen Jahren wird an unterschiedlichen Verfahren geforscht, die das „Future Internet“ erm{\\\"o}glichen sollen – diese Ans{\\\"a}tze gehen weit {\\\"u}ber die Ziele von IPv6 hinaus. In diesem Beitrag stellen wir einige Kernpunkte der Future-Internet-Initiativen vor und identifizieren Gemeinsamkeiten der unterschiedlichen Konzepte. Wir beleuchten die Konsequenzen aus datenschutzrechtlicher Sicht und geben einen {\\\"U}berblick {\\\"u}ber Ans{\\\"a}tze, die die identifizierten Datenschutz-Probleme durch technische Maßnahmen bis zu einem gewissen Grad verhindern."}]},{"type":"preprint","abstract":[{"lang":"eng","text":"We present a new transformation of chosen-plaintext secure predicate encryption schemes with public index into chosen-ciphertext secure schemes. Our construction requires only a universal one-way hash function and is selectively secure in the standard model. The transformation is not generic but can be applied to various existing schemes constructed from bilinear groups. Using common structural properties of these schemes we provide an efficient and simple transformation without overhead in form of one-time signatures or message authentication codes as required in the known generic transformations."}],"status":"public","file":[{"date_updated":"2018-03-16T11:28:34Z","date_created":"2018-03-16T11:28:34Z","creator":"florida","file_size":377945,"file_name":"442-P-KEM.pdf","access_level":"closed","file_id":"1351","content_type":"application/pdf","success":1,"relation":"main_file"}],"_id":"442","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"}],"department":[{"_id":"64"}],"user_id":"25078","ddc":["000"],"file_date_updated":"2018-03-16T11:28:34Z","has_accepted_license":"1","year":"2014","citation":{"apa":"Blömer, J., &#38; Liske, G. (2014). Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. Universität Paderborn.","bibtex":"@article{Blömer_Liske_2014, title={Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions}, publisher={Universität Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2014} }","mla":"Blömer, Johannes, and Gennadij Liske. <i>Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions</i>. Universität Paderborn, 2014.","short":"J. Blömer, G. Liske, (2014).","chicago":"Blömer, Johannes, and Gennadij Liske. “Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.” Universität Paderborn, 2014.","ieee":"J. Blömer and G. Liske, “Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions.” Universität Paderborn, 2014.","ama":"Blömer J, Liske G. Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. 2014."},"date_updated":"2022-01-06T07:01:03Z","publisher":"Universität Paderborn","oa":"1","date_created":"2017-10-17T12:42:18Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"first_name":"Gennadij","last_name":"Liske","full_name":"Liske, Gennadij"}],"title":"Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/511.pdf"}]}]