[{"citation":{"ieee":"N. Janicki, “Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln,” presented at the 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU), Universität zu Köln, 2022.","apa":"Janicki, N. (2022). <i>Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln</i>. 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU), Universität zu Köln.","chicago":"Janicki, Nicole. “Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln,” 2022.","short":"N. Janicki, in: 2022.","mla":"Janicki, Nicole. <i>Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln</i>. 2022.","bibtex":"@inproceedings{Janicki_2022, title={Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln}, author={Janicki, Nicole}, year={2022} }","ama":"Janicki N. Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln. In: ; 2022."},"date_created":"2024-06-03T07:34:33Z","type":"conference_abstract","conference":{"end_date":"12.03.2022","location":"Universität zu Köln","start_date":"10.03.2022","name":"31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU)"},"author":[{"id":"50915","last_name":"Janicki","first_name":"Nicole","full_name":"Janicki, Nicole"}],"status":"public","year":"2022","title":"Technische Bildung im Sachunterricht der Grundschule am Beispiel von Lernrobotern - Entwicklung und Evaluation eines Fortbildungskonzepts. Posterbeitrag im Rahmen der 31. Jahrestagung der Gesellschaft für Didaktik des Sachunterrichts (GDSU) vom 09. bis 12.03.2022 in Köln","date_updated":"2024-06-03T07:49:33Z","_id":"54549","language":[{"iso":"ger"}],"user_id":"50915"},{"publication":"Theory Pract. Log. Program.","issue":"2","citation":{"bibtex":"@article{Baader_Koopmann_Michel_Turhan_Zarrieß_2022, title={Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner}, volume={22}, DOI={<a href=\"https://doi.org/10.1017/S1471068421000466\">10.1017/S1471068421000466</a>}, number={2}, journal={Theory Pract. Log. Program.}, author={Baader, Franz and Koopmann, Patrick and Michel, Friedrich and Turhan, Anni-Yasmin and Zarrieß, Benjamin}, year={2022}, pages={162–192} }","chicago":"Baader, Franz, Patrick Koopmann, Friedrich Michel, Anni-Yasmin Turhan, and Benjamin Zarrieß. “Efficient TBox Reasoning with Value Restrictions Using the Flower Reasoner.” <i>Theory Pract. Log. Program.</i> 22, no. 2 (2022): 162–192. <a href=\"https://doi.org/10.1017/S1471068421000466\">https://doi.org/10.1017/S1471068421000466</a>.","ama":"Baader F, Koopmann P, Michel F, Turhan A-Y, Zarrieß B. Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner. <i>Theory Pract Log Program</i>. 2022;22(2):162–192. doi:<a href=\"https://doi.org/10.1017/S1471068421000466\">10.1017/S1471068421000466</a>","short":"F. Baader, P. Koopmann, F. Michel, A.-Y. Turhan, B. Zarrieß, Theory Pract. Log. Program. 22 (2022) 162–192.","ieee":"F. Baader, P. Koopmann, F. Michel, A.-Y. Turhan, and B. Zarrieß, “Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner,” <i>Theory Pract. Log. Program.</i>, vol. 22, no. 2, pp. 162–192, 2022, doi: <a href=\"https://doi.org/10.1017/S1471068421000466\">10.1017/S1471068421000466</a>.","mla":"Baader, Franz, et al. “Efficient TBox Reasoning with Value Restrictions Using the Flower Reasoner.” <i>Theory Pract. Log. Program.</i>, vol. 22, no. 2, 2022, pp. 162–192, doi:<a href=\"https://doi.org/10.1017/S1471068421000466\">10.1017/S1471068421000466</a>.","apa":"Baader, F., Koopmann, P., Michel, F., Turhan, A.-Y., &#38; Zarrieß, B. (2022). Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner. <i>Theory Pract. Log. Program.</i>, <i>22</i>(2), 162–192. <a href=\"https://doi.org/10.1017/S1471068421000466\">https://doi.org/10.1017/S1471068421000466</a>"},"type":"journal_article","department":[{"_id":"888"}],"date_created":"2024-03-26T10:53:00Z","date_updated":"2024-06-03T08:25:12Z","intvolume":"        22","title":"Efficient TBox Reasoning with Value Restrictions using the Flower Reasoner","year":"2022","status":"public","author":[{"full_name":"Baader, Franz","last_name":"Baader","first_name":"Franz"},{"full_name":"Koopmann, Patrick","last_name":"Koopmann","first_name":"Patrick"},{"full_name":"Michel, Friedrich","first_name":"Friedrich","last_name":"Michel"},{"id":"104470","first_name":"Anni-Yasmin","last_name":"Turhan","full_name":"Turhan, Anni-Yasmin"},{"full_name":"Zarrieß, Benjamin","last_name":"Zarrieß","first_name":"Benjamin"}],"doi":"10.1017/S1471068421000466","user_id":"9503","volume":22,"page":"162–192","language":[{"iso":"eng"}],"_id":"52918"},{"publication_status":"published","date_updated":"2024-06-03T14:02:30Z","intvolume":"         4","title":"Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium","year":"2022","status":"public","author":[{"orcid":"https://orcid.org/0009-0006-0365-4546","last_name":"Janus","first_name":"Richard","full_name":"Janus, Richard","id":"31047"}],"user_id":"31047","volume":4,"page":"1","language":[{"iso":"ger"}],"_id":"54554","publisher":"Evangelischer Bund","series_title":"Evangelische Orientierung","citation":{"mla":"Janus, Richard. <i>Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium</i>. Evangelischer Bund, 2022.","bibtex":"@book{Janus_2022, place={Bensheim}, series={Evangelische Orientierung}, title={Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium}, volume={4}, publisher={Evangelischer Bund}, author={Janus, Richard}, year={2022}, collection={Evangelische Orientierung} }","ama":"Janus R. <i>Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium</i>. Vol 4. Evangelischer Bund; 2022.","ieee":"R. Janus, <i>Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium</i>, vol. 4. Bensheim: Evangelischer Bund, 2022.","apa":"Janus, R. (2022). <i>Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium</i> (Vol. 4). Evangelischer Bund.","short":"R. Janus, Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium, Evangelischer Bund, Bensheim, 2022.","chicago":"Janus, Richard. <i>Gott wird Mensch. Weihnachten zwischen Fiktion und Evangelium</i>. Vol. 4. Evangelische Orientierung. Bensheim: Evangelischer Bund, 2022."},"type":"misc","department":[{"_id":"36"},{"_id":"20"},{"_id":"500"}],"date_created":"2024-06-03T14:02:21Z","place":"Bensheim"},{"author":[{"first_name":"I.","last_name":"Nastjuk","full_name":"Nastjuk, I."},{"id":"98948","last_name":"Trang","orcid":"0000-0002-4784-4038","first_name":"Simon Thanh-Nam","full_name":"Trang, Simon Thanh-Nam"},{"full_name":"Papageorgiou, E.","last_name":"Papageorgiou","first_name":"E."}],"year":"2022","status":"public","title":"Smart cities and smart governance models for future cities","intvolume":"        32","date_updated":"2024-06-04T09:48:00Z","language":[{"iso":"eng"}],"_id":"49458","page":"1917-1924","main_file_link":[{"url":"https://link.springer.com/article/10.1007/s12525-022-00609-0","open_access":"1"}],"volume":32,"user_id":"98948","citation":{"chicago":"Nastjuk, I., Simon Thanh-Nam Trang, and E. Papageorgiou. “Smart Cities and Smart Governance Models for Future Cities.” <i>Electronic Markets</i> 32 (2022): 1917–24.","short":"I. Nastjuk, S.T.-N. Trang, E. Papageorgiou, Electronic Markets 32 (2022) 1917–1924.","ieee":"I. Nastjuk, S. T.-N. Trang, and E. Papageorgiou, “Smart cities and smart governance models for future cities,” <i>Electronic Markets</i>, vol. 32, pp. 1917–1924, 2022.","apa":"Nastjuk, I., Trang, S. T.-N., &#38; Papageorgiou, E. (2022). Smart cities and smart governance models for future cities. <i>Electronic Markets</i>, <i>32</i>, 1917–1924.","bibtex":"@article{Nastjuk_Trang_Papageorgiou_2022, title={Smart cities and smart governance models for future cities}, volume={32}, journal={Electronic Markets}, author={Nastjuk, I. and Trang, Simon Thanh-Nam and Papageorgiou, E.}, year={2022}, pages={1917–1924} }","ama":"Nastjuk I, Trang ST-N, Papageorgiou E. Smart cities and smart governance models for future cities. <i>Electronic Markets</i>. 2022;32:1917-1924.","mla":"Nastjuk, I., et al. “Smart Cities and Smart Governance Models for Future Cities.” <i>Electronic Markets</i>, vol. 32, 2022, pp. 1917–24."},"publication":"Electronic Markets","date_created":"2023-12-04T13:37:18Z","department":[{"_id":"792"}],"oa":"1","type":"journal_article"},{"volume":31,"user_id":"98948","_id":"49460","language":[{"iso":"eng"}],"page":"829-848","intvolume":"        31","date_updated":"2024-06-04T09:50:51Z","author":[{"full_name":"Masuch, K.","first_name":"K.","last_name":"Masuch"},{"full_name":"Greve, M.","last_name":"Greve","first_name":"M."},{"full_name":"Trang, Simon Thanh-Nam","orcid":"0000-0002-4784-4038","first_name":"Simon Thanh-Nam","last_name":"Trang","id":"98948"}],"title":"What to do after a data breach? Examining apology and compensation as response strategies for health service providers","status":"public","year":"2022","department":[{"_id":"792"}],"type":"journal_article","date_created":"2023-12-04T13:37:36Z","citation":{"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.","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.","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} }","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.","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.","short":"K. Masuch, M. Greve, S.T.-N. Trang, Electronic Markets 31 (2022) 829–848."},"publication":"Electronic Markets"},{"author":[{"full_name":"Masuch, K.","last_name":"Masuch","first_name":"K."},{"last_name":"Greve","first_name":"M.","full_name":"Greve, M."},{"first_name":"Simon Thanh-Nam","last_name":"Trang","orcid":"0000-0002-4784-4038","full_name":"Trang, Simon Thanh-Nam","id":"98948"}],"year":"2022","title":"Apologize or Justify? Examining the Impact of Data Breach Response Actions on Stock Value of Affected Companies","status":"public","intvolume":"        12","date_updated":"2024-06-04T09:50:12Z","language":[{"iso":"eng"}],"_id":"49459","volume":12,"user_id":"98948","citation":{"short":"K. Masuch, M. Greve, S.T.-N. Trang, Computers &#38; Security 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).","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.","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} }","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.","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."},"publication":"Computers & Security","date_created":"2023-12-04T13:37:24Z","department":[{"_id":"792"}],"type":"journal_article"},{"publication_status":"published","date_updated":"2024-06-04T12:24:49Z","author":[{"full_name":"Manzoor, Ali","first_name":"Ali","last_name":"Manzoor","id":"77309"},{"first_name":"Muhammad","last_name":"Saleem","full_name":"Saleem, Muhammad"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031194320","9783031194337"]},"year":"2022","title":"REBench: Microbenchmarking Framework for Relation Extraction Systems","status":"public","user_id":"77309","doi":"10.1007/978-3-031-19433-7_37","_id":"54585","language":[{"iso":"eng"}],"publisher":"Springer International Publishing","citation":{"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>.","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} }","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>","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.","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>.","short":"A. Manzoor, M. Saleem, A.-C. Ngonga Ngomo, in: The Semantic Web – ISWC 2022, Springer International Publishing, Cham, 2022."},"publication":"The Semantic Web – ISWC 2022","department":[{"_id":"574"}],"type":"book_chapter","date_created":"2024-06-04T12:21:30Z","place":"Cham"},{"year":"2022","title":"Parameterised complexity of model checking and satisfiability in propositional dependence logic","author":[{"id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir"},{"full_name":"Meier, Arne","first_name":"Arne","last_name":"Meier"}],"publication_identifier":{"issn":["1012-2443","1573-7470"]},"publication_status":"published","date_updated":"2024-06-04T16:06:59Z","intvolume":"        90","language":[{"iso":"eng"}],"doi":"10.1007/s10472-021-09730-w","issue":"2-3","publication":"Annals of Mathematics and Artificial Intelligence","extern":"1","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>"}],"date_created":"2023-07-03T11:45:39Z","type":"journal_article","keyword":["Applied Mathematics","Artificial Intelligence"],"status":"public","page":"271-296","publisher":"Springer Science and Business Media LLC","_id":"45849","user_id":"99353","volume":90,"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>.","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>","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>.","short":"Y. Mahmood, A. Meier, Annals of Mathematics and Artificial Intelligence 90 (2022) 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>.","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} }","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>"}},{"citation":{"short":"J. Kontinen, A. Meier, Y. Mahmood, Journal of Logic and Computation 32 (2022) 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>.","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} }","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>","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>."},"status":"public","user_id":"99353","volume":32,"page":"1624-1644","publisher":"Oxford University Press (OUP)","_id":"45847","abstract":[{"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>","lang":"eng"}],"extern":"1","issue":"8","publication":"Journal of Logic and Computation","type":"journal_article","keyword":["Logic","Hardware and Architecture","Arts and Humanities (miscellaneous)","Software","Theoretical Computer Science"],"date_created":"2023-07-03T11:36:55Z","date_updated":"2024-06-04T16:06:37Z","publication_status":"published","intvolume":"        32","year":"2022","title":"A parameterized view on the complexity of dependence and independence logic","author":[{"full_name":"Kontinen, Juha","last_name":"Kontinen","first_name":"Juha"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"},{"id":"99353","full_name":"Mahmood, Yasir","first_name":"Yasir","last_name":"Mahmood"}],"publication_identifier":{"issn":["0955-792X","1465-363X"]},"doi":"10.1093/logcom/exac070","language":[{"iso":"eng"}]},{"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>","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} }","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>.","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>.","short":"J. Kontinen, A. Meier, Y. Mahmood, in: Logical Foundations of Computer Science, Springer International Publishing, Cham, 2022.","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>."},"publication":"Logical Foundations of Computer Science","extern":"1","place":"Cham","date_created":"2023-07-03T11:36:33Z","type":"conference","author":[{"full_name":"Kontinen, Juha","last_name":"Kontinen","first_name":"Juha"},{"full_name":"Meier, Arne","first_name":"Arne","last_name":"Meier"},{"id":"99353","last_name":"Mahmood","first_name":"Yasir","full_name":"Mahmood, Yasir"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030930998","9783030931001"]},"year":"2022","title":"A Parameterized View on the Complexity of Dependence Logic","status":"public","date_updated":"2024-06-04T16:06:49Z","publication_status":"published","publisher":"Springer International Publishing","_id":"45846","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-93100-1_9","user_id":"99353"},{"date_created":"2023-09-22T13:21:22Z","type":"conference","department":[{"_id":"34"},{"_id":"858"}],"publication":"Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022","citation":{"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.","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.","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} }","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.","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.","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."},"extern":"1","page":"313–330","_id":"47289","publisher":"USENIX Association","language":[{"iso":"eng"}],"user_id":"14931","editor":[{"last_name":"Chiasson","first_name":"Sonia","full_name":"Chiasson, Sonia"},{"first_name":"Apu","last_name":"Kapadia","full_name":"Kapadia, Apu"}],"status":"public","year":"2022","title":"If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers","author":[{"full_name":"Huaman, Nicolas","last_name":"Huaman","first_name":"Nicolas"},{"last_name":"Krause","first_name":"Alexander","full_name":"Krause, Alexander"},{"full_name":"Wermke, Dominik","last_name":"Wermke","first_name":"Dominik"},{"first_name":"Jan H.","last_name":"Klemmer","full_name":"Klemmer, Jan H."},{"full_name":"Stransky, Christian","first_name":"Christian","last_name":"Stransky"},{"last_name":"Acar","first_name":"Yasemin","full_name":"Acar, Yasemin","id":"94636"},{"last_name":"Fahl","first_name":"Sascha","full_name":"Fahl, Sascha"}],"date_updated":"2024-06-05T12:52:28Z"},{"extern":"1","publication":"2022 IEEE Symposium on Security and Privacy (SP)","citation":{"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>","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>.","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>.","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.","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>.","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>"},"type":"conference","department":[{"_id":"858"}],"date_created":"2023-10-06T16:12:30Z","publication_status":"published","date_updated":"2024-06-05T12:55:00Z","year":"2022","status":"public","title":"“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks","author":[{"last_name":"Jancar","first_name":"Jan","full_name":"Jancar, Jan"},{"last_name":"Fourné","first_name":"Marcel","full_name":"Fourné, Marcel","id":"99291"},{"first_name":"Daniel De Almeida","last_name":"Braga","full_name":"Braga, Daniel De Almeida"},{"full_name":"Sabt, Mohamed","first_name":"Mohamed","last_name":"Sabt"},{"last_name":"Schwabe","first_name":"Peter","full_name":"Schwabe, Peter"},{"last_name":"Barthe","first_name":"Gilles","full_name":"Barthe, Gilles"},{"full_name":"Fouque, Pierre-Alain","last_name":"Fouque","first_name":"Pierre-Alain"},{"id":"94636","first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin"}],"user_id":"14931","doi":"10.1109/sp46214.2022.9833713","_id":"47844","language":[{"iso":"eng"}],"publisher":"IEEE"},{"author":[{"first_name":"Marco","last_name":"Gutfleisch","full_name":"Gutfleisch, Marco"},{"first_name":"Jan H.","last_name":"Klemmer","full_name":"Klemmer, Jan H."},{"full_name":"Busch, Niklas","last_name":"Busch","first_name":"Niklas"},{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"full_name":"Sasse, M. Angela","first_name":"M. Angela","last_name":"Sasse"},{"full_name":"Fahl, Sascha","first_name":"Sascha","last_name":"Fahl"}],"status":"public","title":"How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study","year":"2022","date_updated":"2024-06-05T12:53:00Z","publisher":"IEEE","_id":"47286","language":[{"iso":"eng"}],"page":"893–910","doi":"10.1109/SP46214.2022.9833756","user_id":"14931","citation":{"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>.","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} }","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>","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>.","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>","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.","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>."},"publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","extern":"1","date_created":"2023-09-22T13:18:54Z","department":[{"_id":"34"},{"_id":"858"}],"type":"conference"},{"date_created":"2023-09-22T13:19:56Z","department":[{"_id":"34"},{"_id":"858"}],"type":"conference","citation":{"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>.","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} }","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>","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>","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>.","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."},"publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","extern":"1","_id":"47287","publisher":"IEEE","language":[{"iso":"eng"}],"page":"860–875","user_id":"14931","doi":"10.1109/SP46214.2022.9833755","author":[{"last_name":"Stransky","first_name":"Christian","full_name":"Stransky, Christian"},{"full_name":"Wiese, Oliver","last_name":"Wiese","first_name":"Oliver"},{"full_name":"Roth, Volker","first_name":"Volker","last_name":"Roth"},{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"title":"27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University","year":"2022","status":"public","date_updated":"2024-06-05T12:53:20Z"},{"publication":"31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022","citation":{"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.","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.","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.","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.","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.","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.","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} }"},"extern":"1","date_created":"2023-09-22T13:17:23Z","type":"conference","department":[{"_id":"34"},{"_id":"858"}],"title":"Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples","year":"2022","status":"public","author":[{"full_name":"Kaur, Harjot","first_name":"Harjot","last_name":"Kaur"},{"full_name":"Amft, Sabrina","last_name":"Amft","first_name":"Sabrina"},{"full_name":"Votipka, Daniel","first_name":"Daniel","last_name":"Votipka"},{"id":"94636","first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin"},{"full_name":"Fahl, Sascha","first_name":"Sascha","last_name":"Fahl"}],"date_updated":"2024-06-05T12:53:43Z","page":"4041–4058","_id":"47283","publisher":"USENIX Association","language":[{"iso":"eng"}],"user_id":"14931","editor":[{"first_name":"Kevin R. B.","last_name":"Butler","full_name":"Butler, Kevin R. B."},{"first_name":"Kurt","last_name":"Thomas","full_name":"Thomas, Kurt"}]},{"intvolume":"        20","date_updated":"2024-06-05T12:54:05Z","author":[{"full_name":"Huaman, Nicolas","first_name":"Nicolas","last_name":"Huaman"},{"full_name":"Amft, Sabrina","first_name":"Sabrina","last_name":"Amft"},{"first_name":"Marten","last_name":"Oltrogge","full_name":"Oltrogge, Marten"},{"full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar","id":"94636"},{"first_name":"Sascha","last_name":"Fahl","full_name":"Fahl, Sascha"}],"title":"They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web","year":"2022","status":"public","volume":20,"user_id":"14931","doi":"10.1109/MSEC.2021.3123795","_id":"47290","language":[{"iso":"eng"}],"page":"49–60","extern":"1","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>","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} }","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>.","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>.","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>","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>."},"publication":"IEEE Secur. Priv.","issue":"2","department":[{"_id":"34"},{"_id":"858"}],"type":"journal_article","date_created":"2023-09-22T13:22:05Z"},{"citation":{"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>.","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>","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>.","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} }","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.","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>","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>."},"publication":"2022 IEEE Symposium on Security and Privacy (SP)","extern":"1","date_created":"2023-10-06T16:12:18Z","department":[{"_id":"858"}],"type":"conference","author":[{"full_name":"Wermke, Dominik","last_name":"Wermke","first_name":"Dominik"},{"full_name":"Wohler, Noah","first_name":"Noah","last_name":"Wohler"},{"first_name":"Jan H.","last_name":"Klemmer","full_name":"Klemmer, Jan H."},{"id":"99291","last_name":"Fourné","first_name":"Marcel","full_name":"Fourné, Marcel"},{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"status":"public","title":"Committed to Trust: A Qualitative Study on Security &amp; Trust in Open Source Software Projects","year":"2022","publication_status":"published","date_updated":"2024-06-05T12:55:32Z","publisher":"IEEE","_id":"47843","language":[{"iso":"eng"}],"user_id":"14931","doi":"10.1109/sp46214.2022.9833686"},{"date_created":"2023-09-22T13:20:28Z","type":"conference","department":[{"_id":"34"},{"_id":"858"}],"publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","citation":{"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>.","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>","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} }","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>","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>.","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."},"extern":"1","page":"632–649","language":[{"iso":"eng"}],"_id":"47288","publisher":"IEEE","doi":"10.1109/SP46214.2022.9833713","user_id":"14931","status":"public","year":"2022","title":"\"They’re not that hard to mitigate\": What Cryptographic Library Developers Think About Timing Attacks","author":[{"first_name":"Jan","last_name":"Jancar","full_name":"Jancar, Jan"},{"last_name":"Fourné","first_name":"Marcel","full_name":"Fourné, Marcel"},{"first_name":"Daniel De Almeida","last_name":"Braga","full_name":"Braga, Daniel De Almeida"},{"full_name":"Sabt, Mohamed","last_name":"Sabt","first_name":"Mohamed"},{"full_name":"Schwabe, Peter","last_name":"Schwabe","first_name":"Peter"},{"first_name":"Gilles","last_name":"Barthe","full_name":"Barthe, Gilles"},{"full_name":"Fouque, Pierre-Alain","last_name":"Fouque","first_name":"Pierre-Alain"},{"id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin","last_name":"Acar"}],"date_updated":"2024-06-05T13:20:54Z"},{"author":[{"full_name":"Wermke, Dominik","first_name":"Dominik","last_name":"Wermke"},{"full_name":"Wöhler, Noah","first_name":"Noah","last_name":"Wöhler"},{"first_name":"Jan H.","last_name":"Klemmer","full_name":"Klemmer, Jan H."},{"full_name":"Fourné, Marcel","first_name":"Marcel","last_name":"Fourné"},{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"first_name":"Sascha","last_name":"Fahl","full_name":"Fahl, Sascha"}],"year":"2022","status":"public","title":"Committed to Trust: A Qualitative Study on Security & Trust in Open Source Software Projects","date_updated":"2024-06-05T13:34:37Z","publisher":"IEEE","_id":"47285","language":[{"iso":"eng"}],"page":"1880–1896","user_id":"14931","doi":"10.1109/SP46214.2022.9833686","citation":{"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.","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>.","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} }","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>."},"publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","extern":"1","date_created":"2023-09-22T13:18:27Z","department":[{"_id":"34"},{"_id":"858"}],"type":"conference"},{"_id":"47284","language":[{"iso":"eng"}],"publisher":"IEEE","page":"2304–2319","user_id":"14931","doi":"10.1109/SP46214.2022.9833779","author":[{"full_name":"Munyendo, Collins W.","first_name":"Collins W.","last_name":"Munyendo"},{"id":"94636","last_name":"Acar","first_name":"Yasemin","full_name":"Acar, Yasemin"},{"full_name":"Aviv, Adam J.","first_name":"Adam J.","last_name":"Aviv"}],"status":"public","title":"\"Desperate Times Call for Desperate Measures\": User Concerns with Mobile Loan Apps in Kenya","year":"2022","date_updated":"2024-06-05T13:34:58Z","date_created":"2023-09-22T13:18:01Z","department":[{"_id":"34"},{"_id":"858"}],"type":"conference","citation":{"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.","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>.","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} }","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>","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>."},"publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","extern":"1"}]