[{"language":[{"iso":"eng"}],"_id":"3879","series_title":"Lecture Notes in Computer Science","user_id":"82920","department":[{"_id":"600"}],"status":"public","type":"book","title":"Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining","doi":"http://dx.doi.org/10.1007/978-3-319-25741-9","date_updated":"2022-01-06T06:59:47Z","date_created":"2018-08-11T16:15:08Z","author":[{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"}],"year":"2015","citation":{"apa":"Wachsmuth, H. (2015). <i>Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining</i>. <a href=\"http://dx.doi.org/10.1007/978-3-319-25741-9\">http://dx.doi.org/10.1007/978-3-319-25741-9</a>","short":"H. Wachsmuth, Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining, 2015.","bibtex":"@book{Wachsmuth_2015, series={Lecture Notes in Computer Science}, title={Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining}, DOI={<a href=\"http://dx.doi.org/10.1007/978-3-319-25741-9\">http://dx.doi.org/10.1007/978-3-319-25741-9</a>}, author={Wachsmuth, Henning}, year={2015}, collection={Lecture Notes in Computer Science} }","mla":"Wachsmuth, Henning. <i>Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining</i>. 2015, doi:<a href=\"http://dx.doi.org/10.1007/978-3-319-25741-9\">http://dx.doi.org/10.1007/978-3-319-25741-9</a>.","chicago":"Wachsmuth, Henning. <i>Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining</i>. Lecture Notes in Computer Science, 2015. <a href=\"http://dx.doi.org/10.1007/978-3-319-25741-9\">http://dx.doi.org/10.1007/978-3-319-25741-9</a>.","ieee":"H. Wachsmuth, <i>Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining</i>. 2015.","ama":"Wachsmuth H. <i>Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining</i>.; 2015. doi:<a href=\"http://dx.doi.org/10.1007/978-3-319-25741-9\">http://dx.doi.org/10.1007/978-3-319-25741-9</a>"},"publication_identifier":{"isbn":["978-3-319-25740-2"]}},{"_id":"290","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"77"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-21T09:22:03Z","language":[{"iso":"eng"}],"publication":"Computer Languages, Systems & Structures","type":"journal_article","abstract":[{"lang":"eng","text":"Model transformation is a key concept in model-driven software engineering. The definition of model transformations is usually based on meta-models describing the abstract syntax of languages. While meta-models are thereby able to abstract from uperfluous details of concrete syntax, they often loose structural information inherent in languages, like information on model elements always occurring together in particular shapes. As a consequence, model transformations cannot naturally re-use language structures, thus leading to unnecessary complexity in their development as well as in quality assurance.In this paper, we propose a new approach to model transformation development which allows to simplify the developed transformations and improve their quality via the exploitation of the languages׳ structures. The approach is based on context-free graph grammars and transformations defined by pairing productions of source and target grammars. We show that such transformations have important properties: they terminate and are sound, complete, and deterministic."}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:22:03Z","date_created":"2018-03-21T09:22:03Z","creator":"florida","file_size":1329478,"file_name":"290-BSW15-main.pdf","access_level":"closed","file_id":"1464"}],"publisher":"Elsevier","date_updated":"2022-01-06T06:58:43Z","author":[{"first_name":"Galina","full_name":"Besova, Galina","last_name":"Besova"},{"first_name":"Dominik","last_name":"Steenken","full_name":"Steenken, Dominik"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_created":"2017-10-17T12:41:48Z","title":"Grammar-based model transformations: Definition, execution, and quality properties","doi":"10.1016/j.cl.2015.05.003","has_accepted_license":"1","year":"2015","page":"116-138","citation":{"ama":"Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition, execution, and quality properties. <i>Computer Languages, Systems &#38; Structures</i>. 2015:116-138. doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>","ieee":"G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations: Definition, execution, and quality properties,” <i>Computer Languages, Systems &#38; Structures</i>, pp. 116–138, 2015.","chicago":"Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” <i>Computer Languages, Systems &#38; Structures</i>, 2015, 116–38. <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>.","short":"G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems &#38; Structures (2015) 116–138.","mla":"Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” <i>Computer Languages, Systems &#38; Structures</i>, Elsevier, 2015, pp. 116–38, doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>.","bibtex":"@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations: Definition, execution, and quality properties}, DOI={<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>}, journal={Computer Languages, Systems &#38; Structures}, publisher={Elsevier}, author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015}, pages={116–138} }","apa":"Besova, G., Steenken, D., &#38; Wehrheim, H. (2015). Grammar-based model transformations: Definition, execution, and quality properties. <i>Computer Languages, Systems &#38; Structures</i>, 116–138. <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>"}},{"publication_identifier":{"isbn":["9783662464465","9783662464472"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"256-279","citation":{"apa":"Blazy, O., Kakvi, S., Kiltz, E., &#38; Pan, J. (2015). Tightly-Secure Signatures from Chameleon Hash Functions. In <i>Lecture Notes in Computer Science</i> (pp. 256–279). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">https://doi.org/10.1007/978-3-662-46447-2_12</a>","short":"O. Blazy, S. Kakvi, E. Kiltz, J. Pan, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2015, pp. 256–279.","mla":"Blazy, Olivier, et al. “Tightly-Secure Signatures from Chameleon Hash Functions.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2015, pp. 256–79, doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">10.1007/978-3-662-46447-2_12</a>.","bibtex":"@inbook{Blazy_Kakvi_Kiltz_Pan_2015, place={Berlin, Heidelberg}, title={Tightly-Secure Signatures from Chameleon Hash Functions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">10.1007/978-3-662-46447-2_12</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blazy, Olivier and Kakvi, Saqib and Kiltz, Eike and Pan, Jiaxin}, year={2015}, pages={256–279} }","ieee":"O. Blazy, S. Kakvi, E. Kiltz, and J. Pan, “Tightly-Secure Signatures from Chameleon Hash Functions,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2015, pp. 256–279.","chicago":"Blazy, Olivier, Saqib Kakvi, Eike Kiltz, and Jiaxin Pan. “Tightly-Secure Signatures from Chameleon Hash Functions.” In <i>Lecture Notes in Computer Science</i>, 256–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">https://doi.org/10.1007/978-3-662-46447-2_12</a>.","ama":"Blazy O, Kakvi S, Kiltz E, Pan J. Tightly-Secure Signatures from Chameleon Hash Functions. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2015:256-279. doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">10.1007/978-3-662-46447-2_12</a>"},"place":"Berlin, Heidelberg","year":"2015","author":[{"first_name":"Olivier","last_name":"Blazy","full_name":"Blazy, Olivier"},{"last_name":"Kakvi","id":"66268","full_name":"Kakvi, Saqib","first_name":"Saqib"},{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"first_name":"Jiaxin","full_name":"Pan, Jiaxin","last_name":"Pan"}],"date_created":"2018-05-25T12:46:08Z","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:47Z","oa":"1","doi":"10.1007/978-3-662-46447-2_12","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/1021.pdf"}],"title":"Tightly-Secure Signatures from Chameleon Hash Functions","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","department":[{"_id":"558"}],"user_id":"66268","_id":"2921","extern":"1"},{"status":"public","type":"mastersthesis","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"297","user_id":"25078","department":[{"_id":"64"}],"year":"2015","citation":{"ama":"Sosniak M. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn; 2015.","chicago":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","ieee":"M. Sosniak, <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","apa":"Sosniak, M. (2015). <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn.","mla":"Sosniak, Martin. <i>Evaluation of Pairing Optimization for Embedded Platforms</i>. Universität Paderborn, 2015.","bibtex":"@book{Sosniak_2015, title={Evaluation of Pairing Optimization for Embedded Platforms}, publisher={Universität Paderborn}, author={Sosniak, Martin}, year={2015} }","short":"M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms, Universität Paderborn, 2015."},"title":"Evaluation of Pairing Optimization for Embedded Platforms","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:49Z","supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2017-10-17T12:41:50Z","author":[{"first_name":"Martin","full_name":"Sosniak, Martin","last_name":"Sosniak"}]},{"citation":{"ama":"Gerken B. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn; 2015.","ieee":"B. Gerken, <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","chicago":"Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","short":"B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie, Universität Paderborn, 2015.","mla":"Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn, 2015.","bibtex":"@book{Gerken_2015, title={Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie}, publisher={Universität Paderborn}, author={Gerken, Britta}, year={2015} }","apa":"Gerken, B. (2015). <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn."},"year":"2015","title":"Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2017-10-17T12:41:50Z","author":[{"last_name":"Gerken","full_name":"Gerken, Britta","first_name":"Britta"}],"date_updated":"2022-01-06T06:58:50Z","publisher":"Universität Paderborn","status":"public","type":"mastersthesis","language":[{"iso":"ger"}],"department":[{"_id":"64"}],"user_id":"477","_id":"299","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}]},{"ddc":["040"],"file_date_updated":"2018-07-20T09:54:22Z","_id":"301","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"64"}],"user_id":"27207","urn":"3016","status":"public","file":[{"date_created":"2018-03-20T07:47:11Z","creator":"florida","date_updated":"2018-07-20T09:54:22Z","file_name":"301-thesis_jbobolz_final_02.pdf","access_level":"open_access","file_id":"1443","file_size":1214027,"content_type":"application/pdf","relation":"main_file"}],"type":"mastersthesis","title":"Efficient Verifier-Local Revocation for Anonymous Credentials","publisher":"Universität Paderborn","oa":"1","date_updated":"2022-01-06T06:58:51Z","date_created":"2017-10-17T12:41:50Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"first_name":"Jan","last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan"}],"year":"2015","citation":{"apa":"Bobolz, J. (2015). <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn.","mla":"Bobolz, Jan. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 2015.","bibtex":"@book{Bobolz_2015, title={Efficient Verifier-Local Revocation for Anonymous Credentials}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2015} }","short":"J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials, Universität Paderborn, 2015.","ieee":"J. Bobolz, <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 2015.","chicago":"Bobolz, Jan. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 2015.","ama":"Bobolz J. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn; 2015."},"has_accepted_license":"1"},{"date_updated":"2022-01-06T06:58:51Z","publisher":"Universität Paderborn","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"first_name":"Christian","last_name":"Stroh","full_name":"Stroh, Christian"}],"date_created":"2017-10-17T12:41:50Z","title":"Efficient Attributes for Pairing-Based Anonymous Credentials","year":"2015","citation":{"apa":"Stroh, C. (2015). <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn.","bibtex":"@book{Stroh_2015, title={Efficient Attributes for Pairing-Based Anonymous Credentials}, publisher={Universität Paderborn}, author={Stroh, Christian}, year={2015} }","short":"C. Stroh, Efficient Attributes for Pairing-Based Anonymous Credentials, Universität Paderborn, 2015.","mla":"Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn, 2015.","ama":"Stroh C. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn; 2015.","chicago":"Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn, 2015.","ieee":"C. Stroh, <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn, 2015."},"_id":"302","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"user_id":"477","type":"mastersthesis","status":"public"},{"ddc":["040"],"file_date_updated":"2018-03-20T07:46:19Z","_id":"304","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"15504","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":2275834,"file_id":"1441","access_level":"closed","file_name":"304-Dissertation_-_Koutsopoulos.pdf","date_updated":"2018-03-20T07:46:19Z","date_created":"2018-03-20T07:46:19Z","creator":"florida"}],"type":"dissertation","title":"Dynamics and Efficiency in Topological Self-Stabilization","date_updated":"2022-01-06T06:58:53Z","publisher":"Universität Paderborn","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"}],"date_created":"2017-10-17T12:41:51Z","year":"2015","citation":{"chicago":"Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ieee":"A. Koutsopoulos, <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ama":"Koutsopoulos A. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn; 2015.","apa":"Koutsopoulos, A. (2015). <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn.","mla":"Koutsopoulos, Andreas. <i>Dynamics and Efficiency in Topological Self-Stabilization</i>. Universität Paderborn, 2015.","short":"A. Koutsopoulos, Dynamics and Efficiency in Topological Self-Stabilization, Universität Paderborn, 2015.","bibtex":"@book{Koutsopoulos_2015, title={Dynamics and Efficiency in Topological Self-Stabilization}, publisher={Universität Paderborn}, author={Koutsopoulos, Andreas}, year={2015} }"},"has_accepted_license":"1"},{"ddc":["040"],"file_date_updated":"2018-03-13T09:14:43Z","_id":"305","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"department":[{"_id":"79"}],"user_id":"15504","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-13T09:14:43Z","creator":"florida","date_updated":"2018-03-13T09:14:43Z","access_level":"closed","file_name":"305-Dissertation_-_Kniesburges.pdf","file_id":"1206","file_size":1709094}],"type":"dissertation","title":"Distributed Data Structures and the Power of topological Self-Stabilization","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:54Z","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"}],"date_created":"2017-10-17T12:41:51Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"year":"2015","citation":{"ama":"Kniesburges S. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn; 2015.","chicago":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ieee":"S. Kniesburges, <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn, 2015.","apa":"Kniesburges, S. (2015). <i>Distributed Data Structures and the Power of topological Self-Stabilization</i>. Universität Paderborn.","bibtex":"@book{Kniesburges_2015, title={Distributed Data Structures and the Power of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges, Sebastian}, year={2015} }","mla":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","short":"S. Kniesburges, Distributed Data Structures and the Power of Topological Self-Stabilization, Universität Paderborn, 2015."},"has_accepted_license":"1"},{"ddc":["040"],"file_date_updated":"2018-03-20T07:44:55Z","_id":"312","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"user_id":"477","status":"public","file":[{"file_size":721996,"file_name":"312-MA_2015_Schleiter_Constructions_of_fully_secure_PE_schemes_01.pdf","access_level":"closed","file_id":"1439","date_updated":"2018-03-20T07:44:55Z","date_created":"2018-03-20T07:44:55Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"type":"mastersthesis","title":"Constructions of Fully Secure Predicate Encryption Schemes","date_updated":"2022-01-06T06:58:57Z","publisher":"Universität Paderborn","author":[{"full_name":"Schleiter, Patrick","last_name":"Schleiter","first_name":"Patrick"}],"date_created":"2017-10-17T12:41:52Z","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"year":"2015","citation":{"ama":"Schleiter P. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn; 2015.","chicago":"Schleiter, Patrick. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn, 2015.","ieee":"P. Schleiter, <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn, 2015.","mla":"Schleiter, Patrick. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn, 2015.","bibtex":"@book{Schleiter_2015, title={Constructions of Fully Secure Predicate Encryption Schemes}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2015} }","short":"P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes, Universität Paderborn, 2015.","apa":"Schleiter, P. (2015). <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn."},"has_accepted_license":"1"},{"status":"public","type":"journal_article","publication":"J. Cryptology","extern":"1","_id":"3120","user_id":"38235","department":[{"_id":"558"}],"year":"2015","citation":{"ama":"Böhl F, Hofheinz D, Jager T, Koch J, Striecks C. Confined Guessing: New Signatures From Standard Assumptions. <i>J Cryptology</i>. 2015;(1):176--208. doi:<a href=\"https://doi.org/10.1007/s00145-014-9183-z\">10.1007/s00145-014-9183-z</a>","chicago":"Böhl, Florian, Dennis Hofheinz, Tibor Jager, Jessica Koch, and Christoph Striecks. “Confined Guessing: New Signatures From Standard Assumptions.” <i>J. Cryptology</i>, no. 1 (2015): 176--208. <a href=\"https://doi.org/10.1007/s00145-014-9183-z\">https://doi.org/10.1007/s00145-014-9183-z</a>.","ieee":"F. Böhl, D. Hofheinz, T. Jager, J. Koch, and C. Striecks, “Confined Guessing: New Signatures From Standard Assumptions,” <i>J. Cryptology</i>, no. 1, pp. 176--208, 2015.","mla":"Böhl, Florian, et al. “Confined Guessing: New Signatures From Standard Assumptions.” <i>J. Cryptology</i>, no. 1, 2015, pp. 176--208, doi:<a href=\"https://doi.org/10.1007/s00145-014-9183-z\">10.1007/s00145-014-9183-z</a>.","short":"F. Böhl, D. Hofheinz, T. Jager, J. Koch, C. Striecks, J. Cryptology (2015) 176--208.","bibtex":"@article{Böhl_Hofheinz_Jager_Koch_Striecks_2015, title={Confined Guessing: New Signatures From Standard Assumptions}, DOI={<a href=\"https://doi.org/10.1007/s00145-014-9183-z\">10.1007/s00145-014-9183-z</a>}, number={1}, journal={J. Cryptology}, author={Böhl, Florian and Hofheinz, Dennis and Jager, Tibor and Koch, Jessica and Striecks, Christoph}, year={2015}, pages={176--208} }","apa":"Böhl, F., Hofheinz, D., Jager, T., Koch, J., &#38; Striecks, C. (2015). Confined Guessing: New Signatures From Standard Assumptions. <i>J. Cryptology</i>, (1), 176--208. <a href=\"https://doi.org/10.1007/s00145-014-9183-z\">https://doi.org/10.1007/s00145-014-9183-z</a>"},"page":"176--208","issue":"1","title":"Confined Guessing: New Signatures From Standard Assumptions","doi":"10.1007/s00145-014-9183-z","date_updated":"2022-01-06T06:58:57Z","date_created":"2018-06-07T09:17:17Z","author":[{"first_name":"Florian","full_name":"Böhl, Florian","last_name":"Böhl"},{"first_name":"Dennis","full_name":"Hofheinz, Dennis","last_name":"Hofheinz"},{"last_name":"Jager","full_name":"Jager, Tibor","id":"64669","first_name":"Tibor"},{"first_name":"Jessica","last_name":"Koch","full_name":"Koch, Jessica"},{"full_name":"Striecks, Christoph","last_name":"Striecks","first_name":"Christoph"}]},{"title":"On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption","doi":"10.1145/2810103.2813657","date_updated":"2022-01-06T06:58:57Z","date_created":"2018-06-07T09:17:47Z","author":[{"first_name":"Tibor","last_name":"Jager","id":"64669","full_name":"Jager, Tibor"},{"last_name":"Schwenk","full_name":"Schwenk, Jörg","first_name":"Jörg"},{"last_name":"Somorovsky","full_name":"Somorovsky, Juraj","first_name":"Juraj"}],"year":"2015","citation":{"ama":"Jager T, Schwenk J, Somorovsky J. On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption. In: <i>Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015</i>. ; 2015:1185--1196. doi:<a href=\"https://doi.org/10.1145/2810103.2813657\">10.1145/2810103.2813657</a>","ieee":"T. Jager, J. Schwenk, and J. Somorovsky, “On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption,” in <i>Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015</i>, 2015, pp. 1185--1196.","chicago":"Jager, Tibor, Jörg Schwenk, and Juraj Somorovsky. “On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption.” In <i>Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015</i>, 1185--1196, 2015. <a href=\"https://doi.org/10.1145/2810103.2813657\">https://doi.org/10.1145/2810103.2813657</a>.","short":"T. Jager, J. Schwenk, J. Somorovsky, in: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015, 2015, pp. 1185--1196.","mla":"Jager, Tibor, et al. “On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption.” <i>Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015</i>, 2015, pp. 1185--1196, doi:<a href=\"https://doi.org/10.1145/2810103.2813657\">10.1145/2810103.2813657</a>.","bibtex":"@inproceedings{Jager_Schwenk_Somorovsky_2015, title={On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption}, DOI={<a href=\"https://doi.org/10.1145/2810103.2813657\">10.1145/2810103.2813657</a>}, booktitle={Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015}, author={Jager, Tibor and Schwenk, Jörg and Somorovsky, Juraj}, year={2015}, pages={1185--1196} }","apa":"Jager, T., Schwenk, J., &#38; Somorovsky, J. (2015). On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption. In <i>Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015</i> (pp. 1185--1196). <a href=\"https://doi.org/10.1145/2810103.2813657\">https://doi.org/10.1145/2810103.2813657</a>"},"page":"1185--1196","extern":"1","_id":"3121","user_id":"38235","department":[{"_id":"558"}],"status":"public","type":"conference","publication":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015"},{"_id":"3122","department":[{"_id":"558"}],"user_id":"38235","extern":"1","publication":"Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I","type":"conference","status":"public","date_updated":"2022-01-06T06:58:57Z","author":[{"first_name":"Tibor","full_name":"Jager, Tibor","id":"64669","last_name":"Jager"},{"first_name":"Jörg","full_name":"Schwenk, Jörg","last_name":"Schwenk"},{"first_name":"Juraj","full_name":"Somorovsky, Juraj","last_name":"Somorovsky"}],"date_created":"2018-06-07T09:18:33Z","title":"Practical Invalid Curve Attacks on TLS-ECDH","doi":"10.1007/978-3-319-24174-6_21","year":"2015","page":"407--425","citation":{"apa":"Jager, T., Schwenk, J., &#38; Somorovsky, J. (2015). Practical Invalid Curve Attacks on TLS-ECDH. In <i>Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I</i> (pp. 407--425). <a href=\"https://doi.org/10.1007/978-3-319-24174-6_21\">https://doi.org/10.1007/978-3-319-24174-6_21</a>","short":"T. Jager, J. Schwenk, J. Somorovsky, in: Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I, 2015, pp. 407--425.","bibtex":"@inproceedings{Jager_Schwenk_Somorovsky_2015, title={Practical Invalid Curve Attacks on TLS-ECDH}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-24174-6_21\">10.1007/978-3-319-24174-6_21</a>}, booktitle={Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I}, author={Jager, Tibor and Schwenk, Jörg and Somorovsky, Juraj}, year={2015}, pages={407--425} }","mla":"Jager, Tibor, et al. “Practical Invalid Curve Attacks on TLS-ECDH.” <i>Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I</i>, 2015, pp. 407--425, doi:<a href=\"https://doi.org/10.1007/978-3-319-24174-6_21\">10.1007/978-3-319-24174-6_21</a>.","ama":"Jager T, Schwenk J, Somorovsky J. Practical Invalid Curve Attacks on TLS-ECDH. In: <i>Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I</i>. ; 2015:407--425. doi:<a href=\"https://doi.org/10.1007/978-3-319-24174-6_21\">10.1007/978-3-319-24174-6_21</a>","chicago":"Jager, Tibor, Jörg Schwenk, and Juraj Somorovsky. “Practical Invalid Curve Attacks on TLS-ECDH.” In <i>Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I</i>, 407--425, 2015. <a href=\"https://doi.org/10.1007/978-3-319-24174-6_21\">https://doi.org/10.1007/978-3-319-24174-6_21</a>.","ieee":"T. Jager, J. Schwenk, and J. Somorovsky, “Practical Invalid Curve Attacks on TLS-ECDH,” in <i>Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I</i>, 2015, pp. 407--425."}},{"date_updated":"2022-01-06T06:58:57Z","date_created":"2018-06-07T09:19:04Z","author":[{"first_name":"Felix","full_name":"Heuer, Felix","last_name":"Heuer"},{"last_name":"Jager","full_name":"Jager, Tibor","id":"64669","first_name":"Tibor"},{"first_name":"Eike","full_name":"Kiltz, Eike","last_name":"Kiltz"},{"first_name":"Sven","full_name":"Schäge, Sven","last_name":"Schäge"}],"title":"On the Selective Opening Security of Practical Public-Key Encryption Schemes","doi":"10.1007/978-3-662-46447-2_2","year":"2015","page":"27--51","citation":{"apa":"Heuer, F., Jager, T., Kiltz, E., &#38; Schäge, S. (2015). On the Selective Opening Security of Practical Public-Key Encryption Schemes. In <i>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings</i> (pp. 27--51). <a href=\"https://doi.org/10.1007/978-3-662-46447-2_2\">https://doi.org/10.1007/978-3-662-46447-2_2</a>","bibtex":"@inproceedings{Heuer_Jager_Kiltz_Schäge_2015, title={On the Selective Opening Security of Practical Public-Key Encryption Schemes}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-46447-2_2\">10.1007/978-3-662-46447-2_2</a>}, booktitle={Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings}, author={Heuer, Felix and Jager, Tibor and Kiltz, Eike and Schäge, Sven}, year={2015}, pages={27--51} }","short":"F. Heuer, T. Jager, E. Kiltz, S. Schäge, in: Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015, pp. 27--51.","mla":"Heuer, Felix, et al. “On the Selective Opening Security of Practical Public-Key Encryption Schemes.” <i>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings</i>, 2015, pp. 27--51, doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_2\">10.1007/978-3-662-46447-2_2</a>.","ama":"Heuer F, Jager T, Kiltz E, Schäge S. On the Selective Opening Security of Practical Public-Key Encryption Schemes. In: <i>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings</i>. ; 2015:27--51. doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_2\">10.1007/978-3-662-46447-2_2</a>","chicago":"Heuer, Felix, Tibor Jager, Eike Kiltz, and Sven Schäge. “On the Selective Opening Security of Practical Public-Key Encryption Schemes.” In <i>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings</i>, 27--51, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_2\">https://doi.org/10.1007/978-3-662-46447-2_2</a>.","ieee":"F. Heuer, T. Jager, E. Kiltz, and S. Schäge, “On the Selective Opening Security of Practical Public-Key Encryption Schemes,” in <i>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings</i>, 2015, pp. 27--51."},"_id":"3123","department":[{"_id":"558"}],"user_id":"38235","extern":"1","publication":"Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings","type":"conference","status":"public"},{"page":"477--494","citation":{"ieee":"F. Bergsma, T. Jager, and J. Schwenk, “One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model,” in <i>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings</i>, 2015, pp. 477--494.","chicago":"Bergsma, Florian, Tibor Jager, and Jörg Schwenk. “One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model.” In <i>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings</i>, 477--494, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_21\">https://doi.org/10.1007/978-3-662-46447-2_21</a>.","ama":"Bergsma F, Jager T, Schwenk J. One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model. In: <i>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings</i>. ; 2015:477--494. doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_21\">10.1007/978-3-662-46447-2_21</a>","apa":"Bergsma, F., Jager, T., &#38; Schwenk, J. (2015). One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model. In <i>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings</i> (pp. 477--494). <a href=\"https://doi.org/10.1007/978-3-662-46447-2_21\">https://doi.org/10.1007/978-3-662-46447-2_21</a>","short":"F. Bergsma, T. Jager, J. Schwenk, in: Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings, 2015, pp. 477--494.","bibtex":"@inproceedings{Bergsma_Jager_Schwenk_2015, title={One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-46447-2_21\">10.1007/978-3-662-46447-2_21</a>}, booktitle={Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings}, author={Bergsma, Florian and Jager, Tibor and Schwenk, Jörg}, year={2015}, pages={477--494} }","mla":"Bergsma, Florian, et al. “One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model.” <i>Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings</i>, 2015, pp. 477--494, doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_21\">10.1007/978-3-662-46447-2_21</a>."},"year":"2015","date_created":"2018-06-07T09:19:47Z","author":[{"first_name":"Florian","full_name":"Bergsma, Florian","last_name":"Bergsma"},{"first_name":"Tibor","full_name":"Jager, Tibor","id":"64669","last_name":"Jager"},{"last_name":"Schwenk","full_name":"Schwenk, Jörg","first_name":"Jörg"}],"date_updated":"2022-01-06T06:58:57Z","doi":"10.1007/978-3-662-46447-2_21","title":"One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model","publication":"Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30 - April 1, 2015, Proceedings","type":"conference","status":"public","department":[{"_id":"558"}],"user_id":"38235","_id":"3124","extern":"1"},{"status":"public","type":"conference","publication":"Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}","extern":"1","_id":"3125","user_id":"38235","department":[{"_id":"558"}],"year":"2015","citation":{"ama":"Jager T. Verifiable Random Functions from Weaker Assumptions. In: <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}</i>. ; 2015:121--143. doi:<a href=\"https://doi.org/10.1007/978-3-662-46497-7_5\">10.1007/978-3-662-46497-7_5</a>","chicago":"Jager, Tibor. “Verifiable Random Functions from Weaker Assumptions.” In <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}</i>, 121--143, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46497-7_5\">https://doi.org/10.1007/978-3-662-46497-7_5</a>.","ieee":"T. Jager, “Verifiable Random Functions from Weaker Assumptions,” in <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}</i>, 2015, pp. 121--143.","mla":"Jager, Tibor. “Verifiable Random Functions from Weaker Assumptions.” <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}</i>, 2015, pp. 121--143, doi:<a href=\"https://doi.org/10.1007/978-3-662-46497-7_5\">10.1007/978-3-662-46497-7_5</a>.","short":"T. Jager, in: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}, 2015, pp. 121--143.","bibtex":"@inproceedings{Jager_2015, title={Verifiable Random Functions from Weaker Assumptions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-46497-7_5\">10.1007/978-3-662-46497-7_5</a>}, booktitle={Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}}, author={Jager, Tibor}, year={2015}, pages={121--143} }","apa":"Jager, T. (2015). Verifiable Random Functions from Weaker Assumptions. In <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}</i> (pp. 121--143). <a href=\"https://doi.org/10.1007/978-3-662-46497-7_5\">https://doi.org/10.1007/978-3-662-46497-7_5</a>"},"page":"121--143","title":"Verifiable Random Functions from Weaker Assumptions","doi":"10.1007/978-3-662-46497-7_5","date_updated":"2022-01-06T06:58:57Z","date_created":"2018-06-07T09:20:19Z","author":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"}]},{"publication":"Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I","type":"conference","status":"public","_id":"3126","department":[{"_id":"558"}],"user_id":"38235","extern":"1","year":"2015","page":"629--658","citation":{"bibtex":"@inproceedings{Bader_Hofheinz_Jager_Kiltz_Li_2015, title={Tightly-Secure Authenticated Key Exchange}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-46494-6_26\">10.1007/978-3-662-46494-6_26</a>}, booktitle={Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I}, author={Bader, Christoph and Hofheinz, Dennis and Jager, Tibor and Kiltz, Eike and Li, Yong}, year={2015}, pages={629--658} }","short":"C. Bader, D. Hofheinz, T. Jager, E. Kiltz, Y. Li, in: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I, 2015, pp. 629--658.","mla":"Bader, Christoph, et al. “Tightly-Secure Authenticated Key Exchange.” <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I</i>, 2015, pp. 629--658, doi:<a href=\"https://doi.org/10.1007/978-3-662-46494-6_26\">10.1007/978-3-662-46494-6_26</a>.","apa":"Bader, C., Hofheinz, D., Jager, T., Kiltz, E., &#38; Li, Y. (2015). Tightly-Secure Authenticated Key Exchange. In <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I</i> (pp. 629--658). <a href=\"https://doi.org/10.1007/978-3-662-46494-6_26\">https://doi.org/10.1007/978-3-662-46494-6_26</a>","ama":"Bader C, Hofheinz D, Jager T, Kiltz E, Li Y. Tightly-Secure Authenticated Key Exchange. In: <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I</i>. ; 2015:629--658. doi:<a href=\"https://doi.org/10.1007/978-3-662-46494-6_26\">10.1007/978-3-662-46494-6_26</a>","chicago":"Bader, Christoph, Dennis Hofheinz, Tibor Jager, Eike Kiltz, and Yong Li. “Tightly-Secure Authenticated Key Exchange.” In <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I</i>, 629--658, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46494-6_26\">https://doi.org/10.1007/978-3-662-46494-6_26</a>.","ieee":"C. Bader, D. Hofheinz, T. Jager, E. Kiltz, and Y. Li, “Tightly-Secure Authenticated Key Exchange,” in <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I</i>, 2015, pp. 629--658."},"date_updated":"2022-01-06T06:58:57Z","author":[{"first_name":"Christoph","full_name":"Bader, Christoph","last_name":"Bader"},{"last_name":"Hofheinz","full_name":"Hofheinz, Dennis","first_name":"Dennis"},{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"last_name":"Kiltz","full_name":"Kiltz, Eike","first_name":"Eike"},{"first_name":"Yong","last_name":"Li","full_name":"Li, Yong"}],"date_created":"2018-06-07T09:20:48Z","title":"Tightly-Secure Authenticated Key Exchange","doi":"10.1007/978-3-662-46494-6_26"},{"abstract":[{"text":"Nowadays, many service providers offer software components in the form of Software as a Service. Requesters that want to discover those services in order to use or to integrate them, need to find out which service satisfies their requirements best. For this purpose, service matching approaches determine how well the specifications of provided services satisfy their requirements (including structural, behavioral, and non-functional requirements). In this paper, we describe the tool-suite MatchBox that allows the integration of existing service matchers and their combination as part of flexibly configurable matching processes. Taking requirements and service specifications as an input, MatchBox is able to execute such matching processes and deliver rich matching results. In contrast to related tools, MatchBox allows users to take into account many different kinds of requirements, while it also provides the flexibility to control the matching process in many different ways. ","lang":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:44:26Z","creator":"florida","date_updated":"2018-03-20T07:44:26Z","file_id":"1438","file_name":"313-p974-boerding.pdf","access_level":"closed","file_size":875687}],"status":"public","type":"conference","publication":"10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE'15)","ddc":["040"],"file_date_updated":"2018-03-20T07:44:26Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"313","user_id":"477","department":[{"_id":"76"}],"year":"2015","citation":{"ama":"Börding P, Bruns M, Platenius MC. Comprehensive Service Matching with MatchBox. In: <i>10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)</i>. ; 2015:974--977. doi:<a href=\"https://doi.org/10.1145/2786805.2803181\">10.1145/2786805.2803181</a>","ieee":"P. Börding, M. Bruns, and M. C. Platenius, “Comprehensive Service Matching with MatchBox,” in <i>10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)</i>, 2015, pp. 974--977.","chicago":"Börding, Paul, Melanie Bruns, and Marie Christin Platenius. “Comprehensive Service Matching with MatchBox.” In <i>10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)</i>, 974--977, 2015. <a href=\"https://doi.org/10.1145/2786805.2803181\">https://doi.org/10.1145/2786805.2803181</a>.","bibtex":"@inproceedings{Börding_Bruns_Platenius_2015, title={Comprehensive Service Matching with MatchBox}, DOI={<a href=\"https://doi.org/10.1145/2786805.2803181\">10.1145/2786805.2803181</a>}, booktitle={10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)}, author={Börding, Paul and Bruns, Melanie and Platenius, Marie Christin}, year={2015}, pages={974--977} }","short":"P. Börding, M. Bruns, M.C. Platenius, in: 10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15), 2015, pp. 974--977.","mla":"Börding, Paul, et al. “Comprehensive Service Matching with MatchBox.” <i>10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)</i>, 2015, pp. 974--977, doi:<a href=\"https://doi.org/10.1145/2786805.2803181\">10.1145/2786805.2803181</a>.","apa":"Börding, P., Bruns, M., &#38; Platenius, M. C. (2015). Comprehensive Service Matching with MatchBox. In <i>10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)</i> (pp. 974--977). <a href=\"https://doi.org/10.1145/2786805.2803181\">https://doi.org/10.1145/2786805.2803181</a>"},"page":"974--977","has_accepted_license":"1","title":"Comprehensive Service Matching with MatchBox","doi":"10.1145/2786805.2803181","date_updated":"2022-01-06T06:58:58Z","date_created":"2017-10-17T12:41:53Z","author":[{"full_name":"Börding, Paul","last_name":"Börding","first_name":"Paul"},{"full_name":"Bruns, Melanie","last_name":"Bruns","first_name":"Melanie"},{"first_name":"Marie Christin","full_name":"Platenius, Marie Christin","last_name":"Platenius"}]},{"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","_id":"316","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"bachelorsthesis","title":"Budget Games with priced strategies","date_created":"2017-10-17T12:41:53Z","author":[{"full_name":"Pautz, Jannis","last_name":"Pautz","first_name":"Jannis"}],"supervisor":[{"last_name":"Skopalik","id":"40384","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:01Z","citation":{"apa":"Pautz, J. (2015). <i>Budget Games with priced strategies</i>. Universität Paderborn.","bibtex":"@book{Pautz_2015, title={Budget Games with priced strategies}, publisher={Universität Paderborn}, author={Pautz, Jannis}, year={2015} }","mla":"Pautz, Jannis. <i>Budget Games with Priced Strategies</i>. Universität Paderborn, 2015.","short":"J. Pautz, Budget Games with Priced Strategies, Universität Paderborn, 2015.","ieee":"J. Pautz, <i>Budget Games with priced strategies</i>. Universität Paderborn, 2015.","chicago":"Pautz, Jannis. <i>Budget Games with Priced Strategies</i>. Universität Paderborn, 2015.","ama":"Pautz J. <i>Budget Games with Priced Strategies</i>. Universität Paderborn; 2015."},"year":"2015"},{"has_accepted_license":"1","issue":"3-4","year":"2015","page":"303--320","citation":{"bibtex":"@article{Ziegert_Wehrheim_2015, title={Temporal plans for software architecture reconfiguration}, DOI={<a href=\"https://doi.org/10.1007/s00450-014-0259-7\">10.1007/s00450-014-0259-7</a>}, number={3–4}, journal={Computer Science - R &#38; D}, author={Ziegert, Steffen and Wehrheim, Heike}, year={2015}, pages={303--320} }","short":"S. Ziegert, H. Wehrheim, Computer Science - R &#38; D (2015) 303--320.","mla":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture Reconfiguration.” <i>Computer Science - R &#38; D</i>, no. 3–4, 2015, pp. 303--320, doi:<a href=\"https://doi.org/10.1007/s00450-014-0259-7\">10.1007/s00450-014-0259-7</a>.","apa":"Ziegert, S., &#38; Wehrheim, H. (2015). Temporal plans for software architecture reconfiguration. <i>Computer Science - R &#38; D</i>, (3–4), 303--320. <a href=\"https://doi.org/10.1007/s00450-014-0259-7\">https://doi.org/10.1007/s00450-014-0259-7</a>","chicago":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture Reconfiguration.” <i>Computer Science - R &#38; D</i>, no. 3–4 (2015): 303--320. <a href=\"https://doi.org/10.1007/s00450-014-0259-7\">https://doi.org/10.1007/s00450-014-0259-7</a>.","ieee":"S. Ziegert and H. Wehrheim, “Temporal plans for software architecture reconfiguration,” <i>Computer Science - R &#38; D</i>, no. 3–4, pp. 303--320, 2015.","ama":"Ziegert S, Wehrheim H. Temporal plans for software architecture reconfiguration. <i>Computer Science - R &#38; D</i>. 2015;(3-4):303--320. doi:<a href=\"https://doi.org/10.1007/s00450-014-0259-7\">10.1007/s00450-014-0259-7</a>"},"date_updated":"2022-01-06T06:59:01Z","author":[{"last_name":"Ziegert","full_name":"Ziegert, Steffen","first_name":"Steffen"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2018-06-13T07:47:56Z","title":"Temporal plans for software architecture reconfiguration","doi":"10.1007/s00450-014-0259-7","publication":"Computer Science - R & D","type":"journal_article","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-02T15:52:13Z","creator":"ups","date_updated":"2018-11-02T15:52:13Z","file_id":"5315","file_name":"TemporalPlansForSoftwareArchit.pdf","access_level":"closed","file_size":2136451}],"_id":"3162","project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"department":[{"_id":"77"}],"user_id":"477","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:52:13Z"}]