---
_id: '49459'
author:
- first_name: K.
  full_name: Masuch, K.
  last_name: Masuch
- first_name: M.
  full_name: Greve, M.
  last_name: Greve
- first_name: Simon Thanh-Nam
  full_name: Trang, Simon Thanh-Nam
  id: '98948'
  last_name: Trang
  orcid: 0000-0002-4784-4038
citation:
  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.
  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>.
  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} }'
  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).
  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.
  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.
  short: K. Masuch, M. Greve, S.T.-N. Trang, Computers &#38; Security 12 (2022).
date_created: 2023-12-04T13:37:24Z
date_updated: 2024-06-04T09:50:12Z
department:
- _id: '792'
intvolume: '        12'
language:
- iso: eng
publication: Computers & Security
status: public
title: Apologize or Justify? Examining the Impact of Data Breach Response Actions
  on Stock Value of Affected Companies
type: journal_article
user_id: '98948'
volume: 12
year: '2022'
...
---
_id: '54585'
author:
- first_name: Ali
  full_name: Manzoor, Ali
  id: '77309'
  last_name: Manzoor
- first_name: Muhammad
  full_name: Saleem, Muhammad
  last_name: Saleem
- first_name: Axel-Cyrille
  full_name: Ngonga Ngomo, Axel-Cyrille
  id: '65716'
  last_name: Ngonga Ngomo
citation:
  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>'
  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>'
  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}
    }'
  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.'
  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>.'
  short: 'A. Manzoor, M. Saleem, A.-C. Ngonga Ngomo, in: The Semantic Web – ISWC 2022,
    Springer International Publishing, Cham, 2022.'
date_created: 2024-06-04T12:21:30Z
date_updated: 2024-06-04T12:24:49Z
department:
- _id: '574'
doi: 10.1007/978-3-031-19433-7_37
language:
- iso: eng
place: Cham
publication: The Semantic Web – ISWC 2022
publication_identifier:
  isbn:
  - '9783031194320'
  - '9783031194337'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: 'REBench: Microbenchmarking Framework for Relation Extraction Systems'
type: book_chapter
user_id: '77309'
year: '2022'
...
---
_id: '45849'
abstract:
- lang: eng
  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>'
author:
- first_name: Yasir
  full_name: Mahmood, Yasir
  id: '99353'
  last_name: Mahmood
- first_name: Arne
  full_name: Meier, Arne
  last_name: Meier
citation:
  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>
  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>
  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} }'
  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>.'
  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>.'
  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.
date_created: 2023-07-03T11:45:39Z
date_updated: 2024-06-04T16:06:59Z
doi: 10.1007/s10472-021-09730-w
extern: '1'
intvolume: '        90'
issue: 2-3
keyword:
- Applied Mathematics
- Artificial Intelligence
language:
- iso: eng
page: 271-296
publication: Annals of Mathematics and Artificial Intelligence
publication_identifier:
  issn:
  - 1012-2443
  - 1573-7470
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Parameterised complexity of model checking and satisfiability in propositional
  dependence logic
type: journal_article
user_id: '99353'
volume: 90
year: '2022'
...
---
_id: '45847'
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>"
author:
- first_name: Juha
  full_name: Kontinen, Juha
  last_name: Kontinen
- first_name: Arne
  full_name: Meier, Arne
  last_name: Meier
- first_name: Yasir
  full_name: Mahmood, Yasir
  id: '99353'
  last_name: Mahmood
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>
  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} }'
  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>.'
  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.
date_created: 2023-07-03T11:36:55Z
date_updated: 2024-06-04T16:06:37Z
doi: 10.1093/logcom/exac070
extern: '1'
intvolume: '        32'
issue: '8'
keyword:
- Logic
- Hardware and Architecture
- Arts and Humanities (miscellaneous)
- Software
- Theoretical Computer Science
language:
- iso: eng
page: 1624-1644
publication: Journal of Logic and Computation
publication_identifier:
  issn:
  - 0955-792X
  - 1465-363X
publication_status: published
publisher: Oxford University Press (OUP)
status: public
title: A parameterized view on the complexity of dependence and independence logic
type: journal_article
user_id: '99353'
volume: 32
year: '2022'
...
---
_id: '45846'
author:
- first_name: Juha
  full_name: Kontinen, Juha
  last_name: Kontinen
