@misc{18027, author = {{Banh, Ngoc Chi}}, publisher = {{Universität Paderborn}}, title = {{{An Asynchronous Adaption of a Churn-resistant Overlay Network}}}, year = {{2017}}, } @misc{60, author = {{Niehus, David}}, publisher = {{Universität Paderborn}}, title = {{{Semantically Secure Attribute-based Searchable Encryption}}}, year = {{2017}}, } @misc{62, author = {{Weis, Eduard}}, publisher = {{Universität Paderborn}}, title = {{{Searchable Encryption}}}, year = {{2017}}, } @misc{698, author = {{Banh, Ngoc Chi}}, publisher = {{Universität Paderborn}}, title = {{{As Asynchronous Adaption of a Churn-resistant Overlay Network}}}, year = {{2017}}, } @misc{88, author = {{Ganesh Athreya, Advait}}, publisher = {{Universität Paderborn}}, title = {{{Instantiating a Predicate Encryption Scheme via Pair Encodings}}}, year = {{2017}}, } @misc{67, author = {{Jürgens, Mirko}}, publisher = {{Universität Paderborn}}, title = {{{Provably Secure Key-Derivation-Functions for Certain Types of Applications}}}, year = {{2017}}, } @misc{104, author = {{Diemert, Denis}}, publisher = {{Universität Paderborn}}, title = {{{EAX - An Authenticated Encryption Mode for Block Ciphers}}}, year = {{2017}}, } @misc{1049, author = {{Beckendorfer, Björn}}, publisher = {{Universität Paderborn}}, title = {{{Visualisierung zu Algorithmen verteilter Netzwerksysteme}}}, year = {{2017}}, } @misc{117, author = {{Bemmann, Pascal}}, publisher = {{Universität Paderborn}}, title = {{{Attribute-based Signatures using Structure Preserving Signatures}}}, year = {{2017}}, } @misc{118, author = {{Chi Banh, Ngoc}}, publisher = {{Universität Paderborn}}, title = {{{An Asynchronous Adaptation of a Churn-resistant Overlay Network}}}, year = {{2017}}, } @misc{213, author = {{Porzenheim, Laurens}}, publisher = {{Universität Paderborn}}, title = {{{Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes}}}, year = {{2016}}, } @misc{214, author = {{Bemmann, Kai Sören}}, publisher = {{Universität Paderborn}}, title = {{{Commitment Schemes - Definitions, Variants, and Security}}}, year = {{2016}}, } @inproceedings{215, abstract = {{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.}}, author = {{Drees, Maximilian and Gmyr, Robert and Scheideler, Christian}}, booktitle = {{Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{417----427}}, title = {{{Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration}}}, doi = {{10.1145/2935764.2935783}}, year = {{2016}}, } @inproceedings{208, abstract = {{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.}}, author = {{Blömer, Johannes and Liske, Gennadij}}, booktitle = {{Proceedings of the CT-RSA 2016}}, pages = {{431--447}}, title = {{{Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes}}}, doi = {{10.1007/978-3-319-29485-8_25}}, year = {{2016}}, } @misc{223, abstract = {{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.}}, author = {{Hinnenthal, Kristian}}, publisher = {{Universität Paderborn}}, title = {{{Aggregation in Overlay Networks}}}, year = {{2016}}, } @phdthesis{167, author = {{Günther, Peter}}, publisher = {{Universität Paderborn}}, title = {{{Physical attacks on pairing-based cryptography}}}, year = {{2016}}, } @inproceedings{155, abstract = {{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.}}, author = {{Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian}}, booktitle = {{Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, pages = {{248----262}}, title = {{{Self-stabilizing Metric Graphs}}}, doi = {{10.1007/978-3-319-49259-9_20}}, year = {{2016}}, } @misc{146, author = {{Hamm, Julian}}, publisher = {{Universität Paderborn}}, title = {{{Symmetric Anonymous Credentials with Protocols for Relations on Attributes}}}, year = {{2016}}, } @misc{152, author = {{Dallmeier, Fynn}}, publisher = {{Universität Paderborn}}, title = {{{Short Randomizable Aggregatable Signatures: Constructions and Security Analysis}}}, year = {{2016}}, } @phdthesis{10136, author = {{Eikel, Martina}}, publisher = {{Universität Paderborn}}, title = {{{Insider-resistent Distributed Storage Systems}}}, year = {{2016}}, }