[{"status":"public","type":"conference","file_date_updated":"2018-03-21T12:41:55Z","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"project":[{"_id":"1","name":"SFB 901","grant_number":"160364472"},{"name":"SFB 901 - Subprojekt C2","_id":"14","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Enabling Heterogeneous Hardware Acceleration using Novel Programming and Scheduling Models","_id":"30","grant_number":"01|H11004A"}],"_id":"168","citation":{"ama":"Lösch A, Beisel T, Kenter T, Plessl C, Platzner M. Performance-centric scheduling with task migration for a heterogeneous compute node in the data center. In: <i>Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>. EDA Consortium / IEEE; 2016:912-917.","chicago":"Lösch, Achim, Tobias Beisel, Tobias Kenter, Christian Plessl, and Marco Platzner. “Performance-Centric Scheduling with Task Migration for a Heterogeneous Compute Node in the Data Center.” In <i>Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>, 912–17. EDA Consortium / IEEE, 2016.","ieee":"A. Lösch, T. Beisel, T. Kenter, C. Plessl, and M. Platzner, “Performance-centric scheduling with task migration for a heterogeneous compute node in the data center,” in <i>Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>, 2016, pp. 912–917.","apa":"Lösch, A., Beisel, T., Kenter, T., Plessl, C., &#38; Platzner, M. (2016). Performance-centric scheduling with task migration for a heterogeneous compute node in the data center. <i>Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>, 912–917.","mla":"Lösch, Achim, et al. “Performance-Centric Scheduling with Task Migration for a Heterogeneous Compute Node in the Data Center.” <i>Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)</i>, EDA Consortium / IEEE, 2016, pp. 912–17.","bibtex":"@inproceedings{Lösch_Beisel_Kenter_Plessl_Platzner_2016, title={Performance-centric scheduling with task migration for a heterogeneous compute node in the data center}, booktitle={Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE)}, publisher={EDA Consortium / IEEE}, author={Lösch, Achim and Beisel, Tobias and Kenter, Tobias and Plessl, Christian and Platzner, Marco}, year={2016}, pages={912–917} }","short":"A. Lösch, T. Beisel, T. Kenter, C. Plessl, M. Platzner, in: Proceedings of the 2016 Design, Automation &#38; Test in Europe Conference &#38; Exhibition (DATE), EDA Consortium / IEEE, 2016, pp. 912–917."},"page":"912-917","has_accepted_license":"1","author":[{"first_name":"Achim","id":"43646","full_name":"Lösch, Achim","last_name":"Lösch"},{"last_name":"Beisel","full_name":"Beisel, Tobias","first_name":"Tobias"},{"first_name":"Tobias","last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias"},{"id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"date_updated":"2023-09-26T13:27:00Z","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":261356,"access_level":"closed","file_name":"168-07459438.pdf","file_id":"1541","date_updated":"2018-03-21T12:41:55Z","date_created":"2018-03-21T12:41:55Z","creator":"florida"}],"abstract":[{"lang":"eng","text":"The use of heterogeneous computing resources, such as Graphic Processing Units or other specialized coprocessors, has become widespread in recent years because of their per- formance and energy efficiency advantages. Approaches for managing and scheduling tasks to heterogeneous resources are still subject to research. Although queuing systems have recently been extended to support accelerator resources, a general solution that manages heterogeneous resources at the operating system- level to exploit a global view of the system state is still missing.In this paper we present a user space scheduler that enables task scheduling and migration on heterogeneous processing resources in Linux. Using run queues for available resources we perform scheduling decisions based on the system state and on task characterization from earlier measurements. With a pro- gramming pattern that supports the integration of checkpoints into applications, we preempt tasks and migrate them between three very different compute resources. Considering static and dynamic workload scenarios, we show that this approach can gain up to 17% performance, on average 7%, by effectively avoiding idle resources. We demonstrate that a work-conserving strategy without migration is no suitable alternative."}],"publication":"Proceedings of the 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE)","language":[{"iso":"eng"}],"ddc":["040"],"year":"2016","quality_controlled":"1","title":"Performance-centric scheduling with task migration for a heterogeneous compute node in the data center","date_created":"2017-10-17T12:41:24Z","publisher":"EDA Consortium / IEEE"},{"year":"2016","citation":{"bibtex":"@inproceedings{Kenter_Vaz_Riebler_Plessl_2016, title={Opportunities for deferring application partitioning and accelerator synthesis to runtime (extended abstract)}, booktitle={Workshop on Reconfigurable Computing (WRC)}, author={Kenter, Tobias and Vaz, Gavin Francis and Riebler, Heinrich and Plessl, Christian}, year={2016} }","short":"T. Kenter, G.F. Vaz, H. Riebler, C. Plessl, in: Workshop on Reconfigurable Computing (WRC), 2016.","mla":"Kenter, Tobias, et al. “Opportunities for Deferring Application Partitioning and Accelerator Synthesis to Runtime (Extended Abstract).” <i>Workshop on Reconfigurable Computing (WRC)</i>, 2016.","apa":"Kenter, T., Vaz, G. F., Riebler, H., &#38; Plessl, C. (2016). Opportunities for deferring application partitioning and accelerator synthesis to runtime (extended abstract). <i>Workshop on Reconfigurable Computing (WRC)</i>.","ieee":"T. Kenter, G. F. Vaz, H. Riebler, and C. Plessl, “Opportunities for deferring application partitioning and accelerator synthesis to runtime (extended abstract),” 2016.","chicago":"Kenter, Tobias, Gavin Francis Vaz, Heinrich Riebler, and Christian Plessl. “Opportunities for Deferring Application Partitioning and Accelerator Synthesis to Runtime (Extended Abstract).” In <i>Workshop on Reconfigurable Computing (WRC)</i>, 2016.","ama":"Kenter T, Vaz GF, Riebler H, Plessl C. Opportunities for deferring application partitioning and accelerator synthesis to runtime (extended abstract). In: <i>Workshop on Reconfigurable Computing (WRC)</i>. ; 2016."},"quality_controlled":"1","has_accepted_license":"1","title":"Opportunities for deferring application partitioning and accelerator synthesis to runtime (extended abstract)","date_updated":"2023-09-26T13:27:21Z","date_created":"2017-10-17T12:41:25Z","author":[{"last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias","first_name":"Tobias"},{"first_name":"Gavin Francis","last_name":"Vaz","id":"30332","full_name":"Vaz, Gavin Francis"},{"last_name":"Riebler","full_name":"Riebler, Heinrich","id":"8961","first_name":"Heinrich"},{"last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"}],"status":"public","file":[{"file_size":54421,"access_level":"closed","file_id":"1538","file_name":"171-plessl16_fpl_wrc.pdf","date_updated":"2018-03-21T12:39:46Z","date_created":"2018-03-21T12:39:46Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Workshop on Reconfigurable Computing (WRC)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-21T12:39:46Z","language":[{"iso":"eng"}],"_id":"171","project":[{"name":"SFB 901","_id":"1","grant_number":"160364472"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - Subprojekt C2"},{"_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"}],"user_id":"15278"},{"year":"2015","citation":{"ama":"John T. Supporting Business Model Idea Generation Through Machine-generated Ideas - Towards a Design Theory. In: <i>AIS SIGPRAG Pre-ICIS Workshop: Practice-Based Design and Innovation of Digital Artifacts</i>. ; 2015.","ieee":"T. John, “Supporting Business Model Idea Generation Through Machine-generated Ideas - Towards a Design Theory,” in <i>AIS SIGPRAG Pre-ICIS Workshop: Practice-based Design and Innovation of Digital Artifacts</i>, Fort Worth, USA, 2015.","chicago":"John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated Ideas - Towards a Design Theory.” In <i>AIS SIGPRAG Pre-ICIS Workshop: Practice-Based Design and Innovation of Digital Artifacts</i>, 2015.","mla":"John, Thomas. “Supporting Business Model Idea Generation Through Machine-Generated Ideas - Towards a Design Theory.” <i>AIS SIGPRAG Pre-ICIS Workshop: Practice-Based Design and Innovation of Digital Artifacts</i>, 2015.","bibtex":"@inproceedings{John_2015, title={Supporting Business Model Idea Generation Through Machine-generated Ideas - Towards a Design Theory}, booktitle={AIS SIGPRAG Pre-ICIS Workshop: Practice-based Design and Innovation of Digital Artifacts}, author={John, Thomas}, year={2015} }","short":"T. John, in: AIS SIGPRAG Pre-ICIS Workshop: Practice-Based Design and Innovation of Digital Artifacts, 2015.","apa":"John, T. (2015). Supporting Business Model Idea Generation Through Machine-generated Ideas - Towards a Design Theory. In <i>AIS SIGPRAG Pre-ICIS Workshop: Practice-based Design and Innovation of Digital Artifacts</i>. Fort Worth, USA."},"has_accepted_license":"1","title":"Supporting Business Model Idea Generation Through Machine-generated Ideas - Towards a Design Theory","main_file_link":[{"url":"http://sigprag.net/workshop-programme/"}],"conference":{"location":"Fort Worth, USA","name":"AIS SIGPRAG Pre-ICIS Workshop: Practice-based Design and Innovation of Digital Artifacts"},"date_updated":"2022-01-06T06:56:36Z","date_created":"2017-10-17T12:41:40Z","author":[{"first_name":"Thomas","last_name":"John","full_name":"John, Thomas","id":"3952"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T15:13:37Z","creator":"ups","date_created":"2018-11-02T15:13:37Z","file_size":652902,"file_id":"5295","file_name":"John-Supporting-Business-Model-Idea-Generation.pdf","access_level":"closed"}],"status":"public","type":"conference_abstract","publication":"AIS SIGPRAG Pre-ICIS Workshop: Practice-based Design and Innovation of Digital Artifacts","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:13:37Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"17","name":"SFB 901 - Subprojekt C5"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"248","user_id":"477","department":[{"_id":"276"}]},{"file_date_updated":"2018-11-02T14:08:23Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"44","name":"KogniHome - die mitdenkende Wohnung"}],"_id":"253","user_id":"13703","series_title":"LNCS","department":[{"_id":"64"}],"status":"public","type":"conference","doi":"10.1007/978-3-319-32859-1_14","date_updated":"2022-01-06T06:59:07Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Jakob","last_name":"Juhnke","full_name":"Juhnke, Jakob","id":"48090"},{"last_name":"Löken","id":"13703","full_name":"Löken, Nils","first_name":"Nils"}],"citation":{"mla":"Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.” <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2015, pp. 166–80, doi:<a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">10.1007/978-3-319-32859-1_14</a>.","bibtex":"@inproceedings{Blömer_Juhnke_Löken_2015, series={LNCS}, title={Short Group Signatures with Distributed Traceability}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">10.1007/978-3-319-32859-1_14</a>}, booktitle={Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Juhnke, Jakob and Löken, Nils}, year={2015}, pages={166–180}, collection={LNCS} }","short":"J. Blömer, J. Juhnke, N. Löken, in: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.","apa":"Blömer, J., Juhnke, J., &#38; Löken, N. (2015). Short Group Signatures with Distributed Traceability. In <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i> (pp. 166–180). <a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">https://doi.org/10.1007/978-3-319-32859-1_14</a>","chicago":"Blömer, Johannes, Jakob Juhnke, and Nils Löken. “Short Group Signatures with Distributed Traceability.” In <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 166–80. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">https://doi.org/10.1007/978-3-319-32859-1_14</a>.","ieee":"J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed Traceability,” in <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2015, pp. 166–180.","ama":"Blömer J, Juhnke J, Löken N. Short Group Signatures with Distributed Traceability. In: <i>Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>. LNCS. ; 2015:166-180. doi:<a href=\"https://doi.org/10.1007/978-3-319-32859-1_14\">10.1007/978-3-319-32859-1_14</a>"},"page":"166-180","has_accepted_license":"1","related_material":{"record":[{"status":"public","id":"325","relation":"other"}]},"ddc":["000"],"language":[{"iso":"eng"}],"abstract":[{"text":"Group signatures, introduced by Chaum and van Heyst [15], are an important primitive in cryptography. In group signature schemes every group member can anonymously sign messages on behalf of the group. In case of disputes a dedicated opening manager is able to trace signatures - he can extract the identity of the producer of a given signature. A formal model for static group signatures schemes and their security is defined by Bellare, Micciancio, and Warinschi [4], the case of dynamic groups is considered by Bellare, Shi, and Zhang [5]. Both models define group signature schemes with a single opening manager. The main difference between these models is that the number of group members in static schemes is fixed, while in dynamic schemes group members can join the group over time.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"ShortGroupSignaturesWithDistri.pdf","file_id":"5262","file_size":262436,"creator":"ups","date_created":"2018-11-02T14:08:23Z","date_updated":"2018-11-02T14:08:23Z"}],"publication":"Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)","title":"Short Group Signatures with Distributed Traceability","date_created":"2017-10-17T12:41:41Z","year":"2015"},{"type":"journal_article","publication":"Transactions on Parallel Computing","abstract":[{"lang":"eng","text":"In this work, we present the first scalable distributed information system, that is, a system with low storage overhead, that is provably robust against denial-of-service (DoS) attacks by a current insider. We allow a current insider to have complete knowledge about the information system and to have the power to block any ϵ-fraction of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task of the system is to serve any collection of lookup requests with at most one per nonblocked server in an efficient way despite this attack. Previously, scalable solutions were only known for DoS attacks of past insiders, where a past insider only has complete knowledge about some past time point t0 of the information system. Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed that in this case, it is possible to design an information system so that any information that was inserted or last updated after t0 is safe against a DoS attack. But their constructions would not work at all for a current insider. The key idea behind our IRIS system is to make extensive use of coding. More precisely, we present two alternative distributed coding strategies with an at most logarithmic storage overhead that can handle up to a constant fraction of blocked servers."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":651726,"access_level":"closed","file_name":"284-Eikel-Scheideler-ACM2015.pdf","file_id":"1468","date_updated":"2018-03-21T09:25:04Z","creator":"florida","date_created":"2018-03-21T09:25:04Z"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"284","user_id":"477","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-21T09:25:04Z","has_accepted_license":"1","issue":"3","year":"2015","citation":{"ieee":"M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS Attacks,” <i>Transactions on Parallel Computing</i>, no. 3, pp. 18:1--18:33, 2015.","chicago":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” <i>Transactions on Parallel Computing</i>, no. 3 (2015): 18:1--18:33. <a href=\"https://doi.org/10.1145/2809806\">https://doi.org/10.1145/2809806</a>.","ama":"Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS Attacks. <i>Transactions on Parallel Computing</i>. 2015;(3):18:1--18:33. doi:<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>","apa":"Eikel, M., &#38; Scheideler, C. (2015). IRIS: A Robust Information System Against Insider DoS Attacks. <i>Transactions on Parallel Computing</i>, (3), 18:1--18:33. <a href=\"https://doi.org/10.1145/2809806\">https://doi.org/10.1145/2809806</a>","mla":"Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.” <i>Transactions on Parallel Computing</i>, no. 3, ACM, 2015, pp. 18:1--18:33, doi:<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>.","bibtex":"@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System Against Insider DoS Attacks}, DOI={<a href=\"https://doi.org/10.1145/2809806\">10.1145/2809806</a>}, number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel, Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }","short":"M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33."},"page":"18:1--18:33","date_updated":"2022-01-06T06:58:03Z","publisher":"ACM","author":[{"full_name":"Eikel, Martina","last_name":"Eikel","first_name":"Martina"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2017-10-17T12:41:47Z","title":"IRIS: A Robust Information System Against Insider DoS Attacks","doi":"10.1145/2809806"},{"title":"Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup","date_created":"2017-10-17T12:41:47Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"full_name":"Kalde, Benedikt","last_name":"Kalde","first_name":"Benedikt"}],"date_updated":"2022-01-06T06:58:10Z","publisher":"Universität Paderborn","citation":{"short":"B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup, Universität Paderborn, 2015.","mla":"Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","bibtex":"@book{Kalde_2015, title={Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup}, publisher={Universität Paderborn}, author={Kalde, Benedikt}, year={2015} }","apa":"Kalde, B. (2015). <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn.","ieee":"B. Kalde, <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","chicago":"Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn, 2015.","ama":"Kalde B. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup</i>. Universität Paderborn; 2015."},"year":"2015","language":[{"iso":"ger"}],"department":[{"_id":"64"}],"user_id":"477","_id":"286","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","type":"bachelorsthesis"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"261","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"477","year":"2015","citation":{"ama":"Eisenhofer T. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn; 2015.","chicago":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","ieee":"T. Eisenhofer, <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","short":"T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität Paderborn, 2015.","bibtex":"@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung}, publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015} }","mla":"Eisenhofer, Thorsten. <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn, 2015.","apa":"Eisenhofer, T. (2015). <i>Protokolle zur authentifizierten Schüsselvereinbarung</i>. Universität Paderborn."},"title":"Protokolle zur authentifizierten Schüsselvereinbarung","date_updated":"2022-01-06T06:57:16Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"author":[{"first_name":"Thorsten","full_name":"Eisenhofer, Thorsten","last_name":"Eisenhofer"}],"date_created":"2017-10-17T12:41:43Z"},{"doi":"10.1007/s00291-015-0403-1","title":"Optimizing Water Tanks in Water Distribution Systems by combining Network Reduction, Mathematical Optimization and Hydraulic Simulation","date_created":"2017-10-17T12:41:43Z","author":[{"first_name":"Corinna","last_name":"Hallmann","full_name":"Hallmann, Corinna"},{"first_name":"Leena","full_name":"Suhl, Leena","last_name":"Suhl"}],"publisher":"Springer","date_updated":"2022-01-06T06:57:19Z","citation":{"mla":"Hallmann, Corinna, and Leena Suhl. “Optimizing Water Tanks in Water Distribution Systems by Combining Network Reduction, Mathematical Optimization and Hydraulic Simulation.” <i>OR Spectrum</i>, Springer, 2015, pp. 1–19, doi:<a href=\"https://doi.org/10.1007/s00291-015-0403-1\">10.1007/s00291-015-0403-1</a>.","short":"C. Hallmann, L. Suhl, OR Spectrum (2015) 1–19.","bibtex":"@article{Hallmann_Suhl_2015, title={Optimizing Water Tanks in Water Distribution Systems by combining Network Reduction, Mathematical Optimization and Hydraulic Simulation}, DOI={<a href=\"https://doi.org/10.1007/s00291-015-0403-1\">10.1007/s00291-015-0403-1</a>}, journal={OR Spectrum}, publisher={Springer}, author={Hallmann, Corinna and Suhl, Leena}, year={2015}, pages={1–19} }","apa":"Hallmann, C., &#38; Suhl, L. (2015). Optimizing Water Tanks in Water Distribution Systems by combining Network Reduction, Mathematical Optimization and Hydraulic Simulation. <i>OR Spectrum</i>, 1–19. <a href=\"https://doi.org/10.1007/s00291-015-0403-1\">https://doi.org/10.1007/s00291-015-0403-1</a>","ama":"Hallmann C, Suhl L. Optimizing Water Tanks in Water Distribution Systems by combining Network Reduction, Mathematical Optimization and Hydraulic Simulation. <i>OR Spectrum</i>. 2015:1-19. doi:<a href=\"https://doi.org/10.1007/s00291-015-0403-1\">10.1007/s00291-015-0403-1</a>","ieee":"C. Hallmann and L. Suhl, “Optimizing Water Tanks in Water Distribution Systems by combining Network Reduction, Mathematical Optimization and Hydraulic Simulation,” <i>OR Spectrum</i>, pp. 1–19, 2015.","chicago":"Hallmann, Corinna, and Leena Suhl. “Optimizing Water Tanks in Water Distribution Systems by Combining Network Reduction, Mathematical Optimization and Hydraulic Simulation.” <i>OR Spectrum</i>, 2015, 1–19. <a href=\"https://doi.org/10.1007/s00291-015-0403-1\">https://doi.org/10.1007/s00291-015-0403-1</a>."},"page":"1-19","year":"2015","has_accepted_license":"1","file_date_updated":"2018-03-21T09:35:03Z","ddc":["040"],"user_id":"477","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C3","_id":"15"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"263","file":[{"file_size":430920,"access_level":"closed","file_name":"263-Hallmann_-_Optimizing_water_tanks_in_water_distribution_systems.pdf","file_id":"1482","date_updated":"2018-03-21T09:35:03Z","creator":"florida","date_created":"2018-03-21T09:35:03Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"text":"In the last two decades, water consumption in Germany has been decreasing, which causes the water tanks and pipes in water distribution systems to work inefficiently. This paper proposes a method that supports the planning process for tanks in water distribution systems. The method uses a combination of network reduction, mathematical optimization and hydraulic simulation. The mathematical optimization model is a non-convex Mixed Integer Quadratically Constrained Program (MIQCP) that is solved by a piecewise linearization. As this may lead to many binary variables and therefore high computing times, the size of the water distribution system model is reduced before building the optimization model. After applying several network reduction techniques and using a piecewise approximation of the original model, there may be some hydraulic differences between the original network model and the reduced network model. To make sure that the solution obtained in the optimization process is feasible in the original water distribution system model, the solution is verified by a hydraulic simulation. If the solution is not feasible, the reduced model has to be modified and solved again until the hydraulic simulation verifies a solution as feasible. In this paper, each of these processes is described and the results indicate the usefulness of each of them.","lang":"eng"}],"type":"journal_article","publication":"OR Spectrum"},{"has_accepted_license":"1","year":"2015","citation":{"apa":"Wette, P. (2015). <i>Optimizing Software-Defined Networks using Application-Layer Knowledge</i>. Universität Paderborn.","mla":"Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","bibtex":"@book{Wette_2015, title={Optimizing Software-Defined Networks using Application-Layer Knowledge}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2015} }","short":"P. Wette, Optimizing Software-Defined Networks Using Application-Layer Knowledge, Universität Paderborn, 2015.","chicago":"Wette, Philip. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","ieee":"P. Wette, <i>Optimizing Software-Defined Networks using Application-Layer Knowledge</i>. Universität Paderborn, 2015.","ama":"Wette P. <i>Optimizing Software-Defined Networks Using Application-Layer Knowledge</i>. Universität Paderborn; 2015."},"date_updated":"2022-01-06T06:57:20Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:43Z","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"}],"supervisor":[{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"title":"Optimizing Software-Defined Networks using Application-Layer Knowledge","type":"dissertation","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"264-Dissertation_-_Wette.pdf","access_level":"closed","file_id":"1481","file_size":8031107,"date_created":"2018-03-21T09:34:36Z","creator":"florida","date_updated":"2018-03-21T09:34:36Z"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"264","user_id":"477","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-03-21T09:34:36Z"},{"title":"Optimierung von Wasserbehältern in einem Wasserversorgungssystem mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer Simulation","supervisor":[{"first_name":"Lena","full_name":"Suhl, Lena","last_name":"Suhl"}],"author":[{"full_name":"Hallmann, Corinna","last_name":"Hallmann","first_name":"Corinna"}],"date_created":"2017-10-17T12:41:43Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:21Z","citation":{"bibtex":"@book{Hallmann_2015, title={Optimierung von Wasserbehältern in einem Wasserversorgungssystem mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer Simulation}, publisher={Universität Paderborn}, author={Hallmann, Corinna}, year={2015} }","short":"C. Hallmann, Optimierung von Wasserbehältern in einem Wasserversorgungssystem mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer Simulation, Universität Paderborn, 2015.","mla":"Hallmann, Corinna. <i>Optimierung von Wasserbehältern in einem Wasserversorgungssystem mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer Simulation</i>. Universität Paderborn, 2015.","apa":"Hallmann, C. (2015). <i>Optimierung von Wasserbehältern in einem Wasserversorgungssystem mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer Simulation</i>. Universität Paderborn.","chicago":"Hallmann, Corinna. <i>Optimierung von Wasserbehältern in einem Wasserversorgungssystem mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer Simulation</i>. Universität Paderborn, 2015.","ieee":"C. Hallmann, <i>Optimierung von Wasserbehältern in einem Wasserversorgungssystem mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer Simulation</i>. Universität Paderborn, 2015.","ama":"Hallmann C. <i>Optimierung von Wasserbehältern in einem Wasserversorgungssystem mittels einer Kombination aus Netzreduktion, mathematischer Optimierung und hydraulischer Simulation</i>. Universität Paderborn; 2015."},"year":"2015","has_accepted_license":"1","file_date_updated":"2018-03-21T09:34:10Z","language":[{"iso":"ger"}],"ddc":["040"],"user_id":"477","department":[{"_id":"19"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"265","file":[{"file_size":2745774,"file_id":"1480","access_level":"closed","file_name":"265-Dissertation_-_Corinna_Hallmann.pdf","date_updated":"2018-03-21T09:34:10Z","creator":"florida","date_created":"2018-03-21T09:34:10Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"dissertation"},{"year":"2015","citation":{"mla":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–44, doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>.","short":"C. Markarian, F. Meyer auf der Heide, in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC), 2015, pp. 343–344.","bibtex":"@inproceedings{Markarian_Meyer auf der Heide_2015, title={Online Resource Leasing}, DOI={<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>}, booktitle={Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm}, year={2015}, pages={343–344} }","apa":"Markarian, C., &#38; Meyer auf der Heide, F. (2015). Online Resource Leasing. In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i> (pp. 343–344). <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>","chicago":"Markarian, Christine, and Friedhelm Meyer auf der Heide. “Online Resource Leasing.” In <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 343–44, 2015. <a href=\"https://doi.org/10.1145/2767386.2767454\">https://doi.org/10.1145/2767386.2767454</a>.","ieee":"C. Markarian and F. Meyer auf der Heide, “Online Resource Leasing,” in <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>, 2015, pp. 343–344.","ama":"Markarian C, Meyer auf der Heide F. Online Resource Leasing. In: <i>Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)</i>. ; 2015:343-344. doi:<a href=\"https://doi.org/10.1145/2767386.2767454\">10.1145/2767386.2767454</a>"},"page":"343-344","has_accepted_license":"1","title":"Online Resource Leasing","doi":"10.1145/2767386.2767454","date_updated":"2022-01-06T06:57:22Z","date_created":"2017-10-17T12:41:44Z","author":[{"first_name":"Christine","last_name":"Markarian","id":"37612","full_name":"Markarian, Christine"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"abstract":[{"lang":"eng","text":"Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of \"online leasing problems\" by introducing leasing to online optimization problems. Resources required to provide a service in an \"online leasing problem\" are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of \"online resource leasing problems\". "}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-21T09:33:11Z","date_updated":"2018-03-21T09:33:11Z","access_level":"closed","file_id":"1478","file_name":"266-p343-markarian.pdf","file_size":679580}],"status":"public","type":"conference","publication":"Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)","ddc":["040"],"file_date_updated":"2018-03-21T09:33:11Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"266","user_id":"15504","department":[{"_id":"63"}]},{"related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-16656"}]},"has_accepted_license":"1","citation":{"bibtex":"@book{Markarian_2015, title={Online Resource Leasing}, publisher={Universität Paderborn}, author={Markarian, Christine}, year={2015} }","short":"C. Markarian, Online Resource Leasing, Universität Paderborn, 2015.","mla":"Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","apa":"Markarian, C. (2015). <i>Online Resource Leasing</i>. Universität Paderborn.","ama":"Markarian C. <i>Online Resource Leasing</i>. Universität Paderborn; 2015.","chicago":"Markarian, Christine. <i>Online Resource Leasing</i>. Universität Paderborn, 2015.","ieee":"C. Markarian, <i>Online Resource Leasing</i>. Universität Paderborn, 2015."},"year":"2015","author":[{"last_name":"Markarian","id":"37612","full_name":"Markarian, Christine","first_name":"Christine"}],"date_created":"2017-10-17T12:41:44Z","supervisor":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:26Z","title":"Online Resource Leasing","type":"dissertation","status":"public","file":[{"date_updated":"2018-03-21T09:33:41Z","creator":"florida","date_created":"2018-03-21T09:33:41Z","file_size":1328685,"file_id":"1479","file_name":"267-Dissertation_-_Markarian.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"267","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:33:41Z","ddc":["040"]},{"year":"2015","citation":{"short":"F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption, Universität Paderborn, 2015.","mla":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","bibtex":"@book{Eidens_2015, title={Anonymous credential system based on q-Strong Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2015} }","apa":"Eidens, F. (2015). <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn.","ama":"Eidens F. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn; 2015.","chicago":"Eidens, Fabian. <i>Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015.","ieee":"F. Eidens, <i>Anonymous credential system based on q-Strong Diffie-Hellman Assumption</i>. Universität Paderborn, 2015."},"has_accepted_license":"1","title":"Anonymous credential system based on q-Strong Diffie-Hellman Assumption","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:05Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"author":[{"last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian","first_name":"Fabian"}],"date_created":"2017-10-17T12:41:54Z","status":"public","file":[{"date_updated":"2018-03-20T07:40:22Z","creator":"florida","date_created":"2018-03-20T07:40:22Z","file_size":879285,"access_level":"closed","file_id":"1432","file_name":"321-eidens_masterthesis_01.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"type":"mastersthesis","ddc":["040"],"file_date_updated":"2018-03-20T07:40:22Z","_id":"321","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"user_id":"477"},{"file_date_updated":"2018-03-20T07:39:54Z","series_title":"LNCS","user_id":"48090","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"322","status":"public","type":"conference","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/546"}],"doi":"10.1007/978-3-662-47854-7_29","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"Juhnke","full_name":"Juhnke, Jakob","id":"48090","first_name":"Jakob"},{"last_name":"Kolb","id":"43647","full_name":"Kolb, Christina","first_name":"Christina"}],"oa":"1","date_updated":"2022-01-06T06:59:05Z","citation":{"ieee":"J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 2015, pp. 478--488.","chicago":"Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.” In <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 478--488. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">https://doi.org/10.1007/978-3-662-47854-7_29</a>.","ama":"Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems. In: <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>. LNCS. ; 2015:478--488. doi:<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>","apa":"Blömer, J., Juhnke, J., &#38; Kolb, C. (2015). Anonymous and Publicly Linkable Reputation Systems. In <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i> (pp. 478--488). <a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">https://doi.org/10.1007/978-3-662-47854-7_29</a>","short":"J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.","bibtex":"@inproceedings{Blömer_Juhnke_Kolb_2015, series={LNCS}, title={Anonymous and Publicly Linkable Reputation Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>}, booktitle={Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)}, author={Blömer, Johannes and Juhnke, Jakob and Kolb, Christina}, year={2015}, pages={478--488}, collection={LNCS} }","mla":"Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.” <i>Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)</i>, 2015, pp. 478--488, doi:<a href=\"https://doi.org/10.1007/978-3-662-47854-7_29\">10.1007/978-3-662-47854-7_29</a>."},"page":"478--488","has_accepted_license":"1","ddc":["040"],"file":[{"creator":"florida","date_created":"2018-03-20T07:39:54Z","date_updated":"2018-03-20T07:39:54Z","access_level":"closed","file_id":"1431","file_name":"322-546_01.pdf","file_size":499568,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"Reputation systems are used to compute and publish reputation scores for services or products. We consider reputation systems where users are allowed to rate products that they purchased previously. To obtain trustworthy reputations, they are allowed to rate these products only once. As long as users rate products once, they stay anonymous. Everybody is able to detect users deviating from the rate-products-only-once policy and the anonymity of such dishonest users can be revoked by a system manager. In this paper we present formal models for such reputation systems and their security. Based on group signatures presented by Boneh, Boyen, and Shacham we design an efficient reputation system that meets all our requirements."}],"publication":"Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC)","title":"Anonymous and Publicly Linkable Reputation Systems","date_created":"2017-10-17T12:41:54Z","year":"2015"},{"type":"mastersthesis","status":"public","department":[{"_id":"64"}],"user_id":"477","_id":"325","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"related_material":{"record":[{"relation":"other","id":"253","status":"public"}]},"citation":{"apa":"Löken, N. (2015). <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn.","mla":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","short":"N. Löken, A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption, Universität Paderborn, 2015.","bibtex":"@book{Löken_2015, title={A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2015} }","chicago":"Löken, Nils. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","ieee":"N. Löken, <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn, 2015.","ama":"Löken N. <i>A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption</i>. Universität Paderborn; 2015."},"year":"2015","date_created":"2017-10-17T12:41:55Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"first_name":"Nils","id":"13703","full_name":"Löken, Nils","last_name":"Löken"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:07Z","title":"A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption"},{"citation":{"apa":"Heihoff, F. (2015). <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn.","short":"F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität Paderborn, 2015.","bibtex":"@book{Heihoff_2015, title={A group signature scheme based on the LSRW assumption}, publisher={Universität Paderborn}, author={Heihoff, Frederic}, year={2015} }","mla":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015.","ieee":"F. Heihoff, <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn, 2015.","chicago":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015.","ama":"Heihoff F. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn; 2015."},"year":"2015","title":"A group signature scheme based on the LSRW assumption","date_created":"2017-10-17T12:41:55Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"author":[{"last_name":"Heihoff","full_name":"Heihoff, Frederic","first_name":"Frederic"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:07Z","status":"public","type":"bachelorsthesis","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"326"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"3364","citation":{"mla":"Knorr, Christoph. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015.","short":"C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten, Universität Paderborn, 2015.","bibtex":"@book{Knorr_2015, title={Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph}, year={2015} }","apa":"Knorr, C. (2015). <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn.","ama":"Knorr C. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn; 2015.","ieee":"C. Knorr, <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015.","chicago":"Knorr, Christoph. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015."},"year":"2015","title":"Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten","date_created":"2018-06-26T14:06:07Z","supervisor":[{"first_name":"Achim","id":"43646","full_name":"Lösch, Achim","last_name":"Lösch"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"author":[{"last_name":"Knorr","full_name":"Knorr, Christoph","first_name":"Christoph"}],"date_updated":"2022-01-06T06:59:13Z","publisher":"Universität Paderborn"},{"type":"mastersthesis","status":"public","user_id":"25078","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"297","citation":{"chicago":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","ieee":"M. Sosniak, <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","ama":"Sosniak M. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn; 2015.","apa":"Sosniak, M. (2015). <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn.","bibtex":"@book{Sosniak_2015, title={Evaluation of Pairing Optimization for Embedded Platforms}, publisher={Universität Paderborn}, author={Sosniak, Martin}, year={2015} }","mla":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","short":"M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms, Universität Paderborn, 2015."},"year":"2015","supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_created":"2017-10-17T12:41:50Z","author":[{"full_name":"Sosniak, Martin","last_name":"Sosniak","first_name":"Martin"}],"date_updated":"2022-01-06T06:58:49Z","publisher":"Universität Paderborn","title":"Evaluation of Pairing Optimization for Embedded Platforms"},{"type":"mastersthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"_id":"299","user_id":"477","department":[{"_id":"64"}],"language":[{"iso":"ger"}],"year":"2015","citation":{"short":"B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie, Universität Paderborn, 2015.","bibtex":"@book{Gerken_2015, title={Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie}, publisher={Universität Paderborn}, author={Gerken, Britta}, year={2015} }","mla":"Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","apa":"Gerken, B. (2015). <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn.","ama":"Gerken B. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn; 2015.","chicago":"Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","ieee":"B. Gerken, <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015."},"date_updated":"2022-01-06T06:58:50Z","publisher":"Universität Paderborn","author":[{"first_name":"Britta","full_name":"Gerken, Britta","last_name":"Gerken"}],"date_created":"2017-10-17T12:41:50Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"title":"Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie"},{"publisher":"Universität Paderborn","oa":"1","date_updated":"2022-01-06T06:58:51Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan","first_name":"Jan"}],"date_created":"2017-10-17T12:41:50Z","title":"Efficient Verifier-Local Revocation for Anonymous Credentials","has_accepted_license":"1","year":"2015","citation":{"ieee":"J. Bobolz, <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 2015.","chicago":"Bobolz, Jan. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 2015.","ama":"Bobolz J. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn; 2015.","bibtex":"@book{Bobolz_2015, title={Efficient Verifier-Local Revocation for Anonymous Credentials}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2015} }","mla":"Bobolz, Jan. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 2015.","short":"J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials, Universität Paderborn, 2015.","apa":"Bobolz, J. (2015). <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"301","user_id":"27207","department":[{"_id":"64"}],"ddc":["040"],"file_date_updated":"2018-07-20T09:54:22Z","type":"mastersthesis","urn":"3016","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-07-20T09:54:22Z","creator":"florida","date_created":"2018-03-20T07:47:11Z","file_size":1214027,"access_level":"open_access","file_name":"301-thesis_jbobolz_final_02.pdf","file_id":"1443"}],"status":"public"}]