- first_name: Arne
  full_name: Meier, Arne
  last_name: Meier
- first_name: Yasir
  full_name: Mahmood, Yasir
  id: '99353'
  last_name: Mahmood
citation:
  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>'
  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>
  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}
    }'
  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>.'
  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>.'
  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>.
  short: 'J. Kontinen, A. Meier, Y. Mahmood, in: Logical Foundations of Computer Science,
    Springer International Publishing, Cham, 2022.'
date_created: 2023-07-03T11:36:33Z
date_updated: 2024-06-04T16:06:49Z
doi: 10.1007/978-3-030-93100-1_9
extern: '1'
language:
- iso: eng
place: Cham
publication: Logical Foundations of Computer Science
publication_identifier:
  isbn:
  - '9783030930998'
  - '9783030931001'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: A Parameterized View on the Complexity of Dependence Logic
type: conference
user_id: '99353'
year: '2022'
...
---
_id: '47289'
author:
- first_name: Nicolas
  full_name: Huaman, Nicolas
  last_name: Huaman
- first_name: Alexander
  full_name: Krause, Alexander
  last_name: Krause
- first_name: Dominik
  full_name: Wermke, Dominik
  last_name: Wermke
- first_name: Jan H.
  full_name: Klemmer, Jan H.
  last_name: Klemmer
- first_name: Christian
  full_name: Stransky, Christian
  last_name: Stransky
- first_name: Yasemin
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
- first_name: Sascha
  full_name: Fahl, Sascha
  last_name: Fahl
citation:
  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.'
  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.'
  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} }'
  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.'
  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.'
  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.'
  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.'
date_created: 2023-09-22T13:21:22Z
date_updated: 2024-06-05T12:52:28Z
department:
- _id: '34'
- _id: '858'
editor:
- first_name: Sonia
  full_name: Chiasson, Sonia
  last_name: Chiasson
- first_name: Apu
  full_name: Kapadia, Apu
  last_name: Kapadia
extern: '1'
language:
- iso: eng
page: 313–330
publication: Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston,
  MA, USA, August 7-9, 2022
publisher: USENIX Association
status: public
title: 'If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with
  Security Information Workers'
type: conference
user_id: '14931'
year: '2022'
...
---
_id: '47844'
author:
- first_name: Jan
  full_name: Jancar, Jan
  last_name: Jancar
- first_name: Marcel
  full_name: Fourné, Marcel
  id: '99291'
  last_name: Fourné
- first_name: Daniel De Almeida
  full_name: Braga, Daniel De Almeida
  last_name: Braga
- 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
- first_name: Pierre-Alain
  full_name: Fouque, Pierre-Alain
  last_name: Fouque
- first_name: Yasemin
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
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>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>'
  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>'
  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} }'
  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>.'
  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>.'
  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.'
date_created: 2023-10-06T16:12:30Z
date_updated: 2024-06-05T12:55:00Z
department:
- _id: '858'
doi: 10.1109/sp46214.2022.9833713
extern: '1'
language:
- iso: eng
publication: 2022 IEEE Symposium on Security and Privacy (SP)
publication_status: published
publisher: IEEE
status: public
title: '“They’re not that hard to mitigate”: What Cryptographic Library Developers
  Think About Timing Attacks'
type: conference
user_id: '14931'
year: '2022'
...
---
_id: '47286'
author:
- first_name: Marco
  full_name: Gutfleisch, Marco
  last_name: Gutfleisch
- first_name: Jan H.
  full_name: Klemmer, Jan H.
  last_name: Klemmer
- first_name: Niklas
  full_name: Busch, Niklas
  last_name: Busch
- first_name: Yasemin
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
- first_name: M. Angela
  full_name: Sasse, M. Angela
  last_name: Sasse
- first_name: Sascha
  full_name: Fahl, Sascha
  last_name: Fahl
citation:
  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>'
  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>
  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} }'
  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>.'
  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>.
  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.'
