[{"citation":{"short":"L.-S. Henke, Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting, 2024.","bibtex":"@book{Henke_2024, title={Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting}, author={Henke, Luca-Sebastian}, year={2024} }","mla":"Henke, Luca-Sebastian. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>. 2024.","apa":"Henke, L.-S. (2024). <i>Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting</i>.","chicago":"Henke, Luca-Sebastian. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>, 2024.","ieee":"L.-S. Henke, <i>Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting</i>. 2024.","ama":"Henke L-S. <i>Exploring Custom FPGA Accelerators for DNN-Based RF Fingerprinting</i>.; 2024."},"year":"2024","date_created":"2024-05-13T14:00:01Z","author":[{"first_name":"Luca-Sebastian","full_name":"Henke, Luca-Sebastian","last_name":"Henke"}],"supervisor":[{"first_name":"Felix","last_name":"Jentzsch","orcid":"0000-0003-4987-5708","id":"55631","full_name":"Jentzsch, Felix"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"date_updated":"2026-04-27T14:20:23Z","title":"Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting","type":"mastersthesis","status":"public","user_id":"55631","department":[{"_id":"78"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"54245","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"<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>"}],"status":"public","publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems","type":"journal_article","_id":"65535","user_id":"125442","year":"2024","intvolume":"      2024","page":"355-381","citation":{"bibtex":"@article{Jancar_Suchanek_Svenda_Sedlacek_Chmielewski_2024, title={pyecsca: Reverse engineering black-box elliptic curve cryptography via side-channel analysis}, volume={2024}, DOI={<a href=\"https://doi.org/10.46586/tches.v2024.i4.355-381\">10.46586/tches.v2024.i4.355-381</a>}, number={4}, journal={IACR Transactions on Cryptographic Hardware and Embedded Systems}, publisher={Universitatsbibliothek der Ruhr-Universitat Bochum}, author={Jancar, Jan and Suchanek, Vojtech and Svenda, Petr and Sedlacek, Vladimir and Chmielewski, Łukasz}, year={2024}, pages={355–381} }","short":"J. Jancar, V. Suchanek, P. Svenda, V. Sedlacek, Ł. Chmielewski, IACR Transactions on Cryptographic Hardware and Embedded Systems 2024 (2024) 355–381.","mla":"Jancar, Jan, et al. “Pyecsca: Reverse Engineering Black-Box Elliptic Curve Cryptography via Side-Channel Analysis.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2024, no. 4, Universitatsbibliothek der Ruhr-Universitat Bochum, 2024, pp. 355–81, doi:<a href=\"https://doi.org/10.46586/tches.v2024.i4.355-381\">10.46586/tches.v2024.i4.355-381</a>.","apa":"Jancar, J., Suchanek, V., Svenda, P., Sedlacek, V., &#38; Chmielewski, Ł. (2024). pyecsca: Reverse engineering black-box elliptic curve cryptography via side-channel analysis. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, <i>2024</i>(4), 355–381. <a href=\"https://doi.org/10.46586/tches.v2024.i4.355-381\">https://doi.org/10.46586/tches.v2024.i4.355-381</a>","ama":"Jancar J, Suchanek V, Svenda P, Sedlacek V, Chmielewski Ł. pyecsca: Reverse engineering black-box elliptic curve cryptography via side-channel analysis. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. 2024;2024(4):355-381. doi:<a href=\"https://doi.org/10.46586/tches.v2024.i4.355-381\">10.46586/tches.v2024.i4.355-381</a>","chicago":"Jancar, Jan, Vojtech Suchanek, Petr Svenda, Vladimir Sedlacek, and Łukasz Chmielewski. “Pyecsca: Reverse Engineering Black-Box Elliptic Curve Cryptography via Side-Channel Analysis.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i> 2024, no. 4 (2024): 355–81. <a href=\"https://doi.org/10.46586/tches.v2024.i4.355-381\">https://doi.org/10.46586/tches.v2024.i4.355-381</a>.","ieee":"J. Jancar, V. Suchanek, P. Svenda, V. Sedlacek, and Ł. Chmielewski, “pyecsca: Reverse engineering black-box elliptic curve cryptography via side-channel analysis,” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2024, no. 4, pp. 355–381, 2024, doi: <a href=\"https://doi.org/10.46586/tches.v2024.i4.355-381\">10.46586/tches.v2024.i4.355-381</a>."},"publication_identifier":{"issn":["2569-2925"]},"publication_status":"published","issue":"4","title":"pyecsca: Reverse engineering black-box elliptic curve cryptography via side-channel analysis","doi":"10.46586/tches.v2024.i4.355-381","publisher":"Universitatsbibliothek der Ruhr-Universitat Bochum","date_updated":"2026-04-30T09:32:37Z","volume":2024,"author":[{"first_name":"Jan","last_name":"Jancar","full_name":"Jancar, Jan"},{"first_name":"Vojtech","full_name":"Suchanek, Vojtech","last_name":"Suchanek"},{"full_name":"Svenda, Petr","last_name":"Svenda","first_name":"Petr"},{"last_name":"Sedlacek","full_name":"Sedlacek, Vladimir","first_name":"Vladimir"},{"first_name":"Łukasz","full_name":"Chmielewski, Łukasz","last_name":"Chmielewski"}],"date_created":"2026-04-30T09:31:41Z"},{"date_updated":"2026-04-30T09:32:34Z","publisher":"Usenix Assoc","author":[{"first_name":"M","last_name":"Fourn ","full_name":"Fourn , M"},{"first_name":"DD","last_name":"Braga","full_name":"Braga, DD"},{"first_name":"J","full_name":"Jancar, J","last_name":"Jancar"},{"first_name":"M","last_name":"Sabt","full_name":"Sabt, M"},{"first_name":"P","last_name":"Schwabe","full_name":"Schwabe, P"},{"last_name":"Barthe","full_name":"Barthe, G","first_name":"G"},{"last_name":"Fouque","full_name":"Fouque, PA","first_name":"PA"},{"first_name":"Y","full_name":"Acar, Y","last_name":"Acar"}],"date_created":"2026-04-30T09:31:29Z","title":"\"These results must be false\": A usability evaluation of constant-time analysis tools","quality_controlled":"1","publication_identifier":{"issn":["978-1-939133-44-1"]},"publication_status":"published","year":"2024","place":"Berkeley","citation":{"apa":"Fourn , M., Braga, D., Jancar, J., Sabt, M., Schwabe, P., Barthe, G., Fouque, P., &#38; Acar, Y. (2024). <i>“These results must be false”: A usability evaluation of constant-time analysis tools</i>.","short":"M. Fourn , D. Braga, J. Jancar, M. Sabt, P. Schwabe, G. Barthe, P. Fouque, Y. Acar, (2024).","mla":"Fourn , M., et al. <i>“These Results Must Be False”: A Usability Evaluation of Constant-Time Analysis Tools</i>. Usenix Assoc, 2024.","bibtex":"@article{Fourn _Braga_Jancar_Sabt_Schwabe_Barthe_Fouque_Acar_2024, place={Berkeley}, title={“These results must be false”: A usability evaluation of constant-time analysis tools}, publisher={Usenix Assoc}, author={Fourn , M and Braga, DD and Jancar, J and Sabt, M and Schwabe, P and Barthe, G and Fouque, PA and Acar, Y}, year={2024} }","chicago":"Fourn , M, DD Braga, J Jancar, M Sabt, P Schwabe, G Barthe, PA Fouque, and Y Acar. “‘These Results Must Be False’: A Usability Evaluation of Constant-Time Analysis Tools,” 2024.","ieee":"M. Fourn  <i>et al.</i>, “‘These results must be false’: A usability evaluation of constant-time analysis tools,” 2024.","ama":"Fourn  M, Braga D, Jancar J, et al. “These results must be false”: A usability evaluation of constant-time analysis tools. Published online 2024."},"_id":"65534","user_id":"125442","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"lang":"eng","text":"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)."}],"status":"public"},{"citation":{"bibtex":"@inbook{Janovsky_Chmielewski_Svenda_Jancar_Matyas_2024, place={Cham}, title={Chain of Trust: Unraveling References Among Common Criteria Certified Products}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-65175-5_14\">10.1007/978-3-031-65175-5_14</a>}, booktitle={IFIP Advances in Information and Communication Technology}, publisher={Springer Nature Switzerland}, author={Janovsky, Adam and Chmielewski, Łukasz and Svenda, Petr and Jancar, Jan and Matyas, Vashek}, year={2024} }","short":"A. Janovsky, Ł. Chmielewski, P. Svenda, J. Jancar, V. Matyas, in: IFIP Advances in Information and Communication Technology, Springer Nature Switzerland, Cham, 2024.","mla":"Janovsky, Adam, et al. “Chain of Trust: Unraveling References Among Common Criteria Certified Products.” <i>IFIP Advances in Information and Communication Technology</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-65175-5_14\">10.1007/978-3-031-65175-5_14</a>.","apa":"Janovsky, A., Chmielewski, Ł., Svenda, P., Jancar, J., &#38; Matyas, V. (2024). Chain of Trust: Unraveling References Among Common Criteria Certified Products. In <i>IFIP Advances in Information and Communication Technology</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-65175-5_14\">https://doi.org/10.1007/978-3-031-65175-5_14</a>","ieee":"A. Janovsky, Ł. Chmielewski, P. Svenda, J. Jancar, and V. Matyas, “Chain of Trust: Unraveling References Among Common Criteria Certified Products,” in <i>IFIP Advances in Information and Communication Technology</i>, Cham: Springer Nature Switzerland, 2024.","chicago":"Janovsky, Adam, Łukasz Chmielewski, Petr Svenda, Jan Jancar, and Vashek Matyas. “Chain of Trust: Unraveling References Among Common Criteria Certified Products.” In <i>IFIP Advances in Information and Communication Technology</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-65175-5_14\">https://doi.org/10.1007/978-3-031-65175-5_14</a>.","ama":"Janovsky A, Chmielewski Ł, Svenda P, Jancar J, Matyas V. Chain of Trust: Unraveling References Among Common Criteria Certified Products. In: <i>IFIP Advances in Information and Communication Technology</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-65175-5_14\">10.1007/978-3-031-65175-5_14</a>"},"place":"Cham","year":"2024","publication_status":"published","publication_identifier":{"issn":["1868-4238","1868-422X"],"isbn":["9783031651748","9783031651755"]},"doi":"10.1007/978-3-031-65175-5_14","title":"Chain of Trust: Unraveling References Among Common Criteria Certified Products","author":[{"full_name":"Janovsky, Adam","last_name":"Janovsky","first_name":"Adam"},{"first_name":"Łukasz","last_name":"Chmielewski","full_name":"Chmielewski, Łukasz"},{"first_name":"Petr","full_name":"Svenda, Petr","last_name":"Svenda"},{"full_name":"Jancar, Jan","last_name":"Jancar","first_name":"Jan"},{"first_name":"Vashek","full_name":"Matyas, Vashek","last_name":"Matyas"}],"date_created":"2026-04-30T09:31:48Z","date_updated":"2026-04-30T09:32:32Z","publisher":"Springer Nature Switzerland","status":"public","type":"book_chapter","publication":"IFIP Advances in Information and Communication Technology","language":[{"iso":"eng"}],"user_id":"125442","_id":"65536"},{"type":"journal_article","publication":"Computers &amp; Security","status":"public","user_id":"125442","_id":"65527","language":[{"iso":"eng"}],"article_number":"103895","publication_status":"published","publication_identifier":{"issn":["0167-4048"]},"citation":{"chicago":"Janovsky, Adam, Jan Jancar, Petr Svenda, Łukasz Chmielewski, Jiri Michalik, and Vashek Matyas. “Sec-Certs: Examining the Security Certification Practice for Better Vulnerability Mitigation.” <i>Computers &#38;amp; Security</i> 143 (2024). <a href=\"https://doi.org/10.1016/j.cose.2024.103895\">https://doi.org/10.1016/j.cose.2024.103895</a>.","ieee":"A. Janovsky, J. Jancar, P. Svenda, Ł. Chmielewski, J. Michalik, and V. Matyas, “sec-certs: Examining the security certification practice for better vulnerability mitigation,” <i>Computers &#38;amp; Security</i>, vol. 143, Art. no. 103895, 2024, doi: <a href=\"https://doi.org/10.1016/j.cose.2024.103895\">10.1016/j.cose.2024.103895</a>.","mla":"Janovsky, Adam, et al. “Sec-Certs: Examining the Security Certification Practice for Better Vulnerability Mitigation.” <i>Computers &#38;amp; Security</i>, vol. 143, 103895, Elsevier BV, 2024, doi:<a href=\"https://doi.org/10.1016/j.cose.2024.103895\">10.1016/j.cose.2024.103895</a>.","bibtex":"@article{Janovsky_Jancar_Svenda_Chmielewski_Michalik_Matyas_2024, title={sec-certs: Examining the security certification practice for better vulnerability mitigation}, volume={143}, DOI={<a href=\"https://doi.org/10.1016/j.cose.2024.103895\">10.1016/j.cose.2024.103895</a>}, number={103895}, journal={Computers &#38;amp; Security}, publisher={Elsevier BV}, author={Janovsky, Adam and Jancar, Jan and Svenda, Petr and Chmielewski, Łukasz and Michalik, Jiri and Matyas, Vashek}, year={2024} }","short":"A. Janovsky, J. Jancar, P. Svenda, Ł. Chmielewski, J. Michalik, V. Matyas, Computers &#38;amp; Security 143 (2024).","apa":"Janovsky, A., Jancar, J., Svenda, P., Chmielewski, Ł., Michalik, J., &#38; Matyas, V. (2024). sec-certs: Examining the security certification practice for better vulnerability mitigation. <i>Computers &#38;amp; Security</i>, <i>143</i>, Article 103895. <a href=\"https://doi.org/10.1016/j.cose.2024.103895\">https://doi.org/10.1016/j.cose.2024.103895</a>","ama":"Janovsky A, Jancar J, Svenda P, Chmielewski Ł, Michalik J, Matyas V. sec-certs: Examining the security certification practice for better vulnerability mitigation. <i>Computers &#38;amp; Security</i>. 2024;143. doi:<a href=\"https://doi.org/10.1016/j.cose.2024.103895\">10.1016/j.cose.2024.103895</a>"},"intvolume":"       143","year":"2024","date_created":"2026-04-30T09:26:34Z","author":[{"last_name":"Janovsky","full_name":"Janovsky, Adam","first_name":"Adam"},{"first_name":"Jan","full_name":"Jancar, Jan","last_name":"Jancar"},{"last_name":"Svenda","full_name":"Svenda, Petr","first_name":"Petr"},{"full_name":"Chmielewski, Łukasz","last_name":"Chmielewski","first_name":"Łukasz"},{"last_name":"Michalik","full_name":"Michalik, Jiri","first_name":"Jiri"},{"full_name":"Matyas, Vashek","last_name":"Matyas","first_name":"Vashek"}],"volume":143,"publisher":"Elsevier BV","date_updated":"2026-04-30T09:32:22Z","doi":"10.1016/j.cose.2024.103895","title":"sec-certs: Examining the security certification practice for better vulnerability mitigation"},{"_id":"62047","department":[{"_id":"300"}],"user_id":"101166","language":[{"iso":"ger"}],"type":"conference_abstract","status":"public","date_updated":"2026-04-30T10:41:25Z","author":[{"last_name":"Reckmann","full_name":"Reckmann, Eileen","id":"101166","first_name":"Eileen"},{"first_name":"Katrin","last_name":"Temmen","id":"30086","full_name":"Temmen, Katrin"}],"date_created":"2025-11-03T10:12:06Z","title":"Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten","conference":{"name":"GDSU-Jahrestagung","start_date":"2024-03-07","end_date":"2024-03-09","location":"Hannover"},"year":"2024","citation":{"ama":"Reckmann E, Temmen K. Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten. In: ; 2024.","apa":"Reckmann, E., &#38; Temmen, K. (2024). <i>Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten</i>. GDSU-Jahrestagung, Hannover.","short":"E. Reckmann, K. Temmen, in: 2024.","bibtex":"@inproceedings{Reckmann_Temmen_2024, title={Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten}, author={Reckmann, Eileen and Temmen, Katrin}, year={2024} }","mla":"Reckmann, Eileen, and Katrin Temmen. <i>Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten</i>. 2024.","ieee":"E. Reckmann and K. Temmen, “Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten,” presented at the GDSU-Jahrestagung, Hannover, 2024.","chicago":"Reckmann, Eileen, and Katrin Temmen. “Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten,” 2024."}},{"abstract":[{"lang":"eng","text":"<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>"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":898697,"file_name":"Böer, Weigelt, Schütz, & Güldenpenning_2024_Practice reduces the costs of producing head fakes in basketball.pdf","file_id":"62114","access_level":"closed","date_updated":"2025-11-06T13:32:52Z","date_created":"2025-11-06T13:32:52Z","creator":"nboeer"}],"publication":"Psychological Research","keyword":["Arts and Humanities (miscellaneous)","Developmental and Educational Psychology","Experimental and Cognitive Psychology","General Medicine"],"ddc":["150","796"],"language":[{"iso":"eng"}],"year":"2024","quality_controlled":"1","title":"Practice reduces the costs of producing head fakes in basketball","publisher":"Springer Science and Business Media LLC","date_created":"2023-10-26T09:57:43Z","status":"public","type":"journal_article","article_type":"original","file_date_updated":"2025-11-06T13:32:52Z","_id":"48484","department":[{"_id":"17"},{"_id":"266"}],"user_id":"52000","page":"523-534","intvolume":"        88","citation":{"ieee":"N. T. Böer, M. Weigelt, C. Schütz, and I. Güldenpenning, “Practice reduces the costs of producing head fakes in basketball,” <i>Psychological Research</i>, vol. 88, pp. 523–534, 2024, doi: <a href=\"https://doi.org/10.1007/s00426-023-01885-x\">10.1007/s00426-023-01885-x</a>.","chicago":"Böer, Nils Tobias, Matthias Weigelt, Christoph Schütz, and Iris Güldenpenning. “Practice Reduces the Costs of Producing Head Fakes in Basketball.” <i>Psychological Research</i> 88 (2024): 523–34. <a href=\"https://doi.org/10.1007/s00426-023-01885-x\">https://doi.org/10.1007/s00426-023-01885-x</a>.","ama":"Böer NT, Weigelt M, Schütz C, Güldenpenning I. Practice reduces the costs of producing head fakes in basketball. <i>Psychological Research</i>. 2024;88:523-534. doi:<a href=\"https://doi.org/10.1007/s00426-023-01885-x\">10.1007/s00426-023-01885-x</a>","bibtex":"@article{Böer_Weigelt_Schütz_Güldenpenning_2024, title={Practice reduces the costs of producing head fakes in basketball}, volume={88}, DOI={<a href=\"https://doi.org/10.1007/s00426-023-01885-x\">10.1007/s00426-023-01885-x</a>}, journal={Psychological Research}, publisher={Springer Science and Business Media LLC}, author={Böer, Nils Tobias and Weigelt, Matthias and Schütz, Christoph and Güldenpenning, Iris}, year={2024}, pages={523–534} }","short":"N.T. Böer, M. Weigelt, C. Schütz, I. Güldenpenning, Psychological Research 88 (2024) 523–534.","mla":"Böer, Nils Tobias, et al. “Practice Reduces the Costs of Producing Head Fakes in Basketball.” <i>Psychological Research</i>, vol. 88, Springer Science and Business Media LLC, 2024, pp. 523–34, doi:<a href=\"https://doi.org/10.1007/s00426-023-01885-x\">10.1007/s00426-023-01885-x</a>.","apa":"Böer, N. T., Weigelt, M., Schütz, C., &#38; Güldenpenning, I. (2024). Practice reduces the costs of producing head fakes in basketball. <i>Psychological Research</i>, <i>88</i>, 523–534. <a href=\"https://doi.org/10.1007/s00426-023-01885-x\">https://doi.org/10.1007/s00426-023-01885-x</a>"},"publication_identifier":{"issn":["0340-0727","1430-2772"]},"has_accepted_license":"1","publication_status":"published","related_material":{"link":[{"relation":"research_data","url":"https://osf.io/svjtz/files"}]},"doi":"10.1007/s00426-023-01885-x","main_file_link":[{"url":"https://link.springer.com/article/10.1007/s00426-023-01885-x","open_access":"1"}],"oa":"1","date_updated":"2026-05-03T11:16:46Z","volume":88,"author":[{"id":"52000","full_name":"Böer, Nils Tobias","orcid":"0000-0002-0236-7282","last_name":"Böer","first_name":"Nils Tobias"},{"last_name":"Weigelt","id":"36388","full_name":"Weigelt, Matthias","first_name":"Matthias"},{"full_name":"Schütz, Christoph","last_name":"Schütz","first_name":"Christoph"},{"first_name":"Iris","last_name":"Güldenpenning","orcid":"0000-0003-0549-5543","id":"52931","full_name":"Güldenpenning, Iris"}]},{"publication":"Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)","type":"conference","abstract":[{"lang":"eng","text":"The Polynomial-Time Hierarchy ($\\mathsf{PH}$) is a staple of classical\r\ncomplexity theory, with applications spanning randomized computation to circuit\r\nlower bounds to ''quantum advantage'' analyses for near-term quantum computers.\r\nQuantumly, however, despite the fact that at least \\emph{four} definitions of\r\nquantum $\\mathsf{PH}$ exist, it has been challenging to prove analogues for\r\nthese of even basic facts from $\\mathsf{PH}$. This work studies three\r\nquantum-verifier based generalizations of $\\mathsf{PH}$, two of which are from\r\n[Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings\r\n($\\mathsf{QCPH}$) and quantum mixed states ($\\mathsf{QPH}$) as proofs, and one\r\nof which is new to this work, utilizing quantum pure states\r\n($\\mathsf{pureQPH}$) as proofs. We first resolve several open problems from\r\n[GSSSY22], including a collapse theorem and a Karp-Lipton theorem for\r\n$\\mathsf{QCPH}$. Then, for our new class $\\mathsf{pureQPH}$, we show one-sided\r\nerror reduction for $\\mathsf{pureQPH}$, as well as the first bounds relating\r\nthese quantum variants of $\\mathsf{PH}$, namely $\\mathsf{QCPH}\\subseteq\r\n\\mathsf{pureQPH} \\subseteq \\mathsf{EXP}^{\\mathsf{PP}}$."}],"status":"public","external_id":{"arxiv":["2401.01633"]},"_id":"50273","user_id":"71541","language":[{"iso":"eng"}],"publication_status":"published","issue":"7","year":"2024","intvolume":"       306","page":"7-17","citation":{"ama":"Agarwal A, Gharibian S, Koppula V, Rudolph D. Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. In: <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>. Vol 306. ; 2024:7-17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>","ieee":"A. Agarwal, S. Gharibian, V. Koppula, and D. Rudolph, “Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds,” in <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, 2024, vol. 306, no. 7, pp. 7–17, doi: <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>.","chicago":"Agarwal, Avantika, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” In <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, 306:7–17, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">https://doi.org/10.4230/LIPIcs.MFCS.2024.7</a>.","bibtex":"@inproceedings{Agarwal_Gharibian_Koppula_Rudolph_2024, title={Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds}, volume={306}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>}, number={7}, booktitle={Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)}, author={Agarwal, Avantika and Gharibian, Sevag and Koppula, Venkata and Rudolph, Dorian}, year={2024}, pages={7–17} }","short":"A. Agarwal, S. Gharibian, V. Koppula, D. Rudolph, in: Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2024, pp. 7–17.","mla":"Agarwal, Avantika, et al. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, vol. 306, no. 7, 2024, pp. 7–17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">10.4230/LIPIcs.MFCS.2024.7</a>.","apa":"Agarwal, A., Gharibian, S., Koppula, V., &#38; Rudolph, D. (2024). Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. <i>Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)</i>, <i>306</i>(7), 7–17. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2024.7\">https://doi.org/10.4230/LIPIcs.MFCS.2024.7</a>"},"date_updated":"2026-04-30T14:10:19Z","volume":306,"author":[{"full_name":"Agarwal, Avantika","last_name":"Agarwal","first_name":"Avantika"},{"orcid":"0000-0002-9992-3379","last_name":"Gharibian","full_name":"Gharibian, Sevag","id":"71541","first_name":"Sevag"},{"first_name":"Venkata","full_name":"Koppula, Venkata","last_name":"Koppula"},{"id":"57863","full_name":"Rudolph, Dorian","last_name":"Rudolph","first_name":"Dorian"}],"date_created":"2024-01-07T20:09:32Z","title":"Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds","doi":"10.4230/LIPIcs.MFCS.2024.7"}]