[{"doi":"10.1007/978-3-030-80418-3_25","title":"Unsupervised Relation Extraction Using Sentence Encoding","author":[{"first_name":"Ali","last_name":"Manzoor","id":"77309","full_name":"Manzoor, Ali"},{"first_name":"Muhammad","last_name":"Saleem","full_name":"Saleem, Muhammad"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"date_created":"2024-06-04T12:23:21Z","publisher":"Springer International Publishing","date_updated":"2024-06-04T12:24:52Z","citation":{"apa":"Manzoor, A., Saleem, M., &#38; Ngonga Ngomo, A.-C. (2021). Unsupervised Relation Extraction Using Sentence Encoding. In <i>The Semantic Web: ESWC 2021 Satellite Events</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">https://doi.org/10.1007/978-3-030-80418-3_25</a>","short":"A. Manzoor, M. Saleem, A.-C. Ngonga Ngomo, in: The Semantic Web: ESWC 2021 Satellite Events, Springer International Publishing, Cham, 2021.","bibtex":"@inbook{Manzoor_Saleem_Ngonga Ngomo_2021, place={Cham}, title={Unsupervised Relation Extraction Using Sentence Encoding}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">10.1007/978-3-030-80418-3_25</a>}, booktitle={The Semantic Web: ESWC 2021 Satellite Events}, publisher={Springer International Publishing}, author={Manzoor, Ali and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, year={2021} }","mla":"Manzoor, Ali, et al. “Unsupervised Relation Extraction Using Sentence Encoding.” <i>The Semantic Web: ESWC 2021 Satellite Events</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">10.1007/978-3-030-80418-3_25</a>.","chicago":"Manzoor, Ali, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “Unsupervised Relation Extraction Using Sentence Encoding.” In <i>The Semantic Web: ESWC 2021 Satellite Events</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">https://doi.org/10.1007/978-3-030-80418-3_25</a>.","ieee":"A. Manzoor, M. Saleem, and A.-C. Ngonga Ngomo, “Unsupervised Relation Extraction Using Sentence Encoding,” in <i>The Semantic Web: ESWC 2021 Satellite Events</i>, Cham: Springer International Publishing, 2021.","ama":"Manzoor A, Saleem M, Ngonga Ngomo A-C. Unsupervised Relation Extraction Using Sentence Encoding. In: <i>The Semantic Web: ESWC 2021 Satellite Events</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">10.1007/978-3-030-80418-3_25</a>"},"year":"2021","place":"Cham","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030804176","9783030804183"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"574"}],"user_id":"77309","_id":"54586","status":"public","publication":"The Semantic Web: ESWC 2021 Satellite Events","type":"book_chapter"},{"quality_controlled":"1","year":"2021","date_created":"2021-03-31T19:39:42Z","title":"HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids","publication":"Euro-Par 2020: Parallel Processing Workshops","abstract":[{"text":"Solving partial differential equations on unstructured grids is a cornerstone of engineering and scientific computing. Nowadays, heterogeneous parallel platforms with CPUs, GPUs, and FPGAs enable energy-efficient and computationally demanding simulations. We developed the HighPerMeshes C++-embedded Domain-Specific Language (DSL) for bridging the abstraction gap between the mathematical and algorithmic formulation of mesh-based algorithms for PDE problems on the one hand and an increasing number of heterogeneous platforms with their different parallel programming and runtime models on the other hand. Thus, the HighPerMeshes DSL aims at higher productivity in the code development process for multiple target platforms. We introduce the concepts as well as the basic structure of the HighPerMeshes DSL, and demonstrate its usage with three examples, a Poisson and monodomain problem, respectively, solved by the continuous finite element method, and the discontinuous Galerkin method for Maxwell’s equation. The mapping of the abstract algorithmic description onto parallel hardware, including distributed memory compute clusters, is presented. Finally, the achievable performance and scalability are demonstrated for a typical example problem on a multi-core CPU cluster.","lang":"eng"}],"file":[{"file_name":"2021-03 Alhaddad2021_Chapter_HighPerMeshesADomain-SpecificL.pdf","file_id":"21588","access_level":"closed","file_size":564398,"creator":"fossie","date_created":"2021-03-31T19:42:52Z","date_updated":"2021-03-31T19:42:52Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"ddc":["004"],"keyword":["tet_topic_hpc"],"language":[{"iso":"eng"}],"publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030715922","9783030715939"]},"place":"Cham","citation":{"ama":"Alhaddad S, Förstner J, Groth S, et al. HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids. In: <i>Euro-Par 2020: Parallel Processing Workshops</i>. ; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-71593-9_15\">10.1007/978-3-030-71593-9_15</a>","chicago":"Alhaddad, Samer, Jens Förstner, Stefan Groth, Daniel Grünewald, Yevgen Grynko, Frank Hannig, Tobias Kenter, et al. “HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids.” In <i>Euro-Par 2020: Parallel Processing Workshops</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-71593-9_15\">https://doi.org/10.1007/978-3-030-71593-9_15</a>.","ieee":"S. Alhaddad <i>et al.</i>, “HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids,” in <i>Euro-Par 2020: Parallel Processing Workshops</i>, Cham, 2021.","bibtex":"@inbook{Alhaddad_Förstner_Groth_Grünewald_Grynko_Hannig_Kenter_Pfreundt_Plessl_Schotte_et al._2021, place={Cham}, title={HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-71593-9_15\">10.1007/978-3-030-71593-9_15</a>}, booktitle={Euro-Par 2020: Parallel Processing Workshops}, author={Alhaddad, Samer and Förstner, Jens and Groth, Stefan and Grünewald, Daniel and Grynko, Yevgen and Hannig, Frank and Kenter, Tobias and Pfreundt, Franz-Josef and Plessl, Christian and Schotte, Merlind and et al.}, year={2021} }","short":"S. Alhaddad, J. Förstner, S. Groth, D. Grünewald, Y. Grynko, F. Hannig, T. Kenter, F.-J. Pfreundt, C. Plessl, M. Schotte, T. Steinke, J. Teich, M. Weiser, F. Wende, in: Euro-Par 2020: Parallel Processing Workshops, Cham, 2021.","mla":"Alhaddad, Samer, et al. “HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids.” <i>Euro-Par 2020: Parallel Processing Workshops</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-71593-9_15\">10.1007/978-3-030-71593-9_15</a>.","apa":"Alhaddad, S., Förstner, J., Groth, S., Grünewald, D., Grynko, Y., Hannig, F., Kenter, T., Pfreundt, F.-J., Plessl, C., Schotte, M., Steinke, T., Teich, J., Weiser, M., &#38; Wende, F. (2021). HighPerMeshes – A Domain-Specific Language for Numerical Algorithms on Unstructured Grids. In <i>Euro-Par 2020: Parallel Processing Workshops</i>. <a href=\"https://doi.org/10.1007/978-3-030-71593-9_15\">https://doi.org/10.1007/978-3-030-71593-9_15</a>"},"date_updated":"2023-09-26T11:40:25Z","author":[{"last_name":"Alhaddad","id":"42456","full_name":"Alhaddad, Samer","first_name":"Samer"},{"first_name":"Jens","full_name":"Förstner, Jens","id":"158","last_name":"Förstner","orcid":"0000-0001-7059-9862"},{"first_name":"Stefan","full_name":"Groth, Stefan","last_name":"Groth"},{"last_name":"Grünewald","full_name":"Grünewald, Daniel","first_name":"Daniel"},{"first_name":"Yevgen","last_name":"Grynko","full_name":"Grynko, Yevgen","id":"26059"},{"first_name":"Frank","full_name":"Hannig, Frank","last_name":"Hannig"},{"id":"3145","full_name":"Kenter, Tobias","last_name":"Kenter","first_name":"Tobias"},{"first_name":"Franz-Josef","last_name":"Pfreundt","full_name":"Pfreundt, Franz-Josef"},{"full_name":"Plessl, Christian","id":"16153","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"},{"full_name":"Schotte, Merlind","last_name":"Schotte","first_name":"Merlind"},{"last_name":"Steinke","full_name":"Steinke, Thomas","first_name":"Thomas"},{"full_name":"Teich, Jürgen","last_name":"Teich","first_name":"Jürgen"},{"first_name":"Martin","last_name":"Weiser","full_name":"Weiser, Martin"},{"first_name":"Florian","full_name":"Wende, Florian","last_name":"Wende"}],"doi":"10.1007/978-3-030-71593-9_15","type":"book_chapter","status":"public","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"21587","user_id":"15278","department":[{"_id":"61"},{"_id":"230"},{"_id":"429"},{"_id":"27"},{"_id":"518"}],"file_date_updated":"2021-03-31T19:42:52Z"},{"publication_status":"published","publication_identifier":{"isbn":["9783030790240","9783030790257"],"issn":["0302-9743","1611-3349"]},"quality_controlled":"1","citation":{"ama":"Ramaswami A, Kenter T, Kühne T, Plessl C. Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing. In: <i>Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-79025-7_21\">10.1007/978-3-030-79025-7_21</a>","ieee":"A. Ramaswami, T. Kenter, T. Kühne, and C. Plessl, “Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing,” in <i>Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, Cham: Springer International Publishing, 2021.","chicago":"Ramaswami, Arjun, Tobias Kenter, Thomas Kühne, and Christian Plessl. “Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing.” In <i>Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-79025-7_21\">https://doi.org/10.1007/978-3-030-79025-7_21</a>.","apa":"Ramaswami, A., Kenter, T., Kühne, T., &#38; Plessl, C. (2021). Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing. In <i>Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>. Int. Conf. on Applied Reconfigurable Computing. Architectures, Tools, and Applications. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-79025-7_21\">https://doi.org/10.1007/978-3-030-79025-7_21</a>","short":"A. Ramaswami, T. Kenter, T. Kühne, C. Plessl, in: Applied Reconfigurable Computing. Architectures, Tools, and Applications, Springer International Publishing, Cham, 2021.","mla":"Ramaswami, Arjun, et al. “Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing.” <i>Applied Reconfigurable Computing. Architectures, Tools, and Applications</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-79025-7_21\">10.1007/978-3-030-79025-7_21</a>.","bibtex":"@inbook{Ramaswami_Kenter_Kühne_Plessl_2021, place={Cham}, title={Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-79025-7_21\">10.1007/978-3-030-79025-7_21</a>}, booktitle={Applied Reconfigurable Computing. Architectures, Tools, and Applications}, publisher={Springer International Publishing}, author={Ramaswami, Arjun and Kenter, Tobias and Kühne, Thomas and Plessl, Christian}, year={2021} }"},"year":"2021","place":"Cham","author":[{"last_name":"Ramaswami","orcid":"https://orcid.org/0000-0002-0909-1178","full_name":"Ramaswami, Arjun","id":"49171","first_name":"Arjun"},{"id":"3145","full_name":"Kenter, Tobias","last_name":"Kenter","first_name":"Tobias"},{"id":"49079","full_name":"Kühne, Thomas","last_name":"Kühne","first_name":"Thomas"},{"full_name":"Plessl, Christian","id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian"}],"date_created":"2022-02-21T14:22:01Z","publisher":"Springer International Publishing","date_updated":"2023-09-26T11:40:45Z","conference":{"name":"Int. Conf. on Applied Reconfigurable Computing. Architectures, Tools, and Applications"},"doi":"10.1007/978-3-030-79025-7_21","title":"Evaluating the Design Space for Offloading 3D FFT Calculations to an FPGA for High-Performance Computing","type":"book_chapter","publication":"Applied Reconfigurable Computing. Architectures, Tools, and Applications","status":"public","user_id":"15278","department":[{"_id":"27"},{"_id":"518"},{"_id":"304"}],"_id":"29936","language":[{"iso":"eng"}]},{"title":"Ensemble Kalman Filter Optimizing Deep Neural Networks: An Alternative Approach to Non-performing Gradient Descent","doi":"10.1007/978-3-030-64580-9_7","publisher":"Springer International Publishing","date_updated":"2025-08-08T11:36:59Z","date_created":"2025-08-06T15:02:38Z","author":[{"first_name":"Alper","orcid":"0000-0001-8869-215X","last_name":"Yegenoglu","id":"117951","full_name":"Yegenoglu, Alper"},{"first_name":"Kai","full_name":"Krajsek, Kai","last_name":"Krajsek"},{"first_name":"Sandra Diaz","full_name":"Pier, Sandra Diaz","last_name":"Pier"},{"last_name":"Herty","full_name":"Herty, Michael","first_name":"Michael"}],"place":"Cham","year":"2021","citation":{"chicago":"Yegenoglu, Alper, Kai Krajsek, Sandra Diaz Pier, and Michael Herty. “Ensemble Kalman Filter Optimizing Deep Neural Networks: An Alternative Approach to Non-Performing Gradient Descent.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-64580-9_7\">https://doi.org/10.1007/978-3-030-64580-9_7</a>.","ieee":"A. Yegenoglu, K. Krajsek, S. D. Pier, and M. Herty, “Ensemble Kalman Filter Optimizing Deep Neural Networks: An Alternative Approach to Non-performing Gradient Descent,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer International Publishing, 2021.","ama":"Yegenoglu A, Krajsek K, Pier SD, Herty M. Ensemble Kalman Filter Optimizing Deep Neural Networks: An Alternative Approach to Non-performing Gradient Descent. In: <i>Lecture Notes in Computer Science</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-64580-9_7\">10.1007/978-3-030-64580-9_7</a>","apa":"Yegenoglu, A., Krajsek, K., Pier, S. D., &#38; Herty, M. (2021). Ensemble Kalman Filter Optimizing Deep Neural Networks: An Alternative Approach to Non-performing Gradient Descent. In <i>Lecture Notes in Computer Science</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-64580-9_7\">https://doi.org/10.1007/978-3-030-64580-9_7</a>","mla":"Yegenoglu, Alper, et al. “Ensemble Kalman Filter Optimizing Deep Neural Networks: An Alternative Approach to Non-Performing Gradient Descent.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-64580-9_7\">10.1007/978-3-030-64580-9_7</a>.","short":"A. Yegenoglu, K. Krajsek, S.D. Pier, M. Herty, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2021.","bibtex":"@inbook{Yegenoglu_Krajsek_Pier_Herty_2021, place={Cham}, title={Ensemble Kalman Filter Optimizing Deep Neural Networks: An Alternative Approach to Non-performing Gradient Descent}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64580-9_7\">10.1007/978-3-030-64580-9_7</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Yegenoglu, Alper and Krajsek, Kai and Pier, Sandra Diaz and Herty, Michael}, year={2021} }"},"publication_status":"published","publication_identifier":{"isbn":["9783030645793","9783030645809"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"_id":"60901","user_id":"117951","abstract":[{"lang":"eng","text":"The successful training of deep neural networks is dependent on initialization schemes and choice of activation functions. Non-optimally chosen parameter settings lead to the known problem of exploding or vanishing gradients. This issue occurs when gradient descent and backpropagation are applied. For this setting the Ensemble Kalman Filter (EnKF) can be used as an alternative optimizer when training neural networks. The EnKF does not require the explicit calculation of gradients or adjoints and we show this resolves the exploding and vanishing gradient problem. We analyze different parameter initializations, propose a dynamic change in ensembles and compare results to established methods."}],"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science"},{"language":[{"iso":"eng"}],"_id":"65531","user_id":"125442","status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter","title":"A Formula for Disaster: A Unified Approach to Elliptic Curve Special-Point-Based Attacks","doi":"10.1007/978-3-030-92062-3_5","publisher":"Springer International Publishing","date_updated":"2026-04-30T09:32:48Z","author":[{"first_name":"Vladimir","last_name":"Sedlacek","full_name":"Sedlacek, Vladimir"},{"first_name":"Jesús-Javier","full_name":"Chi-Domínguez, Jesús-Javier","last_name":"Chi-Domínguez"},{"first_name":"Jan","last_name":"Jancar","full_name":"Jancar, Jan"},{"first_name":"Billy Bob","last_name":"Brumley","full_name":"Brumley, Billy Bob"}],"date_created":"2026-04-30T09:27:07Z","place":"Cham","year":"2021","citation":{"short":"V. Sedlacek, J.-J. Chi-Domínguez, J. Jancar, B.B. Brumley, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2021.","bibtex":"@inbook{Sedlacek_Chi-Domínguez_Jancar_Brumley_2021, place={Cham}, title={A Formula for Disaster: A Unified Approach to Elliptic Curve Special-Point-Based Attacks}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-92062-3_5\">10.1007/978-3-030-92062-3_5</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Sedlacek, Vladimir and Chi-Domínguez, Jesús-Javier and Jancar, Jan and Brumley, Billy Bob}, year={2021} }","mla":"Sedlacek, Vladimir, et al. “A Formula for Disaster: A Unified Approach to Elliptic Curve Special-Point-Based Attacks.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-92062-3_5\">10.1007/978-3-030-92062-3_5</a>.","apa":"Sedlacek, V., Chi-Domínguez, J.-J., Jancar, J., &#38; Brumley, B. B. (2021). A Formula for Disaster: A Unified Approach to Elliptic Curve Special-Point-Based Attacks. In <i>Lecture Notes in Computer Science</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-92062-3_5\">https://doi.org/10.1007/978-3-030-92062-3_5</a>","chicago":"Sedlacek, Vladimir, Jesús-Javier Chi-Domínguez, Jan Jancar, and Billy Bob Brumley. “A Formula for Disaster: A Unified Approach to Elliptic Curve Special-Point-Based Attacks.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-92062-3_5\">https://doi.org/10.1007/978-3-030-92062-3_5</a>.","ieee":"V. Sedlacek, J.-J. Chi-Domínguez, J. Jancar, and B. B. Brumley, “A Formula for Disaster: A Unified Approach to Elliptic Curve Special-Point-Based Attacks,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer International Publishing, 2021.","ama":"Sedlacek V, Chi-Domínguez J-J, Jancar J, Brumley BB. A Formula for Disaster: A Unified Approach to Elliptic Curve Special-Point-Based Attacks. In: <i>Lecture Notes in Computer Science</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-92062-3_5\">10.1007/978-3-030-92062-3_5</a>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030920616","9783030920623"]},"publication_status":"published"},{"date_updated":"2022-01-06T06:54:06Z","date_created":"2020-09-17T10:52:41Z","author":[{"first_name":"Karlson","full_name":"Pfannschmidt, Karlson","last_name":"Pfannschmidt"},{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"title":"Learning Choice Functions via Pareto-Embeddings","doi":"10.1007/978-3-030-58285-2_30","publication_status":"published","publication_identifier":{"isbn":["9783030582845","9783030582852"],"issn":["0302-9743","1611-3349"]},"year":"2020","place":"Cham","citation":{"chicago":"Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions via Pareto-Embeddings.” In <i>Lecture Notes in Computer Science</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-58285-2_30\">https://doi.org/10.1007/978-3-030-58285-2_30</a>.","ieee":"K. Pfannschmidt and E. Hüllermeier, “Learning Choice Functions via Pareto-Embeddings,” in <i>Lecture Notes in Computer Science</i>, Cham, 2020.","ama":"Pfannschmidt K, Hüllermeier E. Learning Choice Functions via Pareto-Embeddings. In: <i>Lecture Notes in Computer Science</i>. Cham; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-58285-2_30\">10.1007/978-3-030-58285-2_30</a>","mla":"Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions via Pareto-Embeddings.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-58285-2_30\">10.1007/978-3-030-58285-2_30</a>.","bibtex":"@inbook{Pfannschmidt_Hüllermeier_2020, place={Cham}, title={Learning Choice Functions via Pareto-Embeddings}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-58285-2_30\">10.1007/978-3-030-58285-2_30</a>}, booktitle={Lecture Notes in Computer Science}, author={Pfannschmidt, Karlson and Hüllermeier, Eyke}, year={2020} }","short":"K. Pfannschmidt, E. Hüllermeier, in: Lecture Notes in Computer Science, Cham, 2020.","apa":"Pfannschmidt, K., &#38; Hüllermeier, E. (2020). Learning Choice Functions via Pareto-Embeddings. In <i>Lecture Notes in Computer Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-58285-2_30\">https://doi.org/10.1007/978-3-030-58285-2_30</a>"},"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"19521","user_id":"13472","department":[{"_id":"7"},{"_id":"355"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public"},{"language":[{"iso":"eng"}],"keyword":["pc2-ressources"],"user_id":"61189","_id":"19561","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter","doi":"10.1007/978-3-030-53552-0_12","title":"Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types","author":[{"first_name":"Meinolf","last_name":"Sellmann","full_name":"Sellmann, Meinolf"},{"first_name":"Kevin","full_name":"Tierney, Kevin","last_name":"Tierney"}],"date_created":"2020-09-18T07:54:06Z","date_updated":"2022-01-06T06:54:07Z","citation":{"apa":"Sellmann, M., &#38; Tierney, K. (2020). Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. In <i>Lecture Notes in Computer Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-53552-0_12\">https://doi.org/10.1007/978-3-030-53552-0_12</a>","mla":"Sellmann, Meinolf, and Kevin Tierney. “Hyper-Parameterized Dialectic Search for Non-Linear Box-Constrained Optimization with Heterogenous Variable Types.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-53552-0_12\">10.1007/978-3-030-53552-0_12</a>.","bibtex":"@inbook{Sellmann_Tierney_2020, place={Cham}, title={Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-53552-0_12\">10.1007/978-3-030-53552-0_12</a>}, booktitle={Lecture Notes in Computer Science}, author={Sellmann, Meinolf and Tierney, Kevin}, year={2020} }","short":"M. Sellmann, K. Tierney, in: Lecture Notes in Computer Science, Cham, 2020.","chicago":"Sellmann, Meinolf, and Kevin Tierney. “Hyper-Parameterized Dialectic Search for Non-Linear Box-Constrained Optimization with Heterogenous Variable Types.” In <i>Lecture Notes in Computer Science</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53552-0_12\">https://doi.org/10.1007/978-3-030-53552-0_12</a>.","ieee":"M. Sellmann and K. Tierney, “Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types,” in <i>Lecture Notes in Computer Science</i>, Cham, 2020.","ama":"Sellmann M, Tierney K. Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. In: <i>Lecture Notes in Computer Science</i>. Cham; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-53552-0_12\">10.1007/978-3-030-53552-0_12</a>"},"year":"2020","place":"Cham","publication_identifier":{"isbn":["9783030535513","9783030535520"],"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"place":"Cham","citation":{"ama":"Jager T, Niehues D. On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In: <i>Lecture Notes in Computer Science</i>. Cham; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">10.1007/978-3-030-38471-5_13</a>","ieee":"T. Jager and D. Niehues, “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions,” in <i>Lecture Notes in Computer Science</i>, Cham, 2020.","chicago":"Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.” In <i>Lecture Notes in Computer Science</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">https://doi.org/10.1007/978-3-030-38471-5_13</a>.","apa":"Jager, T., &#38; Niehues, D. (2020). On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions. In <i>Lecture Notes in Computer Science</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">https://doi.org/10.1007/978-3-030-38471-5_13</a>","bibtex":"@inbook{Jager_Niehues_2020, place={Cham}, title={On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">10.1007/978-3-030-38471-5_13</a>}, booktitle={Lecture Notes in Computer Science}, author={Jager, Tibor and Niehues, David}, year={2020} }","short":"T. Jager, D. Niehues, in: Lecture Notes in Computer Science, Cham, 2020.","mla":"Jager, Tibor, and David Niehues. “On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-38471-5_13\">10.1007/978-3-030-38471-5_13</a>."},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030384708","9783030384715"]},"has_accepted_license":"1","publication_status":"published","related_material":{"link":[{"relation":"later_version","url":"https://eprint.iacr.org/2019/1335.pdf"}]},"doi":"10.1007/978-3-030-38471-5_13","conference":{"location":"Waterloo, Canada","end_date":"2019-08-16","start_date":"2019-08-12","name":"Selected Areas in Cryptography"},"main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007%252F978-3-030-38471-5_13.pdf"}],"date_updated":"2022-01-06T06:54:58Z","author":[{"first_name":"Tibor","full_name":"Jager, Tibor","last_name":"Jager"},{"first_name":"David","last_name":"Niehues","id":"36113","full_name":"Niehues, David"}],"status":"public","type":"book_chapter","file_date_updated":"2021-03-08T17:02:37Z","_id":"21396","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"558"}],"user_id":"36113","year":"2020","quality_controlled":"1","title":"On the Real-World Instantiability of Admissible Hash Functions and Efficient Verifiable Random Functions","date_created":"2021-03-08T16:50:31Z","abstract":[{"text":"Verifiable random functions (VRFs) are essentially digital signatures with additional properties, namely verifiable uniqueness and pseudorandomness, which make VRFs a useful tool, e.g., to prevent enumeration in DNSSEC Authenticated Denial of Existence and the CONIKS key management system, or in the random committee selection of the Algorand blockchain.\r\n\r\nMost standard-model VRFs rely on admissible hash functions (AHFs) to achieve security against adaptive attacks in the standard model. Known AHF constructions are based on error-correcting codes, which yield asymptotically efficient constructions. However, previous works do not clarify how the code should be instantiated concretely in the real world. The rate and the minimal distance of the selected code have significant impact on the efficiency of the resulting cryptosystem, therefore it is unclear if and how the aforementioned constructions can be used in practice.\r\n\r\nFirst, we explain inherent limitations of code-based AHFs. Concretely, we assume that even if we were given codes that achieve the well-known Gilbert-Varshamov or McEliece-Rodemich-Rumsey-Welch bounds, existing AHF-based constructions of verifiable random functions (VRFs) can only be instantiated quite inefficiently. Then we introduce and construct computational AHFs (cAHFs). While classical AHFs are information-theoretic, and therefore work even in presence of computationally unbounded adversaries, cAHFs provide only security against computationally bounded adversaries. However, we show that cAHFs can be instantiated significantly more efficiently. Finally, we use our cAHF to construct the currently most efficient verifiable random function with full adaptive security in the standard model.","lang":"eng"}],"file":[{"date_updated":"2021-03-08T17:02:37Z","date_created":"2021-03-08T17:02:37Z","creator":"davnie","file_size":706743,"access_level":"closed","file_id":"21399","file_name":"Jager und Niehues - 2020 - On the Real-World Instantiability of Admissible Ha.pdf","content_type":"application/pdf","relation":"main_file"}],"publication":"Lecture Notes in Computer Science","keyword":["Admissible hash functions","Verifiable random functions","Error-correcting codes","Provable security"],"ddc":["000"],"language":[{"iso":"eng"}]},{"type":"book_chapter","publication":"Advanced Information Systems Engineering","status":"public","_id":"17337","user_id":"57458","department":[{"_id":"66"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030494346","9783030494353"]},"place":"Cham","year":"2020","citation":{"mla":"Jazayeri, Bahar, et al. “Modeling and Analyzing Architectural Diversity of Open Platforms.” <i>Advanced Information Systems Engineering</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">10.1007/978-3-030-49435-3_3</a>.","bibtex":"@inbook{Jazayeri_Schwichtenberg_Küster_Zimmermann_Engels_2020, place={Cham}, title={Modeling and Analyzing Architectural Diversity of Open Platforms}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">10.1007/978-3-030-49435-3_3</a>}, booktitle={Advanced Information Systems Engineering}, author={Jazayeri, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor}, year={2020} }","short":"B. Jazayeri, S. Schwichtenberg, J. Küster, O. Zimmermann, G. Engels, in: Advanced Information Systems Engineering, Cham, 2020.","apa":"Jazayeri, B., Schwichtenberg, S., Küster, J., Zimmermann, O., &#38; Engels, G. (2020). Modeling and Analyzing Architectural Diversity of Open Platforms. In <i>Advanced Information Systems Engineering</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">https://doi.org/10.1007/978-3-030-49435-3_3</a>","chicago":"Jazayeri, Bahar, Simon Schwichtenberg, Jochen Küster, Olaf Zimmermann, and Gregor Engels. “Modeling and Analyzing Architectural Diversity of Open Platforms.” In <i>Advanced Information Systems Engineering</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">https://doi.org/10.1007/978-3-030-49435-3_3</a>.","ieee":"B. Jazayeri, S. Schwichtenberg, J. Küster, O. Zimmermann, and G. Engels, “Modeling and Analyzing Architectural Diversity of Open Platforms,” in <i>Advanced Information Systems Engineering</i>, Cham, 2020.","ama":"Jazayeri B, Schwichtenberg S, Küster J, Zimmermann O, Engels G. Modeling and Analyzing Architectural Diversity of Open Platforms. In: <i>Advanced Information Systems Engineering</i>. Cham; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">10.1007/978-3-030-49435-3_3</a>"},"date_updated":"2022-01-06T06:53:08Z","date_created":"2020-06-26T10:31:49Z","author":[{"last_name":"Jazayeri","full_name":"Jazayeri, Bahar","first_name":"Bahar"},{"first_name":"Simon","last_name":"Schwichtenberg","full_name":"Schwichtenberg, Simon"},{"first_name":"Jochen","full_name":"Küster, Jochen","last_name":"Küster"},{"full_name":"Zimmermann, Olaf","last_name":"Zimmermann","first_name":"Olaf"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"}],"title":"Modeling and Analyzing Architectural Diversity of Open Platforms","doi":"10.1007/978-3-030-49435-3_3"},{"doi":"10.1007/978-3-030-64354-6_5","title":"Using Abstract Contracts for Verifying Evolving Features and Their Interactions","author":[{"last_name":"Knüppel","full_name":"Knüppel, Alexander","first_name":"Alexander"},{"first_name":"Stefan","last_name":"Krüger","full_name":"Krüger, Stefan"},{"full_name":"Thüm, Thomas","last_name":"Thüm","first_name":"Thomas"},{"first_name":"Richard","full_name":"Bubel, Richard","last_name":"Bubel"},{"first_name":"Sebastian","last_name":"Krieter","full_name":"Krieter, Sebastian"},{"first_name":"Eric","full_name":"Bodden, Eric","id":"59256","orcid":"0000-0003-3470-3647","last_name":"Bodden"},{"first_name":"Ina","full_name":"Schaefer, Ina","last_name":"Schaefer"}],"date_created":"2021-01-11T09:15:41Z","date_updated":"2022-01-06T06:54:41Z","citation":{"bibtex":"@inbook{Knüppel_Krüger_Thüm_Bubel_Krieter_Bodden_Schaefer_2020, place={Cham}, title={Using Abstract Contracts for Verifying Evolving Features and Their Interactions}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64354-6_5\">10.1007/978-3-030-64354-6_5</a>}, booktitle={Lecture Notes in Computer Science}, author={Knüppel, Alexander and Krüger, Stefan and Thüm, Thomas and Bubel, Richard and Krieter, Sebastian and Bodden, Eric and Schaefer, Ina}, year={2020} }","short":"A. Knüppel, S. Krüger, T. Thüm, R. Bubel, S. Krieter, E. Bodden, I. Schaefer, in: Lecture Notes in Computer Science, Cham, 2020.","mla":"Knüppel, Alexander, et al. “Using Abstract Contracts for Verifying Evolving Features and Their Interactions.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-64354-6_5\">10.1007/978-3-030-64354-6_5</a>.","apa":"Knüppel, A., Krüger, S., Thüm, T., Bubel, R., Krieter, S., Bodden, E., &#38; Schaefer, I. (2020). Using Abstract Contracts for Verifying Evolving Features and Their Interactions. In <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-030-64354-6_5\">https://doi.org/10.1007/978-3-030-64354-6_5</a>","chicago":"Knüppel, Alexander, Stefan Krüger, Thomas Thüm, Richard Bubel, Sebastian Krieter, Eric Bodden, and Ina Schaefer. “Using Abstract Contracts for Verifying Evolving Features and Their Interactions.” In <i>Lecture Notes in Computer Science</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64354-6_5\">https://doi.org/10.1007/978-3-030-64354-6_5</a>.","ieee":"A. Knüppel <i>et al.</i>, “Using Abstract Contracts for Verifying Evolving Features and Their Interactions,” in <i>Lecture Notes in Computer Science</i>, Cham, 2020.","ama":"Knüppel A, Krüger S, Thüm T, et al. Using Abstract Contracts for Verifying Evolving Features and Their Interactions. In: <i>Lecture Notes in Computer Science</i>. ; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-64354-6_5\">10.1007/978-3-030-64354-6_5</a>"},"year":"2020","place":"Cham","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030643539","9783030643546"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"76"}],"user_id":"5786","_id":"20891","status":"public","abstract":[{"lang":"eng","text":"Today, software systems are rarely developed monolithically, but may be composed of numerous individually developed features. Their modularization facilitates independent development and verification. While feature-based strategies to verify features in isolation have existed for years, they cannot address interactions between features. The problem with feature interactions is that they are typically unknown and may involve any subset of the features. Contrary, a family-based verification strategy captures feature interactions, but does not scale well when features evolve frequently. To the best of our knowledge, there currently exists no approach with focus on evolving features that combines both strategies and aims at eliminating their respective drawbacks. To fill this gap, we introduce Fefalution, a feature-family-based verification approach based on abstract contracts to verify evolving features and their interactions. Fefalution builds partial proofs for each evolving feature and then reuses the resulting partial proofs in verifying feature interactions, yielding a full verification of the complete software system. Moreover, to investigate whether a combination of both strategies is fruitful, we present the first empirical study for the verification of evolving features implemented by means of feature-oriented programming and by comparing Fefalution with another five family-based approaches varying in a set of optimizations. Our results indicate that partial proofs based on abstract contracts exhibit huge reuse potential, but also come with a substantial overhead for smaller evolution scenarios.\r\n"}],"publication":"Lecture Notes in Computer Science","type":"book_chapter"},{"author":[{"full_name":"El Mesaoudi-Paul, Adil","last_name":"El Mesaoudi-Paul","first_name":"Adil"},{"first_name":"Dimitri","last_name":"Weiß","full_name":"Weiß, Dimitri"},{"first_name":"Viktor","id":"76599","full_name":"Bengs, Viktor","last_name":"Bengs"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129","first_name":"Eyke"},{"first_name":"Kevin","last_name":"Tierney","full_name":"Tierney, Kevin"}],"volume":12096,"date_updated":"2022-01-06T06:53:25Z","doi":"10.1007/978-3-030-53552-0_22","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030535513","9783030535520"]},"citation":{"ama":"El Mesaoudi-Paul A, Weiß D, Bengs V, Hüllermeier E, Tierney K. Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach. In: <i>Learning and Intelligent Optimization. LION 2020.</i> Vol 12096. Lecture Notes in Computer Science. Cham: Springer; 2020:216-232. doi:<a href=\"https://doi.org/10.1007/978-3-030-53552-0_22\">10.1007/978-3-030-53552-0_22</a>","ieee":"A. El Mesaoudi-Paul, D. Weiß, V. Bengs, E. Hüllermeier, and K. Tierney, “Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach,” in <i>Learning and Intelligent Optimization. LION 2020.</i>, vol. 12096, Cham: Springer, 2020, pp. 216–232.","chicago":"El Mesaoudi-Paul, Adil, Dimitri Weiß, Viktor Bengs, Eyke Hüllermeier, and Kevin Tierney. “Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach.” In <i>Learning and Intelligent Optimization. LION 2020.</i>, 12096:216–32. Lecture Notes in Computer Science. Cham: Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53552-0_22\">https://doi.org/10.1007/978-3-030-53552-0_22</a>.","apa":"El Mesaoudi-Paul, A., Weiß, D., Bengs, V., Hüllermeier, E., &#38; Tierney, K. (2020). Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach. In <i>Learning and Intelligent Optimization. LION 2020.</i> (Vol. 12096, pp. 216–232). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-53552-0_22\">https://doi.org/10.1007/978-3-030-53552-0_22</a>","bibtex":"@inbook{El Mesaoudi-Paul_Weiß_Bengs_Hüllermeier_Tierney_2020, place={Cham}, series={Lecture Notes in Computer Science}, title={Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach}, volume={12096}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-53552-0_22\">10.1007/978-3-030-53552-0_22</a>}, booktitle={Learning and Intelligent Optimization. LION 2020.}, publisher={Springer}, author={El Mesaoudi-Paul, Adil and Weiß, Dimitri and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}, year={2020}, pages={216–232}, collection={Lecture Notes in Computer Science} }","mla":"El Mesaoudi-Paul, Adil, et al. “Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach.” <i>Learning and Intelligent Optimization. LION 2020.</i>, vol. 12096, Springer, 2020, pp. 216–32, doi:<a href=\"https://doi.org/10.1007/978-3-030-53552-0_22\">10.1007/978-3-030-53552-0_22</a>.","short":"A. El Mesaoudi-Paul, D. Weiß, V. Bengs, E. Hüllermeier, K. Tierney, in: Learning and Intelligent Optimization. LION 2020., Springer, Cham, 2020, pp. 216–232."},"page":"216 - 232","intvolume":"     12096","place":"Cham","user_id":"76599","series_title":"Lecture Notes in Computer Science","department":[{"_id":"34"},{"_id":"7"},{"_id":"355"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"18014","type":"book_chapter","status":"public","date_created":"2020-08-17T11:44:37Z","publisher":"Springer","title":"Pool-Based Realtime Algorithm Configuration: A Preselection Bandit Approach","year":"2020","language":[{"iso":"eng"}],"publication":"Learning and Intelligent Optimization. LION 2020."},{"status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"241"},{"_id":"662"},{"_id":"76"}],"user_id":"5786","_id":"23377","citation":{"apa":"Piskachev, G., Petrasch, T., Späth, J., &#38; Bodden, E. (2020). AuthCheck: Program-State Analysis for Access-Control Vulnerabilities. In <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-030-54997-8_34\">https://doi.org/10.1007/978-3-030-54997-8_34</a>","bibtex":"@inbook{Piskachev_Petrasch_Späth_Bodden_2020, place={Cham}, title={AuthCheck: Program-State Analysis for Access-Control Vulnerabilities}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-54997-8_34\">10.1007/978-3-030-54997-8_34</a>}, booktitle={Lecture Notes in Computer Science}, author={Piskachev, Goran and Petrasch, Tobias and Späth, Johannes and Bodden, Eric}, year={2020} }","short":"G. Piskachev, T. Petrasch, J. Späth, E. Bodden, in: Lecture Notes in Computer Science, Cham, 2020.","mla":"Piskachev, Goran, et al. “AuthCheck: Program-State Analysis for Access-Control Vulnerabilities.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-54997-8_34\">10.1007/978-3-030-54997-8_34</a>.","ama":"Piskachev G, Petrasch T, Späth J, Bodden E. AuthCheck: Program-State Analysis for Access-Control Vulnerabilities. In: <i>Lecture Notes in Computer Science</i>. ; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-54997-8_34\">10.1007/978-3-030-54997-8_34</a>","ieee":"G. Piskachev, T. Petrasch, J. Späth, and E. Bodden, “AuthCheck: Program-State Analysis for Access-Control Vulnerabilities,” in <i>Lecture Notes in Computer Science</i>, Cham, 2020.","chicago":"Piskachev, Goran, Tobias Petrasch, Johannes Späth, and Eric Bodden. “AuthCheck: Program-State Analysis for Access-Control Vulnerabilities.” In <i>Lecture Notes in Computer Science</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-54997-8_34\">https://doi.org/10.1007/978-3-030-54997-8_34</a>."},"year":"2020","place":"Cham","publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","doi":"10.1007/978-3-030-54997-8_34","title":"AuthCheck: Program-State Analysis for Access-Control Vulnerabilities","date_created":"2021-08-09T12:05:09Z","author":[{"last_name":"Piskachev","full_name":"Piskachev, Goran","first_name":"Goran"},{"full_name":"Petrasch, Tobias","last_name":"Petrasch","first_name":"Tobias"},{"first_name":"Johannes","full_name":"Späth, Johannes","last_name":"Späth"},{"last_name":"Bodden","full_name":"Bodden, Eric","first_name":"Eric"}],"date_updated":"2022-01-06T06:55:50Z"},{"publication":"Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020","type":"conference","editor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"},{"first_name":"Jordi","full_name":"Cabot, Jordi","last_name":"Cabot"}],"status":"public","_id":"17084","department":[{"_id":"28"},{"_id":"66"},{"_id":"534"}],"user_id":"53103","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030452339","9783030452346"]},"publication_status":"published","place":"Cham","year":"2020","citation":{"chicago":"Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming.” In <i>Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020</i>, edited by Heike Wehrheim and Jordi Cabot. Cham: Springer, 2020. <a href=\"https://doi.org/10.1007/978-3-030-45234-6_16\">https://doi.org/10.1007/978-3-030-45234-6_16</a>.","ieee":"N. Weidmann and A. Anjorin, “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming,” in <i>Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020</i>, Dublin, Ireland, 2020.","ama":"Weidmann N, Anjorin A. Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming. In: Wehrheim H, Cabot J, eds. <i>Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020</i>. Cham: Springer; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-45234-6_16\">10.1007/978-3-030-45234-6_16</a>","apa":"Weidmann, N., &#38; Anjorin, A. (2020). Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming. In H. Wehrheim &#38; J. Cabot (Eds.), <i>Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020</i>. Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-030-45234-6_16\">https://doi.org/10.1007/978-3-030-45234-6_16</a>","short":"N. Weidmann, A. Anjorin, in: H. Wehrheim, J. Cabot (Eds.), Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, Springer, Cham, 2020.","bibtex":"@inproceedings{Weidmann_Anjorin_2020, place={Cham}, title={Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-45234-6_16\">10.1007/978-3-030-45234-6_16</a>}, booktitle={Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020}, publisher={Springer}, author={Weidmann, Nils and Anjorin, Anthony}, editor={Wehrheim, Heike and Cabot, JordiEditors}, year={2020} }","mla":"Weidmann, Nils, and Anthony Anjorin. “Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming.” <i>Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020</i>, edited by Heike Wehrheim and Jordi Cabot, Springer, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-45234-6_16\">10.1007/978-3-030-45234-6_16</a>."},"date_updated":"2022-01-06T06:53:04Z","publisher":"Springer","author":[{"first_name":"Nils","last_name":"Weidmann","id":"53103","full_name":"Weidmann, Nils"},{"full_name":"Anjorin, Anthony","last_name":"Anjorin","first_name":"Anthony"}],"date_created":"2020-06-06T09:50:42Z","title":"Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming","doi":"10.1007/978-3-030-45234-6_16","conference":{"end_date":"2020-04-30","location":"Dublin, Ireland","name":"Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020","start_date":"2020-04-25"}},{"status":"public","type":"conference","publication":"Advanced Information Systems Engineering","language":[{"iso":"eng"}],"_id":"17085","user_id":"36399","place":"Cham","year":"2020","citation":{"apa":"Schwichtenberg, B., Schwichtenberg, S., Küster, J., Zimmermann, O., &#38; Engels, G. (2020). Modeling and Analyzing Architectural Diversity of Open Platforms. In <i>Advanced Information Systems Engineering</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">https://doi.org/10.1007/978-3-030-49435-3_3</a>","bibtex":"@inproceedings{Schwichtenberg_Schwichtenberg_Küster_Zimmermann_Engels_2020, place={Cham}, title={Modeling and Analyzing Architectural Diversity of Open Platforms}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">10.1007/978-3-030-49435-3_3</a>}, booktitle={Advanced Information Systems Engineering}, author={Schwichtenberg, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor}, year={2020} }","short":"B. Schwichtenberg, S. Schwichtenberg, J. Küster, O. Zimmermann, G. Engels, in: Advanced Information Systems Engineering, Cham, 2020.","mla":"Schwichtenberg, Bahar, et al. “Modeling and Analyzing Architectural Diversity of Open Platforms.” <i>Advanced Information Systems Engineering</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">10.1007/978-3-030-49435-3_3</a>.","ama":"Schwichtenberg B, Schwichtenberg S, Küster J, Zimmermann O, Engels G. Modeling and Analyzing Architectural Diversity of Open Platforms. In: <i>Advanced Information Systems Engineering</i>. Cham; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">10.1007/978-3-030-49435-3_3</a>","ieee":"B. Schwichtenberg, S. Schwichtenberg, J. Küster, O. Zimmermann, and G. Engels, “Modeling and Analyzing Architectural Diversity of Open Platforms,” in <i>Advanced Information Systems Engineering</i>, 2020.","chicago":"Schwichtenberg, Bahar, Simon Schwichtenberg, Jochen Küster, Olaf Zimmermann, and Gregor Engels. “Modeling and Analyzing Architectural Diversity of Open Platforms.” In <i>Advanced Information Systems Engineering</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-49435-3_3\">https://doi.org/10.1007/978-3-030-49435-3_3</a>."},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030494346","9783030494353"]},"title":"Modeling and Analyzing Architectural Diversity of Open Platforms","doi":"10.1007/978-3-030-49435-3_3","date_updated":"2022-01-06T06:53:04Z","author":[{"last_name":"Schwichtenberg","id":"36399","full_name":"Schwichtenberg, Bahar","first_name":"Bahar"},{"full_name":"Schwichtenberg, Simon","id":"13235","last_name":"Schwichtenberg","first_name":"Simon"},{"first_name":"Jochen","last_name":"Küster","full_name":"Küster, Jochen"},{"first_name":"Olaf","full_name":"Zimmermann, Olaf","last_name":"Zimmermann"},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"}],"date_created":"2020-06-07T08:53:10Z"},{"year":"2020","place":"Cham","citation":{"ieee":"F. Dallmeier <i>et al.</i>, “Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC,” in <i>Cryptology and Network Security</i>, Vienna, 2020, pp. 211–231, doi: <a href=\"https://doi.org/10.1007/978-3-030-65411-5_11\">10.1007/978-3-030-65411-5_11</a>.","chicago":"Dallmeier, Fynn, Jan P. Drees, Kai Gellert, Tobias Handirk, Tibor Jager, Jonas Klauke, Simon Nachtigall, Timo Renzelmann, and Rudi Wolf. “Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC.” In <i>Cryptology and Network Security</i>, 211–31. Cham: Springer-Verlag, 2020. <a href=\"https://doi.org/10.1007/978-3-030-65411-5_11\">https://doi.org/10.1007/978-3-030-65411-5_11</a>.","ama":"Dallmeier F, Drees JP, Gellert K, et al. Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC. In: <i>Cryptology and Network Security</i>. Springer-Verlag; 2020:211-231. doi:<a href=\"https://doi.org/10.1007/978-3-030-65411-5_11\">10.1007/978-3-030-65411-5_11</a>","short":"F. Dallmeier, J.P. Drees, K. Gellert, T. Handirk, T. Jager, J. Klauke, S. Nachtigall, T. Renzelmann, R. Wolf, in: Cryptology and Network Security, Springer-Verlag, Cham, 2020, pp. 211–231.","mla":"Dallmeier, Fynn, et al. “Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC.” <i>Cryptology and Network Security</i>, Springer-Verlag, 2020, pp. 211–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-65411-5_11\">10.1007/978-3-030-65411-5_11</a>.","bibtex":"@inproceedings{Dallmeier_Drees_Gellert_Handirk_Jager_Klauke_Nachtigall_Renzelmann_Wolf_2020, place={Cham}, title={Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-65411-5_11\">10.1007/978-3-030-65411-5_11</a>}, booktitle={Cryptology and Network Security}, publisher={Springer-Verlag}, author={Dallmeier, Fynn and Drees, Jan P. and Gellert, Kai and Handirk, Tobias and Jager, Tibor and Klauke, Jonas and Nachtigall, Simon and Renzelmann, Timo and Wolf, Rudi}, year={2020}, pages={211–231} }","apa":"Dallmeier, F., Drees, J. P., Gellert, K., Handirk, T., Jager, T., Klauke, J., Nachtigall, S., Renzelmann, T., &#38; Wolf, R. (2020). Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC. <i>Cryptology and Network Security</i>, 211–231. <a href=\"https://doi.org/10.1007/978-3-030-65411-5_11\">https://doi.org/10.1007/978-3-030-65411-5_11</a>"},"page":"211-231","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030654108","9783030654115"]},"title":"Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC","doi":"10.1007/978-3-030-65411-5_11","conference":{"start_date":"2020-12-14","name":"CANS 2020","location":"Vienna","end_date":"2020-12-16"},"publisher":"Springer-Verlag","date_updated":"2022-03-11T10:59:41Z","author":[{"full_name":"Dallmeier, Fynn","last_name":"Dallmeier","first_name":"Fynn"},{"first_name":"Jan P.","full_name":"Drees, Jan P.","last_name":"Drees"},{"first_name":"Kai","last_name":"Gellert","full_name":"Gellert, Kai"},{"first_name":"Tobias","last_name":"Handirk","full_name":"Handirk, Tobias"},{"full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"last_name":"Klauke","orcid":"0000-0001-9160-9636","full_name":"Klauke, Jonas","id":"40915","first_name":"Jonas"},{"full_name":"Nachtigall, Simon","last_name":"Nachtigall","first_name":"Simon"},{"full_name":"Renzelmann, Timo","last_name":"Renzelmann","first_name":"Timo"},{"first_name":"Rudi","full_name":"Wolf, Rudi","last_name":"Wolf"}],"date_created":"2021-12-15T17:43:11Z","abstract":[{"lang":"eng","text":"Modern cryptographic protocols, such as TLS 1.3 and QUIC, can send cryptographically protected data in “zero round-trip times (0-RTT)”, that is, without the need for a prior interactive handshake. Such protocols meet the demand for communication with minimal latency, but those currently deployed in practice achieve only rather weak security properties, as they may not achieve forward security for the first transmitted payload message and require additional countermeasures against replay attacks.Recently, 0-RTT protocols with full forward security and replay resilience have been proposed in the academic literature. These are based on puncturable encryption, which uses rather heavy building blocks, such as cryptographic pairings. Some constructions were claimed to have practical efficiency, but it is unclear how they compare concretely to protocols deployed in practice, and we currently do not have any benchmark results that new protocols can be compared with.We provide the first concrete performance analysis of a modern 0-RTT protocol with full forward security, by integrating the Bloom Filter Encryption scheme of Derler et al. (EUROCRYPT 2018) in the Chromium QUIC implementation and comparing it to Google’s original QUIC protocol. We find that for reasonable deployment parameters, the server CPU load increases approximately by a factor of eight and the memory consumption on the server increases significantly, but stays below 400&nbsp;MB even for medium-scale deployments that handle up&nbsp;to 50K connections per day. The difference of the size of handshake messages is small enough that transmission time on the network is identical, and therefore not significant.We conclude that while current 0-RTT protocols with full forward security come with significant computational overhead, their use in practice is feasible, and may be used in applications where the increased CPU and memory load can be tolerated in exchange for full forward security and replay resilience on the cryptographic protocol level. Our results serve as a first benchmark that can be used to assess the efficiency of 0-RTT protocols potentially developed in the future.\r\n"}],"status":"public","type":"conference","publication":"Cryptology and Network Security","extern":"1","language":[{"iso":"eng"}],"_id":"28997","user_id":"40915"},{"_id":"20706","user_id":"64394","language":[{"iso":"eng"}],"type":"conference","publication":"Designing for Digital Transformation. Co-Creating Services with Citizens and Industry","status":"public","date_updated":"2022-04-04T09:59:49Z","author":[{"first_name":"Philipp","last_name":"zur Heiden","full_name":"zur Heiden, Philipp"}],"date_created":"2020-12-11T14:01:48Z","title":"Considering Context in Design Science Research: A Systematic Literature Review","doi":"10.1007/978-3-030-64823-7_21","publication_status":"published","publication_identifier":{"isbn":["9783030648220","9783030648237"],"issn":["0302-9743","1611-3349"]},"year":"2020","place":"Cham","citation":{"mla":"zur Heiden, Philipp. “Considering Context in Design Science Research: A Systematic Literature Review.” <i>Designing for Digital Transformation. Co-Creating Services with Citizens and Industry</i>, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-64823-7_21\">10.1007/978-3-030-64823-7_21</a>.","short":"P. zur Heiden, in: Designing for Digital Transformation. Co-Creating Services with Citizens and Industry, Cham, 2020.","bibtex":"@inproceedings{zur Heiden_2020, place={Cham}, title={Considering Context in Design Science Research: A Systematic Literature Review}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-64823-7_21\">10.1007/978-3-030-64823-7_21</a>}, booktitle={Designing for Digital Transformation. Co-Creating Services with Citizens and Industry}, author={zur Heiden, Philipp}, year={2020} }","apa":"zur Heiden, P. (2020). Considering Context in Design Science Research: A Systematic Literature Review. <i>Designing for Digital Transformation. Co-Creating Services with Citizens and Industry</i>. <a href=\"https://doi.org/10.1007/978-3-030-64823-7_21\">https://doi.org/10.1007/978-3-030-64823-7_21</a>","ama":"zur Heiden P. Considering Context in Design Science Research: A Systematic Literature Review. In: <i>Designing for Digital Transformation. Co-Creating Services with Citizens and Industry</i>. ; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-64823-7_21\">10.1007/978-3-030-64823-7_21</a>","chicago":"Heiden, Philipp zur. “Considering Context in Design Science Research: A Systematic Literature Review.” In <i>Designing for Digital Transformation. Co-Creating Services with Citizens and Industry</i>. Cham, 2020. <a href=\"https://doi.org/10.1007/978-3-030-64823-7_21\">https://doi.org/10.1007/978-3-030-64823-7_21</a>.","ieee":"P. zur Heiden, “Considering Context in Design Science Research: A Systematic Literature Review,” 2020, doi: <a href=\"https://doi.org/10.1007/978-3-030-64823-7_21\">10.1007/978-3-030-64823-7_21</a>."}},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030399504","9783030399511"]},"publication_status":"published","citation":{"apa":"Mahmood, Y., &#38; Meier, A. (2020). Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">https://doi.org/10.1007/978-3-030-39951-1_10</a>","bibtex":"@inproceedings{Mahmood_Meier_2020, place={Cham}, title={Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Mahmood, Yasir and Meier, Arne}, year={2020} }","short":"Y. Mahmood, A. Meier, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2020.","mla":"Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>.","ama":"Mahmood Y, Meier A. Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. In: <i>Lecture Notes in Computer Science</i>. Springer International Publishing; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>","chicago":"Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">https://doi.org/10.1007/978-3-030-39951-1_10</a>.","ieee":"Y. Mahmood and A. Meier, “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic,” 2020, doi: <a href=\"https://doi.org/10.1007/978-3-030-39951-1_10\">10.1007/978-3-030-39951-1_10</a>."},"year":"2020","place":"Cham","date_created":"2023-07-03T11:41:58Z","author":[{"id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"}],"date_updated":"2024-06-04T15:56:56Z","publisher":"Springer International Publishing","doi":"10.1007/978-3-030-39951-1_10","title":"Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic","publication":"Lecture Notes in Computer Science","type":"conference","status":"public","user_id":"99353","_id":"45848","language":[{"iso":"eng"}]},{"type":"conference","publication":"Logical Foundations of Computer Science","status":"public","user_id":"99353","_id":"45818","extern":"1","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783030367541","9783030367558"],"issn":["0302-9743","1611-3349"]},"citation":{"chicago":"Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterised Complexity of Abduction in Schaefer’s Framework.” In <i>Logical Foundations of Computer Science</i>. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">https://doi.org/10.1007/978-3-030-36755-8_13</a>.","ieee":"Y. Mahmood, A. Meier, and J. Schmidt, “Parameterised Complexity of Abduction in Schaefer’s Framework,” 2020, doi: <a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">10.1007/978-3-030-36755-8_13</a>.","ama":"Mahmood Y, Meier A, Schmidt J. Parameterised Complexity of Abduction in Schaefer’s Framework. In: <i>Logical Foundations of Computer Science</i>. Springer International Publishing; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">10.1007/978-3-030-36755-8_13</a>","apa":"Mahmood, Y., Meier, A., &#38; Schmidt, J. (2020). Parameterised Complexity of Abduction in Schaefer’s Framework. <i>Logical Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">https://doi.org/10.1007/978-3-030-36755-8_13</a>","bibtex":"@inproceedings{Mahmood_Meier_Schmidt_2020, place={Cham}, title={Parameterised Complexity of Abduction in Schaefer’s Framework}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">10.1007/978-3-030-36755-8_13</a>}, booktitle={Logical Foundations of Computer Science}, publisher={Springer International Publishing}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2020} }","mla":"Mahmood, Yasir, et al. “Parameterised Complexity of Abduction in Schaefer’s Framework.” <i>Logical Foundations of Computer Science</i>, Springer International Publishing, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-36755-8_13\">10.1007/978-3-030-36755-8_13</a>.","short":"Y. Mahmood, A. Meier, J. Schmidt, in: Logical Foundations of Computer Science, Springer International Publishing, Cham, 2020."},"place":"Cham","year":"2020","author":[{"last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353","first_name":"Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"},{"full_name":"Schmidt, Johannes","last_name":"Schmidt","first_name":"Johannes"}],"date_created":"2023-06-30T11:51:03Z","date_updated":"2024-06-04T16:02:33Z","publisher":"Springer International Publishing","doi":"10.1007/978-3-030-36755-8_13","title":"Parameterised Complexity of Abduction in Schaefer’s Framework"},{"publication_identifier":{"isbn":["9783030503086","9783030503093"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Cham","year":"2020","citation":{"chicago":"Haney, Julie M., Susanne M. Furman, and Yasemin Acar. “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges.” In <i>HCI for Cybersecurity, Privacy and Trust</i>. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-50309-3_26\">https://doi.org/10.1007/978-3-030-50309-3_26</a>.","ieee":"J. M. Haney, S. M. Furman, and Y. Acar, “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges,” in <i>HCI for Cybersecurity, Privacy and Trust</i>, Cham: Springer International Publishing, 2020.","ama":"Haney JM, Furman SM, Acar Y. Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges. In: <i>HCI for Cybersecurity, Privacy and Trust</i>. Springer International Publishing; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-50309-3_26\">10.1007/978-3-030-50309-3_26</a>","apa":"Haney, J. M., Furman, S. M., &#38; Acar, Y. (2020). Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges. In <i>HCI for Cybersecurity, Privacy and Trust</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-50309-3_26\">https://doi.org/10.1007/978-3-030-50309-3_26</a>","bibtex":"@inbook{Haney_Furman_Acar_2020, place={Cham}, title={Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-50309-3_26\">10.1007/978-3-030-50309-3_26</a>}, booktitle={HCI for Cybersecurity, Privacy and Trust}, publisher={Springer International Publishing}, author={Haney, Julie M. and Furman, Susanne M. and Acar, Yasemin}, year={2020} }","mla":"Haney, Julie M., et al. “Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges.” <i>HCI for Cybersecurity, Privacy and Trust</i>, Springer International Publishing, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-50309-3_26\">10.1007/978-3-030-50309-3_26</a>.","short":"J.M. Haney, S.M. Furman, Y. Acar, in: HCI for Cybersecurity, Privacy and Trust, Springer International Publishing, Cham, 2020."},"date_updated":"2024-06-05T13:04:23Z","publisher":"Springer International Publishing","author":[{"full_name":"Haney, Julie M.","last_name":"Haney","first_name":"Julie M."},{"first_name":"Susanne M.","last_name":"Furman","full_name":"Furman, Susanne M."},{"first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin","id":"94636"}],"date_created":"2023-09-22T12:59:53Z","title":"Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges","doi":"10.1007/978-3-030-50309-3_26","publication":"HCI for Cybersecurity, Privacy and Trust","type":"book_chapter","status":"public","_id":"47261","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","extern":"1","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"user_id":"125442","_id":"65530","status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter","doi":"10.1007/978-3-030-59013-0_11","title":"Fooling Primality Tests on Smartcards","date_created":"2026-04-30T09:26:58Z","author":[{"first_name":"Vladimir","last_name":"Sedlacek","full_name":"Sedlacek, Vladimir"},{"first_name":"Jan","full_name":"Jancar, Jan","last_name":"Jancar"},{"last_name":"Svenda","full_name":"Svenda, Petr","first_name":"Petr"}],"publisher":"Springer International Publishing","date_updated":"2026-04-30T09:32:51Z","citation":{"ieee":"V. Sedlacek, J. Jancar, and P. Svenda, “Fooling Primality Tests on Smartcards,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer International Publishing, 2020.","chicago":"Sedlacek, Vladimir, Jan Jancar, and Petr Svenda. “Fooling Primality Tests on Smartcards.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-59013-0_11\">https://doi.org/10.1007/978-3-030-59013-0_11</a>.","ama":"Sedlacek V, Jancar J, Svenda P. Fooling Primality Tests on Smartcards. In: <i>Lecture Notes in Computer Science</i>. Springer International Publishing; 2020. doi:<a href=\"https://doi.org/10.1007/978-3-030-59013-0_11\">10.1007/978-3-030-59013-0_11</a>","apa":"Sedlacek, V., Jancar, J., &#38; Svenda, P. (2020). Fooling Primality Tests on Smartcards. In <i>Lecture Notes in Computer Science</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-59013-0_11\">https://doi.org/10.1007/978-3-030-59013-0_11</a>","bibtex":"@inbook{Sedlacek_Jancar_Svenda_2020, place={Cham}, title={Fooling Primality Tests on Smartcards}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-59013-0_11\">10.1007/978-3-030-59013-0_11</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Sedlacek, Vladimir and Jancar, Jan and Svenda, Petr}, year={2020} }","short":"V. Sedlacek, J. Jancar, P. Svenda, in: Lecture Notes in Computer Science, Springer International Publishing, Cham, 2020.","mla":"Sedlacek, Vladimir, et al. “Fooling Primality Tests on Smartcards.” <i>Lecture Notes in Computer Science</i>, Springer International Publishing, 2020, doi:<a href=\"https://doi.org/10.1007/978-3-030-59013-0_11\">10.1007/978-3-030-59013-0_11</a>."},"year":"2020","place":"Cham","publication_identifier":{"isbn":["9783030590123","9783030590130"],"issn":["0302-9743","1611-3349"]},"publication_status":"published"}]