date_created: 2023-09-22T13:18:54Z
date_updated: 2024-06-05T12:53:00Z
department:
- _id: '34'
- _id: '858'
doi: 10.1109/SP46214.2022.9833756
extern: '1'
language:
- iso: eng
page: 893–910
publication: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco,
  CA, USA, May 22-26, 2022
publisher: IEEE
status: public
title: How Does Usable Security (Not) End Up in Software Products? Results From a
  Qualitative Interview Study
type: conference
user_id: '14931'
year: '2022'
...
---
_id: '47287'
author:
- first_name: Christian
  full_name: Stransky, Christian
  last_name: Stransky
- first_name: Oliver
  full_name: Wiese, Oliver
  last_name: Wiese
- first_name: Volker
  full_name: Roth, Volker
  last_name: Roth
- first_name: Yasemin
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
- first_name: Sascha
  full_name: Fahl, Sascha
  last_name: Fahl
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>'
  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>'
  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}
    }'
  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>.'
  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.'
date_created: 2023-09-22T13:19:56Z
date_updated: 2024-06-05T12:53:20Z
department:
- _id: '34'
- _id: '858'
doi: 10.1109/SP46214.2022.9833755
extern: '1'
language:
- iso: eng
page: 860–875
publication: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco,
  CA, USA, May 22-26, 2022
publisher: IEEE
status: public
title: '27 Years and 81 Million Opportunities Later: Investigating the Use of Email
  Encryption for an Entire University'
type: conference
user_id: '14931'
year: '2022'
...
---
_id: '47283'
author:
- first_name: Harjot
  full_name: Kaur, Harjot
  last_name: Kaur
- first_name: Sabrina
  full_name: Amft, Sabrina
  last_name: Amft
- first_name: Daniel
  full_name: Votipka, Daniel
  last_name: Votipka
- first_name: Yasemin
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
- first_name: Sascha
  full_name: Fahl, Sascha
  last_name: Fahl
citation:
  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.'
  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.'
  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} }'
  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.'
  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.'
date_created: 2023-09-22T13:17:23Z
date_updated: 2024-06-05T12:53:43Z
department:
- _id: '34'
- _id: '858'
editor:
- first_name: Kevin R. B.
  full_name: Butler, Kevin R. B.
  last_name: Butler
- first_name: Kurt
  full_name: Thomas, Kurt
  last_name: Thomas
extern: '1'
language:
- iso: eng
page: 4041–4058
publication: 31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA,
  August 10-12, 2022
publisher: USENIX Association
status: public
title: 'Where to Recruit for Security Development Studies: Comparing Six Software
  Developer Samples'
type: conference
user_id: '14931'
year: '2022'
...
---
_id: '47290'
author:
- first_name: Nicolas
  full_name: Huaman, Nicolas
  last_name: Huaman
- first_name: Sabrina
  full_name: Amft, Sabrina
  last_name: Amft
- first_name: Marten
  full_name: Oltrogge, Marten
  last_name: Oltrogge
- first_name: Yasemin
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
- first_name: Sascha
  full_name: Fahl, Sascha
  last_name: Fahl
citation:
  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>'
  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>'
  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}
    }'
  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>.'
  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>.'
  short: N. Huaman, S. Amft, M. Oltrogge, Y. Acar, S. Fahl, IEEE Secur. Priv. 20 (2022)
    49–60.
date_created: 2023-09-22T13:22:05Z
date_updated: 2024-06-05T12:54:05Z
department:
- _id: '34'
- _id: '858'
doi: 10.1109/MSEC.2021.3123795
extern: '1'
intvolume: '        20'
issue: '2'
language:
- iso: eng
page: 49–60
publication: IEEE Secur. Priv.
status: public
title: 'They Would Do Better If They Worked Together: Interaction Problems Between
  Password Managers and the Web'
type: journal_article
user_id: '14931'
volume: 20
year: '2022'
...
---
_id: '47843'
author:
- first_name: Dominik
  full_name: Wermke, Dominik
  last_name: Wermke
- first_name: Noah
  full_name: Wohler, Noah
  last_name: Wohler
- first_name: Jan H.
  full_name: Klemmer, Jan H.
  last_name: Klemmer
- first_name: Marcel
  full_name: Fourné, Marcel
  id: '99291'
  last_name: Fourné
