[{"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T15:54:38Z","creator":"ups","date_created":"2018-11-02T15:54:38Z","file_size":1002478,"access_level":"closed","file_name":"roz-6-Melnikov.pdf","file_id":"5317"}],"publication":"Schedae Informaticae","title":"Pairwise versus Pointwise Ranking: A Case Study","date_created":"2018-06-22T14:49:40Z","publisher":"Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego","year":"2016","file_date_updated":"2018-11-02T15:54:38Z","department":[{"_id":"355"},{"_id":"183"}],"user_id":"15504","_id":"3318","project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"journal_article","doi":"10.4467/20838476si.16.006.6187","volume":25,"author":[{"last_name":"Melnikov","full_name":"Melnikov, Vitalik","first_name":"Vitalik"},{"last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke"},{"id":"18949","full_name":"Kaimann, Daniel","last_name":"Kaimann","first_name":"Daniel"},{"first_name":"Bernd ","last_name":"Frick","full_name":"Frick, Bernd "},{"first_name":" Pritha ","full_name":"Gupta,  Pritha ","last_name":"Gupta"}],"date_updated":"2022-01-06T06:59:10Z","intvolume":"        25","citation":{"chicago":"Melnikov, Vitalik, Eyke Hüllermeier, Daniel Kaimann, Bernd  Frick, and  Pritha  Gupta. “Pairwise versus Pointwise Ranking: A Case Study.” <i>Schedae Informaticae</i> 25 (2016). <a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">https://doi.org/10.4467/20838476si.16.006.6187</a>.","ieee":"V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick, and  Pritha  Gupta, “Pairwise versus Pointwise Ranking: A Case Study,” <i>Schedae Informaticae</i>, vol. 25, 2016.","ama":"Melnikov V, Hüllermeier E, Kaimann D, Frick B, Gupta  Pritha . Pairwise versus Pointwise Ranking: A Case Study. <i>Schedae Informaticae</i>. 2016;25. doi:<a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">10.4467/20838476si.16.006.6187</a>","mla":"Melnikov, Vitalik, et al. “Pairwise versus Pointwise Ranking: A Case Study.” <i>Schedae Informaticae</i>, vol. 25, Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego, 2016, doi:<a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">10.4467/20838476si.16.006.6187</a>.","short":"V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick,  Pritha  Gupta, Schedae Informaticae 25 (2016).","bibtex":"@article{Melnikov_Hüllermeier_Kaimann_Frick_Gupta_2016, title={Pairwise versus Pointwise Ranking: A Case Study}, volume={25}, DOI={<a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">10.4467/20838476si.16.006.6187</a>}, journal={Schedae Informaticae}, publisher={Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego}, author={Melnikov, Vitalik and Hüllermeier, Eyke and Kaimann, Daniel and Frick, Bernd  and Gupta,  Pritha }, year={2016} }","apa":"Melnikov, V., Hüllermeier, E., Kaimann, D., Frick, B., &#38; Gupta,  Pritha . (2016). Pairwise versus Pointwise Ranking: A Case Study. <i>Schedae Informaticae</i>, <i>25</i>. <a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">https://doi.org/10.4467/20838476si.16.006.6187</a>"},"has_accepted_license":"1","publication_identifier":{"issn":["2083-8476"]},"publication_status":"published"},{"title":"A News Editorial Corpus for Mining Argumentation Strategies","main_file_link":[{"url":"https://www.aclweb.org/anthology/C16-1324.pdf"}],"date_updated":"2022-01-06T06:59:34Z","date_created":"2018-08-02T11:32:06Z","author":[{"first_name":"Khalid","last_name":"Al Khatib","full_name":"Al Khatib, Khalid"},{"first_name":"Henning","last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning"},{"full_name":"Kiesel, Johannes","last_name":"Kiesel","first_name":"Johannes"},{"full_name":"Hagen, Matthias","last_name":"Hagen","first_name":"Matthias"},{"last_name":"Stein","full_name":"Stein, Benno","first_name":"Benno"}],"year":"2016","page":"3433-3443","citation":{"ama":"Al Khatib K, Wachsmuth H, Kiesel J, Hagen M, Stein B. A News Editorial Corpus for Mining Argumentation Strategies. In: <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</i>. ; 2016:3433-3443.","ieee":"K. Al Khatib, H. Wachsmuth, J. Kiesel, M. Hagen, and B. Stein, “A News Editorial Corpus for Mining Argumentation Strategies,” in <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</i>, 2016, pp. 3433–3443.","chicago":"Al Khatib, Khalid, Henning Wachsmuth, Johannes Kiesel, Matthias Hagen, and Benno Stein. “A News Editorial Corpus for Mining Argumentation Strategies.” In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</i>, 3433–43, 2016.","bibtex":"@inproceedings{Al Khatib_Wachsmuth_Kiesel_Hagen_Stein_2016, title={A News Editorial Corpus for Mining Argumentation Strategies}, booktitle={Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers}, author={Al Khatib, Khalid and Wachsmuth, Henning and Kiesel, Johannes and Hagen, Matthias and Stein, Benno}, year={2016}, pages={3433–3443} }","mla":"Al Khatib, Khalid, et al. “A News Editorial Corpus for Mining Argumentation Strategies.” <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</i>, 2016, pp. 3433–43.","short":"K. Al Khatib, H. Wachsmuth, J. Kiesel, M. Hagen, B. Stein, in: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, 2016, pp. 3433–3443.","apa":"Al Khatib, K., Wachsmuth, H., Kiesel, J., Hagen, M., &#38; Stein, B. (2016). A News Editorial Corpus for Mining Argumentation Strategies. In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</i> (pp. 3433–3443)."},"language":[{"iso":"eng"}],"_id":"3747","department":[{"_id":"600"}],"user_id":"82920","status":"public","publication":"Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers","type":"conference"},{"extern":"1","language":[{"iso":"eng"}],"department":[{"_id":"600"}],"user_id":"82920","_id":"3801","status":"public","publication":"Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","type":"conference","doi":"10.18653/v1/N16-1165","main_file_link":[{"url":"https://www.aclweb.org/anthology/N16-1165.pdf"}],"title":"Cross-Domain Mining of Argumentative Text through Distant Supervision","date_created":"2018-08-02T13:38:23Z","author":[{"full_name":"Al-Khatib, Khalid","last_name":"Al-Khatib","first_name":"Khalid"},{"first_name":"Henning","last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning"},{"last_name":"Hagen","full_name":"Hagen, Matthias","first_name":"Matthias"},{"last_name":"Köhler","full_name":"Köhler, Jonas","first_name":"Jonas"},{"last_name":"Stein","full_name":"Stein, Benno","first_name":"Benno"}],"date_updated":"2022-01-06T06:59:36Z","page":"1395-1404","citation":{"apa":"Al-Khatib, K., Wachsmuth, H., Hagen, M., Köhler, J., &#38; Stein, B. (2016). Cross-Domain Mining of Argumentative Text through Distant Supervision. In <i>Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</i> (pp. 1395–1404). <a href=\"https://doi.org/10.18653/v1/N16-1165\">https://doi.org/10.18653/v1/N16-1165</a>","mla":"Al-Khatib, Khalid, et al. “Cross-Domain Mining of Argumentative Text through Distant Supervision.” <i>Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</i>, 2016, pp. 1395–404, doi:<a href=\"https://doi.org/10.18653/v1/N16-1165\">10.18653/v1/N16-1165</a>.","bibtex":"@inproceedings{Al-Khatib_Wachsmuth_Hagen_Köhler_Stein_2016, title={Cross-Domain Mining of Argumentative Text through Distant Supervision}, DOI={<a href=\"https://doi.org/10.18653/v1/N16-1165\">10.18653/v1/N16-1165</a>}, booktitle={Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies}, author={Al-Khatib, Khalid and Wachsmuth, Henning and Hagen, Matthias and Köhler, Jonas and Stein, Benno}, year={2016}, pages={1395–1404} }","short":"K. Al-Khatib, H. Wachsmuth, M. Hagen, J. Köhler, B. Stein, in: Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2016, pp. 1395–1404.","ama":"Al-Khatib K, Wachsmuth H, Hagen M, Köhler J, Stein B. Cross-Domain Mining of Argumentative Text through Distant Supervision. In: <i>Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</i>. ; 2016:1395-1404. doi:<a href=\"https://doi.org/10.18653/v1/N16-1165\">10.18653/v1/N16-1165</a>","ieee":"K. Al-Khatib, H. Wachsmuth, M. Hagen, J. Köhler, and B. Stein, “Cross-Domain Mining of Argumentative Text through Distant Supervision,” in <i>Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</i>, 2016, pp. 1395–1404.","chicago":"Al-Khatib, Khalid, Henning Wachsmuth, Matthias Hagen, Jonas Köhler, and Benno Stein. “Cross-Domain Mining of Argumentative Text through Distant Supervision.” In <i>Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</i>, 1395–1404, 2016. <a href=\"https://doi.org/10.18653/v1/N16-1165\">https://doi.org/10.18653/v1/N16-1165</a>."},"year":"2016"},{"_id":"3816","department":[{"_id":"600"}],"user_id":"82920","language":[{"iso":"eng"}],"publication":"Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers","type":"conference","status":"public","date_updated":"2022-01-06T06:59:37Z","author":[{"first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth"},{"first_name":"Khalid","last_name":"Al Khatib","full_name":"Al Khatib, Khalid"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"}],"date_created":"2018-08-02T13:38:43Z","title":"Using Argument Mining to Assess the Argumentation Quality of Essays","main_file_link":[{"url":"https://www.aclweb.org/anthology/C16-1158.pdf"}],"publication_identifier":{"isbn":["978-3-88579-975-7"]},"year":"2016","page":"1680-1691","citation":{"bibtex":"@inproceedings{Wachsmuth_Al Khatib_Stein_2016, title={Using Argument Mining to Assess the Argumentation Quality of Essays}, booktitle={Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers}, author={Wachsmuth, Henning and Al Khatib, Khalid and Stein, Benno}, year={2016}, pages={1680–1691} }","short":"H. Wachsmuth, K. Al Khatib, B. Stein, in: Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, 2016, pp. 1680–1691.","mla":"Wachsmuth, Henning, et al. “Using Argument Mining to Assess the Argumentation Quality of Essays.” <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</i>, 2016, pp. 1680–91.","apa":"Wachsmuth, H., Al Khatib, K., &#38; Stein, B. (2016). Using Argument Mining to Assess the Argumentation Quality of Essays. In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</i> (pp. 1680–1691).","chicago":"Wachsmuth, Henning, Khalid Al Khatib, and Benno Stein. “Using Argument Mining to Assess the Argumentation Quality of Essays.” In <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</i>, 1680–91, 2016.","ieee":"H. Wachsmuth, K. Al Khatib, and B. Stein, “Using Argument Mining to Assess the Argumentation Quality of Essays,” in <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</i>, 2016, pp. 1680–1691.","ama":"Wachsmuth H, Al Khatib K, Stein B. Using Argument Mining to Assess the Argumentation Quality of Essays. In: <i>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</i>. ; 2016:1680-1691."}},{"type":"conference","publication":"Ausgezeichnete Informatikdissertationen 2015","status":"public","user_id":"82920","department":[{"_id":"600"}],"_id":"3880","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-88579-975-7"]},"citation":{"ama":"Wachsmuth H. Pipelines Für Effiziente und Robuste Ad-hoc Textanalyse. In: <i>Ausgezeichnete Informatikdissertationen 2015</i>. ; 2016:329-338.","chicago":"Wachsmuth, Henning. “Pipelines Für Effiziente Und Robuste Ad-Hoc Textanalyse.” In <i>Ausgezeichnete Informatikdissertationen 2015</i>, 329–38, 2016.","ieee":"H. Wachsmuth, “Pipelines Für Effiziente und Robuste Ad-hoc Textanalyse,” in <i>Ausgezeichnete Informatikdissertationen 2015</i>, 2016, pp. 329–338.","apa":"Wachsmuth, H. (2016). Pipelines Für Effiziente und Robuste Ad-hoc Textanalyse. In <i>Ausgezeichnete Informatikdissertationen 2015</i> (pp. 329–338).","bibtex":"@inproceedings{Wachsmuth_2016, title={Pipelines Für Effiziente und Robuste Ad-hoc Textanalyse}, booktitle={Ausgezeichnete Informatikdissertationen 2015}, author={Wachsmuth, Henning}, year={2016}, pages={329–338} }","short":"H. Wachsmuth, in: Ausgezeichnete Informatikdissertationen 2015, 2016, pp. 329–338.","mla":"Wachsmuth, Henning. “Pipelines Für Effiziente Und Robuste Ad-Hoc Textanalyse.” <i>Ausgezeichnete Informatikdissertationen 2015</i>, 2016, pp. 329–38."},"page":"329-338","year":"2016","date_created":"2018-08-11T16:16:00Z","author":[{"first_name":"Henning","last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning"}],"date_updated":"2022-01-06T06:59:47Z","main_file_link":[{"url":"https://dl.gi.de/bitstream/handle/20.500.12116/4595/329.pdf?sequence=1"}],"title":"Pipelines Für Effiziente und Robuste Ad-hoc Textanalyse"},{"_id":"2898","user_id":"25078","department":[{"_id":"64"}],"status":"public","type":"mastersthesis","title":"Searchable Encryption","date_updated":"2022-01-06T06:58:42Z","author":[{"first_name":"Eduard","last_name":"Weis","full_name":"Weis, Eduard"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2018-05-25T09:43:39Z","year":"2016","citation":{"short":"E. Weis, Searchable Encryption, 2016.","bibtex":"@book{Weis_2016, title={Searchable Encryption}, author={Weis, Eduard}, year={2016} }","mla":"Weis, Eduard. <i>Searchable Encryption</i>. 2016.","apa":"Weis, E. (2016). <i>Searchable Encryption</i>.","chicago":"Weis, Eduard. <i>Searchable Encryption</i>, 2016.","ieee":"E. Weis, <i>Searchable Encryption</i>. 2016.","ama":"Weis E. <i>Searchable Encryption</i>.; 2016."}},{"publication_status":"published","publication_identifier":{"isbn":["9781467375795"]},"year":"2016","citation":{"ama":"Blömer J, Günther P. Singular Curve Point Decompression Attack. In: <i>2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/fdtc.2015.17\">10.1109/fdtc.2015.17</a>","ieee":"J. Blömer and P. Günther, “Singular Curve Point Decompression Attack,” in <i>2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)</i>, 2016.","chicago":"Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.” In <i>2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/fdtc.2015.17\">https://doi.org/10.1109/fdtc.2015.17</a>.","apa":"Blömer, J., &#38; Günther, P. (2016). Singular Curve Point Decompression Attack. In <i>2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)</i>. IEEE. <a href=\"https://doi.org/10.1109/fdtc.2015.17\">https://doi.org/10.1109/fdtc.2015.17</a>","bibtex":"@inproceedings{Blömer_Günther_2016, title={Singular Curve Point Decompression Attack}, DOI={<a href=\"https://doi.org/10.1109/fdtc.2015.17\">10.1109/fdtc.2015.17</a>}, booktitle={2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)}, publisher={IEEE}, author={Blömer, Johannes and Günther, Peter}, year={2016} }","short":"J. Blömer, P. Günther, in: 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2016.","mla":"Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.” <i>2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/fdtc.2015.17\">10.1109/fdtc.2015.17</a>."},"date_updated":"2022-01-06T06:58:48Z","publisher":"IEEE","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"last_name":"Günther","full_name":"Günther, Peter","first_name":"Peter"}],"date_created":"2018-05-29T11:25:43Z","title":"Singular Curve Point Decompression Attack","doi":"10.1109/fdtc.2015.17","type":"conference","publication":"2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC)","status":"public","project":[{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"2947","user_id":"25078","department":[{"_id":"64"}]},{"date_updated":"2022-01-06T06:58:48Z","publisher":"Springer International Publishing","date_created":"2018-05-29T11:26:56Z","author":[{"first_name":"Peter","last_name":"Günther","full_name":"Günther, Peter"},{"first_name":"Volker","last_name":"Krummel","full_name":"Krummel, Volker"}],"title":"Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures","doi":"10.1007/978-3-319-32859-1_13","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319328584","9783319328591"]},"publication_status":"published","year":"2016","place":"Cham","page":"151-165","citation":{"bibtex":"@inbook{Günther_Krummel_2016, place={Cham}, title={Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-32859-1_13\">10.1007/978-3-319-32859-1_13</a>}, booktitle={Mathematical Aspects of Computer and Information Sciences}, publisher={Springer International Publishing}, author={Günther, Peter and Krummel, Volker}, year={2016}, pages={151–165} }","short":"P. Günther, V. Krummel, in: Mathematical Aspects of Computer and Information Sciences, Springer International Publishing, Cham, 2016, pp. 151–165.","mla":"Günther, Peter, and Volker Krummel. “Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures.” <i>Mathematical Aspects of Computer and Information Sciences</i>, Springer International Publishing, 2016, pp. 151–65, doi:<a href=\"https://doi.org/10.1007/978-3-319-32859-1_13\">10.1007/978-3-319-32859-1_13</a>.","apa":"Günther, P., &#38; Krummel, V. (2016). Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures. In <i>Mathematical Aspects of Computer and Information Sciences</i> (pp. 151–165). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-32859-1_13\">https://doi.org/10.1007/978-3-319-32859-1_13</a>","ama":"Günther P, Krummel V. Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures. In: <i>Mathematical Aspects of Computer and Information Sciences</i>. Cham: Springer International Publishing; 2016:151-165. doi:<a href=\"https://doi.org/10.1007/978-3-319-32859-1_13\">10.1007/978-3-319-32859-1_13</a>","chicago":"Günther, Peter, and Volker Krummel. “Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures.” In <i>Mathematical Aspects of Computer and Information Sciences</i>, 151–65. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-32859-1_13\">https://doi.org/10.1007/978-3-319-32859-1_13</a>.","ieee":"P. Günther and V. Krummel, “Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures,” in <i>Mathematical Aspects of Computer and Information Sciences</i>, Cham: Springer International Publishing, 2016, pp. 151–165."},"_id":"2948","project":[{"name":"Securing the Financial Cloud","_id":"43"}],"department":[{"_id":"64"}],"user_id":"25078","publication":"Mathematical Aspects of Computer and Information Sciences","type":"book_chapter","status":"public"},{"status":"public","type":"book_chapter","publication":"Algorithm Engineering","user_id":"25078","department":[{"_id":"64"}],"_id":"2968","citation":{"apa":"Blömer, J., Lammersen, C., Schmidt, M., &#38; Sohler, C. (2016). Theoretical Analysis of the k-Means Algorithm – A Survey. In <i>Algorithm Engineering</i> (pp. 81–116). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-49487-6_3\">https://doi.org/10.1007/978-3-319-49487-6_3</a>","mla":"Blömer, Johannes, et al. “Theoretical Analysis of the K-Means Algorithm – A Survey.” <i>Algorithm Engineering</i>, Springer International Publishing, 2016, pp. 81–116, doi:<a href=\"https://doi.org/10.1007/978-3-319-49487-6_3\">10.1007/978-3-319-49487-6_3</a>.","bibtex":"@inbook{Blömer_Lammersen_Schmidt_Sohler_2016, place={Cham}, title={Theoretical Analysis of the k-Means Algorithm – A Survey}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49487-6_3\">10.1007/978-3-319-49487-6_3</a>}, booktitle={Algorithm Engineering}, publisher={Springer International Publishing}, author={Blömer, Johannes and Lammersen, Christiane and Schmidt, Melanie and Sohler, Christian}, year={2016}, pages={81–116} }","short":"J. Blömer, C. Lammersen, M. Schmidt, C. Sohler, in: Algorithm Engineering, Springer International Publishing, Cham, 2016, pp. 81–116.","ama":"Blömer J, Lammersen C, Schmidt M, Sohler C. Theoretical Analysis of the k-Means Algorithm – A Survey. In: <i>Algorithm Engineering</i>. Cham: Springer International Publishing; 2016:81-116. doi:<a href=\"https://doi.org/10.1007/978-3-319-49487-6_3\">10.1007/978-3-319-49487-6_3</a>","chicago":"Blömer, Johannes, Christiane Lammersen, Melanie Schmidt, and Christian Sohler. “Theoretical Analysis of the K-Means Algorithm – A Survey.” In <i>Algorithm Engineering</i>, 81–116. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49487-6_3\">https://doi.org/10.1007/978-3-319-49487-6_3</a>.","ieee":"J. Blömer, C. Lammersen, M. Schmidt, and C. Sohler, “Theoretical Analysis of the k-Means Algorithm – A Survey,” in <i>Algorithm Engineering</i>, Cham: Springer International Publishing, 2016, pp. 81–116."},"page":"81-116","year":"2016","place":"Cham","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319494869","9783319494876"]},"doi":"10.1007/978-3-319-49487-6_3","title":"Theoretical Analysis of the k-Means Algorithm – A Survey","date_created":"2018-06-04T12:22:40Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Christiane","last_name":"Lammersen","full_name":"Lammersen, Christiane"},{"first_name":"Melanie","full_name":"Schmidt, Melanie","last_name":"Schmidt"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"publisher":"Springer International Publishing","date_updated":"2022-01-06T06:58:49Z"},{"user_id":"25078","department":[{"_id":"64"}],"_id":"2969","status":"public","type":"preprint","main_file_link":[{"url":"https://arxiv.org/abs/1603.06478","open_access":"1"}],"title":"Hard-Clustering with Gaussian Mixture Models","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"first_name":"Sascha","last_name":"Brauer","full_name":"Brauer, Sascha","id":"13291"},{"first_name":"Kathrin","full_name":"Bujna, Kathrin","last_name":"Bujna"}],"date_created":"2018-06-04T12:26:51Z","oa":"1","date_updated":"2022-01-06T06:58:49Z","publisher":"Computing Research Repository","citation":{"ieee":"J. Blömer, S. Brauer, and K. Bujna, “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.","chicago":"Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.","ama":"Blömer J, Brauer S, Bujna K. Hard-Clustering with Gaussian Mixture Models. 2016.","apa":"Blömer, J., Brauer, S., &#38; Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository.","short":"J. Blömer, S. Brauer, K. Bujna, (2016).","bibtex":"@article{Blömer_Brauer_Bujna_2016, title={Hard-Clustering with Gaussian Mixture Models}, publisher={Computing Research Repository}, author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2016} }","mla":"Blömer, Johannes, et al. <i>Hard-Clustering with Gaussian Mixture Models</i>. Computing Research Repository, 2016."},"year":"2016"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319317496","9783319317502"]},"year":"2016","place":"Cham","citation":{"ieee":"J. Blömer and K. Bujna, “Adaptive Seeding for Gaussian Mixture Models,” in <i>Advances in Knowledge Discovery and Data Mining</i>, Cham: Springer International Publishing, 2016, pp. 296–308.","chicago":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” In <i>Advances in Knowledge Discovery and Data Mining</i>, 296–308. Cham: Springer International Publishing, 2016. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>.","ama":"Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: <i>Advances in Knowledge Discovery and Data Mining</i>. Cham: Springer International Publishing; 2016:296-308. doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>","apa":"Blömer, J., &#38; Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In <i>Advances in Knowledge Discovery and Data Mining</i> (pp. 296–308). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">https://doi.org/10.1007/978-3-319-31750-2_24</a>","bibtex":"@inbook{Blömer_Bujna_2016, place={Cham}, title={Adaptive Seeding for Gaussian Mixture Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>}, booktitle={Advances in Knowledge Discovery and Data Mining}, publisher={Springer International Publishing}, author={Blömer, Johannes and Bujna, Kathrin}, year={2016}, pages={296–308} }","mla":"Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.” <i>Advances in Knowledge Discovery and Data Mining</i>, Springer International Publishing, 2016, pp. 296–308, doi:<a href=\"https://doi.org/10.1007/978-3-319-31750-2_24\">10.1007/978-3-319-31750-2_24</a>.","short":"J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308."},"page":"296-308","date_updated":"2022-01-06T06:58:49Z","publisher":"Springer International Publishing","date_created":"2018-06-04T12:27:21Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"last_name":"Bujna","full_name":"Bujna, Kathrin","first_name":"Kathrin"}],"title":"Adaptive Seeding for Gaussian Mixture Models","doi":"10.1007/978-3-319-31750-2_24","type":"book_chapter","publication":"Advances in Knowledge Discovery and Data Mining","status":"public","_id":"2970","user_id":"25078","department":[{"_id":"64"}]},{"user_id":"25078","department":[{"_id":"64"}],"_id":"2971","status":"public","type":"report","title":"Effizienz und Sicherheit paarungsbasierter Kryptographie","date_created":"2018-06-05T07:21:25Z","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"last_name":"Günther","full_name":"Günther, Peter","first_name":"Peter"}],"date_updated":"2022-01-06T06:58:49Z","publisher":"Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops","citation":{"short":"J. Blömer, P. Günther, Effizienz Und Sicherheit Paarungsbasierter Kryptographie, Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","mla":"Blömer, Johannes, and Peter Günther. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","bibtex":"@book{Blömer_Günther_2016, title={Effizienz und Sicherheit paarungsbasierter Kryptographie}, publisher={Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops}, author={Blömer, Johannes and Günther, Peter}, year={2016} }","apa":"Blömer, J., &#38; Günther, P. (2016). <i>Effizienz und Sicherheit paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops.","ama":"Blömer J, Günther P. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops; 2016.","ieee":"J. Blömer and P. Günther, <i>Effizienz und Sicherheit paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.","chicago":"Blömer, Johannes, and Peter Günther. <i>Effizienz Und Sicherheit Paarungsbasierter Kryptographie</i>. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016."},"year":"2016","publication_status":"published"},{"status":"public","publication":"Des. Codes Cryptography","type":"journal_article","extern":"1","department":[{"_id":"558"}],"user_id":"38235","_id":"3112","page":"29--61","citation":{"chicago":"Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key Encryption.” <i>Des. Codes Cryptography</i>, no. 1 (2016): 29--61. <a href=\"https://doi.org/10.1007/s10623-015-0062-x\">https://doi.org/10.1007/s10623-015-0062-x</a>.","ieee":"D. Hofheinz and T. Jager, “Tightly secure signatures and public-key encryption,” <i>Des. Codes Cryptography</i>, no. 1, pp. 29--61, 2016.","ama":"Hofheinz D, Jager T. Tightly secure signatures and public-key encryption. <i>Des Codes Cryptography</i>. 2016;(1):29--61. doi:<a href=\"https://doi.org/10.1007/s10623-015-0062-x\">10.1007/s10623-015-0062-x</a>","mla":"Hofheinz, Dennis, and Tibor Jager. “Tightly Secure Signatures and Public-Key Encryption.” <i>Des. Codes Cryptography</i>, no. 1, 2016, pp. 29--61, doi:<a href=\"https://doi.org/10.1007/s10623-015-0062-x\">10.1007/s10623-015-0062-x</a>.","bibtex":"@article{Hofheinz_Jager_2016, title={Tightly secure signatures and public-key encryption}, DOI={<a href=\"https://doi.org/10.1007/s10623-015-0062-x\">10.1007/s10623-015-0062-x</a>}, number={1}, journal={Des. Codes Cryptography}, author={Hofheinz, Dennis and Jager, Tibor}, year={2016}, pages={29--61} }","short":"D. Hofheinz, T. Jager, Des. Codes Cryptography (2016) 29--61.","apa":"Hofheinz, D., &#38; Jager, T. (2016). Tightly secure signatures and public-key encryption. <i>Des. Codes Cryptography</i>, (1), 29--61. <a href=\"https://doi.org/10.1007/s10623-015-0062-x\">https://doi.org/10.1007/s10623-015-0062-x</a>"},"year":"2016","issue":"1","doi":"10.1007/s10623-015-0062-x","title":"Tightly secure signatures and public-key encryption","date_created":"2018-06-07T09:12:15Z","author":[{"full_name":"Hofheinz, Dennis","last_name":"Hofheinz","first_name":"Dennis"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"}],"date_updated":"2022-01-06T06:58:56Z"},{"title":"Selective opening security of practical public-key encryption schemes","doi":"10.1049/iet-ifs.2015.0507","date_updated":"2022-01-06T06:58:56Z","date_created":"2018-06-07T09:12:50Z","author":[{"first_name":"Felix","full_name":"Heuer, Felix","last_name":"Heuer"},{"last_name":"Jager","full_name":"Jager, Tibor","id":"64669","first_name":"Tibor"},{"last_name":"Schäge","full_name":"Schäge, Sven","first_name":"Sven"},{"last_name":"Kiltz","full_name":"Kiltz, Eike","first_name":"Eike"}],"year":"2016","page":"304--318","citation":{"ieee":"F. Heuer, T. Jager, S. Schäge, and E. Kiltz, “Selective opening security of practical public-key encryption schemes,” <i>IET Information Security</i>, no. 6, pp. 304--318, 2016.","chicago":"Heuer, Felix, Tibor Jager, Sven Schäge, and Eike Kiltz. “Selective Opening Security of Practical Public-Key Encryption Schemes.” <i>IET Information Security</i>, no. 6 (2016): 304--318. <a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">https://doi.org/10.1049/iet-ifs.2015.0507</a>.","ama":"Heuer F, Jager T, Schäge S, Kiltz E. Selective opening security of practical public-key encryption schemes. <i>IET Information Security</i>. 2016;(6):304--318. doi:<a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">10.1049/iet-ifs.2015.0507</a>","apa":"Heuer, F., Jager, T., Schäge, S., &#38; Kiltz, E. (2016). Selective opening security of practical public-key encryption schemes. <i>IET Information Security</i>, (6), 304--318. <a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">https://doi.org/10.1049/iet-ifs.2015.0507</a>","short":"F. Heuer, T. Jager, S. Schäge, E. Kiltz, IET Information Security (2016) 304--318.","bibtex":"@article{Heuer_Jager_Schäge_Kiltz_2016, title={Selective opening security of practical public-key encryption schemes}, DOI={<a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">10.1049/iet-ifs.2015.0507</a>}, number={6}, journal={IET Information Security}, author={Heuer, Felix and Jager, Tibor and Schäge, Sven and Kiltz, Eike}, year={2016}, pages={304--318} }","mla":"Heuer, Felix, et al. “Selective Opening Security of Practical Public-Key Encryption Schemes.” <i>IET Information Security</i>, no. 6, 2016, pp. 304--318, doi:<a href=\"https://doi.org/10.1049/iet-ifs.2015.0507\">10.1049/iet-ifs.2015.0507</a>."},"issue":"6","extern":"1","_id":"3113","department":[{"_id":"558"}],"user_id":"38235","status":"public","publication":"IET Information Security","type":"journal_article"},{"issue":"3","citation":{"chicago":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” <i>PoPETs</i>, no. 3 (2016): 62--82.","ieee":"T. Jager and A. Rupp, “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way,” <i>PoPETs</i>, no. 3, pp. 62--82, 2016.","ama":"Jager T, Rupp A. Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. <i>PoPETs</i>. 2016;(3):62--82.","apa":"Jager, T., &#38; Rupp, A. (2016). Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. <i>PoPETs</i>, (3), 62--82.","mla":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” <i>PoPETs</i>, no. 3, 2016, pp. 62--82.","short":"T. Jager, A. Rupp, PoPETs (2016) 62--82.","bibtex":"@article{Jager_Rupp_2016, title={Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way}, number={3}, journal={PoPETs}, author={Jager, Tibor and Rupp, Andy}, year={2016}, pages={62--82} }"},"page":"62--82","year":"2016","date_created":"2018-06-07T09:13:15Z","author":[{"last_name":"Jager","full_name":"Jager, Tibor","id":"64669","first_name":"Tibor"},{"first_name":"Andy","full_name":"Rupp, Andy","last_name":"Rupp"}],"date_updated":"2022-01-06T06:58:56Z","title":"Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way","type":"journal_article","publication":"PoPETs","status":"public","user_id":"38235","department":[{"_id":"558"}],"_id":"3114","extern":"1"},{"type":"conference","publication":"Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II","status":"public","_id":"3115","user_id":"38235","department":[{"_id":"558"}],"extern":"1","year":"2016","citation":{"ieee":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, and M. Zhandry, “How to Generate and Use Universal Samplers,” in <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>, 2016, pp. 715--744.","chicago":"Hofheinz, Dennis, Tibor Jager, Dakshita Khurana, Amit Sahai, Brent Waters, and Mark Zhandry. “How to Generate and Use Universal Samplers.” In <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>, 715--744, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">https://doi.org/10.1007/978-3-662-53890-6_24</a>.","ama":"Hofheinz D, Jager T, Khurana D, Sahai A, Waters B, Zhandry M. How to Generate and Use Universal Samplers. In: <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>. ; 2016:715--744. doi:<a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">10.1007/978-3-662-53890-6_24</a>","apa":"Hofheinz, D., Jager, T., Khurana, D., Sahai, A., Waters, B., &#38; Zhandry, M. (2016). How to Generate and Use Universal Samplers. In <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i> (pp. 715--744). <a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">https://doi.org/10.1007/978-3-662-53890-6_24</a>","short":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, M. Zhandry, in: Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II, 2016, pp. 715--744.","bibtex":"@inproceedings{Hofheinz_Jager_Khurana_Sahai_Waters_Zhandry_2016, title={How to Generate and Use Universal Samplers}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">10.1007/978-3-662-53890-6_24</a>}, booktitle={Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II}, author={Hofheinz, Dennis and Jager, Tibor and Khurana, Dakshita and Sahai, Amit and Waters, Brent and Zhandry, Mark}, year={2016}, pages={715--744} }","mla":"Hofheinz, Dennis, et al. “How to Generate and Use Universal Samplers.” <i>Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II</i>, 2016, pp. 715--744, doi:<a href=\"https://doi.org/10.1007/978-3-662-53890-6_24\">10.1007/978-3-662-53890-6_24</a>."},"page":"715--744","date_updated":"2022-01-06T06:58:57Z","author":[{"full_name":"Hofheinz, Dennis","last_name":"Hofheinz","first_name":"Dennis"},{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"full_name":"Khurana, Dakshita","last_name":"Khurana","first_name":"Dakshita"},{"last_name":"Sahai","full_name":"Sahai, Amit","first_name":"Amit"},{"last_name":"Waters","full_name":"Waters, Brent","first_name":"Brent"},{"full_name":"Zhandry, Mark","last_name":"Zhandry","first_name":"Mark"}],"date_created":"2018-06-07T09:13:48Z","title":"How to Generate and Use Universal Samplers","doi":"10.1007/978-3-662-53890-6_24"},{"type":"conference","publication":"Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings","status":"public","_id":"3116","user_id":"38235","department":[{"_id":"558"}],"extern":"1","year":"2016","citation":{"ieee":"M. Horst, M. Grothe, T. Jager, and J. Schwenk, “Breaking PPTP VPNs via RADIUS Encryption,” in <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>, 2016, pp. 159--175.","chicago":"Horst, Matthias, Martin Grothe, Tibor Jager, and Jörg Schwenk. “Breaking PPTP VPNs via RADIUS Encryption.” In <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>, 159--175, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">https://doi.org/10.1007/978-3-319-48965-0_10</a>.","ama":"Horst M, Grothe M, Jager T, Schwenk J. Breaking PPTP VPNs via RADIUS Encryption. In: <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>. ; 2016:159--175. doi:<a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">10.1007/978-3-319-48965-0_10</a>","short":"M. Horst, M. Grothe, T. Jager, J. Schwenk, in: Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings, 2016, pp. 159--175.","bibtex":"@inproceedings{Horst_Grothe_Jager_Schwenk_2016, title={Breaking PPTP VPNs via RADIUS Encryption}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">10.1007/978-3-319-48965-0_10</a>}, booktitle={Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings}, author={Horst, Matthias and Grothe, Martin and Jager, Tibor and Schwenk, Jörg}, year={2016}, pages={159--175} }","mla":"Horst, Matthias, et al. “Breaking PPTP VPNs via RADIUS Encryption.” <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i>, 2016, pp. 159--175, doi:<a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">10.1007/978-3-319-48965-0_10</a>.","apa":"Horst, M., Grothe, M., Jager, T., &#38; Schwenk, J. (2016). Breaking PPTP VPNs via RADIUS Encryption. In <i>Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings</i> (pp. 159--175). <a href=\"https://doi.org/10.1007/978-3-319-48965-0_10\">https://doi.org/10.1007/978-3-319-48965-0_10</a>"},"page":"159--175","date_updated":"2022-01-06T06:58:57Z","date_created":"2018-06-07T09:14:34Z","author":[{"last_name":"Horst","full_name":"Horst, Matthias","first_name":"Matthias"},{"first_name":"Martin","last_name":"Grothe","full_name":"Grothe, Martin"},{"first_name":"Tibor","id":"64669","full_name":"Jager, Tibor","last_name":"Jager"},{"last_name":"Schwenk","full_name":"Schwenk, Jörg","first_name":"Jörg"}],"title":"Breaking PPTP VPNs via RADIUS Encryption","doi":"10.1007/978-3-319-48965-0_10"},{"year":"2016","citation":{"apa":"Bader, C., Jager, T., Li, Y., &#38; Schäge, S. (2016). On the Impossibility of Tight Cryptographic Reductions. In <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i> (pp. 273--304). <a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">https://doi.org/10.1007/978-3-662-49896-5_10</a>","mla":"Bader, Christoph, et al. “On the Impossibility of Tight Cryptographic Reductions.” <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>, 2016, pp. 273--304, doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">10.1007/978-3-662-49896-5_10</a>.","short":"C. Bader, T. Jager, Y. Li, S. Schäge, in: Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II, 2016, pp. 273--304.","bibtex":"@inproceedings{Bader_Jager_Li_Schäge_2016, title={On the Impossibility of Tight Cryptographic Reductions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">10.1007/978-3-662-49896-5_10</a>}, booktitle={Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II}, author={Bader, Christoph and Jager, Tibor and Li, Yong and Schäge, Sven}, year={2016}, pages={273--304} }","ama":"Bader C, Jager T, Li Y, Schäge S. On the Impossibility of Tight Cryptographic Reductions. In: <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>. ; 2016:273--304. doi:<a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">10.1007/978-3-662-49896-5_10</a>","ieee":"C. Bader, T. Jager, Y. Li, and S. Schäge, “On the Impossibility of Tight Cryptographic Reductions,” in <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>, 2016, pp. 273--304.","chicago":"Bader, Christoph, Tibor Jager, Yong Li, and Sven Schäge. “On the Impossibility of Tight Cryptographic Reductions.” In <i>Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II</i>, 273--304, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49896-5_10\">https://doi.org/10.1007/978-3-662-49896-5_10</a>."},"page":"273--304","title":"On the Impossibility of Tight Cryptographic Reductions","doi":"10.1007/978-3-662-49896-5_10","date_updated":"2022-01-06T06:58:57Z","author":[{"full_name":"Bader, Christoph","last_name":"Bader","first_name":"Christoph"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"full_name":"Li, Yong","last_name":"Li","first_name":"Yong"},{"full_name":"Schäge, Sven","last_name":"Schäge","first_name":"Sven"}],"date_created":"2018-06-07T09:15:15Z","status":"public","type":"conference","publication":"Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II","extern":"1","_id":"3117","user_id":"38235","department":[{"_id":"558"}]},{"year":"2016","page":"146--168","citation":{"apa":"Hofheinz, D., Jager, T., &#38; Rupp, A. (2016). Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts. In <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i> (pp. 146--168). <a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">https://doi.org/10.1007/978-3-662-53644-5_6</a>","bibtex":"@inproceedings{Hofheinz_Jager_Rupp_2016, title={Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">10.1007/978-3-662-53644-5_6</a>}, booktitle={Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II}, author={Hofheinz, Dennis and Jager, Tibor and Rupp, Andy}, year={2016}, pages={146--168} }","short":"D. Hofheinz, T. Jager, A. Rupp, in: Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II, 2016, pp. 146--168.","mla":"Hofheinz, Dennis, et al. “Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts.” <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>, 2016, pp. 146--168, doi:<a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">10.1007/978-3-662-53644-5_6</a>.","chicago":"Hofheinz, Dennis, Tibor Jager, and Andy Rupp. “Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts.” In <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>, 146--168, 2016. <a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">https://doi.org/10.1007/978-3-662-53644-5_6</a>.","ieee":"D. Hofheinz, T. Jager, and A. Rupp, “Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts,” in <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>, 2016, pp. 146--168.","ama":"Hofheinz D, Jager T, Rupp A. Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts. In: <i>Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II</i>. ; 2016:146--168. doi:<a href=\"https://doi.org/10.1007/978-3-662-53644-5_6\">10.1007/978-3-662-53644-5_6</a>"},"title":"Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts","doi":"10.1007/978-3-662-53644-5_6","date_updated":"2022-01-06T06:58:57Z","date_created":"2018-06-07T09:15:51Z","author":[{"first_name":"Dennis","last_name":"Hofheinz","full_name":"Hofheinz, Dennis"},{"last_name":"Jager","id":"64669","full_name":"Jager, Tibor","first_name":"Tibor"},{"first_name":"Andy","last_name":"Rupp","full_name":"Rupp, Andy"}],"status":"public","publication":"Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II","type":"conference","extern":"1","_id":"3118","department":[{"_id":"558"}],"user_id":"38235"},{"user_id":"38235","department":[{"_id":"558"}],"_id":"3119","extern":"1","type":"conference","publication":"Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I","status":"public","author":[{"first_name":"Dennis","last_name":"Hofheinz","full_name":"Hofheinz, Dennis"},{"first_name":"Tibor","id":"64669","full_name":"Jager, Tibor","last_name":"Jager"}],"date_created":"2018-06-07T09:16:30Z","date_updated":"2022-01-06T06:58:57Z","doi":"10.1007/978-3-662-49096-9_14","title":"Verifiable Random Functions from Standard Assumptions","citation":{"ama":"Hofheinz D, Jager T. Verifiable Random Functions from Standard Assumptions. In: <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>. ; 2016:336--362. doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">10.1007/978-3-662-49096-9_14</a>","ieee":"D. Hofheinz and T. Jager, “Verifiable Random Functions from Standard Assumptions,” in <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>, 2016, pp. 336--362.","chicago":"Hofheinz, Dennis, and Tibor Jager. “Verifiable Random Functions from Standard Assumptions.” In <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>, 336--362, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">https://doi.org/10.1007/978-3-662-49096-9_14</a>.","mla":"Hofheinz, Dennis, and Tibor Jager. “Verifiable Random Functions from Standard Assumptions.” <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i>, 2016, pp. 336--362, doi:<a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">10.1007/978-3-662-49096-9_14</a>.","bibtex":"@inproceedings{Hofheinz_Jager_2016, title={Verifiable Random Functions from Standard Assumptions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">10.1007/978-3-662-49096-9_14</a>}, booktitle={Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I}, author={Hofheinz, Dennis and Jager, Tibor}, year={2016}, pages={336--362} }","short":"D. Hofheinz, T. Jager, in: Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I, 2016, pp. 336--362.","apa":"Hofheinz, D., &#38; Jager, T. (2016). Verifiable Random Functions from Standard Assumptions. In <i>Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I</i> (pp. 336--362). <a href=\"https://doi.org/10.1007/978-3-662-49096-9_14\">https://doi.org/10.1007/978-3-662-49096-9_14</a>"},"page":"336--362","year":"2016"}]