TY - CONF AU - Weidmann, Nils AU - Anjorin, Anthony ED - Wehrheim, Heike ED - Cabot, Jordi ID - 17084 SN - 0302-9743 T2 - Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020 TI - Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming ER - TY - CONF AU - Schwichtenberg, Bahar AU - Schwichtenberg, Simon AU - Küster, Jochen AU - Zimmermann, Olaf AU - Engels, Gregor ID - 17085 SN - 0302-9743 T2 - Advanced Information Systems Engineering TI - Modeling and Analyzing Architectural Diversity of Open Platforms ER - TY - CONF AB - Modern cryptographic protocols, such as TLS 1.3 and QUIC, can send cryptographically protected data in “zero round-trip times (0-RTT)”, that is, without the need for a prior interactive handshake. Such protocols meet the demand for communication with minimal latency, but those currently deployed in practice achieve only rather weak security properties, as they may not achieve forward security for the first transmitted payload message and require additional countermeasures against replay attacks.Recently, 0-RTT protocols with full forward security and replay resilience have been proposed in the academic literature. These are based on puncturable encryption, which uses rather heavy building blocks, such as cryptographic pairings. Some constructions were claimed to have practical efficiency, but it is unclear how they compare concretely to protocols deployed in practice, and we currently do not have any benchmark results that new protocols can be compared with.We provide the first concrete performance analysis of a modern 0-RTT protocol with full forward security, by integrating the Bloom Filter Encryption scheme of Derler et al. (EUROCRYPT 2018) in the Chromium QUIC implementation and comparing it to Google’s original QUIC protocol. We find that for reasonable deployment parameters, the server CPU load increases approximately by a factor of eight and the memory consumption on the server increases significantly, but stays below 400 MB even for medium-scale deployments that handle up to 50K connections per day. The difference of the size of handshake messages is small enough that transmission time on the network is identical, and therefore not significant.We conclude that while current 0-RTT protocols with full forward security come with significant computational overhead, their use in practice is feasible, and may be used in applications where the increased CPU and memory load can be tolerated in exchange for full forward security and replay resilience on the cryptographic protocol level. Our results serve as a first benchmark that can be used to assess the efficiency of 0-RTT protocols potentially developed in the future. AU - Dallmeier, Fynn AU - Drees, Jan P. AU - Gellert, Kai AU - Handirk, Tobias AU - Jager, Tibor AU - Klauke, Jonas AU - Nachtigall, Simon AU - Renzelmann, Timo AU - Wolf, Rudi ID - 28997 SN - 0302-9743 T2 - Cryptology and Network Security TI - Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC ER - TY - CONF AU - zur Heiden, Philipp ID - 20706 SN - 0302-9743 T2 - Designing for Digital Transformation. Co-Creating Services with Citizens and Industry TI - Considering Context in Design Science Research: A Systematic Literature Review ER - TY - CONF AU - Mahmood, Yasir AU - Meier, Arne ID - 45848 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic ER - TY - CHAP AU - Haney, Julie M. AU - Furman, Susanne M. AU - Acar, Yasemin ID - 47261 SN - 0302-9743 T2 - HCI for Cybersecurity, Privacy and Trust TI - Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges ER - TY - CHAP AU - Senft, Björn AU - Rittmeier, Florian AU - Fischer, Holger Gerhard AU - Oberthür, Simon ID - 11952 SN - 0302-9743 T2 - Design, User Experience, and Usability. Practice and Case Studies TI - A Value-Centered Approach for Unique and Novel Software Applications ER - TY - CHAP AU - Kuhlemann, Stefan AU - Sellmann, Meinolf AU - Tierney, Kevin ID - 14890 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Exploiting Counterfactuals for Scalable Stochastic Optimization ER - TY - CHAP AU - Ahmadi Fahandar, Mohsen AU - Hüllermeier, Eyke ID - 15004 SN - 0302-9743 T2 - Discovery Science TI - Feature Selection for Analogy-Based Learning to Rank ER - TY - CHAP AU - Ahmadi Fahandar, Mohsen AU - Hüllermeier, Eyke ID - 15005 SN - 0302-9743 T2 - KI 2019: Advances in Artificial Intelligence TI - Analogy-Based Preference Learning with Kernels ER - TY - CHAP AU - Nguyen, Vu-Linh AU - Destercke, Sébastien AU - Hüllermeier, Eyke ID - 15006 SN - 0302-9743 T2 - Discovery Science TI - Epistemic Uncertainty Sampling ER - TY - CONF AU - Hartel, Rita AU - Dunst, Alexander ID - 15080 SN - 0302-9743 T2 - International Conference on Multimedia Modeling, MMM TI - How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics ER - TY - CHAP AU - Beyer, Dirk AU - Jakobs, Marie-Christine ID - 13872 SN - 0302-9743 T2 - Fundamental Approaches to Software Engineering TI - CoVeriTest: Cooperative Verifier-Based Testing ER - TY - CONF AU - Mahmood, Yasir AU - Meier, Arne AU - Schmidt, Johannes ID - 45818 SN - 0302-9743 T2 - Logical Foundations of Computer Science TI - Parameterised Complexity of Abduction in Schaefer’s Framework ER - TY - CONF AU - Blömer, Johannes AU - Eidens, Fabian AU - Juhnke, Jakob ID - 2862 SN - 0302-9743 T2 - Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings TI - Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems ER - TY - CONF AB - We study the Online Prize-collecting Node-weighted Steiner Forest problem (OPC-NWSF) in which we are given an undirected graph \(G=(V, E)\) with \(|V| = n\) and node-weight function \(w: V \rightarrow \mathcal {R}^+\). A sequence of k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph H such that each pair \(\{s, t\}\) is either connected (there is a path between s and t in H) or its associated penalty is paid. The goal is to minimize the weight of H and the total penalties paid. The current best result for OPC-NWSF is a randomized \(\mathcal {O}(\log ^4 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing a randomized \(\mathcal {O}(\log n \log k)\)-competitive algorithm for OPC-NWSF, which is optimal up to constant factor since OPC-NWSF has a randomized lower bound of \(\varOmega (\log ^2 n)\) due to Korman [11]. Moreover, our result also implies an improvement for two special cases of OPC-NWSF, the Online Prize-collecting Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently best known results for OPC-NWST and ONWSF are a randomized \(\mathcal {O}(\log ^3 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized \(\mathcal {O}(\log n \log ^2 k)\)-competitive algorithm due to Hajiaghayi et al. (FOCS 2013), respectively. AU - Markarian, Christine ID - 24396 SN - 0302-9743 T2 - International Workshop on Combinatorial Algorithms (IWOCA) TI - An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest ER - TY - CONF AB - Profiling applications on a heterogeneous compute node is challenging since the way to retrieve data from the resources and interpret them varies between resource types and manufacturers. This holds especially true for measuring the energy consumption. In this paper we present Ampehre, a novel open source measurement framework that allows developers to gather comparable measurements from heterogeneous compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture of Ampehre and detail the measurement process on the example of energy measurements on CPU and GPU. To characterize the probing effect, we quantitatively analyze the trade-off between the accuracy of measurements and the CPU load imposed by Ampehre. Based on this analysis, we are able to specify reasonable combinations of sampling periods for the different resource types of a compute node. AU - Lösch, Achim AU - Wiens, Alex AU - Platzner, Marco ID - 3362 SN - 0302-9743 T2 - Proceedings of the International Conference on Architecture of Computing Systems (ARCS) TI - Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes VL - 10793 ER - TY - CONF AB - Modern Boolean satisfiability solvers can emit proofs of unsatisfiability. There is substantial interest in being able to verify such proofs and also in using them for further computations. In this paper, we present an FPGA accelerator for checking resolution proofs, a popular proof format. Our accelerator exploits parallelism at the low level by implementing the basic resolution step in hardware, and at the high level by instantiating a number of parallel modules for proof checking. Since proof checking involves highly irregular memory accesses, we employ Hybrid Memory Cube technology for accelerator memory. The results show that while the accelerator is scalable and achieves speedups for all benchmark proofs, performance improvements are currently limited by the overhead of transitioning the proof into the accelerator memory. AU - Hansmeier, Tim AU - Platzner, Marco AU - Andrews, David ID - 3373 SN - 0302-9743 T2 - ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications TI - An FPGA/HMC-Based Accelerator for Resolution Proof Checking VL - 10824 ER - TY - CHAP AU - Schellhorn, Gerhard AU - Wedel, Monika AU - Travkin, Oleg AU - König, Jürgen AU - Wehrheim, Heike ID - 3536 SN - 0302-9743 T2 - Software Engineering and Formal Methods TI - FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity ER - TY - CONF AB - 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. AU - Töws, Manuel AU - Wehrheim, Heike ID - 5774 SN - 0302-9743 T2 - Theoretical Aspects of Computing – ICTAC 2018 TI - Information Flow Certificates ER -