- first_name: Yasemin
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
- first_name: Sascha
  full_name: Fahl, Sascha
  last_name: Fahl
citation:
  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>'
  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>'
  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} }'
  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>.'
  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>.'
  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.'
date_created: 2023-10-06T16:12:18Z
date_updated: 2024-06-05T12:55:32Z
department:
- _id: '858'
doi: 10.1109/sp46214.2022.9833686
extern: '1'
language:
- iso: eng
publication: 2022 IEEE Symposium on Security and Privacy (SP)
publication_status: published
publisher: IEEE
status: public
title: 'Committed to Trust: A Qualitative Study on Security &amp; Trust in Open Source
  Software Projects'
type: conference
user_id: '14931'
year: '2022'
...
---
_id: '47288'
author:
- first_name: Jan
  full_name: Jancar, Jan
  last_name: Jancar
- first_name: Marcel
  full_name: Fourné, Marcel
  last_name: Fourné
- first_name: Daniel De Almeida
  full_name: Braga, Daniel De Almeida
  last_name: Braga
- 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
- first_name: Pierre-Alain
  full_name: Fouque, Pierre-Alain
  last_name: Fouque
- first_name: Yasemin
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
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>'
  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>'
  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}
    }'
  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>.'
  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>.'
  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>.'
  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.'
date_created: 2023-09-22T13:20:28Z
date_updated: 2024-06-05T13:20:54Z
department:
- _id: '34'
- _id: '858'
doi: 10.1109/SP46214.2022.9833713
extern: '1'
language:
- iso: eng
page: 632–649
publication: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco,
  CA, USA, May 22-26, 2022
publisher: IEEE
status: public
title: '"They’re not that hard to mitigate": What Cryptographic Library Developers
  Think About Timing Attacks'
type: conference
user_id: '14931'
year: '2022'
...
---
_id: '47285'
author:
- first_name: Dominik
  full_name: Wermke, Dominik
  last_name: Wermke
- first_name: Noah
  full_name: Wöhler, Noah
  last_name: Wöhler
- 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
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
- first_name: Sascha
  full_name: Fahl, Sascha
  last_name: Fahl
citation:
  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>'
  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>'
  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} }'
  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>.'
  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.'
date_created: 2023-09-22T13:18:27Z
date_updated: 2024-06-05T13:34:37Z
department:
- _id: '34'
- _id: '858'
doi: 10.1109/SP46214.2022.9833686
extern: '1'
language:
- iso: eng
page: 1880–1896
publication: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco,
  CA, USA, May 22-26, 2022
publisher: IEEE
status: public
title: 'Committed to Trust: A Qualitative Study on Security & Trust in Open Source
  Software Projects'
type: conference
user_id: '14931'
year: '2022'
...
---
_id: '47284'
author:
- first_name: Collins W.
  full_name: Munyendo, Collins W.
  last_name: Munyendo
- first_name: Yasemin
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
- first_name: Adam J.
  full_name: Aviv, Adam J.
  last_name: Aviv
citation:
  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>'
  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>'
  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} }'
  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>.'
  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>.'
  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>.'
  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.'
date_created: 2023-09-22T13:18:01Z
date_updated: 2024-06-05T13:34:58Z
department:
- _id: '34'
- _id: '858'
doi: 10.1109/SP46214.2022.9833779
extern: '1'
language:
- iso: eng
page: 2304–2319
publication: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco,
  CA, USA, May 22-26, 2022
publisher: IEEE
status: public
title: '"Desperate Times Call for Desperate Measures": User Concerns with Mobile Loan
  Apps in Kenya'
type: conference
user_id: '14931'
year: '2022'
...
---
_id: '47281'
author:
- first_name: Alexander
  full_name: Krause, Alexander
  last_name: Krause
- first_name: Jan H.
  full_name: Klemmer, Jan H.
  last_name: Klemmer
- first_name: Nicolas
  full_name: Huaman, Nicolas
  last_name: Huaman
- first_name: Dominik
  full_name: Wermke, Dominik
  last_name: Wermke
- first_name: Yasemin
  full_name: Acar, Yasemin
  id: '94636'
  last_name: Acar
- first_name: Sascha
  full_name: Fahl, Sascha
  last_name: Fahl
