[{"user_id":"477","department":[{"_id":"64"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"326","type":"bachelorsthesis","status":"public","date_created":"2017-10-17T12:41:55Z","author":[{"last_name":"Heihoff","full_name":"Heihoff, Frederic","first_name":"Frederic"}],"supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:07Z","title":"A group signature scheme based on the LSRW assumption","citation":{"apa":"Heihoff, F. (2015). <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn.","short":"F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität Paderborn, 2015.","mla":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015.","bibtex":"@book{Heihoff_2015, title={A group signature scheme based on the LSRW assumption}, publisher={Universität Paderborn}, author={Heihoff, Frederic}, year={2015} }","ama":"Heihoff F. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn; 2015.","ieee":"F. Heihoff, <i>A group signature scheme based on the LSRW assumption</i>. Universität Paderborn, 2015.","chicago":"Heihoff, Frederic. <i>A Group Signature Scheme Based on the LSRW Assumption</i>. Universität Paderborn, 2015."},"year":"2015"},{"doi":"10.1016/j.tcs.2014.11.027","title":"A deterministic worst-case message complexity optimal solution for resource discovery","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2017-10-17T12:41:55Z","date_updated":"2022-01-06T06:59:08Z","publisher":"Elsevier","page":"67-79","citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A deterministic worst-case message complexity optimal solution for resource discovery,” <i>Theoretical Computer Science</i>, pp. 67–79, 2015.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, 2015, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>. 2015:67-79. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. <i>Theoretical Computer Science</i>, 67–79. <a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">https://doi.org/10.1016/j.tcs.2014.11.027</a>","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theoretical Computer Science (2015) 67–79.","mla":"Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” <i>Theoretical Computer Science</i>, Elsevier, 2015, pp. 67–79, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>.","bibtex":"@article{Kniesburges_Koutsopoulos_Scheideler_2015, title={A deterministic worst-case message complexity optimal solution for resource discovery}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2014.11.027\">10.1016/j.tcs.2014.11.027</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2015}, pages={67–79} }"},"year":"2015","has_accepted_license":"1","file_date_updated":"2018-03-20T07:38:02Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"477","_id":"327","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-20T07:38:02Z","creator":"florida","date_updated":"2018-03-20T07:38:02Z","file_name":"327-KKS15-TOCS_01.pdf","access_level":"closed","file_id":"1427","file_size":398044}],"abstract":[{"text":"We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the address of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)O(n)) or bits (O(nlog⁡n)O(nlog⁡n)) a node receives or sends coincides with the lower bound, while ensuring only a linear runtime (O(n)O(n)) on the number of rounds.","lang":"eng"}],"publication":"Theoretical Computer Science","type":"journal_article"},{"type":"bachelorsthesis","status":"public","department":[{"_id":"78"}],"user_id":"477","_id":"3364","project":[{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"language":[{"iso":"ger"}],"citation":{"apa":"Knorr, C. (2015). <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn.","mla":"Knorr, Christoph. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015.","bibtex":"@book{Knorr_2015, title={Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph}, year={2015} }","short":"C. Knorr, Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten, Universität Paderborn, 2015.","ama":"Knorr C. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn; 2015.","chicago":"Knorr, Christoph. <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015.","ieee":"C. Knorr, <i>Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten</i>. Universität Paderborn, 2015."},"year":"2015","author":[{"first_name":"Christoph","full_name":"Knorr, Christoph","last_name":"Knorr"}],"date_created":"2018-06-26T14:06:07Z","supervisor":[{"id":"43646","full_name":"Lösch, Achim","last_name":"Lösch","first_name":"Achim"},{"first_name":"Marco","last_name":"Platzner","id":"398","full_name":"Platzner, Marco"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:13Z","title":"Evaluation von Bildverarbeitungsalgorithmen in heterogenen Rechenknoten"},{"language":[{"iso":"eng"}],"_id":"3815","department":[{"_id":"600"}],"user_id":"82920","series_title":"Lecture Notes in Computer Science","editor":[{"first_name":"Junichi","full_name":"Tsujii, Junichi","last_name":"Tsujii"},{"first_name":"Jan","last_name":"Hajic","full_name":"Hajic, Jan"}],"status":"public","publication":"Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing","type":"conference","title":"Sentiment Flow - A General Model of Web Review Argumentation","doi":"10.18653/v1/D15-1072","main_file_link":[{"url":"https://www.aclweb.org/anthology/D15-1072.pdf"}],"date_updated":"2022-01-06T06:59:37Z","author":[{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900","first_name":"Henning"},{"first_name":"Johannes","last_name":"Kiesel","full_name":"Kiesel, Johannes"},{"first_name":"Benno","full_name":"Stein, Benno","last_name":"Stein"}],"date_created":"2018-08-02T13:38:41Z","year":"2015","page":"601-611","citation":{"ieee":"H. Wachsmuth, J. Kiesel, and B. Stein, “Sentiment Flow - A General Model of Web Review Argumentation,” in <i>Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</i>, 2015, pp. 601–611.","chicago":"Wachsmuth, Henning, Johannes Kiesel, and Benno Stein. “Sentiment Flow - A General Model of Web Review Argumentation.” In <i>Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</i>, edited by Junichi Tsujii and Jan Hajic, 601–11. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.18653/v1/D15-1072\">https://doi.org/10.18653/v1/D15-1072</a>.","ama":"Wachsmuth H, Kiesel J, Stein B. Sentiment Flow - A General Model of Web Review Argumentation. In: Tsujii J, Hajic J, eds. <i>Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</i>. Lecture Notes in Computer Science. ; 2015:601-611. doi:<a href=\"https://doi.org/10.18653/v1/D15-1072\">10.18653/v1/D15-1072</a>","apa":"Wachsmuth, H., Kiesel, J., &#38; Stein, B. (2015). Sentiment Flow - A General Model of Web Review Argumentation. In J. Tsujii &#38; J. Hajic (Eds.), <i>Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</i> (pp. 601–611). <a href=\"https://doi.org/10.18653/v1/D15-1072\">https://doi.org/10.18653/v1/D15-1072</a>","short":"H. Wachsmuth, J. Kiesel, B. Stein, in: J. Tsujii, J. Hajic (Eds.), Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015, pp. 601–611.","mla":"Wachsmuth, Henning, et al. “Sentiment Flow - A General Model of Web Review Argumentation.” <i>Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</i>, edited by Junichi Tsujii and Jan Hajic, 2015, pp. 601–11, doi:<a href=\"https://doi.org/10.18653/v1/D15-1072\">10.18653/v1/D15-1072</a>.","bibtex":"@inproceedings{Wachsmuth_Kiesel_Stein_2015, series={Lecture Notes in Computer Science}, title={Sentiment Flow - A General Model of Web Review Argumentation}, DOI={<a href=\"https://doi.org/10.18653/v1/D15-1072\">10.18653/v1/D15-1072</a>}, booktitle={Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing}, author={Wachsmuth, Henning and Kiesel, Johannes and Stein, Benno}, editor={Tsujii, Junichi and Hajic, JanEditors}, year={2015}, pages={601–611}, collection={Lecture Notes in Computer Science} }"},"publication_identifier":{"isbn":["978-3-319-25740-2"]}},{"status":"public","type":"book","language":[{"iso":"eng"}],"department":[{"_id":"600"}],"user_id":"82920","series_title":"Lecture Notes in Computer Science","_id":"3879","citation":{"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>.","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} }","short":"H. Wachsmuth, Text Analysis Pipelines - Towards Ad-Hoc Large-Scale Text Mining, 2015.","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>","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>"},"year":"2015","publication_identifier":{"isbn":["978-3-319-25740-2"]},"doi":"http://dx.doi.org/10.1007/978-3-319-25741-9","title":"Text Analysis Pipelines - Towards Ad-hoc Large-scale Text Mining","author":[{"first_name":"Henning","id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"}],"date_created":"2018-08-11T16:15:08Z","date_updated":"2022-01-06T06:59:47Z"},{"page":"116-138","citation":{"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} }","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>.","short":"G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems &#38; Structures (2015) 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>","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>.","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>"},"year":"2015","has_accepted_license":"1","doi":"10.1016/j.cl.2015.05.003","title":"Grammar-based model transformations: Definition, execution, and quality properties","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","id":"573","full_name":"Wehrheim, Heike"}],"date_created":"2017-10-17T12:41:48Z","publisher":"Elsevier","date_updated":"2022-01-06T06:58:43Z","status":"public","file":[{"creator":"florida","date_created":"2018-03-21T09:22:03Z","date_updated":"2018-03-21T09:22:03Z","access_level":"closed","file_id":"1464","file_name":"290-BSW15-main.pdf","file_size":1329478,"content_type":"application/pdf","relation":"main_file","success":1}],"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."}],"publication":"Computer Languages, Systems & Structures","type":"journal_article","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:22:03Z","ddc":["040"],"department":[{"_id":"77"}],"user_id":"477","_id":"290","project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"title":"Tightly-Secure Signatures from Chameleon Hash Functions","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/1021.pdf"}],"doi":"10.1007/978-3-662-46447-2_12","oa":"1","date_updated":"2022-01-06T06:58:47Z","publisher":"Springer Berlin Heidelberg","date_created":"2018-05-25T12:46:08Z","author":[{"full_name":"Blazy, Olivier","last_name":"Blazy","first_name":"Olivier"},{"full_name":"Kakvi, Saqib","id":"66268","last_name":"Kakvi","first_name":"Saqib"},{"last_name":"Kiltz","full_name":"Kiltz, Eike","first_name":"Eike"},{"full_name":"Pan, Jiaxin","last_name":"Pan","first_name":"Jiaxin"}],"year":"2015","place":"Berlin, Heidelberg","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>","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} }","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>.","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>"},"page":"256-279","publication_status":"published","publication_identifier":{"isbn":["9783662464465","9783662464472"],"issn":["0302-9743","1611-3349"]},"extern":"1","_id":"2921","user_id":"66268","department":[{"_id":"558"}],"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science"},{"title":"Evaluation of Pairing Optimization for Embedded Platforms","author":[{"full_name":"Sosniak, Martin","last_name":"Sosniak","first_name":"Martin"}],"date_created":"2017-10-17T12:41:50Z","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:49Z","citation":{"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.","ama":"Sosniak M. <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."},"year":"2015","department":[{"_id":"64"}],"user_id":"25078","_id":"297","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"status":"public","type":"mastersthesis"},{"citation":{"ama":"Gerken B. <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.","ieee":"B. Gerken, <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} }","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.","apa":"Gerken, B. (2015). <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>. Universität Paderborn."},"year":"2015","date_created":"2017-10-17T12:41:50Z","author":[{"full_name":"Gerken, Britta","last_name":"Gerken","first_name":"Britta"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"date_updated":"2022-01-06T06:58:50Z","publisher":"Universität Paderborn","title":"Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie","type":"mastersthesis","status":"public","user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"_id":"299","language":[{"iso":"ger"}]},{"has_accepted_license":"1","year":"2015","citation":{"apa":"Bobolz, J. (2015). <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn.","bibtex":"@book{Bobolz_2015, title={Efficient Verifier-Local Revocation for Anonymous Credentials}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2015} }","mla":"Bobolz, Jan. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>. Universität Paderborn, 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."},"date_updated":"2022-01-06T06:58:51Z","publisher":"Universität Paderborn","oa":"1","date_created":"2017-10-17T12:41:50Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"author":[{"last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan","first_name":"Jan"}],"title":"Efficient Verifier-Local Revocation for Anonymous Credentials","type":"mastersthesis","urn":"3016","file":[{"file_size":1214027,"file_id":"1443","access_level":"open_access","file_name":"301-thesis_jbobolz_final_02.pdf","date_updated":"2018-07-20T09:54:22Z","date_created":"2018-03-20T07:47:11Z","creator":"florida","relation":"main_file","content_type":"application/pdf"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"301","user_id":"27207","department":[{"_id":"64"}],"ddc":["040"],"file_date_updated":"2018-07-20T09:54:22Z"},{"date_updated":"2022-01-06T06:58:51Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2017-10-17T12:41:50Z","author":[{"first_name":"Christian","last_name":"Stroh","full_name":"Stroh, Christian"}],"title":"Efficient Attributes for Pairing-Based Anonymous Credentials","year":"2015","citation":{"ama":"Stroh C. <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.","chicago":"Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>. Universität Paderborn, 2015.","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."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"302","user_id":"477","department":[{"_id":"64"}],"type":"mastersthesis","status":"public"},{"citation":{"ama":"Koutsopoulos A. <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.","chicago":"Koutsopoulos, Andreas. <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} }"},"year":"2015","has_accepted_license":"1","title":"Dynamics and Efficiency in Topological Self-Stabilization","date_created":"2017-10-17T12:41:51Z","author":[{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:58:53Z","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":2275834,"access_level":"closed","file_name":"304-Dissertation_-_Koutsopoulos.pdf","file_id":"1441","date_updated":"2018-03-20T07:46:19Z","date_created":"2018-03-20T07:46:19Z","creator":"florida"}],"type":"dissertation","file_date_updated":"2018-03-20T07:46:19Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"304","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"}],"date_created":"2017-10-17T12:41:51Z","date_updated":"2022-01-06T06:58:54Z","publisher":"Universität Paderborn","title":"Distributed Data Structures and the Power of topological Self-Stabilization","has_accepted_license":"1","citation":{"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} }","short":"S. Kniesburges, Distributed Data Structures and the Power of Topological Self-Stabilization, Universität Paderborn, 2015.","mla":"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.","chicago":"Kniesburges, Sebastian. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn, 2015.","ama":"Kniesburges S. <i>Distributed Data Structures and the Power of Topological Self-Stabilization</i>. Universität Paderborn; 2015."},"year":"2015","department":[{"_id":"79"}],"user_id":"15504","_id":"305","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"file_date_updated":"2018-03-13T09:14:43Z","ddc":["040"],"type":"dissertation","status":"public","file":[{"file_id":"1206","file_name":"305-Dissertation_-_Kniesburges.pdf","access_level":"closed","file_size":1709094,"creator":"florida","date_created":"2018-03-13T09:14:43Z","date_updated":"2018-03-13T09:14:43Z","relation":"main_file","success":1,"content_type":"application/pdf"}]},{"citation":{"apa":"Schleiter, P. (2015). <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn.","short":"P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes, 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} }","mla":"Schleiter, Patrick. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>. Universität Paderborn, 2015.","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."},"year":"2015","has_accepted_license":"1","title":"Constructions of Fully Secure Predicate Encryption Schemes","author":[{"last_name":"Schleiter","full_name":"Schleiter, Patrick","first_name":"Patrick"}],"supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2017-10-17T12:41:52Z","date_updated":"2022-01-06T06:58:57Z","publisher":"Universität Paderborn","file":[{"file_size":721996,"access_level":"closed","file_id":"1439","file_name":"312-MA_2015_Schleiter_Constructions_of_fully_secure_PE_schemes_01.pdf","date_updated":"2018-03-20T07:44:55Z","creator":"florida","date_created":"2018-03-20T07:44:55Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"mastersthesis","file_date_updated":"2018-03-20T07:44:55Z","ddc":["040"],"user_id":"477","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"312"},{"title":"Confined Guessing: New Signatures From Standard Assumptions","doi":"10.1007/s00145-014-9183-z","date_updated":"2022-01-06T06:58:57Z","author":[{"first_name":"Florian","last_name":"Böhl","full_name":"Böhl, Florian"},{"first_name":"Dennis","last_name":"Hofheinz","full_name":"Hofheinz, Dennis"},{"full_name":"Jager, Tibor","id":"64669","last_name":"Jager","first_name":"Tibor"},{"full_name":"Koch, Jessica","last_name":"Koch","first_name":"Jessica"},{"first_name":"Christoph","last_name":"Striecks","full_name":"Striecks, Christoph"}],"date_created":"2018-06-07T09:17:17Z","year":"2015","citation":{"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>","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>.","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} }","short":"F. Böhl, D. Hofheinz, T. Jager, J. Koch, C. Striecks, J. Cryptology (2015) 176--208.","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."},"page":"176--208","issue":"1","extern":"1","_id":"3120","user_id":"38235","department":[{"_id":"558"}],"status":"public","type":"journal_article","publication":"J. Cryptology"},{"date_updated":"2022-01-06T06:58:57Z","date_created":"2018-06-07T09:17:47Z","author":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"full_name":"Schwenk, Jörg","last_name":"Schwenk","first_name":"Jörg"},{"first_name":"Juraj","last_name":"Somorovsky","full_name":"Somorovsky, Juraj"}],"title":"On the Security of TLS 1.3 and QUIC Against Weaknesses in PKCS#1 v1.5 Encryption","doi":"10.1145/2810103.2813657","year":"2015","page":"1185--1196","citation":{"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>.","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.","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>","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>"},"_id":"3121","department":[{"_id":"558"}],"user_id":"38235","extern":"1","publication":"Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, Denver, CO, USA, October 12-16, 2015","type":"conference","status":"public"},{"_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":[{"last_name":"Jager","id":"64669","full_name":"Jager, Tibor","first_name":"Tibor"},{"full_name":"Schwenk, Jörg","last_name":"Schwenk","first_name":"Jörg"},{"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":{"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} }","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.","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>.","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>","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>","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.","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>."}},{"page":"27--51","citation":{"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.","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.","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} }","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>.","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>"},"year":"2015","doi":"10.1007/978-3-662-46447-2_2","title":"On the Selective Opening Security of Practical Public-Key Encryption Schemes","date_created":"2018-06-07T09:19:04Z","author":[{"last_name":"Heuer","full_name":"Heuer, Felix","first_name":"Felix"},{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"full_name":"Kiltz, Eike","last_name":"Kiltz","first_name":"Eike"},{"full_name":"Schäge, Sven","last_name":"Schäge","first_name":"Sven"}],"date_updated":"2022-01-06T06:58:57Z","status":"public","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","extern":"1","department":[{"_id":"558"}],"user_id":"38235","_id":"3123"},{"page":"477--494","citation":{"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>.","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>","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>.","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.","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>"},"year":"2015","author":[{"last_name":"Bergsma","full_name":"Bergsma, Florian","first_name":"Florian"},{"first_name":"Tibor","id":"64669","full_name":"Jager, Tibor","last_name":"Jager"},{"full_name":"Schwenk, Jörg","last_name":"Schwenk","first_name":"Jörg"}],"date_created":"2018-06-07T09:19:47Z","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"},{"type":"conference","publication":"Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part {II}","status":"public","user_id":"38235","department":[{"_id":"558"}],"_id":"3125","extern":"1","citation":{"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>","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} }","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.","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>.","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>"},"page":"121--143","year":"2015","date_created":"2018-06-07T09:20:19Z","author":[{"first_name":"Tibor","full_name":"Jager, Tibor","id":"64669","last_name":"Jager"}],"date_updated":"2022-01-06T06:58:57Z","doi":"10.1007/978-3-662-46497-7_5","title":"Verifiable Random Functions from Weaker Assumptions"}]