@inproceedings{56481, author = {{Berganski, Christoph and Jentzsch, Felix and Platzner, Marco and Kuhmichel, Max and Giefers, Heiner}}, location = {{Sydney}}, title = {{{FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers}}}, year = {{2024}}, } @article{47424, author = {{Burmeister, Sascha Christian and Guericke, Daniela and Schryen, Guido}}, journal = {{Flexible Services and Manufacturing Journal}}, title = {{{A Memetic NSGA-II for the Multi-Objective Flexible Job Shop Scheduling Problem with Real-time Energy Tariffs}}}, year = {{2024}}, } @misc{54245, author = {{Henke, Luca-Sebastian}}, title = {{{Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting}}}, year = {{2024}}, } @article{65535, abstract = {{Side-channel attacks on elliptic curve cryptography (ECC) often assume a white-box attacker who has detailed knowledge of the implementation choices taken by the target implementation. Due to the complex and layered nature of ECC, there are many choices that a developer makes to obtain a functional and interoperable implementation. These include the curve model, coordinate system, addition formulas, and the scalar multiplier, or lower-level details such as the finite-field multiplication algorithm. This creates a gap between the attack requirements and a real-world attacker that often only has black-box access to the target – i.e., has no access to the source code nor knowledge of specific implementation choices made. Yet, when the gap is closed, even real-world implementations of ECC succumb to side-channel attacks, as evidenced by attacks such as TPM-Fail, Minerva, the Side Journey to Titan, or TPMScan [MSE+20; JSS+20; RLM+21; SDB+24].We study this gap by first analyzing open-source ECC libraries for insight into realworld implementation choices. We then examine the space of all ECC implementations combinatorially. Finally, we present a set of novel methods for automated reverse engineering of black-box ECC implementations and release a documented and usable open-source toolkit for side-channel analysis of ECC called pyecsca.Our methods turn attacks around: instead of attempting to recover the private key, they attempt to recover the implementation configuration given control over the private and public inputs. We evaluate them on two simulation levels and study the effect of noise on their performance. Our methods are able to 1) reverse-engineer the scalar multiplication algorithm completely and 2) infer significant information about the coordinate system and addition formulas used in a target implementation. Furthermore, they can bypass coordinate and curve randomization countermeasures.}}, author = {{Jancar, Jan and Suchanek, Vojtech and Svenda, Petr and Sedlacek, Vladimir and Chmielewski, Łukasz}}, issn = {{2569-2925}}, journal = {{IACR Transactions on Cryptographic Hardware and Embedded Systems}}, number = {{4}}, pages = {{355--381}}, publisher = {{Universitatsbibliothek der Ruhr-Universitat Bochum}}, title = {{{pyecsca: Reverse engineering black-box elliptic curve cryptography via side-channel analysis}}}, doi = {{10.46586/tches.v2024.i4.355-381}}, volume = {{2024}}, year = {{2024}}, } @article{65534, abstract = {{Cryptography secures our online interactions, transactions, and trust. To achieve this goal, not only do the cryptographic primitives and protocols need to be secure in theory, they also need to be securely implemented by cryptographic library developers in practice. However, implementing cryptographic algorithms securely is challenging, even for skilled professionals, which can lead to vulnerable implementations, especially to side-channel attacks. For timing attacks, a severe class of side-channel attacks, there exist a multitude of tools that are supposed to help cryptographic library developers assess whether their code is vulnerable to timing attacks. Previous work has established that despite an interest in writing constant-time code, cryptographic library developers do not routinely use these tools due to their general lack of usability. However, the precise factors affecting the usability of these tools remain unexplored. While many of the tools are developed in an academic context, we believe that it is worth exploring the factors that contribute to or hinder their effective use by cryptographic library developers [61]. To assess what contributes to and detracts from usability of tools that verify constant-timeness (CT), we conducted a two-part usability study with 24 (post) graduate student participants on 6 tools across diverse tasks that approximate real-world use cases for cryptographic library developers. We find that all studied tools are affected by similar usability issues to varying degrees, with no tool excelling in usability, and usability issues preventing their effective use. Based on our results, we recommend that effective tools for verifying CT need usable documentation, simple installation, easy to adapt examples, clear output corresponding to CT violations, and minimal noninvasive code markup. We contribute first steps to achieving these with limited academic resources, with our documentation, examples, and installation scripts(1).}}, author = {{Fourn , M and Braga, DD and Jancar, J and Sabt, M and Schwabe, P and Barthe, G and Fouque, PA and Acar, Y}}, issn = {{978-1-939133-44-1}}, publisher = {{Usenix Assoc}}, title = {{{"These results must be false": A usability evaluation of constant-time analysis tools}}}, year = {{2024}}, } @inbook{65536, author = {{Janovsky, Adam and Chmielewski, Łukasz and Svenda, Petr and Jancar, Jan and Matyas, Vashek}}, booktitle = {{IFIP Advances in Information and Communication Technology}}, isbn = {{9783031651748}}, issn = {{1868-4238}}, publisher = {{Springer Nature Switzerland}}, title = {{{Chain of Trust: Unraveling References Among Common Criteria Certified Products}}}, doi = {{10.1007/978-3-031-65175-5_14}}, year = {{2024}}, } @article{65527, author = {{Janovsky, Adam and Jancar, Jan and Svenda, Petr and Chmielewski, Łukasz and Michalik, Jiri and Matyas, Vashek}}, issn = {{0167-4048}}, journal = {{Computers & Security}}, publisher = {{Elsevier BV}}, title = {{{sec-certs: Examining the security certification practice for better vulnerability mitigation}}}, doi = {{10.1016/j.cose.2024.103895}}, volume = {{143}}, year = {{2024}}, } @inproceedings{62047, author = {{Reckmann, Eileen and Temmen, Katrin}}, location = {{Hannover}}, title = {{{Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten}}}, year = {{2024}}, } @article{48484, abstract = {{AbstractPrevious research indicates that performing passes with a head fake in basketball leads to increased response initiation times and errors as compared to performing a pass without a head fake. These so-called fake production costs only occurred when not given the time to mentally prepare the deceptive movement. In the current study, we investigated if extensive practice could reduce the cognitive costs of producing a pass with head fake. Twenty-four basketball novices participated in an experiment on five consecutive days. A visual cue prompted participants to play a pass with or without a head fake either to the left or right side. The cued action had to be executed after an interstimulus interval (ISI) of either 0 ms, 400 ms, 800 ms or 1200 ms, allowing for different movement preparation times. Results indicated higher response initiation times (ITs) and error rates (ERs) for passes with head fakes for the short preparation intervals (ISI 0 ms and 400 ms) on the first day but no difference for the longer preparation intervals (ISI 800 ms and 1200 ms). After only one day of practice, participants showed reduced fake production costs (for ISI 0 ms) and were even able to eliminate these cognitive costs when given time to mentally prepare the movement (for ISI 400 ms). Accordingly, physical practice can reduce the cognitive costs associated with head-fake generation. This finding is discussed against the background of the strengthening of stimulus response associations.}}, author = {{Böer, Nils Tobias and Weigelt, Matthias and Schütz, Christoph and Güldenpenning, Iris}}, issn = {{0340-0727}}, journal = {{Psychological Research}}, keywords = {{Arts and Humanities (miscellaneous), Developmental and Educational Psychology, Experimental and Cognitive Psychology, General Medicine}}, pages = {{523--534}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Practice reduces the costs of producing head fakes in basketball}}}, doi = {{10.1007/s00426-023-01885-x}}, volume = {{88}}, year = {{2024}}, } @inproceedings{50273, abstract = {{The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers. Quantumly, however, despite the fact that at least \emph{four} definitions of quantum $\mathsf{PH}$ exist, it has been challenging to prove analogues for these of even basic facts from $\mathsf{PH}$. This work studies three quantum-verifier based generalizations of $\mathsf{PH}$, two of which are from [Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings ($\mathsf{QCPH}$) and quantum mixed states ($\mathsf{QPH}$) as proofs, and one of which is new to this work, utilizing quantum pure states ($\mathsf{pureQPH}$) as proofs. We first resolve several open problems from [GSSSY22], including a collapse theorem and a Karp-Lipton theorem for $\mathsf{QCPH}$. Then, for our new class $\mathsf{pureQPH}$, we show one-sided error reduction for $\mathsf{pureQPH}$, as well as the first bounds relating these quantum variants of $\mathsf{PH}$, namely $\mathsf{QCPH}\subseteq \mathsf{pureQPH} \subseteq \mathsf{EXP}^{\mathsf{PP}}$.}}, author = {{Agarwal, Avantika and Gharibian, Sevag and Koppula, Venkata and Rudolph, Dorian}}, booktitle = {{Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)}}, number = {{7}}, pages = {{7--17}}, title = {{{Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds}}}, doi = {{10.4230/LIPIcs.MFCS.2024.7}}, volume = {{306}}, year = {{2024}}, } @inproceedings{34083, abstract = {{In the context of language learning, feedback comment generation is the task of generating hints or explanatory notes for learner texts that help understand why a part of text is erroneous. This paper presents our approach to the Feedback Comment Generation Shared Task, collocated with the 16th International Natural Language Generation Conference (INLG 2023). The approach augments the generation of feedback comments by a self-supervised identification of feedback types in a multitask-learning setting. Within the shared task, other approaches performed more effective, yet the combined modeling of feedback type classification and feedback comment generation is superior to performing feedback generation only.}}, author = {{Stahl, Maja and Wachsmuth, Henning}}, booktitle = {{Proceedings of the 16th International Natural Language Generation Conference}}, title = {{{Identifying Feedback Types to Augment Feedback Comment Generation}}}, year = {{2023}}, } @book{34544, abstract = {{Tax evasion, tax avoidance and tax resistance are widespread phenomena in political, economic, social and fiscal history from antiquity through medieval, early modern and modern times. Histories of Tax Evasion, Avoidance and Resistance shows how different groups and individuals around the globe have succeeded or failed in not paying their due taxes, whether in kind or in cash, on their properties or on their crops. It analyses how, throughout history, wealthy and poor taxpayers have tried to avoid or reduce their tax burden by negotiating with tax authorities, through practices of legal or illegal tax evasion, by filing lawsuits, seeking armed resistance or by migration, and how state authorities have dealt with such acts of claim making, defiance, open resistance or elusion. It fills an important research gap in tax history, addressing questions of tax morale and fairness, and how social and political inequality was negotiated through taxation. It gives rich insights into the development of citizen-state relationships throughout the course of history. The book comprises case studies from Ancient Athens, Roman Egypt, Medieval Europe, Early Modern Mexico, the Ottoman Empire, Nigeria under British colonial rule, the United Kingdom of the early 20th century, Greece during the Second World War, as well as West Germany, Switzerland, Sweden and the United States in the 20th century, including transnational entanglements in the world of late-modern offshore finance and taxation. The authors are experts in fiscal, economic, financial, legal, social and/or cultural history. The book is intended for students, researchers and scholars of economic and financial history, social and world history and political economy. The Open Access version of this book, available at www.taylorfrancis.com, has been made available under a Creative Commons Attribution-Share Alike 4.0 license.}}, author = {{Schönhärl, Korinna and Hürlimann, Gisela and Rohde, Dorothea}}, isbn = {{9781003333197}}, keywords = {{Tax History, Financial History}}, publisher = {{Routledge}}, title = {{{Histories of Tax Evasion, Avoidance and Resistance}}}, doi = {{10.4324/9781003333197}}, year = {{2023}}, } @inbook{34546, abstract = {{Jean Bodin's list on how the absolutist monarchical state could raise its revenue ranked taxation only in seventh place. From a modern legal perspective, taxes are compulsory transfers of resources that households and enterprises pay to one or several government bodies without receiving an individual, specific benefit in return. Historians have dealt with not paying taxes in various contexts, such as analysing tax resistance and tax resistance movements in history. Tax law is best understood as an outcome of long-term, often conflictual, negotiations and as an expression of specific political mentalities and ideologies. As a consequence, tax law and sometimes even the tax juridical system have a strongly politicised character. Loopholes in tax legislation that enable or facilitate avoidance or evasion can thus be regarded as a result of the interest-driven politics of parliamentary majorities, as the success of concerted lobby pressure.}}, author = {{Schönhärl, Korinna and Hürlimann, Gisela and Rohde, Dorothea}}, booktitle = {{Histories of Tax Evasion, Avoidance and Resistance }}, editor = {{Schönhärl, Korinna and Hürlimann, Gisela and Rohde, Dorothea}}, pages = {{1--15}}, publisher = {{Routledge}}, title = {{{ The Ability and Intention of Not Paying Taxes in History. Some Introductory Observations}}}, doi = {{10.4324/9781003333197}}, year = {{2023}}, } @inbook{34547, abstract = {{As a case study, this chapter examines two tax education films that were produced 11 years apart in the USA and Western Germany during and after World War II: “The New Spirit” and “Putzke wants to know”. In contrast to America's most popular cartoon character 11 years earlier, Erwin Putzke is in a terrible mood at the beginning of the short film “Putzke wants to know”. The family father and electrician with a workshop of his own is annoyed and upset by the duty of filling in his tax return, grumbling at his wife and daughter and even at their budgie. The film's tax morale message is conveyed to its audience against the backdrop of a sober post-war reality characterised by allied occupation and the Allies' say in West German tax policies during a period of laborious economic build-up after a lost war.}}, author = {{Schönhärl, Korinna}}, booktitle = {{Histories of Tax Evasion, Avoidance and Resistance}}, editor = {{Schönhärl, Korinna and Hürlimann, Gisela and Rohde, Dorothea}}, pages = {{154--167}}, publisher = {{Routledge}}, title = {{{ How to Create a Taxpaying Spirit. A Transnational Examination of an US American and a Western German Tax Education Film in and after World War II}}}, doi = {{10.4324/9781003333197}}, year = {{2023}}, } @inproceedings{34880, author = {{Franke, Mario and Klingler, Florian and Sommer, Christoph}}, booktitle = {{IEEE Consumer Communications and Networking Conference (CCNC 2023), Track Communication and Applications for Connected and Autonomous Vehicles on Land, Water, and Sky}}, publisher = {{IEEE}}, title = {{{Addressing the Unbounded Latency of Best-Effort Device-to-Device Communication with Low Earth Orbit Satellite Support}}}, year = {{2023}}, } @inproceedings{34879, author = {{Hegde, Anupama and Delooz, Quentin and Mariyaklla, Chethan Lokesh and Festag, Andreas and Klingler, Florian}}, booktitle = {{IEEE Wireless Communications and Networking Conference (WCNC 2023), Track Emerging Technologies, Standards, and Applications}}, publisher = {{IEEE}}, title = {{{Radio Resource Allocation for Collective Perception in 5G-NR Vehicle-to-X Communication Systems}}}, year = {{2023}}, } @inproceedings{34878, author = {{Hardes, Tobias and Klingler, Florian and Sommer, Christoph}}, booktitle = {{IEEE Wireless Communications and Networking Conference (WCNC 2023), Track Emerging Technologies, Standards, and Applications}}, publisher = {{IEEE}}, title = {{{Improving Platooning Safety with Full Duplex Relaying and Beamforming}}}, year = {{2023}}, } @misc{33938, author = {{Famula, Marta}}, booktitle = {{Jahrbuch Forum Vormärz Forschung 2022. [in Vorbereitung]}}, publisher = {{Aisthesis}}, title = {{{Antonia Villinger: Dramen der Schwangerschaft. Friedrich Hebbels „Judith“, „Maria Magdalena“ und „Genoveva“. Baden-Baden: Ergon 2021}}}, year = {{2023}}, } @inbook{35319, author = {{Menzefricke, Jörn Steffen and Gabriel, Stefan and Gundlach, Thomas and Hobscheidt, Daniela and Kürpick, Christian and Schnasse, Felix and Scholtysik, Michel and Seif, Heiko and Koldewey, Christian and Dumitrescu, Roman}}, booktitle = {{ Digitalisierung. Fallstudien, Tools und Erkenntnisse für das digitale Zeitalter}}, editor = {{Schallmo, Daniel}}, isbn = {{9783658366339}}, issn = {{2569-2348}}, pages = {{375--408}}, publisher = {{Springer Fachmedien Wiesbaden}}, title = {{{Soziotechnisches Risikomanagement als Erfolgsfaktor für die Digitale Transformation}}}, doi = {{10.1007/978-3-658-36634-6_14}}, year = {{2023}}, } @article{21199, abstract = {{As in almost every other branch of science, the major advances in data science and machine learning have also resulted in significant improvements regarding the modeling and simulation of nonlinear dynamical systems. It is nowadays possible to make accurate medium to long-term predictions of highly complex systems such as the weather, the dynamics within a nuclear fusion reactor, of disease models or the stock market in a very efficient manner. In many cases, predictive methods are advertised to ultimately be useful for control, as the control of high-dimensional nonlinear systems is an engineering grand challenge with huge potential in areas such as clean and efficient energy production, or the development of advanced medical devices. However, the question of how to use a predictive model for control is often left unanswered due to the associated challenges, namely a significantly higher system complexity, the requirement of much larger data sets and an increased and often problem-specific modeling effort. To solve these issues, we present a universal framework (which we call QuaSiModO: Quantization-Simulation-Modeling-Optimization) to transform arbitrary predictive models into control systems and use them for feedback control. The advantages of our approach are a linear increase in data requirements with respect to the control dimension, performance guarantees that rely exclusively on the accuracy of the predictive model, and only little prior knowledge requirements in control theory to solve complex control problems. In particular the latter point is of key importance to enable a large number of researchers and practitioners to exploit the ever increasing capabilities of predictive models for control in a straight-forward and systematic fashion.}}, author = {{Peitz, Sebastian and Bieker, Katharina}}, journal = {{Automatica}}, publisher = {{Elsevier}}, title = {{{On the Universal Transformation of Data-Driven Models to Control Systems}}}, doi = {{10.1016/j.automatica.2022.110840}}, volume = {{149}}, year = {{2023}}, }