@article{3003, abstract = {{We give a brief introduction to probabilistic encryptions. This serves as an example how randomness plays a pivotal role in cryptographic systems that satisfy advanced security concepts.}}, author = {{Blömer, Johannes}}, journal = {{Journal of Universal Computer Science (J.UCS)}}, number = {{6}}, pages = {{654----671}}, title = {{{Randomness and Secrecy - A Brief Introduction}}}, doi = {{10.3217/jucs-012-06-0654}}, year = {{2006}}, } @inbook{3004, author = {{Blömer, Johannes and Krummel, Volker}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540462507}}, issn = {{0302-9743}}, pages = {{106--120}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Fault Based Collision Attacks on AES}}}, doi = {{10.1007/11889700_11}}, year = {{2006}}, } @inbook{3005, author = {{Blömer, Johannes and Otto, Martin}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540462507}}, issn = {{0302-9743}}, pages = {{13--23}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered}}}, doi = {{10.1007/11889700_2}}, year = {{2006}}, } @inbook{3007, author = {{Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540462507}}, issn = {{0302-9743}}, pages = {{36--52}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Sign Change Fault Attacks on Elliptic Curve Cryptosystems}}}, doi = {{10.1007/11889700_4}}, year = {{2006}}, } @inproceedings{26988, abstract = {{For most of today's IT environments, the tremendous need for storage capacity in combination with a required minimum I/O performance has become highly critical. In dynamically growing environments, a storage management solution's underlying data distribution scheme has great impact to the overall system I/O performance. The evaluation of a number of open system storage visualization solutions and volume managers has shown that all of them lack the ability to automatically adapt to changing access patterns and storage infrastructures; many of them require an error prone manual re-layout of the data blocks, or rely on a very time consuming re-striping of all available data. This paper evaluates the performance of conventional data distribution approaches compared to the adaptive virtualization solution V:DRIVE in dynamically changing storage environments. Changes of the storage infrastructure are normally not considered in benchmark results, but can have a significant impact on storage performance. Using synthetic benchmarks, V:DRIVE is compared in such changing environments with the non-adaptive Linux logical volume manager (LVM). The performance results of our tests clearly outline the necessity of adaptive data distribution schemes.}}, author = {{Brinkmann, Andre and Effert, Sascha and Heidebuer, Michael and Vodisek, Mario}}, booktitle = {{14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)}}, title = {{{Influence of adaptive data layouts on performance in dynamically changing storage environments}}}, doi = {{10.1109/pdp.2006.44}}, year = {{2006}}, } @inproceedings{20950, author = {{Meyer, Matthias}}, booktitle = {{Proceedings of the 13th Working Conference on Reverse Engineering (WCRE 2006), Benevento, Italy}}, pages = {{305--306}}, publisher = {{IEEE Computer Society}}, title = {{{Pattern-based Reengineering of Software Systems}}}, year = {{2006}}, } @inproceedings{20951, author = {{Giese, Holger and Meyer, Matthias and Wagner, Robert}}, booktitle = {{Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany}}, pages = {{56--60}}, publisher = {{University of Paderborn}}, title = {{{A Prototype for Guideline Checking and Model Transformation in Matlab/Simulink}}}, volume = {{tr-ri-06-275}}, year = {{2006}}, } @inproceedings{20952, author = {{Tichy, Matthias and Meyer, Matthias and Giese, Holger}}, booktitle = {{Proc. of the 4th International Fujaba Days 2006, Bayreuth, Germany}}, pages = {{10--14}}, publisher = {{University of Paderborn}}, title = {{{On Semantic Issues in Story Diagrams}}}, volume = {{tr-ri-06-275}}, year = {{2006}}, } @misc{20967, author = {{Holtmann, Jörg}}, publisher = {{University of Paderborn}}, title = {{{Entwicklung von Geschäftsprozessmustern zur Qualitätssicherung}}}, year = {{2006}}, } @article{2110, author = {{Ateniese, Giuseppe and Riley, Chris and Scheideler, Christian}}, journal = {{IEEE Trans. Mob. Comput.}}, number = {{9}}, pages = {{1242----1254}}, title = {{{Survivable Monitoring in Dynamic Networks}}}, doi = {{10.1109/TMC.2006.138}}, year = {{2006}}, } @inproceedings{2111, author = {{Kothapalli, Kishore and Scheideler, Christian and Onus, Melih and Schindelhauer, Christian}}, booktitle = {{IPDPS}}, title = {{{Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds}}}, year = {{2006}}, } @inproceedings{2112, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{OPODIS}}, pages = {{275----289}}, title = {{{Robust Random Number Generation for Peer-to-Peer Systems}}}, year = {{2006}}, } @inproceedings{2113, author = {{Awerbuch, Baruch and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{318----327}}, title = {{{Towards a scalable and robust DHT}}}, year = {{2006}}, } @proceedings{17417, abstract = {{We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.}}, editor = {{Rammig, Franz-Josef and Dangelmaier, Wilhelm and Karl, Holger and Mertsching, Bärbel and Meyer auf der Heide, Friedhelm and Trächtler, Ansgar}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Self-Coordinating Systems: The Next Challenge in Research on Distributed Systems}}}, year = {{2006}}, } @book{17475, author = {{Monien, Burkhard and Meyer auf der Heide, Friedhelm}}, isbn = {{978-3-939350-00-2}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{New trends in parallel and distributed computing}}}, volume = {{181}}, year = {{2006}}, } @inproceedings{17619, author = {{Grünewald, Matthias and Meyer auf der Heide, Friedhelm and Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}}, booktitle = {{New Trends in Parallel & Distributed Computing, 6th Int. Heinz Nixdorf Symposium}}, pages = {{225--234}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}}, title = {{{Directional Communication in Mobile Ad Hoc Networks}}}, year = {{2006}}, } @inproceedings{18676, abstract = {{We present random sampling algorithms that with probability at least 1 - δ compute a (1 ± ǫ)- approximation of the clustering coefficient, the transitiv ity coefficient, and of the number of bipartite cliques in a graph given as a stream of edges. Our methods can be extended to approximately count the number of occurences of fixed constant-size subgraphs. Our a lgorithms only require one pass over the input stream and their storage space depends only on structural parameters of the graphs, the approxi- mation guarantee, and the confidence probability. For examp le, the algorithms to compute the clustering and transitivity coefficient depend on that coefficient but n ot on the size of the graph. Since many large social networks have small clustering and transitivity coe fficient, our algorithms use space independent of the size of the input for these graphs. We implemented our algorithms and evaluated their performance on networks from different appli- cation domains. The sizes of the considered input graphs varied from about 8, 000 nodes and 40, 000 edges to about 135 million nodes and more than 1 billion edges. For both algorithms we run experiments with a sample set size varying from 100, 000 to 1, 000, 000 to evaluate running time and approximation guarantee. Our algorithms appear to be time efficient for the se sample sizes.}}, author = {{Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}}, booktitle = {{Proceedings of the European Conference on Complex Systems (ECCS'06)}}, title = {{{Computing Clustering Coefficients in Data Streams}}}, year = {{2006}}, } @inproceedings{18745, author = {{Sohler, Christian and Frahling, Gereon and Marchetti-Spaccamela, Alberto and Leonardi, Stefano and Buriol, Luciana}}, title = {{{Counting Triangles in Data Streams}}}, year = {{2006}}, } @inproceedings{18746, abstract = {{In this paper, we present a randomized constant factor approximation algorithm for the metric minimum facility location problem with uniform costs and demands in a distributed setting, in which every point can open a facility. In particular, our distributed algorithm uses three communication rounds with message sizes bounded to O(log n) bits where n is the number of points. We also extend our algorithm to constant powers of metric spaces, where we also obtain a randomized constant factor approximation algorithm.}}, author = {{Sohler, Christian and Gehweiler, Joachim and Lammersen, Christiane}}, booktitle = {{Proceeedings of 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, title = {{{A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem}}}, year = {{2006}}, } @inproceedings{18926, author = {{Dynia, Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}}, booktitle = {{Architecture of Computing Systems - ARCS}}, isbn = {{9783540327653}}, issn = {{0302-9743}}, number = {{3894}}, pages = {{341----351}}, title = {{{Power-Aware Collective Tree Exploration}}}, doi = {{10.1007/11682127_24}}, year = {{2006}}, }