@inbook{21587, abstract = {{Solving partial differential equations on unstructured grids is a cornerstone of engineering and scientific computing. Nowadays, heterogeneous parallel platforms with CPUs, GPUs, and FPGAs enable energy-efficient and computationally demanding simulations. We developed the HighPerMeshes C++-embedded Domain-Specific Language (DSL) for bridging the abstraction gap between the mathematical and algorithmic formulation of mesh-based algorithms for PDE problems on the one hand and an increasing number of heterogeneous platforms with their different parallel programming and runtime models on the other hand. Thus, the HighPerMeshes DSL aims at higher productivity in the code development process for multiple target platforms. We introduce the concepts as well as the basic structure of the HighPerMeshes DSL, and demonstrate its usage with three examples, a Poisson and monodomain problem, respectively, solved by the continuous finite element method, and the discontinuous Galerkin method for Maxwell’s equation. The mapping of the abstract algorithmic description onto parallel hardware, including distributed memory compute clusters, is presented. Finally, the achievable performance and scalability are demonstrated for a typical example problem on a multi-core CPU cluster.}}, author = {{Alhaddad, Samer and Förstner, Jens and Groth, Stefan and Grünewald, Daniel and Grynko, Yevgen and Hannig, Frank and Kenter, Tobias and Pfreundt, Franz-Josef and Plessl, Christian and Schotte, Merlind and Steinke, Thomas and Teich, Jürgen and Weiser, Martin and Wende, Florian}}, booktitle = {{Euro-Par 2020: Parallel Processing Workshops}}, isbn = {{9783030715922}}, issn = {{0302-9743}}, keywords = {{tet_topic_hpc}}, title = {{{HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids}}}, doi = {{10.1007/978-3-030-71593-9_15}}, year = {{2021}}, } @inbook{29936, author = {{Ramaswami, Arjun and Kenter, Tobias and Kühne, Thomas and Plessl, Christian}}, booktitle = {{Applied Reconfigurable Computing. Architectures, Tools, and Applications}}, isbn = {{9783030790240}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing}}}, doi = {{10.1007/978-3-030-79025-7_21}}, year = {{2021}}, } @inbook{60901, abstract = {{The successful training of deep neural networks is dependent on initialization schemes and choice of activation functions. Non-optimally chosen parameter settings lead to the known problem of exploding or vanishing gradients. This issue occurs when gradient descent and backpropagation are applied. For this setting the Ensemble Kalman Filter (EnKF) can be used as an alternative optimizer when training neural networks. The EnKF does not require the explicit calculation of gradients or adjoints and we show this resolves the exploding and vanishing gradient problem. We analyze different parameter initializations, propose a dynamic change in ensembles and compare results to established methods.}}, author = {{Yegenoglu, Alper and Krajsek, Kai and Pier, Sandra Diaz and Herty, Michael}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030645793}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{Ensemble Kalman Filter Optimizing Deep Neural Networks: An Alternative Approach to Non-performing Gradient Descent}}}, doi = {{10.1007/978-3-030-64580-9_7}}, year = {{2021}}, } @inbook{65531, author = {{Sedlacek, Vladimir and Chi-Domínguez, Jesús-Javier and Jancar, Jan and Brumley, Billy Bob}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030920616}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{A Formula for Disaster: A Unified Approach to Elliptic Curve Special-Point-Based Attacks}}}, doi = {{10.1007/978-3-030-92062-3_5}}, year = {{2021}}, } @inbook{19521, author = {{Pfannschmidt, Karlson and Hüllermeier, Eyke}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030582845}}, issn = {{0302-9743}}, title = {{{Learning Choice Functions via Pareto-Embeddings}}}, doi = {{10.1007/978-3-030-58285-2_30}}, year = {{2020}}, } @inbook{19561, author = {{Sellmann, Meinolf and Tierney, Kevin}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030535513}}, issn = {{0302-9743}}, keywords = {{pc2-ressources}}, title = {{{Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types}}}, doi = {{10.1007/978-3-030-53552-0_12}}, year = {{2020}}, } @inbook{21396, abstract = {{Verifiable random functions (VRFs) are essentially digital signatures with additional properties, namely verifiable uniqueness and pseudorandomness, which make VRFs a useful tool, e.g., to prevent enumeration in DNSSEC Authenticated Denial of Existence and the CONIKS key management system, or in the random committee selection of the Algorand blockchain. Most standard-model VRFs rely on admissible hash functions (AHFs) to achieve security against adaptive attacks in the standard model. Known AHF constructions are based on error-correcting codes, which yield asymptotically efficient constructions. However, previous works do not clarify how the code should be instantiated concretely in the real world. The rate and the minimal distance of the selected code have significant impact on the efficiency of the resulting cryptosystem, therefore it is unclear if and how the aforementioned constructions can be used in practice. First, we explain inherent limitations of code-based AHFs. Concretely, we assume that even if we were given codes that achieve the well-known Gilbert-Varshamov or McEliece-Rodemich-Rumsey-Welch bounds, existing AHF-based constructions of verifiable random functions (VRFs) can only be instantiated quite inefficiently. Then we introduce and construct computational AHFs (cAHFs). While classical AHFs are information-theoretic, and therefore work even in presence of computationally unbounded adversaries, cAHFs provide only security against computationally bounded adversaries. However, we show that cAHFs can be instantiated significantly more efficiently. Finally, we use our cAHF to construct the currently most efficient verifiable random function with full adaptive security in the standard model.}}, author = {{Jager, Tibor and Niehues, David}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030384708}}, issn = {{0302-9743}}, keywords = {{Admissible hash functions, Verifiable random functions, Error-correcting codes, Provable security}}, location = {{Waterloo, Canada}}, title = {{{On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions}}}, doi = {{10.1007/978-3-030-38471-5_13}}, year = {{2020}}, } @inbook{17337, author = {{Jazayeri, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor}}, booktitle = {{Advanced Information Systems Engineering}}, isbn = {{9783030494346}}, issn = {{0302-9743}}, title = {{{Modeling and Analyzing Architectural Diversity of Open Platforms}}}, doi = {{10.1007/978-3-030-49435-3_3}}, year = {{2020}}, } @inbook{20891, abstract = {{Today, software systems are rarely developed monolithically, but may be composed of numerous individually developed features. Their modularization facilitates independent development and verification. While feature-based strategies to verify features in isolation have existed for years, they cannot address interactions between features. The problem with feature interactions is that they are typically unknown and may involve any subset of the features. Contrary, a family-based verification strategy captures feature interactions, but does not scale well when features evolve frequently. To the best of our knowledge, there currently exists no approach with focus on evolving features that combines both strategies and aims at eliminating their respective drawbacks. To fill this gap, we introduce Fefalution, a feature-family-based verification approach based on abstract contracts to verify evolving features and their interactions. Fefalution builds partial proofs for each evolving feature and then reuses the resulting partial proofs in verifying feature interactions, yielding a full verification of the complete software system. Moreover, to investigate whether a combination of both strategies is fruitful, we present the first empirical study for the verification of evolving features implemented by means of feature-oriented programming and by comparing Fefalution with another five family-based approaches varying in a set of optimizations. Our results indicate that partial proofs based on abstract contracts exhibit huge reuse potential, but also come with a substantial overhead for smaller evolution scenarios. }}, author = {{Knüppel, Alexander and Krüger, Stefan and Thüm, Thomas and Bubel, Richard and Krieter, Sebastian and Bodden, Eric and Schaefer, Ina}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030643539}}, issn = {{0302-9743}}, title = {{{Using Abstract Contracts for Verifying Evolving Features and Their Interactions}}}, doi = {{10.1007/978-3-030-64354-6_5}}, year = {{2020}}, } @inbook{18014, author = {{El Mesaoudi-Paul, Adil and Weiß, Dimitri and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}}, booktitle = {{Learning and Intelligent Optimization. LION 2020.}}, isbn = {{9783030535513}}, issn = {{0302-9743}}, pages = {{216 -- 232}}, publisher = {{Springer}}, title = {{{Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach}}}, doi = {{10.1007/978-3-030-53552-0_22}}, volume = {{12096}}, year = {{2020}}, } @inbook{23377, author = {{Piskachev, Goran and Petrasch, Tobias and Späth, Johannes and Bodden, Eric}}, booktitle = {{Lecture Notes in Computer Science}}, issn = {{0302-9743}}, title = {{{AuthCheck: Program-State Analysis for Access-Control Vulnerabilities}}}, doi = {{10.1007/978-3-030-54997-8_34}}, year = {{2020}}, } @inproceedings{17084, author = {{Weidmann, Nils and Anjorin, Anthony}}, booktitle = {{Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020}}, editor = {{Wehrheim, Heike and Cabot, Jordi}}, isbn = {{9783030452339}}, issn = {{0302-9743}}, location = {{Dublin, Ireland}}, publisher = {{Springer}}, title = {{{Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming}}}, doi = {{10.1007/978-3-030-45234-6_16}}, year = {{2020}}, } @inproceedings{17085, author = {{Schwichtenberg, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor}}, booktitle = {{Advanced Information Systems Engineering}}, isbn = {{9783030494346}}, issn = {{0302-9743}}, title = {{{Modeling and Analyzing Architectural Diversity of Open Platforms}}}, doi = {{10.1007/978-3-030-49435-3_3}}, year = {{2020}}, } @inproceedings{28997, abstract = {{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. }}, author = {{Dallmeier, Fynn and Drees, Jan P. and Gellert, Kai and Handirk, Tobias and Jager, Tibor and Klauke, Jonas and Nachtigall, Simon and Renzelmann, Timo and Wolf, Rudi}}, booktitle = {{Cryptology and Network Security}}, isbn = {{9783030654108}}, issn = {{0302-9743}}, location = {{Vienna}}, pages = {{211--231}}, publisher = {{Springer-Verlag}}, title = {{{Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC}}}, doi = {{10.1007/978-3-030-65411-5_11}}, year = {{2020}}, } @inproceedings{20706, author = {{zur Heiden, Philipp}}, booktitle = {{Designing for Digital Transformation. Co-Creating Services with Citizens and Industry}}, isbn = {{9783030648220}}, issn = {{0302-9743}}, title = {{{Considering Context in Design Science Research: A Systematic Literature Review}}}, doi = {{10.1007/978-3-030-64823-7_21}}, year = {{2020}}, } @inproceedings{45848, author = {{Mahmood, Yasir and Meier, Arne}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030399504}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic}}}, doi = {{10.1007/978-3-030-39951-1_10}}, year = {{2020}}, } @inproceedings{45818, author = {{Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}}, booktitle = {{Logical Foundations of Computer Science}}, isbn = {{9783030367541}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{Parameterised Complexity of Abduction in Schaefer’s Framework}}}, doi = {{10.1007/978-3-030-36755-8_13}}, year = {{2020}}, } @inbook{47261, author = {{Haney, Julie M. and Furman, Susanne M. and Acar, Yasemin}}, booktitle = {{HCI for Cybersecurity, Privacy and Trust}}, isbn = {{9783030503086}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges}}}, doi = {{10.1007/978-3-030-50309-3_26}}, year = {{2020}}, } @inbook{65530, author = {{Sedlacek, Vladimir and Jancar, Jan and Svenda, Petr}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030590123}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{Fooling Primality Tests on Smartcards}}}, doi = {{10.1007/978-3-030-59013-0_11}}, year = {{2020}}, } @inbook{66237, author = {{Yu, Qiao and Chen, Kuan-Hsun and Chen, Jian-Jia}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030609351}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{Using a Set of Triangle Inequalities to Accelerate K-means Clustering}}}, doi = {{10.1007/978-3-030-60936-8_23}}, year = {{2020}}, }