@inproceedings{589,
  abstract     = {{We present a privacy-preserving DRM scheme for a (future) cloud computing software market. In such a market, applications are packed into virtual machines (VMs) by software providers and the VMs can be executed at any computing center within the cloud. We propose the introduction of a software TPM as a container for VM-specific keys within the VM that moves around with the VM within the cloud. The software TPM is coupled to a virtual TPM at a computing center to constitute the root of trust for a local DRM enforcement system within the VM that checks the license before each application execution. This allows flexible price models, e.g. execute at most n timeslike models. Users have proof that their personally identifiable information, stored and processed within the VM at a computing center, cannot be obtained by the computing center. A feature of our solution is that neither software provider nor computing center are able to build usage profiles of the software executions.}},
  author       = {{Petrlic, Ronald}},
  booktitle    = {{Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)}},
  pages        = {{958--963}},
  title        = {{{Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment}}},
  doi          = {{10.1109/TrustCom.2012.225}},
  year         = {{2012}},
}

@misc{606,
  author       = {{Löken, Nils}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas}}},
  year         = {{2012}},
}

@misc{607,
  author       = {{Haarhoff, Thomas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}}},
  year         = {{2012}},
}

@misc{620,
  author       = {{Mittendorf, Robert}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Datenschutzgerechtes DRM im Cloud Computing}}},
  year         = {{2012}},
}

@misc{621,
  author       = {{Sekula, Stephan}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing}}},
  year         = {{2012}},
}

@inproceedings{623,
  abstract     = {{This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.}},
  author       = {{Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }},
  booktitle    = {{Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}},
  pages        = {{291--300}},
  title        = {{{Competitive and fair throughput for co-existing networks under adversarial interference}}},
  doi          = {{10.1145/2332432.2332488}},
  year         = {{2012}},
}

@misc{629,
  author       = {{Schleiter, Patrick}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Attribute-basierte Verschlüsselung}}},
  year         = {{2012}},
}

@inproceedings{645,
  abstract     = {{In the standard consensus problem there are n processes with possibly di®erent input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the stabilizing consensus problem [2]. In this problem, we do not require that each process commits to a ¯nal value at some point, but that eventually they arrive at a common, stable value without necessarily being aware of that. This should work irrespective of the states in which the processes are starting. Our main result is a simple randomized algorithm called median rule that, with high probability, just needs O(logmlog log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most p n processes at any time. Without adversarial involvement, just O(log n) time and work is needed for a stable consensus, with high probability. As a by-product, we obtain a simple distributed algorithm for approximating the median of n numbers in time O(logmlog log n + log n) under adversarial presence.}},
  author       = {{Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}},
  pages        = {{149--158}},
  title        = {{{Stabilizing consensus with the power of two choices}}},
  doi          = {{10.1145/1989493.1989516}},
  year         = {{2011}},
}

@inproceedings{646,
  abstract     = {{This paper presents a dynamic overlay network based on the De Bruijn graph which we call Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a guaranteed constant node degree and that the routing between any two nodes takes at most O(log n) hops with high probability. Also, we show that there is a simple local-control algorithm that can recover the LDB network from any network topology that is weakly connected.}},
  author       = {{Richa, Andrea W. and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
  pages        = {{416--430}},
  title        = {{{Self-Stabilizing DeBruijn Networks}}},
  doi          = {{10.1007/978-3-642-24550-3_31}},
  year         = {{2011}},
}

@misc{659,
  author       = {{Liske, Gennadij}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Fault attacks in pairing-based cryptography}}},
  year         = {{2011}},
}