citation:
  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>'
  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} }'
  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>.'
  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>.'
  short: A. Krause, J.H. Klemmer, N. Huaman, D. Wermke, Y. Acar, S. Fahl, CoRR abs/2211.06213
    (2022).
date_created: 2023-09-22T13:16:33Z
date_updated: 2024-06-05T13:36:09Z
department:
- _id: '34'
- _id: '858'
doi: 10.48550/arXiv.2211.06213
extern: '1'
language:
- iso: eng
publication: CoRR
status: public
title: 'Committed by Accident: Studying Prevention and Remediation Strategies Against
  Secret Leakage in Source Code Repositories'
type: journal_article
user_id: '14931'
volume: abs/2211.06213
year: '2022'
...
---
_id: '46307'
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.
author:
- first_name: Moritz
  full_name: Seiler, Moritz
  id: '105520'
  last_name: Seiler
- first_name: Raphael Patrick
  full_name: Prager, Raphael Patrick
  last_name: Prager
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
citation:
  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>'
  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}
    }'
  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>.'
  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>.'
  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.'
date_created: 2023-08-04T07:15:59Z
date_updated: 2024-06-07T07:13:23Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/3512290.3528834
language:
- iso: eng
page: 657–665
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
  isbn:
  - '9781450392372'
publisher: Association for Computing Machinery
status: public
title: A Collection of Deep Learning-based Feature-Free Approaches for Characterizing
  Single-Objective Continuous Fitness Landscapes
type: conference
user_id: '15504'
year: '2022'
...
---
_id: '46304'
abstract:
- lang: eng
  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.
author:
- first_name: Raphael Patrick
  full_name: Prager, Raphael Patrick
  last_name: Prager
- first_name: Moritz
  full_name: Seiler, Moritz
  id: '105520'
  last_name: Seiler
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
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>'
  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>'
  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} }'
  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>.'
  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.'
date_created: 2023-08-04T07:12:33Z
date_updated: 2024-06-07T07:13:47Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-031-14714-2_1
editor:
- first_name: Günter
  full_name: Rudolph, Günter
  last_name: Rudolph
- first_name: Anna V.
  full_name: Kononova, Anna V.
  last_name: Kononova
- first_name: Hernán
  full_name: Aguirre, Hernán
  last_name: Aguirre
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Gabriela
  full_name: Ochoa, Gabriela
  last_name: Ochoa
- first_name: Tea
  full_name: Tušar, Tea
  last_name: Tušar
language:
- iso: eng
page: 3–17
place: Cham
publication: Parallel Problem Solving from Nature — PPSN XVII
publication_identifier:
  isbn:
  - 978-3-031-14714-2
publisher: Springer International Publishing
status: public
title: 'Automated Algorithm Selection in Single-Objective Continuous Optimization:
  A Comparative Study of Deep Learning and Landscape Analysis Methods'
type: conference
user_id: '15504'
year: '2022'
...
---
_id: '46303'
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
  full_name: Pohl, Janina Susanne
  last_name: Pohl
- first_name: Dennis
  full_name: Assenmacher, Dennis
  last_name: Assenmacher
- first_name: Moritz
  full_name: Seiler, Moritz
  id: '105520'
  last_name: Seiler
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
- first_name: Christian
  full_name: Grimme, Christian
  last_name: Grimme
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>'
  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>
  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} }'
  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>.'
  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>.'
  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.'
date_created: 2023-08-04T07:11:34Z
date_updated: 2024-06-07T07:13:35Z
department:
- _id: '34'
- _id: '819'
doi: 10.36190/2022.91
editor:
- first_name: for
  full_name: the Advancement of Artificial Intelligence (AAAI) Association, for
  last_name: the Advancement of Artificial Intelligence (AAAI) Association
language:
- iso: eng
page: 1–10
place: Palo Alto, CA, USA
publication: Workshop Proceedings of the 16$^th$ International Conference on Web and
  Social Media (ICWSM)
publisher: AAAI Press
status: public
title: Artificial Social Media Campaign Creation for Benchmarking and Challenging
  Detection Approaches
