@phdthesis{586, abstract = {{FPGAs, systems on chip and embedded systems are nowadays irreplaceable. They combine the computational power of application specific hardware with software-like flexibility. At runtime, they can adjust their functionality by downloading new hardware modules and integrating their functionality. Due to their growing capabilities, the demands made to reconfigurable hardware grow. Their deployment in increasingly security critical scenarios requires new ways of enforcing security since a failure in security has severe consequences. Aside from financial losses, a loss of human life and risks to national security are possible. With this work I present the novel and groundbreaking concept of proof-carrying hardware. It is a method for the verification of properties of hardware modules to guarantee security for a target platform at runtime. The producer of a hardware module delivers based on the consumer's safety policy a safety proof in combination with the reconfiguration bitstream. The extensive computation of a proof is a contrast to the comparatively undemanding checking of the proof. I present a prototype based on open-source tools and an abstract FPGA architecture and bitstream format. The proof of the usability of proof-carrying hardware provides the evaluation of the prototype with the exemplary application of securing combinational and bounded sequential equivalence of reference monitor modules for memory safety.}}, author = {{Drzevitzky, Stephanie}}, pages = {{114}}, publisher = {{Universität Paderborn}}, title = {{{Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security}}}, year = {{2012}}, } @misc{587, author = {{Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus and Lübbers, Enno}}, publisher = {{Awareness Magazine}}, title = {{{Programming models for reconfigurable heterogeneous multi-cores}}}, year = {{2012}}, } @inproceedings{588, abstract = {{We come up with a digital rights management (DRM) concept for cloud computing and show how license management for software within the cloud can be achieved in a privacy-friendly manner. In our scenario, users who buy software from software providers stay anonymous. At the same time, our approach guarantees that software licenses are bound to users and their validity is checked before execution. We employ a software re-encryption scheme so that computing centers which execute users’ software are not able to build user profiles—not even under pseudonym—of their users. We combine secret sharing and homomorphic encryption. We make sure that malicious users are unable to relay software to others. DRM constitutes an incentive for software providers to take part in a future cloud computing scenario.We make this scenario more attractive for users by preserving their privacy.}}, author = {{Petrlic, Ronald and Sorge, Christoph}}, booktitle = {{Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)}}, pages = {{1286--1291}}, title = {{{Privacy-Preserving DRM for Cloud Computing}}}, doi = {{10.1109/WAINA.2012.92}}, year = {{2012}}, } @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}}, } @inproceedings{590, abstract = {{Predicate abstraction is an established technique for reducing the size of the state space during verification. In this paper, we extend predication abstraction with block-abstraction memoization (BAM), which exploits the fact that blocks are often executed several times in a program. The verification can thus benefit from caching the values of previous block analyses and reusing them upon next entry into a block. In addition to function bodies, BAM also performs well for nested loops. To further increase effectiveness, block memoization has been integrated with lazy abstraction adopting a lazy strategy for cache refinement. Together, this achieves significant performance increases: our tool (an implementation within the configurable program analysis framework CPAchecker) has won the Competition on Software Verification 2012 in the category “Overall”.}}, author = {{Wonisch, Daniel and Wehrheim, Heike}}, booktitle = {{Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}}, pages = {{332--347}}, title = {{{Predicate Analysis with Block-Abstraction Memoization}}}, doi = {{10.1007/978-3-642-34281-3_24}}, year = {{2012}}, } @misc{592, author = {{Celik, Aydin}}, publisher = {{Universität Paderborn}}, title = {{{Penny Auctions: Design und Strategisches Verhalten}}}, year = {{2012}}, } @misc{593, author = {{Rojahn, Tobias}}, publisher = {{Universität Paderborn}}, title = {{{Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten}}}, year = {{2012}}, } @misc{594, author = {{Klerx, Timo}}, publisher = {{Universität Paderborn}}, title = {{{Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen}}}, year = {{2012}}, } @misc{595, author = {{Mallmann Trenn, Frederik}}, publisher = {{Universität Paderborn}}, title = {{{On scheduling with multi-core and multi-speed processors using power down}}}, year = {{2012}}, } @inproceedings{596, abstract = {{To meet quality-of-service requirements in changing environments, modern software systems adapt themselves. The structure, and correspondingly the behavior, of these systems undergoes continuous change. Model-driven performance engineering, however, assumes static system structures, behavior, and deployment. Hence, self-adaptive systems pose new challenges to model-driven performance engineering. There are a few surveys on self-adaptive systems, performance engineering, and the combination of both in the literature. In contrast to existing work, here we focus on model-driven performance analysis approaches. Based on a systematic literature review, we present a classication, identify open issues, and outline further research.}}, author = {{Becker, Matthias and Luckey, Markus and Becker, Steffen}}, booktitle = {{Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA'12)}}, pages = {{117--122}}, title = {{{Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey}}}, doi = {{10.1145/2304696.2304716}}, year = {{2012}}, }