[{"publication":"Electronic Markets","type":"journal_article","status":"public","department":[{"_id":"792"}],"user_id":"98948","_id":"49460","language":[{"iso":"eng"}],"intvolume":"        31","page":"829-848","citation":{"ieee":"K. Masuch, M. Greve, and S. T.-N. Trang, “What to do after a data breach? Examining apology and compensation as response strategies for health service providers,” <i>Electronic Markets</i>, vol. 31, pp. 829–848, 2022.","chicago":"Masuch, K., M. Greve, and Simon Thanh-Nam Trang. “What to Do after a Data Breach? Examining Apology and Compensation as Response Strategies for Health Service Providers.” <i>Electronic Markets</i> 31 (2022): 829–48.","ama":"Masuch K, Greve M, Trang ST-N. What to do after a data breach? Examining apology and compensation as response strategies for health service providers. <i>Electronic Markets</i>. 2022;31:829-848.","mla":"Masuch, K., et al. “What to Do after a Data Breach? Examining Apology and Compensation as Response Strategies for Health Service Providers.” <i>Electronic Markets</i>, vol. 31, 2022, pp. 829–48.","bibtex":"@article{Masuch_Greve_Trang_2022, title={What to do after a data breach? Examining apology and compensation as response strategies for health service providers}, volume={31}, journal={Electronic Markets}, author={Masuch, K. and Greve, M. and Trang, Simon Thanh-Nam}, year={2022}, pages={829–848} }","short":"K. Masuch, M. Greve, S.T.-N. Trang, Electronic Markets 31 (2022) 829–848.","apa":"Masuch, K., Greve, M., &#38; Trang, S. T.-N. (2022). What to do after a data breach? Examining apology and compensation as response strategies for health service providers. <i>Electronic Markets</i>, <i>31</i>, 829–848."},"year":"2022","volume":31,"author":[{"first_name":"K.","full_name":"Masuch, K.","last_name":"Masuch"},{"first_name":"M.","full_name":"Greve, M.","last_name":"Greve"},{"id":"98948","full_name":"Trang, Simon Thanh-Nam","last_name":"Trang","orcid":"0000-0002-4784-4038","first_name":"Simon Thanh-Nam"}],"date_created":"2023-12-04T13:37:36Z","date_updated":"2024-06-04T09:50:51Z","title":"What to do after a data breach? Examining apology and compensation as response strategies for health service providers"},{"status":"public","type":"journal_article","publication":"Computers & Security","language":[{"iso":"eng"}],"_id":"49459","user_id":"98948","department":[{"_id":"792"}],"year":"2022","citation":{"apa":"Masuch, K., Greve, M., &#38; Trang, S. T.-N. (2022). Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies. <i>Computers &#38; Security</i>, <i>12</i>.","short":"K. Masuch, M. Greve, S.T.-N. Trang, Computers &#38; Security 12 (2022).","bibtex":"@article{Masuch_Greve_Trang_2022, title={Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies}, volume={12}, journal={Computers &#38; Security}, author={Masuch, K. and Greve, M. and Trang, Simon Thanh-Nam}, year={2022} }","mla":"Masuch, K., et al. “Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies.” <i>Computers &#38; Security</i>, vol. 12, 2022.","ama":"Masuch K, Greve M, Trang ST-N. Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies. <i>Computers &#38; Security</i>. 2022;12.","ieee":"K. Masuch, M. Greve, and S. T.-N. Trang, “Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies,” <i>Computers &#38; Security</i>, vol. 12, 2022.","chicago":"Masuch, K., M. Greve, and Simon Thanh-Nam Trang. “Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies.” <i>Computers &#38; Security</i> 12 (2022)."},"intvolume":"        12","title":"Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies","date_updated":"2024-06-04T09:50:12Z","author":[{"first_name":"K.","full_name":"Masuch, K.","last_name":"Masuch"},{"full_name":"Greve, M.","last_name":"Greve","first_name":"M."},{"first_name":"Simon Thanh-Nam","orcid":"0000-0002-4784-4038","last_name":"Trang","id":"98948","full_name":"Trang, Simon Thanh-Nam"}],"date_created":"2023-12-04T13:37:24Z","volume":12},{"date_created":"2024-06-04T12:21:30Z","author":[{"last_name":"Manzoor","id":"77309","full_name":"Manzoor, Ali","first_name":"Ali"},{"first_name":"Muhammad","full_name":"Saleem, Muhammad","last_name":"Saleem"},{"first_name":"Axel-Cyrille","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo"}],"publisher":"Springer International Publishing","date_updated":"2024-06-04T12:24:49Z","doi":"10.1007/978-3-031-19433-7_37","title":"REBench: Microbenchmarking Framework for Relation Extraction Systems","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031194320","9783031194337"]},"publication_status":"published","citation":{"short":"A. Manzoor, M. Saleem, A.-C. Ngonga Ngomo, in: The Semantic Web – ISWC 2022, Springer International Publishing, Cham, 2022.","bibtex":"@inbook{Manzoor_Saleem_Ngonga Ngomo_2022, place={Cham}, title={REBench: Microbenchmarking Framework for Relation Extraction Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-19433-7_37\">10.1007/978-3-031-19433-7_37</a>}, booktitle={The Semantic Web – ISWC 2022}, publisher={Springer International Publishing}, author={Manzoor, Ali and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, year={2022} }","mla":"Manzoor, Ali, et al. “REBench: Microbenchmarking Framework for Relation Extraction Systems.” <i>The Semantic Web – ISWC 2022</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-031-19433-7_37\">10.1007/978-3-031-19433-7_37</a>.","apa":"Manzoor, A., Saleem, M., &#38; Ngonga Ngomo, A.-C. (2022). REBench: Microbenchmarking Framework for Relation Extraction Systems. In <i>The Semantic Web – ISWC 2022</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-19433-7_37\">https://doi.org/10.1007/978-3-031-19433-7_37</a>","chicago":"Manzoor, Ali, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “REBench: Microbenchmarking Framework for Relation Extraction Systems.” In <i>The Semantic Web – ISWC 2022</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-19433-7_37\">https://doi.org/10.1007/978-3-031-19433-7_37</a>.","ieee":"A. Manzoor, M. Saleem, and A.-C. Ngonga Ngomo, “REBench: Microbenchmarking Framework for Relation Extraction Systems,” in <i>The Semantic Web – ISWC 2022</i>, Cham: Springer International Publishing, 2022.","ama":"Manzoor A, Saleem M, Ngonga Ngomo A-C. REBench: Microbenchmarking Framework for Relation Extraction Systems. In: <i>The Semantic Web – ISWC 2022</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-031-19433-7_37\">10.1007/978-3-031-19433-7_37</a>"},"place":"Cham","year":"2022","department":[{"_id":"574"}],"user_id":"77309","_id":"54585","language":[{"iso":"eng"}],"publication":"The Semantic Web – ISWC 2022","type":"book_chapter","status":"public"},{"language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Artificial Intelligence"],"abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Dependence Logic was introduced by Jouko Väänänen in 2007. We study a propositional variant of this logic<jats:italic>(PDL)</jats:italic>and investigate a variety of parameterisations with respect to central decision problems. The model checking problem (MC) of<jats:italic>PDL</jats:italic>is<jats:bold>NP</jats:bold>-complete (Ebbing and Lohmann, SOFSEM 2012). The subject of this research is to identify a list of parameterisations (formula-size, formula-depth, treewidth, team-size, number of variables) under which MC becomes fixed-parameter tractable. Furthermore, we show that the number of disjunctions or the arity of dependence atoms (dep-arity) as a parameter both yield a paraNP-completeness result. Then, we consider the satisfiability problem (SAT) which classically is known to be<jats:bold>NP</jats:bold>-complete as well (Lohmann and Vollmer, Studia Logica 2013). There we are presenting a different picture: under team-size, or dep-arity SAT is<jats:bold>paraNP</jats:bold>-complete whereas under all other mentioned parameters the problem is<jats:bold>FPT</jats:bold>. Finally, we introduce a variant of the satisfiability problem, asking for a team of a given size, and show for this problem an almost complete picture.</jats:p>","lang":"eng"}],"publication":"Annals of Mathematics and Artificial Intelligence","title":"Parameterised complexity of model checking and satisfiability in propositional dependence logic","date_created":"2023-07-03T11:45:39Z","publisher":"Springer Science and Business Media LLC","year":"2022","issue":"2-3","extern":"1","user_id":"99353","_id":"45849","status":"public","type":"journal_article","doi":"10.1007/s10472-021-09730-w","author":[{"last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353","first_name":"Yasir"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"}],"volume":90,"date_updated":"2024-06-04T16:06:59Z","citation":{"ieee":"Y. Mahmood and A. Meier, “Parameterised complexity of model checking and satisfiability in propositional dependence logic,” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 90, no. 2–3, pp. 271–296, 2022, doi: <a href=\"https://doi.org/10.1007/s10472-021-09730-w\">10.1007/s10472-021-09730-w</a>.","chicago":"Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” <i>Annals of Mathematics and Artificial Intelligence</i> 90, no. 2–3 (2022): 271–96. <a href=\"https://doi.org/10.1007/s10472-021-09730-w\">https://doi.org/10.1007/s10472-021-09730-w</a>.","ama":"Mahmood Y, Meier A. Parameterised complexity of model checking and satisfiability in propositional dependence logic. <i>Annals of Mathematics and Artificial Intelligence</i>. 2022;90(2-3):271-296. doi:<a href=\"https://doi.org/10.1007/s10472-021-09730-w\">10.1007/s10472-021-09730-w</a>","bibtex":"@article{Mahmood_Meier_2022, title={Parameterised complexity of model checking and satisfiability in propositional dependence logic}, volume={90}, DOI={<a href=\"https://doi.org/10.1007/s10472-021-09730-w\">10.1007/s10472-021-09730-w</a>}, number={2–3}, journal={Annals of Mathematics and Artificial Intelligence}, publisher={Springer Science and Business Media LLC}, author={Mahmood, Yasir and Meier, Arne}, year={2022}, pages={271–296} }","mla":"Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 90, no. 2–3, Springer Science and Business Media LLC, 2022, pp. 271–96, doi:<a href=\"https://doi.org/10.1007/s10472-021-09730-w\">10.1007/s10472-021-09730-w</a>.","short":"Y. Mahmood, A. Meier, Annals of Mathematics and Artificial Intelligence 90 (2022) 271–296.","apa":"Mahmood, Y., &#38; Meier, A. (2022). Parameterised complexity of model checking and satisfiability in propositional dependence logic. <i>Annals of Mathematics and Artificial Intelligence</i>, <i>90</i>(2–3), 271–296. <a href=\"https://doi.org/10.1007/s10472-021-09730-w\">https://doi.org/10.1007/s10472-021-09730-w</a>"},"intvolume":"        90","page":"271-296","publication_status":"published","publication_identifier":{"issn":["1012-2443","1573-7470"]}},{"title":"A parameterized view on the complexity of dependence and independence logic","publisher":"Oxford University Press (OUP)","date_created":"2023-07-03T11:36:55Z","year":"2022","issue":"8","keyword":["Logic","Hardware and Architecture","Arts and Humanities (miscellaneous)","Software","Theoretical Computer Science"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>In this paper, we investigate the parameterized complexity of model checking for Dependence and Independence logic, which are well studied logics in the area of Team Semantics. We start with a list of nine immediate parameterizations for this problem, namely the number of disjunctions (i.e. splits)/(free) variables/universal quantifiers, formula-size, the tree-width of the Gaifman graph of the input structure, the size of the universe/team and the arity of dependence atoms. We present a comprehensive picture of the parameterized complexity of model checking and obtain a division of the problem into tractable and various intractable degrees. Furthermore, we also consider the complexity of the most important variants (data and expression complexity) of the model checking problem by fixing parts of the input.</jats:p>"}],"publication":"Journal of Logic and Computation","doi":"10.1093/logcom/exac070","date_updated":"2024-06-04T16:06:37Z","volume":32,"author":[{"full_name":"Kontinen, Juha","last_name":"Kontinen","first_name":"Juha"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"},{"first_name":"Yasir","last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir"}],"intvolume":"        32","page":"1624-1644","citation":{"ama":"Kontinen J, Meier A, Mahmood Y. A parameterized view on the complexity of dependence and independence logic. <i>Journal of Logic and Computation</i>. 2022;32(8):1624-1644. doi:<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>","chicago":"Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on the Complexity of Dependence and Independence Logic.” <i>Journal of Logic and Computation</i> 32, no. 8 (2022): 1624–44. <a href=\"https://doi.org/10.1093/logcom/exac070\">https://doi.org/10.1093/logcom/exac070</a>.","ieee":"J. Kontinen, A. Meier, and Y. Mahmood, “A parameterized view on the complexity of dependence and independence logic,” <i>Journal of Logic and Computation</i>, vol. 32, no. 8, pp. 1624–1644, 2022, doi: <a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>.","apa":"Kontinen, J., Meier, A., &#38; Mahmood, Y. (2022). A parameterized view on the complexity of dependence and independence logic. <i>Journal of Logic and Computation</i>, <i>32</i>(8), 1624–1644. <a href=\"https://doi.org/10.1093/logcom/exac070\">https://doi.org/10.1093/logcom/exac070</a>","bibtex":"@article{Kontinen_Meier_Mahmood_2022, title={A parameterized view on the complexity of dependence and independence logic}, volume={32}, DOI={<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>}, number={8}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2022}, pages={1624–1644} }","mla":"Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence and Independence Logic.” <i>Journal of Logic and Computation</i>, vol. 32, no. 8, Oxford University Press (OUP), 2022, pp. 1624–44, doi:<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>.","short":"J. Kontinen, A. Meier, Y. Mahmood, Journal of Logic and Computation 32 (2022) 1624–1644."},"publication_identifier":{"issn":["0955-792X","1465-363X"]},"publication_status":"published","extern":"1","_id":"45847","user_id":"99353","status":"public","type":"journal_article"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030930998","9783030931001"]},"place":"Cham","year":"2022","citation":{"bibtex":"@inproceedings{Kontinen_Meier_Mahmood_2022, place={Cham}, title={A Parameterized View on the Complexity of Dependence Logic}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">10.1007/978-3-030-93100-1_9</a>}, booktitle={Logical Foundations of Computer Science}, publisher={Springer International Publishing}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2022} }","short":"J. Kontinen, A. Meier, Y. Mahmood, in: Logical Foundations of Computer Science, Springer International Publishing, Cham, 2022.","mla":"Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence Logic.” <i>Logical Foundations of Computer Science</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">10.1007/978-3-030-93100-1_9</a>.","apa":"Kontinen, J., Meier, A., &#38; Mahmood, Y. (2022). A Parameterized View on the Complexity of Dependence Logic. <i>Logical Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">https://doi.org/10.1007/978-3-030-93100-1_9</a>","ieee":"J. Kontinen, A. Meier, and Y. Mahmood, “A Parameterized View on the Complexity of Dependence Logic,” 2022, doi: <a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">10.1007/978-3-030-93100-1_9</a>.","chicago":"Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on the Complexity of Dependence Logic.” In <i>Logical Foundations of Computer Science</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">https://doi.org/10.1007/978-3-030-93100-1_9</a>.","ama":"Kontinen J, Meier A, Mahmood Y. A Parameterized View on the Complexity of Dependence Logic. In: <i>Logical Foundations of Computer Science</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">10.1007/978-3-030-93100-1_9</a>"},"publisher":"Springer International Publishing","date_updated":"2024-06-04T16:06:49Z","date_created":"2023-07-03T11:36:33Z","author":[{"first_name":"Juha","last_name":"Kontinen","full_name":"Kontinen, Juha"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"},{"first_name":"Yasir","id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood"}],"title":"A Parameterized View on the Complexity of Dependence Logic","doi":"10.1007/978-3-030-93100-1_9","type":"conference","publication":"Logical Foundations of Computer Science","status":"public","_id":"45846","user_id":"99353","language":[{"iso":"eng"}],"extern":"1"},{"citation":{"apa":"Huaman, N., Krause, A., Wermke, D., Klemmer, J. H., Stransky, C., Acar, Y., &#38; Fahl, S. (2022). If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers. In S. Chiasson &#38; A. Kapadia (Eds.), <i>Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022</i> (pp. 313–330). USENIX Association.","ama":"Huaman N, Krause A, Wermke D, et al. If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers. In: Chiasson S, Kapadia A, eds. <i>Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022</i>. USENIX Association; 2022:313–330.","short":"N. Huaman, A. Krause, D. Wermke, J.H. Klemmer, C. Stransky, Y. Acar, S. Fahl, in: S. Chiasson, A. Kapadia (Eds.), Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022, USENIX Association, 2022, pp. 313–330.","mla":"Huaman, Nicolas, et al. “If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers.” <i>Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022</i>, edited by Sonia Chiasson and Apu Kapadia, USENIX Association, 2022, pp. 313–330.","bibtex":"@inproceedings{Huaman_Krause_Wermke_Klemmer_Stransky_Acar_Fahl_2022, title={If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers}, booktitle={Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022}, publisher={USENIX Association}, author={Huaman, Nicolas and Krause, Alexander and Wermke, Dominik and Klemmer, Jan H. and Stransky, Christian and Acar, Yasemin and Fahl, Sascha}, editor={Chiasson, Sonia and Kapadia, Apu}, year={2022}, pages={313–330} }","ieee":"N. Huaman <i>et al.</i>, “If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers,” in <i>Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022</i>, 2022, pp. 313–330.","chicago":"Huaman, Nicolas, Alexander Krause, Dominik Wermke, Jan H. Klemmer, Christian Stransky, Yasemin Acar, and Sascha Fahl. “If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers.” In <i>Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022</i>, edited by Sonia Chiasson and Apu Kapadia, 313–330. USENIX Association, 2022."},"page":"313–330","year":"2022","title":"If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers","date_created":"2023-09-22T13:21:22Z","author":[{"last_name":"Huaman","full_name":"Huaman, Nicolas","first_name":"Nicolas"},{"last_name":"Krause","full_name":"Krause, Alexander","first_name":"Alexander"},{"full_name":"Wermke, Dominik","last_name":"Wermke","first_name":"Dominik"},{"last_name":"Klemmer","full_name":"Klemmer, Jan H.","first_name":"Jan H."},{"first_name":"Christian","full_name":"Stransky, Christian","last_name":"Stransky"},{"last_name":"Acar","id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin"},{"last_name":"Fahl","full_name":"Fahl, Sascha","first_name":"Sascha"}],"publisher":"USENIX Association","date_updated":"2024-06-05T12:52:28Z","status":"public","editor":[{"first_name":"Sonia","full_name":"Chiasson, Sonia","last_name":"Chiasson"},{"full_name":"Kapadia, Apu","last_name":"Kapadia","first_name":"Apu"}],"type":"conference","publication":"Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022","extern":"1","language":[{"iso":"eng"}],"user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"_id":"47289"},{"extern":"1","language":[{"iso":"eng"}],"department":[{"_id":"858"}],"user_id":"14931","_id":"47844","status":"public","publication":"2022 IEEE Symposium on Security and Privacy (SP)","type":"conference","doi":"10.1109/sp46214.2022.9833713","title":"“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks","author":[{"last_name":"Jancar","full_name":"Jancar, Jan","first_name":"Jan"},{"first_name":"Marcel","id":"99291","full_name":"Fourné, Marcel","last_name":"Fourné"},{"first_name":"Daniel De Almeida","last_name":"Braga","full_name":"Braga, Daniel De Almeida"},{"first_name":"Mohamed","full_name":"Sabt, Mohamed","last_name":"Sabt"},{"first_name":"Peter","full_name":"Schwabe, Peter","last_name":"Schwabe"},{"first_name":"Gilles","full_name":"Barthe, Gilles","last_name":"Barthe"},{"full_name":"Fouque, Pierre-Alain","last_name":"Fouque","first_name":"Pierre-Alain"},{"first_name":"Yasemin","last_name":"Acar","id":"94636","full_name":"Acar, Yasemin"}],"date_created":"2023-10-06T16:12:30Z","publisher":"IEEE","date_updated":"2024-06-05T12:55:00Z","citation":{"apa":"Jancar, J., Fourné, M., Braga, D. D. A., Sabt, M., Schwabe, P., Barthe, G., Fouque, P.-A., &#38; Acar, Y. (2022). “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">https://doi.org/10.1109/sp46214.2022.9833713</a>","mla":"Jancar, Jan, et al. “‘They’re Not That Hard to Mitigate’: What Cryptographic Library Developers Think About Timing Attacks.” <i>2022 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">10.1109/sp46214.2022.9833713</a>.","short":"J. Jancar, M. Fourné, D.D.A. Braga, M. Sabt, P. Schwabe, G. Barthe, P.-A. Fouque, Y. Acar, in: 2022 IEEE Symposium on Security and Privacy (SP), IEEE, 2022.","bibtex":"@inproceedings{Jancar_Fourné_Braga_Sabt_Schwabe_Barthe_Fouque_Acar_2022, title={“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks}, DOI={<a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">10.1109/sp46214.2022.9833713</a>}, booktitle={2022 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Jancar, Jan and Fourné, Marcel and Braga, Daniel De Almeida and Sabt, Mohamed and Schwabe, Peter and Barthe, Gilles and Fouque, Pierre-Alain and Acar, Yasemin}, year={2022} }","ama":"Jancar J, Fourné M, Braga DDA, et al. “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. In: <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">10.1109/sp46214.2022.9833713</a>","ieee":"J. Jancar <i>et al.</i>, “‘They’re not that hard to mitigate’: What Cryptographic Library Developers Think About Timing Attacks,” 2022, doi: <a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">10.1109/sp46214.2022.9833713</a>.","chicago":"Jancar, Jan, Marcel Fourné, Daniel De Almeida Braga, Mohamed Sabt, Peter Schwabe, Gilles Barthe, Pierre-Alain Fouque, and Yasemin Acar. “‘They’re Not That Hard to Mitigate’: What Cryptographic Library Developers Think About Timing Attacks.” In <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">https://doi.org/10.1109/sp46214.2022.9833713</a>."},"year":"2022","publication_status":"published"},{"citation":{"short":"M. Gutfleisch, J.H. Klemmer, N. Busch, Y. Acar, M.A. Sasse, S. Fahl, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 893–910.","bibtex":"@inproceedings{Gutfleisch_Klemmer_Busch_Acar_Sasse_Fahl_2022, title={How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study}, DOI={<a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">10.1109/SP46214.2022.9833756</a>}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Gutfleisch, Marco and Klemmer, Jan H. and Busch, Niklas and Acar, Yasemin and Sasse, M. Angela and Fahl, Sascha}, year={2022}, pages={893–910} }","mla":"Gutfleisch, Marco, et al. “How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study.” <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, IEEE, 2022, pp. 893–910, doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">10.1109/SP46214.2022.9833756</a>.","apa":"Gutfleisch, M., Klemmer, J. H., Busch, N., Acar, Y., Sasse, M. A., &#38; Fahl, S. (2022). How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study. <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 893–910. <a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">https://doi.org/10.1109/SP46214.2022.9833756</a>","chicago":"Gutfleisch, Marco, Jan H. Klemmer, Niklas Busch, Yasemin Acar, M. Angela Sasse, and Sascha Fahl. “How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study.” In <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 893–910. IEEE, 2022. <a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">https://doi.org/10.1109/SP46214.2022.9833756</a>.","ieee":"M. Gutfleisch, J. H. Klemmer, N. Busch, Y. Acar, M. A. Sasse, and S. Fahl, “How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study,” in <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2022, pp. 893–910, doi: <a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">10.1109/SP46214.2022.9833756</a>.","ama":"Gutfleisch M, Klemmer JH, Busch N, Acar Y, Sasse MA, Fahl S. How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study. In: <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>. IEEE; 2022:893–910. doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">10.1109/SP46214.2022.9833756</a>"},"page":"893–910","year":"2022","date_created":"2023-09-22T13:18:54Z","author":[{"last_name":"Gutfleisch","full_name":"Gutfleisch, Marco","first_name":"Marco"},{"last_name":"Klemmer","full_name":"Klemmer, Jan H.","first_name":"Jan H."},{"last_name":"Busch","full_name":"Busch, Niklas","first_name":"Niklas"},{"first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin","id":"94636"},{"first_name":"M. Angela","last_name":"Sasse","full_name":"Sasse, M. Angela"},{"first_name":"Sascha","full_name":"Fahl, Sascha","last_name":"Fahl"}],"date_updated":"2024-06-05T12:53:00Z","publisher":"IEEE","doi":"10.1109/SP46214.2022.9833756","title":"How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study","type":"conference","publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","status":"public","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"_id":"47286","language":[{"iso":"eng"}],"extern":"1"},{"language":[{"iso":"eng"}],"extern":"1","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"_id":"47287","status":"public","type":"conference","publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","doi":"10.1109/SP46214.2022.9833755","title":"27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University","author":[{"first_name":"Christian","last_name":"Stransky","full_name":"Stransky, Christian"},{"last_name":"Wiese","full_name":"Wiese, Oliver","first_name":"Oliver"},{"first_name":"Volker","full_name":"Roth, Volker","last_name":"Roth"},{"last_name":"Acar","id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"date_created":"2023-09-22T13:19:56Z","date_updated":"2024-06-05T12:53:20Z","publisher":"IEEE","citation":{"ama":"Stransky C, Wiese O, Roth V, Acar Y, Fahl S. 27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University. In: <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>. IEEE; 2022:860–875. doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">10.1109/SP46214.2022.9833755</a>","chicago":"Stransky, Christian, Oliver Wiese, Volker Roth, Yasemin Acar, and Sascha Fahl. “27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University.” In <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 860–875. IEEE, 2022. <a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">https://doi.org/10.1109/SP46214.2022.9833755</a>.","ieee":"C. Stransky, O. Wiese, V. Roth, Y. Acar, and S. Fahl, “27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University,” in <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2022, pp. 860–875, doi: <a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">10.1109/SP46214.2022.9833755</a>.","apa":"Stransky, C., Wiese, O., Roth, V., Acar, Y., &#38; Fahl, S. (2022). 27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University. <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 860–875. <a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">https://doi.org/10.1109/SP46214.2022.9833755</a>","mla":"Stransky, Christian, et al. “27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University.” <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, IEEE, 2022, pp. 860–875, doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">10.1109/SP46214.2022.9833755</a>.","short":"C. Stransky, O. Wiese, V. Roth, Y. Acar, S. Fahl, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 860–875.","bibtex":"@inproceedings{Stransky_Wiese_Roth_Acar_Fahl_2022, title={27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University}, DOI={<a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">10.1109/SP46214.2022.9833755</a>}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Stransky, Christian and Wiese, Oliver and Roth, Volker and Acar, Yasemin and Fahl, Sascha}, year={2022}, pages={860–875} }"},"page":"860–875","year":"2022"},{"date_updated":"2024-06-05T12:53:43Z","publisher":"USENIX Association","date_created":"2023-09-22T13:17:23Z","author":[{"full_name":"Kaur, Harjot","last_name":"Kaur","first_name":"Harjot"},{"last_name":"Amft","full_name":"Amft, Sabrina","first_name":"Sabrina"},{"full_name":"Votipka, Daniel","last_name":"Votipka","first_name":"Daniel"},{"last_name":"Acar","full_name":"Acar, Yasemin","id":"94636","first_name":"Yasemin"},{"first_name":"Sascha","last_name":"Fahl","full_name":"Fahl, Sascha"}],"title":"Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples","year":"2022","page":"4041–4058","citation":{"chicago":"Kaur, Harjot, Sabrina Amft, Daniel Votipka, Yasemin Acar, and Sascha Fahl. “Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples.” In <i>31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022</i>, edited by Kevin R. B. Butler and Kurt Thomas, 4041–4058. USENIX Association, 2022.","ieee":"H. Kaur, S. Amft, D. Votipka, Y. Acar, and S. Fahl, “Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples,” in <i>31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022</i>, 2022, pp. 4041–4058.","apa":"Kaur, H., Amft, S., Votipka, D., Acar, Y., &#38; Fahl, S. (2022). Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples. In K. R. B. Butler &#38; K. Thomas (Eds.), <i>31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022</i> (pp. 4041–4058). USENIX Association.","ama":"Kaur H, Amft S, Votipka D, Acar Y, Fahl S. Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples. In: Butler KRB, Thomas K, eds. <i>31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022</i>. USENIX Association; 2022:4041–4058.","mla":"Kaur, Harjot, et al. “Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples.” <i>31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022</i>, edited by Kevin R. B. Butler and Kurt Thomas, USENIX Association, 2022, pp. 4041–4058.","short":"H. Kaur, S. Amft, D. Votipka, Y. Acar, S. Fahl, in: K.R.B. Butler, K. Thomas (Eds.), 31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022, USENIX Association, 2022, pp. 4041–4058.","bibtex":"@inproceedings{Kaur_Amft_Votipka_Acar_Fahl_2022, title={Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples}, booktitle={31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022}, publisher={USENIX Association}, author={Kaur, Harjot and Amft, Sabrina and Votipka, Daniel and Acar, Yasemin and Fahl, Sascha}, editor={Butler, Kevin R. B. and Thomas, Kurt}, year={2022}, pages={4041–4058} }"},"_id":"47283","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","language":[{"iso":"eng"}],"extern":"1","publication":"31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022","type":"conference","editor":[{"first_name":"Kevin R. B.","full_name":"Butler, Kevin R. B.","last_name":"Butler"},{"first_name":"Kurt","last_name":"Thomas","full_name":"Thomas, Kurt"}],"status":"public"},{"author":[{"first_name":"Nicolas","last_name":"Huaman","full_name":"Huaman, Nicolas"},{"full_name":"Amft, Sabrina","last_name":"Amft","first_name":"Sabrina"},{"last_name":"Oltrogge","full_name":"Oltrogge, Marten","first_name":"Marten"},{"last_name":"Acar","id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin"},{"last_name":"Fahl","full_name":"Fahl, Sascha","first_name":"Sascha"}],"date_created":"2023-09-22T13:22:05Z","volume":20,"date_updated":"2024-06-05T12:54:05Z","doi":"10.1109/MSEC.2021.3123795","title":"They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web","issue":"2","citation":{"mla":"Huaman, Nicolas, et al. “They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web.” <i>IEEE Secur. Priv.</i>, vol. 20, no. 2, 2022, pp. 49–60, doi:<a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">10.1109/MSEC.2021.3123795</a>.","bibtex":"@article{Huaman_Amft_Oltrogge_Acar_Fahl_2022, title={They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web}, volume={20}, DOI={<a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">10.1109/MSEC.2021.3123795</a>}, number={2}, journal={IEEE Secur. Priv.}, author={Huaman, Nicolas and Amft, Sabrina and Oltrogge, Marten and Acar, Yasemin and Fahl, Sascha}, year={2022}, pages={49–60} }","short":"N. Huaman, S. Amft, M. Oltrogge, Y. Acar, S. Fahl, IEEE Secur. Priv. 20 (2022) 49–60.","apa":"Huaman, N., Amft, S., Oltrogge, M., Acar, Y., &#38; Fahl, S. (2022). They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web. <i>IEEE Secur. Priv.</i>, <i>20</i>(2), 49–60. <a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">https://doi.org/10.1109/MSEC.2021.3123795</a>","ama":"Huaman N, Amft S, Oltrogge M, Acar Y, Fahl S. They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web. <i>IEEE Secur Priv</i>. 2022;20(2):49–60. doi:<a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">10.1109/MSEC.2021.3123795</a>","chicago":"Huaman, Nicolas, Sabrina Amft, Marten Oltrogge, Yasemin Acar, and Sascha Fahl. “They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web.” <i>IEEE Secur. Priv.</i> 20, no. 2 (2022): 49–60. <a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">https://doi.org/10.1109/MSEC.2021.3123795</a>.","ieee":"N. Huaman, S. Amft, M. Oltrogge, Y. Acar, and S. Fahl, “They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web,” <i>IEEE Secur. Priv.</i>, vol. 20, no. 2, pp. 49–60, 2022, doi: <a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">10.1109/MSEC.2021.3123795</a>."},"intvolume":"        20","page":"49–60","year":"2022","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"_id":"47290","language":[{"iso":"eng"}],"extern":"1","type":"journal_article","publication":"IEEE Secur. Priv.","status":"public"},{"doi":"10.1109/sp46214.2022.9833686","title":"Committed to Trust: A Qualitative Study on Security &amp; Trust in Open Source Software Projects","author":[{"full_name":"Wermke, Dominik","last_name":"Wermke","first_name":"Dominik"},{"last_name":"Wohler","full_name":"Wohler, Noah","first_name":"Noah"},{"last_name":"Klemmer","full_name":"Klemmer, Jan H.","first_name":"Jan H."},{"last_name":"Fourné","full_name":"Fourné, Marcel","id":"99291","first_name":"Marcel"},{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"last_name":"Fahl","full_name":"Fahl, Sascha","first_name":"Sascha"}],"date_created":"2023-10-06T16:12:18Z","date_updated":"2024-06-05T12:55:32Z","publisher":"IEEE","citation":{"apa":"Wermke, D., Wohler, N., Klemmer, J. H., Fourné, M., Acar, Y., &#38; Fahl, S. (2022). Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects. <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">https://doi.org/10.1109/sp46214.2022.9833686</a>","ama":"Wermke D, Wohler N, Klemmer JH, Fourné M, Acar Y, Fahl S. Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects. In: <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">10.1109/sp46214.2022.9833686</a>","mla":"Wermke, Dominik, et al. “Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects.” <i>2022 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">10.1109/sp46214.2022.9833686</a>.","short":"D. Wermke, N. Wohler, J.H. Klemmer, M. Fourné, Y. Acar, S. Fahl, in: 2022 IEEE Symposium on Security and Privacy (SP), IEEE, 2022.","bibtex":"@inproceedings{Wermke_Wohler_Klemmer_Fourné_Acar_Fahl_2022, title={Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects}, DOI={<a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">10.1109/sp46214.2022.9833686</a>}, booktitle={2022 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Wermke, Dominik and Wohler, Noah and Klemmer, Jan H. and Fourné, Marcel and Acar, Yasemin and Fahl, Sascha}, year={2022} }","ieee":"D. Wermke, N. Wohler, J. H. Klemmer, M. Fourné, Y. Acar, and S. Fahl, “Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects,” 2022, doi: <a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">10.1109/sp46214.2022.9833686</a>.","chicago":"Wermke, Dominik, Noah Wohler, Jan H. Klemmer, Marcel Fourné, Yasemin Acar, and Sascha Fahl. “Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects.” In <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">https://doi.org/10.1109/sp46214.2022.9833686</a>."},"year":"2022","publication_status":"published","language":[{"iso":"eng"}],"extern":"1","user_id":"14931","department":[{"_id":"858"}],"_id":"47843","status":"public","type":"conference","publication":"2022 IEEE Symposium on Security and Privacy (SP)"},{"_id":"47288","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"language":[{"iso":"eng"}],"extern":"1","type":"conference","publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","status":"public","date_updated":"2024-06-05T13:20:54Z","publisher":"IEEE","author":[{"last_name":"Jancar","full_name":"Jancar, Jan","first_name":"Jan"},{"last_name":"Fourné","full_name":"Fourné, Marcel","first_name":"Marcel"},{"full_name":"Braga, Daniel De Almeida","last_name":"Braga","first_name":"Daniel De Almeida"},{"full_name":"Sabt, Mohamed","last_name":"Sabt","first_name":"Mohamed"},{"first_name":"Peter","full_name":"Schwabe, Peter","last_name":"Schwabe"},{"full_name":"Barthe, Gilles","last_name":"Barthe","first_name":"Gilles"},{"full_name":"Fouque, Pierre-Alain","last_name":"Fouque","first_name":"Pierre-Alain"},{"first_name":"Yasemin","id":"94636","full_name":"Acar, Yasemin","last_name":"Acar"}],"date_created":"2023-09-22T13:20:28Z","title":"\"They’re not that hard to mitigate\": What Cryptographic Library Developers Think About Timing Attacks","doi":"10.1109/SP46214.2022.9833713","year":"2022","citation":{"ama":"Jancar J, Fourné M, Braga DDA, et al. “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. In: <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>. IEEE; 2022:632–649. doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">10.1109/SP46214.2022.9833713</a>","ieee":"J. Jancar <i>et al.</i>, “‘They’re not that hard to mitigate’: What Cryptographic Library Developers Think About Timing Attacks,” in <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2022, pp. 632–649, doi: <a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">10.1109/SP46214.2022.9833713</a>.","chicago":"Jancar, Jan, Marcel Fourné, Daniel De Almeida Braga, Mohamed Sabt, Peter Schwabe, Gilles Barthe, Pierre-Alain Fouque, and Yasemin Acar. “‘They’re Not That Hard to Mitigate’: What Cryptographic Library Developers Think About Timing Attacks.” In <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 632–649. IEEE, 2022. <a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">https://doi.org/10.1109/SP46214.2022.9833713</a>.","apa":"Jancar, J., Fourné, M., Braga, D. D. A., Sabt, M., Schwabe, P., Barthe, G., Fouque, P.-A., &#38; Acar, Y. (2022). “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 632–649. <a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">https://doi.org/10.1109/SP46214.2022.9833713</a>","mla":"Jancar, Jan, et al. “‘They’re Not That Hard to Mitigate’: What Cryptographic Library Developers Think About Timing Attacks.” <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, IEEE, 2022, pp. 632–649, doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">10.1109/SP46214.2022.9833713</a>.","bibtex":"@inproceedings{Jancar_Fourné_Braga_Sabt_Schwabe_Barthe_Fouque_Acar_2022, title={“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks}, DOI={<a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">10.1109/SP46214.2022.9833713</a>}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Jancar, Jan and Fourné, Marcel and Braga, Daniel De Almeida and Sabt, Mohamed and Schwabe, Peter and Barthe, Gilles and Fouque, Pierre-Alain and Acar, Yasemin}, year={2022}, pages={632–649} }","short":"J. Jancar, M. Fourné, D.D.A. Braga, M. Sabt, P. Schwabe, G. Barthe, P.-A. Fouque, Y. Acar, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 632–649."},"page":"632–649"},{"department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","_id":"47285","extern":"1","language":[{"iso":"eng"}],"publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","type":"conference","status":"public","date_created":"2023-09-22T13:18:27Z","author":[{"last_name":"Wermke","full_name":"Wermke, Dominik","first_name":"Dominik"},{"last_name":"Wöhler","full_name":"Wöhler, Noah","first_name":"Noah"},{"first_name":"Jan H.","full_name":"Klemmer, Jan H.","last_name":"Klemmer"},{"first_name":"Marcel","full_name":"Fourné, Marcel","last_name":"Fourné"},{"first_name":"Yasemin","id":"94636","full_name":"Acar, Yasemin","last_name":"Acar"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"date_updated":"2024-06-05T13:34:37Z","publisher":"IEEE","doi":"10.1109/SP46214.2022.9833686","title":"Committed to Trust: A Qualitative Study on Security & Trust in Open Source Software Projects","page":"1880–1896","citation":{"chicago":"Wermke, Dominik, Noah Wöhler, Jan H. Klemmer, Marcel Fourné, Yasemin Acar, and Sascha Fahl. “Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects.” In <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 1880–1896. IEEE, 2022. <a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">https://doi.org/10.1109/SP46214.2022.9833686</a>.","ieee":"D. Wermke, N. Wöhler, J. H. Klemmer, M. Fourné, Y. Acar, and S. Fahl, “Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects,” in <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2022, pp. 1880–1896, doi: <a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">10.1109/SP46214.2022.9833686</a>.","ama":"Wermke D, Wöhler N, Klemmer JH, Fourné M, Acar Y, Fahl S. Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects. In: <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>. IEEE; 2022:1880–1896. doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">10.1109/SP46214.2022.9833686</a>","mla":"Wermke, Dominik, et al. “Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects.” <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, IEEE, 2022, pp. 1880–1896, doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">10.1109/SP46214.2022.9833686</a>.","short":"D. Wermke, N. Wöhler, J.H. Klemmer, M. Fourné, Y. Acar, S. Fahl, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 1880–1896.","bibtex":"@inproceedings{Wermke_Wöhler_Klemmer_Fourné_Acar_Fahl_2022, title={Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects}, DOI={<a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">10.1109/SP46214.2022.9833686</a>}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Wermke, Dominik and Wöhler, Noah and Klemmer, Jan H. and Fourné, Marcel and Acar, Yasemin and Fahl, Sascha}, year={2022}, pages={1880–1896} }","apa":"Wermke, D., Wöhler, N., Klemmer, J. H., Fourné, M., Acar, Y., &#38; Fahl, S. (2022). Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects. <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 1880–1896. <a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">https://doi.org/10.1109/SP46214.2022.9833686</a>"},"year":"2022"},{"type":"conference","publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","status":"public","_id":"47284","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"extern":"1","language":[{"iso":"eng"}],"year":"2022","citation":{"apa":"Munyendo, C. W., Acar, Y., &#38; Aviv, A. J. (2022). “Desperate Times Call for Desperate Measures”: User Concerns with Mobile Loan Apps in Kenya. <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2304–2319. <a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">https://doi.org/10.1109/SP46214.2022.9833779</a>","short":"C.W. Munyendo, Y. Acar, A.J. Aviv, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 2304–2319.","mla":"Munyendo, Collins W., et al. “‘Desperate Times Call for Desperate Measures’: User Concerns with Mobile Loan Apps in Kenya.” <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, IEEE, 2022, pp. 2304–2319, doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">10.1109/SP46214.2022.9833779</a>.","bibtex":"@inproceedings{Munyendo_Acar_Aviv_2022, title={“Desperate Times Call for Desperate Measures”: User Concerns with Mobile Loan Apps in Kenya}, DOI={<a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">10.1109/SP46214.2022.9833779</a>}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Munyendo, Collins W. and Acar, Yasemin and Aviv, Adam J.}, year={2022}, pages={2304–2319} }","ama":"Munyendo CW, Acar Y, Aviv AJ. “Desperate Times Call for Desperate Measures”: User Concerns with Mobile Loan Apps in Kenya. In: <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>. IEEE; 2022:2304–2319. doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">10.1109/SP46214.2022.9833779</a>","ieee":"C. W. Munyendo, Y. Acar, and A. J. Aviv, “‘Desperate Times Call for Desperate Measures’: User Concerns with Mobile Loan Apps in Kenya,” in <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2022, pp. 2304–2319, doi: <a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">10.1109/SP46214.2022.9833779</a>.","chicago":"Munyendo, Collins W., Yasemin Acar, and Adam J. Aviv. “‘Desperate Times Call for Desperate Measures’: User Concerns with Mobile Loan Apps in Kenya.” In <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2304–2319. IEEE, 2022. <a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">https://doi.org/10.1109/SP46214.2022.9833779</a>."},"page":"2304–2319","date_updated":"2024-06-05T13:34:58Z","publisher":"IEEE","date_created":"2023-09-22T13:18:01Z","author":[{"last_name":"Munyendo","full_name":"Munyendo, Collins W.","first_name":"Collins W."},{"first_name":"Yasemin","id":"94636","full_name":"Acar, Yasemin","last_name":"Acar"},{"last_name":"Aviv","full_name":"Aviv, Adam J.","first_name":"Adam J."}],"title":"\"Desperate Times Call for Desperate Measures\": User Concerns with Mobile Loan Apps in Kenya","doi":"10.1109/SP46214.2022.9833779"},{"year":"2022","citation":{"chicago":"Krause, Alexander, Jan H. Klemmer, Nicolas Huaman, Dominik Wermke, Yasemin Acar, and Sascha Fahl. “Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories.” <i>CoRR</i> abs/2211.06213 (2022). <a href=\"https://doi.org/10.48550/arXiv.2211.06213\">https://doi.org/10.48550/arXiv.2211.06213</a>.","ieee":"A. Krause, J. H. Klemmer, N. Huaman, D. Wermke, Y. Acar, and S. Fahl, “Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories,” <i>CoRR</i>, vol. abs/2211.06213, 2022, doi: <a href=\"https://doi.org/10.48550/arXiv.2211.06213\">10.48550/arXiv.2211.06213</a>.","ama":"Krause A, Klemmer JH, Huaman N, Wermke D, Acar Y, Fahl S. Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories. <i>CoRR</i>. 2022;abs/2211.06213. doi:<a href=\"https://doi.org/10.48550/arXiv.2211.06213\">10.48550/arXiv.2211.06213</a>","apa":"Krause, A., Klemmer, J. H., Huaman, N., Wermke, D., Acar, Y., &#38; Fahl, S. (2022). Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories. <i>CoRR</i>, <i>abs/2211.06213</i>. <a href=\"https://doi.org/10.48550/arXiv.2211.06213\">https://doi.org/10.48550/arXiv.2211.06213</a>","short":"A. Krause, J.H. Klemmer, N. Huaman, D. Wermke, Y. Acar, S. Fahl, CoRR abs/2211.06213 (2022).","mla":"Krause, Alexander, et al. “Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories.” <i>CoRR</i>, vol. abs/2211.06213, 2022, doi:<a href=\"https://doi.org/10.48550/arXiv.2211.06213\">10.48550/arXiv.2211.06213</a>.","bibtex":"@article{Krause_Klemmer_Huaman_Wermke_Acar_Fahl_2022, title={Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories}, volume={abs/2211.06213}, DOI={<a href=\"https://doi.org/10.48550/arXiv.2211.06213\">10.48550/arXiv.2211.06213</a>}, journal={CoRR}, author={Krause, Alexander and Klemmer, Jan H. and Huaman, Nicolas and Wermke, Dominik and Acar, Yasemin and Fahl, Sascha}, year={2022} }"},"date_updated":"2024-06-05T13:36:09Z","date_created":"2023-09-22T13:16:33Z","author":[{"first_name":"Alexander","last_name":"Krause","full_name":"Krause, Alexander"},{"first_name":"Jan H.","full_name":"Klemmer, Jan H.","last_name":"Klemmer"},{"first_name":"Nicolas","full_name":"Huaman, Nicolas","last_name":"Huaman"},{"last_name":"Wermke","full_name":"Wermke, Dominik","first_name":"Dominik"},{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"first_name":"Sascha","full_name":"Fahl, Sascha","last_name":"Fahl"}],"volume":"abs/2211.06213","title":"Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories","doi":"10.48550/arXiv.2211.06213","type":"journal_article","publication":"CoRR","status":"public","_id":"47281","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"extern":"1","language":[{"iso":"eng"}]},{"publisher":"Association for Computing Machinery","date_updated":"2024-06-07T07:13:23Z","date_created":"2023-08-04T07:15:59Z","author":[{"first_name":"Moritz","last_name":"Seiler","id":"105520","full_name":"Seiler, Moritz"},{"last_name":"Prager","full_name":"Prager, Raphael Patrick","first_name":"Raphael Patrick"},{"first_name":"Pascal","full_name":"Kerschke, Pascal","last_name":"Kerschke"},{"first_name":"Heike","id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282"}],"title":"A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes","doi":"10.1145/3512290.3528834","publication_identifier":{"isbn":["9781450392372"]},"place":"New York, NY, USA","year":"2022","page":"657–665","citation":{"apa":"Seiler, M., Prager, R. P., Kerschke, P., &#38; Trautmann, H. (2022). A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 657–665. <a href=\"https://doi.org/10.1145/3512290.3528834\">https://doi.org/10.1145/3512290.3528834</a>","bibtex":"@inproceedings{Seiler_Prager_Kerschke_Trautmann_2022, place={New York, NY, USA}, title={A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes}, DOI={<a href=\"https://doi.org/10.1145/3512290.3528834\">10.1145/3512290.3528834</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Seiler, Moritz and Prager, Raphael Patrick and Kerschke, Pascal and Trautmann, Heike}, year={2022}, pages={657–665} }","mla":"Seiler, Moritz, et al. “A Collection of Deep Learning-Based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2022, pp. 657–665, doi:<a href=\"https://doi.org/10.1145/3512290.3528834\">10.1145/3512290.3528834</a>.","short":"M. Seiler, R.P. Prager, P. Kerschke, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2022, pp. 657–665.","ama":"Seiler M, Prager RP, Kerschke P, Trautmann H. A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. Association for Computing Machinery; 2022:657–665. doi:<a href=\"https://doi.org/10.1145/3512290.3528834\">10.1145/3512290.3528834</a>","ieee":"M. Seiler, R. P. Prager, P. Kerschke, and H. Trautmann, “A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2022, pp. 657–665, doi: <a href=\"https://doi.org/10.1145/3512290.3528834\">10.1145/3512290.3528834</a>.","chicago":"Seiler, Moritz, Raphael Patrick Prager, Pascal Kerschke, and Heike Trautmann. “A Collection of Deep Learning-Based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 657–665. New York, NY, USA: Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3512290.3528834\">https://doi.org/10.1145/3512290.3528834</a>."},"_id":"46307","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","language":[{"iso":"eng"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","type":"conference","abstract":[{"lang":"eng","text":"Exploratory Landscape Analysis is a powerful technique for numerically characterizing landscapes of single-objective continuous optimization problems. Landscape insights are crucial both for problem understanding as well as for assessing benchmark set diversity and composition. Despite the irrefutable usefulness of these features, they suffer from their own ailments and downsides. Hence, in this work we provide a collection of different approaches to characterize optimization landscapes. Similar to conventional landscape features, we require a small initial sample. However, instead of computing features based on that sample, we develop alternative representations of the original sample. These range from point clouds to 2D images and, therefore, are entirely feature-free. We demonstrate and validate our devised methods on the BBOB testbed and predict, with the help of Deep Learning, the high-level, expert-based landscape properties such as the degree of multimodality and the existence of funnel structures. The quality of our approaches is on par with methods relying on the traditional landscape features. Thereby, we provide an exciting new perspective on every research area which utilizes problem information such as problem understanding and algorithm design as well as automated algorithm configuration and selection."}],"status":"public"},{"department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","_id":"46304","language":[{"iso":"eng"}],"publication":"Parallel Problem Solving from Nature — PPSN XVII","type":"conference","status":"public","editor":[{"full_name":"Rudolph, Günter","last_name":"Rudolph","first_name":"Günter"},{"full_name":"Kononova, Anna V.","last_name":"Kononova","first_name":"Anna V."},{"full_name":"Aguirre, Hernán","last_name":"Aguirre","first_name":"Hernán"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"first_name":"Gabriela","last_name":"Ochoa","full_name":"Ochoa, Gabriela"},{"first_name":"Tea","full_name":"Tušar, Tea","last_name":"Tušar"}],"abstract":[{"text":"In recent years, feature-based automated algorithm selection using exploratory landscape analysis has demonstrated its great potential in single-objective continuous black-box optimization. However, feature computation is problem-specific and can be costly in terms of computational resources. This paper investigates feature-free approaches that rely on state-of-the-art deep learning techniques operating on either images or point clouds. We show that point-cloud-based strategies, in particular, are highly competitive and also substantially reduce the size of the required solver portfolio. Moreover, we highlight the effect and importance of cost-sensitive learning in automated algorithm selection models.","lang":"eng"}],"date_created":"2023-08-04T07:12:33Z","author":[{"last_name":"Prager","full_name":"Prager, Raphael Patrick","first_name":"Raphael Patrick"},{"id":"105520","full_name":"Seiler, Moritz","last_name":"Seiler","first_name":"Moritz"},{"first_name":"Heike","id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"}],"publisher":"Springer International Publishing","date_updated":"2024-06-07T07:13:47Z","doi":"10.1007/978-3-031-14714-2_1","title":"Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods","publication_identifier":{"isbn":["978-3-031-14714-2"]},"page":"3–17","citation":{"ama":"Prager RP, Seiler M, Trautmann H, Kerschke P. Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods. In: Rudolph G, Kononova AV, Aguirre H, Kerschke P, Ochoa G, Tušar T, eds. <i>Parallel Problem Solving from Nature — PPSN XVII</i>. Springer International Publishing; 2022:3–17. doi:<a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">10.1007/978-3-031-14714-2_1</a>","chicago":"Prager, Raphael Patrick, Moritz Seiler, Heike Trautmann, and Pascal Kerschke. “Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods.” In <i>Parallel Problem Solving from Nature — PPSN XVII</i>, edited by Günter Rudolph, Anna V. Kononova, Hernán Aguirre, Pascal Kerschke, Gabriela Ochoa, and Tea Tušar, 3–17. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">https://doi.org/10.1007/978-3-031-14714-2_1</a>.","ieee":"R. P. Prager, M. Seiler, H. Trautmann, and P. Kerschke, “Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods,” in <i>Parallel Problem Solving from Nature — PPSN XVII</i>, 2022, pp. 3–17, doi: <a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">10.1007/978-3-031-14714-2_1</a>.","apa":"Prager, R. P., Seiler, M., Trautmann, H., &#38; Kerschke, P. (2022). Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods. In G. Rudolph, A. V. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, &#38; T. Tušar (Eds.), <i>Parallel Problem Solving from Nature — PPSN XVII</i> (pp. 3–17). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">https://doi.org/10.1007/978-3-031-14714-2_1</a>","mla":"Prager, Raphael Patrick, et al. “Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods.” <i>Parallel Problem Solving from Nature — PPSN XVII</i>, edited by Günter Rudolph et al., Springer International Publishing, 2022, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">10.1007/978-3-031-14714-2_1</a>.","short":"R.P. Prager, M. Seiler, H. Trautmann, P. Kerschke, in: G. Rudolph, A.V. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, T. Tušar (Eds.), Parallel Problem Solving from Nature — PPSN XVII, Springer International Publishing, Cham, 2022, pp. 3–17.","bibtex":"@inproceedings{Prager_Seiler_Trautmann_Kerschke_2022, place={Cham}, title={Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">10.1007/978-3-031-14714-2_1</a>}, booktitle={Parallel Problem Solving from Nature — PPSN XVII}, publisher={Springer International Publishing}, author={Prager, Raphael Patrick and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}, editor={Rudolph, Günter and Kononova, Anna V. and Aguirre, Hernán and Kerschke, Pascal and Ochoa, Gabriela and Tušar, Tea}, year={2022}, pages={3–17} }"},"place":"Cham","year":"2022"},{"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46303","language":[{"iso":"eng"}],"type":"conference","publication":"Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)","status":"public","editor":[{"full_name":"the Advancement of Artificial Intelligence (AAAI) Association, for","last_name":"the Advancement of Artificial Intelligence (AAAI) Association","first_name":"for"}],"abstract":[{"lang":"eng","text":"Social media platforms are essential for information sharing and, thus, prone to coordinated dis- and misinformation campaigns. Nevertheless, research in this area is hampered by strict data sharing regulations imposed by the platforms, resulting in a lack of benchmark data. Previous work focused on circumventing these rules by either pseudonymizing the data or sharing fragments. In this work, we will address the benchmarking crisis by presenting a methodology that can be used to create artificial campaigns out of original campaign building blocks. We conduct a proof-of-concept study using the freely available generative language model GPT-Neo in this context and demonstrate that the campaign patterns can flexibly be adapted to an underlying social media stream and evade state-of-the-art campaign detection approaches based on stream clustering. Thus, we not only provide a framework for artificial benchmark generation but also demonstrate the possible adversarial nature of such benchmarks for challenging and advancing current campaign detection methods."}],"author":[{"first_name":"Janina Susanne","last_name":"Pohl","full_name":"Pohl, Janina Susanne"},{"first_name":"Dennis","full_name":"Assenmacher, Dennis","last_name":"Assenmacher"},{"first_name":"Moritz","last_name":"Seiler","id":"105520","full_name":"Seiler, Moritz"},{"first_name":"Heike","id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282"},{"last_name":"Grimme","full_name":"Grimme, Christian","first_name":"Christian"}],"date_created":"2023-08-04T07:11:34Z","publisher":"AAAI Press","date_updated":"2024-06-07T07:13:35Z","doi":"10.36190/2022.91","title":"Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches","citation":{"ama":"Pohl JS, Assenmacher D, Seiler M, Trautmann H, Grimme C. Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches. In: the Advancement of Artificial Intelligence (AAAI) Association  for, ed. <i>Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)</i>. AAAI Press; 2022:1–10. doi:<a href=\"https://doi.org/10.36190/2022.91\">10.36190/2022.91</a>","ieee":"J. S. Pohl, D. Assenmacher, M. Seiler, H. Trautmann, and C. Grimme, “Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches,” in <i>Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)</i>, 2022, pp. 1–10, doi: <a href=\"https://doi.org/10.36190/2022.91\">10.36190/2022.91</a>.","chicago":"Pohl, Janina Susanne, Dennis Assenmacher, Moritz Seiler, Heike Trautmann, and Christian Grimme. “Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches.” In <i>Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)</i>, edited by for the Advancement of Artificial Intelligence (AAAI) Association, 1–10. Palo Alto, CA, USA: AAAI Press, 2022. <a href=\"https://doi.org/10.36190/2022.91\">https://doi.org/10.36190/2022.91</a>.","apa":"Pohl, J. S., Assenmacher, D., Seiler, M., Trautmann, H., &#38; Grimme, C. (2022). Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches. In  for the Advancement of Artificial Intelligence (AAAI) Association (Ed.), <i>Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)</i> (pp. 1–10). AAAI Press. <a href=\"https://doi.org/10.36190/2022.91\">https://doi.org/10.36190/2022.91</a>","mla":"Pohl, Janina Susanne, et al. “Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches.” <i>Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)</i>, edited by for the Advancement of Artificial Intelligence (AAAI) Association, AAAI Press, 2022, pp. 1–10, doi:<a href=\"https://doi.org/10.36190/2022.91\">10.36190/2022.91</a>.","short":"J.S. Pohl, D. Assenmacher, M. Seiler, H. Trautmann, C. Grimme, in:  for the Advancement of Artificial Intelligence (AAAI) Association (Ed.), Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM), AAAI Press, Palo Alto, CA, USA, 2022, pp. 1–10.","bibtex":"@inproceedings{Pohl_Assenmacher_Seiler_Trautmann_Grimme_2022, place={Palo Alto, CA, USA}, title={Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches}, DOI={<a href=\"https://doi.org/10.36190/2022.91\">10.36190/2022.91</a>}, booktitle={Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)}, publisher={AAAI Press}, author={Pohl, Janina Susanne and Assenmacher, Dennis and Seiler, Moritz and Trautmann, Heike and Grimme, Christian}, editor={the Advancement of Artificial Intelligence (AAAI) Association, for}, year={2022}, pages={1–10} }"},"page":"1–10","place":"Palo Alto, CA, USA","year":"2022"}]