@inbook{57154,
  author       = {{Asiimwe, Henry and Bode, Henrik and Bogere, Paul and Freitag, Christine and Mangeni, Teddy}},
  booktitle    = {{Bildungsmedien für Erwachsene Educational Media for Adults }},
  editor       = {{Andrzejewska, Ewa and Matthes, Eva and Schütze, Sylvia and Van Wiele, Jan}},
  isbn         = {{978-3-7815-2670-9}},
  pages        = {{245–255}},
  publisher    = {{Verlag Julius Klinkhardt}},
  title        = {{{Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change}}},
  doi          = {{10.35468/6126}},
  year         = {{2024}},
}

@unpublished{63509,
  abstract     = {{Phonons in solid-state quantum emitters play a crucial role in their performance as photon sources in quantum technology. For resonant driving, phonons dampen the Rabi oscillations resulting in reduced preparation fidelities. The phonon spectral density, which quantifies the strength of the carrier-phonon interaction, is non-monotonous as a function of energy. As one of the most prominent consequences, this leads to the reappearance of Rabi rotations for increasing pulse power, which was theoretically predicted in Phys. Rev. Lett. 98, 227403 (2007). In this paper we present the experimental demonstration of the reappearance of Rabi rotations.}},
  author       = {{Hanschke, L. and Bracht, T. K. and Schöll, E. and Bauch, D. and Berger, E. and Kallert, P. and Peter, M. and Garcia, A. J. and Silva, S. F. Covre da and Manna, S. and Rastelli, A. and Schumacher, S. and Reiter, D. E. and Jöns, K. D.}},
  booktitle    = {{arXiv:2409.19167}},
  title        = {{{Experimental measurement of the reappearance of Rabi rotations in semiconductor quantum dots}}},
  year         = {{2024}},
}

@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     = {{<jats:p>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.</jats:p>}},
  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 &amp; 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     = {{<jats:title>Abstract</jats:title><jats:p>Previous 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.</jats:p>}},
  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}},
}