type: conference
user_id: '15504'
year: '2022'
...
---
_id: '46309'
abstract:
- lang: eng
  text: Due to the rise of continuous data-generating applications, analyzing data
    streams has gained increasing attention over the past decades. A core research
    area in stream data is stream classification, which categorizes or detects data
    points within an evolving stream of observations. Areas of stream classification
    are diverse—ranging, e.g., from monitoring sensor data to analyzing a wide range
    of (social) media applications. Research in stream classification is related to
    developing methods that adapt to the changing and potentially volatile data stream.
    It focuses on individual aspects of the stream classification pipeline, e.g.,
    designing suitable algorithm architectures, an efficient train and test procedure,
    or detecting so-called concept drifts. As a result of the many different research
    questions and strands, the field is challenging to grasp, especially for beginners.
    This survey explores, summarizes, and categorizes work within the domain of stream
    classification and identifies core research threads over the past few years. It
    is structured based on the stream classification process to facilitate coordination
    within this complex topic, including common application scenarios and benchmarking
    data sets. Thus, both newcomers to the field and experts who want to widen their
    scope can gain (additional) insight into this research area and find starting
    points and pointers to more in-depth literature on specific issues and research
    directions in the field.
author:
- first_name: Lena
  full_name: Clever, Lena
  last_name: Clever
- first_name: Janina Susanne
  full_name: Pohl, Janina Susanne
  last_name: Pohl
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
citation:
  ama: 'Clever L, Pohl JS, Bossek J, Kerschke P, Trautmann H. Process-Oriented Stream
    Classification Pipeline: A Literature Review. <i>Applied Sciences</i>. 2022;12(8):1–44.
    doi:<a href="https://doi.org/10.3390/app12189094">10.3390/app12189094</a>'
  apa: 'Clever, L., Pohl, J. S., Bossek, J., Kerschke, P., &#38; Trautmann, H. (2022).
    Process-Oriented Stream Classification Pipeline: A Literature Review. <i>Applied
    Sciences</i>, <i>12</i>(8), 1–44. <a href="https://doi.org/10.3390/app12189094">https://doi.org/10.3390/app12189094</a>'
  bibtex: '@article{Clever_Pohl_Bossek_Kerschke_Trautmann_2022, title={Process-Oriented
    Stream Classification Pipeline: A Literature Review}, volume={12}, DOI={<a href="https://doi.org/10.3390/app12189094">10.3390/app12189094</a>},
    number={8}, journal={Applied Sciences}, author={Clever, Lena and Pohl, Janina
    Susanne and Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2022},
    pages={1–44} }'
  chicago: 'Clever, Lena, Janina Susanne Pohl, Jakob Bossek, Pascal Kerschke, and
    Heike Trautmann. “Process-Oriented Stream Classification Pipeline: A Literature
    Review.” <i>Applied Sciences</i> 12, no. 8 (2022): 1–44. <a href="https://doi.org/10.3390/app12189094">https://doi.org/10.3390/app12189094</a>.'
  ieee: 'L. Clever, J. S. Pohl, J. Bossek, P. Kerschke, and H. Trautmann, “Process-Oriented
    Stream Classification Pipeline: A Literature Review,” <i>Applied Sciences</i>,
    vol. 12, no. 8, pp. 1–44, 2022, doi: <a href="https://doi.org/10.3390/app12189094">10.3390/app12189094</a>.'
  mla: 'Clever, Lena, et al. “Process-Oriented Stream Classification Pipeline: A Literature
    Review.” <i>Applied Sciences</i>, vol. 12, no. 8, 2022, pp. 1–44, doi:<a href="https://doi.org/10.3390/app12189094">10.3390/app12189094</a>.'
  short: L. Clever, J.S. Pohl, J. Bossek, P. Kerschke, H. Trautmann, Applied Sciences
    12 (2022) 1–44.
date_created: 2023-08-04T07:17:23Z
date_updated: 2024-06-10T12:02:17Z
department:
- _id: '34'
- _id: '819'
doi: 10.3390/app12189094
intvolume: '        12'
issue: '8'
language:
- iso: eng
page: 1–44
publication: Applied Sciences
status: public
title: 'Process-Oriented Stream Classification Pipeline: A Literature Review'
type: journal_article
user_id: '15504'
volume: 12
year: '2022'
...
