[{"type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"18027","language":[{"iso":"eng"}],"citation":{"apa":"Banh, N. C. (2017). <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn.","short":"N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network, Universität Paderborn, 2017.","mla":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","bibtex":"@book{Banh_2017, title={An Asynchronous Adaption of a Churn-resistant Overlay Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017} }","ama":"Banh NC. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn; 2017.","chicago":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","ieee":"N. C. Banh, <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn, 2017."},"year":"2017","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"author":[{"first_name":"Ngoc Chi","full_name":"Banh, Ngoc Chi","last_name":"Banh"}],"date_created":"2020-08-18T08:40:19Z","date_updated":"2022-01-06T06:53:25Z","publisher":"Universität Paderborn","title":"An Asynchronous Adaption of a Churn-resistant Overlay Network"},{"_id":"60","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","type":"mastersthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:49Z","author":[{"first_name":"David","full_name":"Niehus, David","last_name":"Niehus"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"date_created":"2017-10-17T12:41:03Z","title":"Semantically Secure Attribute-based Searchable Encryption","year":"2017","citation":{"bibtex":"@book{Niehus_2017, title={Semantically Secure Attribute-based Searchable Encryption}, publisher={Universität Paderborn}, author={Niehus, David}, year={2017} }","short":"D. Niehus, Semantically Secure Attribute-Based Searchable Encryption, Universität Paderborn, 2017.","mla":"Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>. Universität Paderborn, 2017.","apa":"Niehus, D. (2017). <i>Semantically Secure Attribute-based Searchable Encryption</i>. Universität Paderborn.","ieee":"D. Niehus, <i>Semantically Secure Attribute-based Searchable Encryption</i>. Universität Paderborn, 2017.","chicago":"Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>. Universität Paderborn, 2017.","ama":"Niehus D. <i>Semantically Secure Attribute-Based Searchable Encryption</i>. Universität Paderborn; 2017."}},{"citation":{"chicago":"Weis, Eduard. <i>Searchable Encryption</i>. Universität Paderborn, 2017.","ieee":"E. Weis, <i>Searchable Encryption</i>. Universität Paderborn, 2017.","ama":"Weis E. <i>Searchable Encryption</i>. Universität Paderborn; 2017.","bibtex":"@book{Weis_2017, title={Searchable Encryption}, publisher={Universität Paderborn}, author={Weis, Eduard}, year={2017} }","mla":"Weis, Eduard. <i>Searchable Encryption</i>. Universität Paderborn, 2017.","short":"E. Weis, Searchable Encryption, Universität Paderborn, 2017.","apa":"Weis, E. (2017). <i>Searchable Encryption</i>. Universität Paderborn."},"year":"2017","date_created":"2017-10-17T12:41:03Z","author":[{"full_name":"Weis, Eduard","last_name":"Weis","first_name":"Eduard"}],"date_updated":"2022-01-06T07:02:56Z","publisher":"Universität Paderborn","title":"Searchable Encryption","type":"mastersthesis","status":"public","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":"62"},{"status":"public","type":"bachelorsthesis","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"698","user_id":"15504","year":"2017","citation":{"bibtex":"@book{Banh_2017, title={As Asynchronous Adaption of a Churn-resistant Overlay Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017} }","mla":"Banh, Ngoc Chi. <i>As Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","short":"N.C. Banh, As Asynchronous Adaption of a Churn-Resistant Overlay Network, Universität Paderborn, 2017.","apa":"Banh, N. C. (2017). <i>As Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn.","ieee":"N. C. Banh, <i>As Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn, 2017.","chicago":"Banh, Ngoc Chi. <i>As Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","ama":"Banh NC. <i>As Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn; 2017."},"title":"As Asynchronous Adaption of a Churn-resistant Overlay Network","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:25Z","date_created":"2017-11-14T08:02:46Z","author":[{"last_name":"Banh","full_name":"Banh, Ngoc Chi","first_name":"Ngoc Chi"}]},{"type":"bachelorsthesis","status":"public","_id":"88","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"477","year":"2017","citation":{"ieee":"A. Ganesh Athreya, <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn, 2017.","chicago":"Ganesh Athreya, Advait. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn, 2017.","ama":"Ganesh Athreya A. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn; 2017.","apa":"Ganesh Athreya, A. (2017). <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn.","mla":"Ganesh Athreya, Advait. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn, 2017.","bibtex":"@book{Ganesh Athreya_2017, title={Instantiating a Predicate Encryption Scheme via Pair Encodings}, publisher={Universität Paderborn}, author={Ganesh Athreya, Advait}, year={2017} }","short":"A. Ganesh Athreya, Instantiating a Predicate Encryption Scheme via Pair Encodings, Universität Paderborn, 2017."},"date_updated":"2022-01-06T07:04:02Z","publisher":"Universität Paderborn","author":[{"first_name":"Advait","last_name":"Ganesh Athreya","full_name":"Ganesh Athreya, Advait"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"date_created":"2017-10-17T12:41:08Z","title":"Instantiating a Predicate Encryption Scheme via Pair Encodings"},{"_id":"67","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"user_id":"477","type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:15Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"author":[{"first_name":"Mirko","full_name":"Jürgens, Mirko","last_name":"Jürgens"}],"date_created":"2017-10-17T12:41:04Z","title":"Provably Secure Key-Derivation-Functions for Certain Types of Applications","year":"2017","citation":{"ama":"Jürgens M. <i>Provably Secure Key-Derivation-Functions for Certain Types of Applications</i>. Universität Paderborn; 2017.","ieee":"M. Jürgens, <i>Provably Secure Key-Derivation-Functions for Certain Types of Applications</i>. Universität Paderborn, 2017.","chicago":"Jürgens, Mirko. <i>Provably Secure Key-Derivation-Functions for Certain Types of Applications</i>. Universität Paderborn, 2017.","apa":"Jürgens, M. (2017). <i>Provably Secure Key-Derivation-Functions for Certain Types of Applications</i>. Universität Paderborn.","bibtex":"@book{Jürgens_2017, title={Provably Secure Key-Derivation-Functions for Certain Types of Applications}, publisher={Universität Paderborn}, author={Jürgens, Mirko}, year={2017} }","mla":"Jürgens, Mirko. <i>Provably Secure Key-Derivation-Functions for Certain Types of Applications</i>. Universität Paderborn, 2017.","short":"M. Jürgens, Provably Secure Key-Derivation-Functions for Certain Types of Applications, Universität Paderborn, 2017."}},{"user_id":"477","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"104","type":"bachelorsthesis","status":"public","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:11Z","author":[{"last_name":"Diemert","full_name":"Diemert, Denis","first_name":"Denis"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:38Z","title":"EAX - An Authenticated Encryption Mode for Block Ciphers","citation":{"bibtex":"@book{Diemert_2017, title={EAX - An Authenticated Encryption Mode for Block Ciphers}, publisher={Universität Paderborn}, author={Diemert, Denis}, year={2017} }","short":"D. Diemert, EAX - An Authenticated Encryption Mode for Block Ciphers, Universität Paderborn, 2017.","mla":"Diemert, Denis. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>. Universität Paderborn, 2017.","apa":"Diemert, D. (2017). <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>. Universität Paderborn.","ama":"Diemert D. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>. Universität Paderborn; 2017.","ieee":"D. Diemert, <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>. Universität Paderborn, 2017.","chicago":"Diemert, Denis. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>. Universität Paderborn, 2017."},"year":"2017"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"_id":"1049","user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public","date_updated":"2022-01-06T06:50:42Z","publisher":"Universität Paderborn","author":[{"last_name":"Beckendorfer","full_name":"Beckendorfer, Björn","first_name":"Björn"}],"date_created":"2017-12-13T10:17:43Z","title":"Visualisierung zu Algorithmen verteilter Netzwerksysteme","year":"2017","citation":{"ama":"Beckendorfer B. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn; 2017.","chicago":"Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","ieee":"B. Beckendorfer, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","apa":"Beckendorfer, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn.","short":"B. Beckendorfer, Visualisierung zu Algorithmen verteilter Netzwerksysteme, Universität Paderborn, 2017.","bibtex":"@book{Beckendorfer_2017, title={Visualisierung zu Algorithmen verteilter Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorfer, Björn}, year={2017} }","mla":"Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017."}},{"citation":{"chicago":"Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>. Universität Paderborn, 2017.","ieee":"P. Bemmann, <i>Attribute-based Signatures using Structure Preserving Signatures</i>. Universität Paderborn, 2017.","ama":"Bemmann P. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>. Universität Paderborn; 2017.","short":"P. Bemmann, Attribute-Based Signatures Using Structure Preserving Signatures, Universität Paderborn, 2017.","bibtex":"@book{Bemmann_2017, title={Attribute-based Signatures using Structure Preserving Signatures}, publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2017} }","mla":"Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>. Universität Paderborn, 2017.","apa":"Bemmann, P. (2017). <i>Attribute-based Signatures using Structure Preserving Signatures</i>. Universität Paderborn."},"year":"2017","author":[{"last_name":"Bemmann","id":"32571","full_name":"Bemmann, Pascal","first_name":"Pascal"}],"supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:14Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:06Z","title":"Attribute-based Signatures using Structure Preserving Signatures","type":"mastersthesis","status":"public","department":[{"_id":"64"}],"user_id":"25078","_id":"117","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"user_id":"477","_id":"118","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"type":"bachelorsthesis","status":"public","author":[{"first_name":"Ngoc","full_name":"Chi Banh, Ngoc","last_name":"Chi Banh"}],"date_created":"2017-10-17T12:41:14Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:08Z","title":"An Asynchronous Adaptation of a Churn-resistant Overlay Network","citation":{"ama":"Chi Banh N. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay Network</i>. Universität Paderborn; 2017.","chicago":"Chi Banh, Ngoc. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","ieee":"N. Chi Banh, <i>An Asynchronous Adaptation of a Churn-resistant Overlay Network</i>. Universität Paderborn, 2017.","bibtex":"@book{Chi Banh_2017, title={An Asynchronous Adaptation of a Churn-resistant Overlay Network}, publisher={Universität Paderborn}, author={Chi Banh, Ngoc}, year={2017} }","short":"N. Chi Banh, An Asynchronous Adaptation of a Churn-Resistant Overlay Network, Universität Paderborn, 2017.","mla":"Chi Banh, Ngoc. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","apa":"Chi Banh, N. (2017). <i>An Asynchronous Adaptation of a Churn-resistant Overlay Network</i>. Universität Paderborn."},"year":"2017"},{"user_id":"477","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"213","type":"bachelorsthesis","status":"public","author":[{"first_name":"Laurens","full_name":"Porzenheim, Laurens","last_name":"Porzenheim"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"date_created":"2017-10-17T12:41:33Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:53Z","title":"Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes","citation":{"apa":"Porzenheim, L. (2016). <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn.","short":"L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes, Universität Paderborn, 2016.","bibtex":"@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim, Laurens}, year={2016} }","mla":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016.","ama":"Porzenheim L. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn; 2016.","ieee":"L. Porzenheim, <i>Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes</i>. Universität Paderborn, 2016.","chicago":"Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes</i>. Universität Paderborn, 2016."},"year":"2016"},{"user_id":"477","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"214","status":"public","type":"bachelorsthesis","title":"Commitment Schemes - Definitions, Variants, and Security","author":[{"last_name":"Bemmann","full_name":"Bemmann, Kai Sören","first_name":"Kai Sören"}],"date_created":"2017-10-17T12:41:33Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:58Z","citation":{"ama":"Bemmann KS. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn; 2016.","chicago":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","ieee":"K. S. Bemmann, <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","mla":"Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn, 2016.","bibtex":"@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants, and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören}, year={2016} }","short":"K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität Paderborn, 2016.","apa":"Bemmann, K. S. (2016). <i>Commitment Schemes - Definitions, Variants, and Security</i>. Universität Paderborn."},"year":"2016"},{"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"215-SPAA16-Drees_Gmyr_Scheideler.pdf","access_level":"closed","file_id":"1518","file_size":352996,"creator":"florida","date_created":"2018-03-21T10:41:40Z","date_updated":"2018-03-21T10:41:40Z"}],"status":"public","abstract":[{"lang":"eng","text":"We present three robust overlay networks: First, we present a network that organizes the nodes into an expander and is resistant to even massive adversarial churn. Second, we develop a network based on the hypercube that maintains connectivity under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log log n)-late adversary which only has access to topological information that is at least Omega(log log n) rounds old. Finally, we develop a network that combines both churn- and DoS-resistance. The networks gain their robustness through constant network reconfiguration, i.e., the topology of the networks changes constantly. Our reconguration algorithms are based on node sampling primitives for expanders and hypercubes that allow each node to sample a logarithmic number of nodes uniformly at random in O(log log n) communication rounds. These primitives are specific to overlay networks and their optimal runtime represents an exponential improvement over known techniques. Our results have a wide range of applications, for example in the area of scalable and robust peer-to-peer systems."}],"type":"conference","publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T10:41:40Z","ddc":["040"],"user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"215","citation":{"bibtex":"@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}, year={2016}, pages={417--427} }","mla":"Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427, doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>.","short":"M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.","apa":"Drees, M., Gmyr, R., &#38; Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 417--427). <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>","ama":"Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2016:417--427. doi:<a href=\"https://doi.org/10.1145/2935764.2935783\">10.1145/2935764.2935783</a>","chicago":"Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 417--427, 2016. <a href=\"https://doi.org/10.1145/2935764.2935783\">https://doi.org/10.1145/2935764.2935783</a>.","ieee":"M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427."},"page":"417--427","year":"2016","has_accepted_license":"1","doi":"10.1145/2935764.2935783","title":"Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration","date_created":"2017-10-17T12:41:33Z","author":[{"last_name":"Drees","full_name":"Drees, Maximilian","first_name":"Maximilian"},{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T06:55:02Z"},{"year":"2016","page":"431-447","citation":{"chicago":"Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” In <i>Proceedings of the CT-RSA 2016</i>, 431–47. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">https://doi.org/10.1007/978-3-319-29485-8_25</a>.","ieee":"J. Blömer and G. Liske, “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes,” in <i>Proceedings of the CT-RSA 2016</i>, 2016, pp. 431–447.","ama":"Blömer J, Liske G. Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In: <i>Proceedings of the CT-RSA 2016</i>. LNCS. ; 2016:431-447. doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>","apa":"Blömer, J., &#38; Liske, G. (2016). Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In <i>Proceedings of the CT-RSA 2016</i> (pp. 431–447). <a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">https://doi.org/10.1007/978-3-319-29485-8_25</a>","short":"J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.","mla":"Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” <i>Proceedings of the CT-RSA 2016</i>, 2016, pp. 431–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>.","bibtex":"@inproceedings{Blömer_Liske_2016, series={LNCS}, title={Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>}, booktitle={Proceedings of the CT-RSA 2016}, author={Blömer, Johannes and Liske, Gennadij}, year={2016}, pages={431–447}, collection={LNCS} }"},"has_accepted_license":"1","title":"Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes","doi":"10.1007/978-3-319-29485-8_25","date_updated":"2022-01-06T06:54:39Z","author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"},{"full_name":"Liske, Gennadij","last_name":"Liske","first_name":"Gennadij"}],"date_created":"2017-10-17T12:41:32Z","abstract":[{"text":"This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption which uses the technique of well-formedness proofs known from public key encryption. The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic transformations from CPA-secure to CCA-secure schemes. The reduction costs of our framework are comparable to the reduction costs of the underlying CPA-secure framework. We achieve this last result by applying the dual system encryption methodology in a novel way.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T10:43:36Z","date_created":"2018-03-21T10:43:36Z","creator":"florida","file_size":462666,"file_name":"208-aCCA_P-KEM_final.pdf","access_level":"closed","file_id":"1521"}],"publication":"Proceedings of the CT-RSA 2016","type":"conference","ddc":["040"],"file_date_updated":"2018-03-21T10:43:36Z","_id":"208","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"series_title":"LNCS","user_id":"477"},{"file_date_updated":"2018-03-21T10:35:39Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"223","file":[{"file_name":"223-MasterarbeitHinnenthal.pdf","access_level":"closed","file_id":"1510","file_size":1127144,"creator":"florida","date_created":"2018-03-21T10:35:39Z","date_updated":"2018-03-21T10:35:39Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"text":"We consider the problem of aggregation in overlay networks. We use a synchronous time model in which each node has polylogarithmic memory and can send at most a polylogarithmic number of messages per round. We investigate how to quickly compute the result of an aggregate functionf over elements that are distributed among the nodes of the network such that the result is eventually known by a selected root node. We show how to compute distributive aggregate functions such as SUM, MAX, and OR in time $O(\\log n / \\log\\log n)$ using a tree that is created in a pre-processing phase. If only a polylogarithmic number of data items need to be aggregated, we show how to compute the result in time $O(\\sqrt{\\log n / \\log\\log n})$. Furthermore, we show how to compute holistic aggregate functions such as DISTINCT, SMALLEST(k) and MODE(k) in time $O(\\log n / \\log\\log n)$. Finally, we show a lower bound of $\\Omega(\\sqrt{\\log n / \\log\\log n})$ for deterministic algorithms that compute any of the aggregate functions in the scope of the thesis.","lang":"eng"}],"type":"mastersthesis","title":"Aggregation in Overlay Networks","author":[{"last_name":"Hinnenthal","id":"32229","full_name":"Hinnenthal, Kristian","first_name":"Kristian"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2017-10-17T12:41:35Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:55:30Z","citation":{"chicago":"Hinnenthal, Kristian. <i>Aggregation in Overlay Networks</i>. Universität Paderborn, 2016.","ieee":"K. Hinnenthal, <i>Aggregation in Overlay Networks</i>. Universität Paderborn, 2016.","ama":"Hinnenthal K. <i>Aggregation in Overlay Networks</i>. Universität Paderborn; 2016.","short":"K. Hinnenthal, Aggregation in Overlay Networks, Universität Paderborn, 2016.","bibtex":"@book{Hinnenthal_2016, title={Aggregation in Overlay Networks}, publisher={Universität Paderborn}, author={Hinnenthal, Kristian}, year={2016} }","mla":"Hinnenthal, Kristian. <i>Aggregation in Overlay Networks</i>. Universität Paderborn, 2016.","apa":"Hinnenthal, K. (2016). <i>Aggregation in Overlay Networks</i>. Universität Paderborn."},"year":"2016","has_accepted_license":"1"},{"main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853"}],"title":"Physical attacks on pairing-based cryptography","date_created":"2017-10-17T12:41:24Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"author":[{"first_name":"Peter","full_name":"Günther, Peter","last_name":"Günther"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:54Z","citation":{"apa":"Günther, P. (2016). <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn.","short":"P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016.","bibtex":"@book{Günther_2016, title={Physical attacks on pairing-based cryptography}, publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }","mla":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","ieee":"P. Günther, <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn, 2016.","chicago":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","ama":"Günther P. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn; 2016."},"year":"2016","has_accepted_license":"1","file_date_updated":"2018-03-21T12:43:21Z","ddc":["040"],"department":[{"_id":"64"}],"user_id":"25078","_id":"167","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":9456552,"access_level":"closed","file_name":"167-thesis_peter_guenther.pdf","file_id":"1542","date_updated":"2018-03-21T12:43:21Z","date_created":"2018-03-21T12:43:21Z","creator":"florida"}],"type":"dissertation"},{"file_date_updated":"2018-03-21T12:51:24Z","ddc":["040"],"user_id":"15504","series_title":"LNCS","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"155","file":[{"creator":"florida","date_created":"2018-03-21T12:51:24Z","date_updated":"2018-03-21T12:51:24Z","file_name":"155-SSS16-GLS.pdf","access_level":"closed","file_id":"1550","file_size":389136,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"text":"We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","doi":"10.1007/978-3-319-49259-9_20","title":"Self-stabilizing Metric Graphs","date_created":"2017-10-17T12:41:22Z","author":[{"full_name":"Gmyr, Robert","last_name":"Gmyr","first_name":"Robert"},{"first_name":"Jonas","last_name":"Lefèvre","full_name":"Lefèvre, Jonas"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_updated":"2022-01-06T06:52:28Z","citation":{"apa":"Gmyr, R., Lefèvre, J., &#38; Scheideler, C. (2016). Self-stabilizing Metric Graphs. In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 248--262). <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>","short":"R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262.","mla":"Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262, doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>.","bibtex":"@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing Metric Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>}, booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS} }","ama":"Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2016:248--262. doi:<a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">10.1007/978-3-319-49259-9_20</a>","ieee":"R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,” in <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262.","chicago":"Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.” In <i>Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 248--262. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49259-9_20\">https://doi.org/10.1007/978-3-319-49259-9_20</a>."},"page":"248--262","year":"2016","has_accepted_license":"1"},{"type":"mastersthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"146","user_id":"477","department":[{"_id":"64"}],"year":"2016","citation":{"bibtex":"@book{Hamm_2016, title={Symmetric Anonymous Credentials with Protocols for Relations on Attributes}, publisher={Universität Paderborn}, author={Hamm, Julian}, year={2016} }","short":"J. Hamm, Symmetric Anonymous Credentials with Protocols for Relations on Attributes, Universität Paderborn, 2016.","mla":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","apa":"Hamm, J. (2016). <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn.","chicago":"Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","ieee":"J. Hamm, <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn, 2016.","ama":"Hamm J. <i>Symmetric Anonymous Credentials with Protocols for Relations on Attributes</i>. Universität Paderborn; 2016."},"date_updated":"2022-01-06T06:52:03Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:20Z","author":[{"first_name":"Julian","full_name":"Hamm, Julian","last_name":"Hamm"}],"supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"title":"Symmetric Anonymous Credentials with Protocols for Relations on Attributes"},{"title":"Short Randomizable Aggregatable Signatures: Constructions and Security Analysis","date_updated":"2022-01-06T06:52:16Z","publisher":"Universität Paderborn","author":[{"first_name":"Fynn","full_name":"Dallmeier, Fynn","last_name":"Dallmeier"}],"supervisor":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:21Z","year":"2016","citation":{"ama":"Dallmeier F. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn; 2016.","ieee":"F. Dallmeier, <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","chicago":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","short":"F. Dallmeier, Short Randomizable Aggregatable Signatures: Constructions and Security Analysis, Universität Paderborn, 2016.","mla":"Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn, 2016.","bibtex":"@book{Dallmeier_2016, title={Short Randomizable Aggregatable Signatures: Constructions and Security Analysis}, publisher={Universität Paderborn}, author={Dallmeier, Fynn}, year={2016} }","apa":"Dallmeier, F. (2016). <i>Short Randomizable Aggregatable Signatures: Constructions and Security Analysis</i>. Universität Paderborn."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"152","user_id":"477","department":[{"_id":"64"}],"status":"public","type":"bachelorsthesis"},{"year":"2016","citation":{"apa":"Eikel, M. (2016). <i>Insider-resistent Distributed Storage Systems</i>. Universität Paderborn.","mla":"Eikel, Martina. <i>Insider-Resistent Distributed Storage Systems</i>. Universität Paderborn, 2016.","bibtex":"@book{Eikel_2016, title={Insider-resistent Distributed Storage Systems}, publisher={Universität Paderborn}, author={Eikel, Martina}, year={2016} }","short":"M. Eikel, Insider-Resistent Distributed Storage Systems, Universität Paderborn, 2016.","ieee":"M. Eikel, <i>Insider-resistent Distributed Storage Systems</i>. Universität Paderborn, 2016.","chicago":"Eikel, Martina. <i>Insider-Resistent Distributed Storage Systems</i>. Universität Paderborn, 2016.","ama":"Eikel M. <i>Insider-Resistent Distributed Storage Systems</i>. Universität Paderborn; 2016."},"has_accepted_license":"1","title":"Insider-resistent Distributed Storage Systems","date_updated":"2022-01-06T06:50:30Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2019-06-07T06:37:37Z","author":[{"first_name":"Martina","last_name":"Eikel","full_name":"Eikel, Martina"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"DissertationEikel.pdf","file_id":"10137","file_size":1605187,"creator":"florida","date_created":"2019-06-07T06:39:13Z","date_updated":"2019-06-07T06:39:13Z"}],"type":"dissertation","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2019-06-07T06:39:13Z","_id":"10136","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"79"}],"user_id":"477"}]