@inproceedings{5764, author = {{Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian and Strothmann, Thim Frederik}}, booktitle = {{Proceedings of the 24th International Conference on DNA Computing and Molecular Programming}}, pages = {{122--138}}, publisher = {{Springer International Publishing}}, title = {{{Forming Tile Shapes with Simple Robots}}}, doi = {{10.1007/978-3-030-00030-1_8}}, year = {{2018}}, } @inproceedings{5774, abstract = {{Information flow analysis investigates the flow of data in applications, checking in particular for flows from private sources to public sinks. Flow- and path-sensitive analyses are, however, often too costly to be performed every time a security-critical application is run. In this paper, we propose a variant of proof carrying code for information flow security. To this end, we develop information flow (IF) certificates which get attached to programs as well as a method for IF certificate validation. We prove soundness of our technique, i.e., show it to be tamper-free. The technique is implemented within the program analysis tool CPAchecker. Our experiments confirm that the use of certificates pays off for costly analysis runs.}}, author = {{Töws, Manuel and Wehrheim, Heike}}, booktitle = {{Theoretical Aspects of Computing – ICTAC 2018}}, isbn = {{9783030025076}}, issn = {{0302-9743}}, pages = {{435--454}}, publisher = {{Springer International Publishing}}, title = {{{Information Flow Certificates}}}, doi = {{10.1007/978-3-030-02508-3_23}}, year = {{2018}}, } @inproceedings{5796, author = {{Engels, Gregor and Strothmann, Thim Frederik and Teetz, Alexander}}, booktitle = {{2018 IEEE 22nd International Enterprise Distributed Object Computing Workshop (EDOCW)}}, isbn = {{9781538641415}}, publisher = {{IEEE}}, title = {{{Adapt Cases 4 BPM - A Modeling Framework for Process Flexibility in IIoT}}}, doi = {{10.1109/edocw.2018.00020}}, year = {{2018}}, } @inproceedings{5816, author = {{Weidmann, Nils}}, booktitle = {{Proceedings of the 21st ACM/IEEE International Conference on Model Driven Engineering Languages and Systems Companion Proceedings - MODELS '18}}, editor = {{Babur, Önder and Strüber, Daniel and Abrahao, Silvia and Burgueno, Loli and Gogolla, Martin and Greenyer, Joel and Kokaly, Sahar and Kolovos, Dimitris and Mayerhofer, Tanja and Zahedi, Mansooreh}}, isbn = {{9781450359658}}, location = {{Copenhagen, Denmark}}, publisher = {{ACM Press}}, title = {{{Tolerant consistency management in model-driven engineering}}}, doi = {{10.1145/3270112.3275339}}, year = {{2018}}, } @techreport{5820, abstract = {{In this paper, we investigate the use of trusted execution environments (TEEs, such as Intel's SGX) for an anonymous communication infrastructure over untrusted networks. For this, we present the general idea of exploiting trusted execution environments for the purpose of anonymous communication, including a continuous-time security framework that models strong anonymity guarantees in the presence of an adversary that observes all network traffic and can adaptively corrupt a constant fraction of participating nodes. In our framework, a participating node can generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms, allowing both senders and receivers of messages to remain anonymous. We introduce a concrete construction, which shows viability of our TEE-based approach to anonymous communication. The construction draws from techniques from cryptography and overlay networks. Our techniques are very general and can be used as a basis for future constructions with similar goals.}}, author = {{Blömer, Johannes and Bobolz, Jan and Scheideler, Christian and Setzer, Alexander}}, title = {{{Provably Anonymous Communication Based on Trusted Execution Environments}}}, year = {{2018}}, } @inproceedings{5822, author = {{Gaspers, Daniel and Knorr, Christoph and Nickchen, Tobias and Nickchen, Daniel and Mertsching, Barbel and Mohamed, Mahmoud A.}}, booktitle = {{2018 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR)}}, isbn = {{9781538655726}}, publisher = {{IEEE}}, title = {{{Real-time Graph-Based 3D Reconstruction of Sparse Feature Environments for Mobile Robot Applications}}}, doi = {{10.1109/ssrr.2018.8468658}}, year = {{2018}}, } @inproceedings{5861, author = {{Jager, Tibor and Kurek, Rafael}}, booktitle = {{Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part II}}, pages = {{221--250}}, title = {{{Short Digital Signatures and ID-KEMs via Truncation Collision Resistance}}}, doi = {{10.1007/978-3-030-03329-3_8}}, year = {{2018}}, } @inproceedings{5862, author = {{Jager, Tibor and Kurek, Rafael and Pan, Jiaxin}}, booktitle = {{Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2-6, 2018, Proceedings, Part III}}, pages = {{490--518}}, title = {{{Simple and More Efficient PRFs with Tight Security from LWE and Matrix-DDH}}}, doi = {{10.1007/978-3-030-03332-3_18}}, year = {{2018}}, } @misc{5936, author = {{Scheibl, Manuel}}, publisher = {{Universität Paderborn}}, title = {{{Learning about learning curves from dataset properties}}}, year = {{2018}}, } @article{5984, author = {{Scheideler, Christian}}, journal = {{Theor. Comput. Sci.}}, pages = {{1}}, title = {{{Preface}}}, doi = {{10.1016/j.tcs.2018.11.004}}, volume = {{751}}, year = {{2018}}, } @inproceedings{5985, author = {{Scheideler, Christian}}, booktitle = {{Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018}}, pages = {{1--2}}, title = {{{Relays: Towards a Link Layer for Robust and Secure Fog Computing}}}, doi = {{10.1145/3229774.3229781}}, year = {{2018}}, } @inproceedings{5986, author = {{Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Kuhn, Fabian and Rudolph, Dorian and Scheideler, Christian}}, booktitle = {{43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK}}, pages = {{52:1--52:15}}, title = {{{Shape Recognition by a Finite Automaton Robot}}}, doi = {{10.4230/LIPIcs.MFCS.2018.52}}, year = {{2018}}, } @inproceedings{6016, author = {{Peuster, Manuel and Karl, Holger}}, booktitle = {{IEEE/IFIP 14th International Conference on Network and Service Management (CNSM)}}, location = {{Rome}}, publisher = {{IEEE/IFIP}}, title = {{{Understand your chains and keep your deadlines: Introducing time-constrained profiling for NFV}}}, year = {{2018}}, } @inproceedings{6236, author = {{Yigitbas, Enes and Anjorin, Anthony and Jovanovikj, Ivan and Kern, Thomas and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Proceedings of the 7th International Working Conference on Human-Centered Software Engineering (HCSE'18)}}, pages = {{231--247}}, publisher = {{Springer, LNCS }}, title = {{{Usability Evaluation of Model-Driven Cross-Device Web User Interfaces}}}, year = {{2018}}, } @inproceedings{6252, author = {{Senft, Björn and Oberthür, Simon and Fischer, Holger Gerhard}}, booktitle = {{Schriften zur allgemeinen Hochschuldidaktik - Band 3. Tagungsband Forschendes Lernen - The wider view}}, isbn = {{978 3-95987-088-7}}, title = {{{Forschendes Lernen in der Informatik - In praxisnaher Projektgruppe einen Softwareentwicklungsprozess erforschen}}}, year = {{2018}}, } @inbook{6253, author = {{Senft, Björn and Fischer, Holger Gerhard and Oberthür, Simon and Patkar, Nitish}}, booktitle = {{Design, User Experience, and Usability: Theory and Practice}}, isbn = {{9783319917962}}, issn = {{0302-9743}}, location = {{Las Vegas, USA}}, pages = {{758--770}}, publisher = {{Springer International Publishing}}, title = {{{Assist Users to Straightaway Suggest and Describe Experienced Problems}}}, doi = {{10.1007/978-3-319-91797-9_52}}, volume = {{10918}}, year = {{2018}}, } @inbook{6254, author = {{Fischer, Holger Gerhard and Senft, Björn and Rittmeier, Florian and Sauer, Stefan}}, booktitle = {{Design, User Experience, and Usability: Theory and Practice. Proceedings of the 20th International Conference on Human-Computer Interaktion (HCI International 2018)}}, editor = {{Marcus, Aaron and Wang, Wentao}}, isbn = {{9783319917962}}, issn = {{0302-9743}}, location = {{Las Vegas, USA}}, pages = {{711--724}}, publisher = {{Springer International Publishing}}, title = {{{A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance Systems}}}, doi = {{10.1007/978-3-319-91797-9_49}}, volume = {{10918}}, year = {{2018}}, } @article{63, author = {{Althaus, Ernst and Brinkmann, Andre and Kling, Peter and Meyer auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Sgall, Jiri and Suess, Tim}}, journal = {{Journal of Scheduling}}, number = {{1}}, pages = {{77--92}}, publisher = {{Springer}}, title = {{{Scheduling Shared Continuous Resources on Many-Cores}}}, doi = {{10.1007/s10951-017-0518-0}}, volume = {{21}}, year = {{2018}}, } @inbook{6423, author = {{Schäfer, Dirk and Hüllermeier, Eyke}}, booktitle = {{Discovery Science}}, isbn = {{9783030017705}}, issn = {{0302-9743}}, pages = {{161--175}}, publisher = {{Springer International Publishing}}, title = {{{Preference-Based Reinforcement Learning Using Dyad Ranking}}}, doi = {{10.1007/978-3-030-01771-2_11}}, year = {{2018}}, } @inproceedings{4411, abstract = {{While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. Considering crashing peers in peer-to-peer networks, it should not be taken for granted that a distributed data structure remains intact. In this work, we present a self-stabilizing protocol for a distributed data structure called the hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has a wide area of applications including string matching problems while offering low overhead and efficient operations when embedded on top of a distributed hash table. Especially, longest prefix matching for $x$ can be done in $\mathcal{O}(\log |x|)$ hash table read accesses. We show how to maintain the structure in a self-stabilizing way. Our protocol assures low overhead in a legal state and a total (asymptotically optimal) memory demand of $\Theta(d)$ bits, where $d$ is the number of bits needed for storing all keys.}}, author = {{Knollmann, Till and Scheideler, Christian}}, booktitle = {{Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}}, editor = {{Izumi, Taisuke and Kuznetsov, Petr}}, keywords = {{Self-Stabilizing, Prefix Search, Distributed Data Structure}}, location = {{Tokyo}}, publisher = {{Springer, Cham}}, title = {{{A Self-Stabilizing Hashed Patricia Trie}}}, doi = {{10.1007/978-3-030-03232-6_1}}, volume = {{11201}}, year = {{2018}}, }