[{"publisher":"Universität Paderborn","_id":"2909","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12721"}],"user_id":"25078","author":[{"first_name":"Daniel","last_name":"Kuntze","full_name":"Kuntze, Daniel"}],"year":"2013","title":"Practical algorithms for clustering and modeling large data sets - Analysis and improvements","status":"public","date_updated":"2022-01-06T06:58:46Z","date_created":"2018-05-25T10:07:42Z","department":[{"_id":"64"}],"type":"dissertation","citation":{"mla":"Kuntze, Daniel. <i>Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements</i>. Universität Paderborn, 2013.","ama":"Kuntze D. <i>Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements</i>. Universität Paderborn; 2013.","bibtex":"@book{Kuntze_2013, title={Practical algorithms for clustering and modeling large data sets - Analysis and improvements}, publisher={Universität Paderborn}, author={Kuntze, Daniel}, year={2013} }","apa":"Kuntze, D. (2013). <i>Practical algorithms for clustering and modeling large data sets - Analysis and improvements</i>. Universität Paderborn.","ieee":"D. Kuntze, <i>Practical algorithms for clustering and modeling large data sets - Analysis and improvements</i>. Universität Paderborn, 2013.","chicago":"Kuntze, Daniel. <i>Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements</i>. Universität Paderborn, 2013.","short":"D. Kuntze, Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements, Universität Paderborn, 2013."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}]},{"publisher":"Fortschritt-Berichte VDI","_id":"2917","user_id":"48090","title":"An Approach for Determining Optimal Contrast in Visual Cryptography","year":"2013","status":"public","author":[{"full_name":"Juhnke, Jakob","first_name":"Jakob","last_name":"Juhnke","id":"48090"},{"first_name":"Hanno","last_name":"Lefmann","full_name":"Lefmann, Hanno"},{"first_name":"Volker","last_name":"Strehl","full_name":"Strehl, Volker"}],"date_updated":"2022-01-06T06:58:47Z","date_created":"2018-05-25T11:42:38Z","type":"report","department":[{"_id":"64"}],"citation":{"chicago":"Juhnke, Jakob, Hanno Lefmann, and Volker Strehl. <i>An Approach for Determining Optimal Contrast in Visual Cryptography</i>. Fortschritt-Berichte VDI, 2013.","short":"J. Juhnke, H. Lefmann, V. Strehl, An Approach for Determining Optimal Contrast in Visual Cryptography, Fortschritt-Berichte VDI, 2013.","ieee":"J. Juhnke, H. Lefmann, and V. Strehl, <i>An Approach for Determining Optimal Contrast in Visual Cryptography</i>. Fortschritt-Berichte VDI, 2013.","apa":"Juhnke, J., Lefmann, H., &#38; Strehl, V. (2013). <i>An Approach for Determining Optimal Contrast in Visual Cryptography</i>. Fortschritt-Berichte VDI.","bibtex":"@book{Juhnke_Lefmann_Strehl_2013, title={An Approach for Determining Optimal Contrast in Visual Cryptography}, publisher={Fortschritt-Berichte VDI}, author={Juhnke, Jakob and Lefmann, Hanno and Strehl, Volker}, year={2013} }","ama":"Juhnke J, Lefmann H, Strehl V. <i>An Approach for Determining Optimal Contrast in Visual Cryptography</i>. Fortschritt-Berichte VDI; 2013.","mla":"Juhnke, Jakob, et al. <i>An Approach for Determining Optimal Contrast in Visual Cryptography</i>. Fortschritt-Berichte VDI, 2013."},"extern":"1"},{"publication":"Constructive Side-Channel Analysis and Secure Design","citation":{"apa":"Blömer, J., Günther, P., &#38; Liske, G. (2013). Improved Side Channel Attacks on Pairing Based Cryptography. In <i>Constructive Side-Channel Analysis and Secure Design</i> (pp. 154–168). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-40026-1_10\">https://doi.org/10.1007/978-3-642-40026-1_10</a>","ieee":"J. Blömer, P. Günther, and G. Liske, “Improved Side Channel Attacks on Pairing Based Cryptography,” in <i>Constructive Side-Channel Analysis and Secure Design</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 154–168.","short":"J. Blömer, P. Günther, G. Liske, in: Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 154–168.","chicago":"Blömer, Johannes, Peter Günther, and Gennadij Liske. “Improved Side Channel Attacks on Pairing Based Cryptography.” In <i>Constructive Side-Channel Analysis and Secure Design</i>, 154–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40026-1_10\">https://doi.org/10.1007/978-3-642-40026-1_10</a>.","mla":"Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.” <i>Constructive Side-Channel Analysis and Secure Design</i>, Springer Berlin Heidelberg, 2013, pp. 154–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-40026-1_10\">10.1007/978-3-642-40026-1_10</a>.","ama":"Blömer J, Günther P, Liske G. Improved Side Channel Attacks on Pairing Based Cryptography. In: <i>Constructive Side-Channel Analysis and Secure Design</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:154-168. doi:<a href=\"https://doi.org/10.1007/978-3-642-40026-1_10\">10.1007/978-3-642-40026-1_10</a>","bibtex":"@inbook{Blömer_Günther_Liske_2013, place={Berlin, Heidelberg}, title={Improved Side Channel Attacks on Pairing Based Cryptography}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-40026-1_10\">10.1007/978-3-642-40026-1_10</a>}, booktitle={Constructive Side-Channel Analysis and Secure Design}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Günther, Peter and Liske, Gennadij}, year={2013}, pages={154–168} }"},"date_created":"2018-06-05T07:33:22Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"64"}],"year":"2013","status":"public","title":"Improved Side Channel Attacks on Pairing Based Cryptography","author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"},{"full_name":"Liske, Gennadij","first_name":"Gennadij","last_name":"Liske"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642400254","9783642400261"]},"publication_status":"published","date_updated":"2022-01-06T06:58:49Z","page":"154-168","publisher":"Springer Berlin Heidelberg","_id":"2979","user_id":"25078","doi":"10.1007/978-3-642-40026-1_10"},{"citation":{"apa":"Tezer, A. (2013). <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn.","ieee":"A. Tezer, <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","chicago":"Tezer, Alina. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","short":"A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen, Universität Paderborn, 2013.","mla":"Tezer, Alina. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","ama":"Tezer A. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn; 2013.","bibtex":"@book{Tezer_2013, title={Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen}, publisher={Universität Paderborn}, author={Tezer, Alina}, year={2013} }"},"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"date_created":"2017-10-17T12:42:23Z","type":"bachelorsthesis","department":[{"_id":"64"}],"year":"2013","title":"Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen","status":"public","author":[{"full_name":"Tezer, Alina","last_name":"Tezer","first_name":"Alina"}],"date_updated":"2022-01-06T07:01:19Z","_id":"471","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"477"},{"user_id":"477","_id":"486","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:01:27Z","author":[{"first_name":"Oliver","last_name":"Otte","full_name":"Otte, Oliver"}],"title":"Seitenkanalresistenz paarungsbasierter Kryptographie","year":"2013","status":"public","department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:42:27Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"citation":{"bibtex":"@book{Otte_2013, title={Seitenkanalresistenz paarungsbasierter Kryptographie}, publisher={Universität Paderborn}, author={Otte, Oliver}, year={2013} }","ama":"Otte O. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn; 2013.","mla":"Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013.","short":"O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie, Universität Paderborn, 2013.","chicago":"Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013.","ieee":"O. Otte, <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013.","apa":"Otte, O. (2013). <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}]},{"year":"2013","status":"public","title":"Security Proofs for Pairing-Based Cryptography in the Generic Group Model","author":[{"id":"27207","last_name":"Bobolz","first_name":"Jan","full_name":"Bobolz, Jan"}],"date_updated":"2022-01-06T07:01:28Z","has_accepted_license":"1","urn":"4875","_id":"487","publisher":"Universität Paderborn","ddc":["000"],"user_id":"27207","file_date_updated":"2018-06-29T09:56:54Z","citation":{"short":"J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic Group Model, Universität Paderborn, 2013.","chicago":"Bobolz, Jan. <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn, 2013.","ieee":"J. Bobolz, <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn, 2013.","apa":"Bobolz, J. (2013). <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn.","bibtex":"@book{Bobolz_2013, title={Security Proofs for Pairing-Based Cryptography in the Generic Group Model}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2013} }","ama":"Bobolz J. <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn; 2013.","mla":"Bobolz, Jan. <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn, 2013."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"file":[{"relation":"main_file","date_updated":"2018-06-29T09:56:54Z","file_name":"thesis_jbobolz_final.pdf","file_size":874286,"access_level":"open_access","file_id":"2346","content_type":"application/pdf","creator":"jbobolz","date_created":"2018-04-13T11:42:08Z"}],"date_created":"2017-10-17T12:42:27Z","type":"bachelorsthesis","oa":"1","department":[{"_id":"64"}]},{"page":"98-105","_id":"488","ddc":["040"],"user_id":"477","status":"public","year":"2013","title":"Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"},{"full_name":"Krummel, Volker","last_name":"Krummel","first_name":"Volker"}],"date_updated":"2022-01-06T07:01:28Z","has_accepted_license":"1","file":[{"file_name":"488-MACIS13.pdf","access_level":"closed","file_size":301962,"relation":"main_file","date_updated":"2018-03-15T13:46:52Z","file_id":"1317","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-15T13:46:52Z"}],"date_created":"2017-10-17T12:42:27Z","type":"conference","department":[{"_id":"64"}],"publication":"Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)","file_date_updated":"2018-03-15T13:46:52Z","citation":{"short":"J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.","chicago":"Blömer, Johannes, Peter Günther, and Volker Krummel. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” In <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 98–105, 2013.","apa":"Blömer, J., Günther, P., &#38; Krummel, V. (2013). Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study. In <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i> (pp. 98–105).","ieee":"J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study,” in <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2013, pp. 98–105.","ama":"Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study. In: <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>. ; 2013:98-105.","bibtex":"@inproceedings{Blömer_Günther_Krummel_2013, title={Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study}, booktitle={Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker}, year={2013}, pages={98–105} }","mla":"Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2013, pp. 98–105."},"abstract":[{"text":"Unattended systems are key ingredients of various critical infrastruc-tures like networks of self service terminals or automated teller machines.For cost and efficiency reasons they should mostly run autonomously.Unattended systems are attractive and lucrative targets for various kindsof attacks, including attacks on the integrity of their components and thecommunication between components. In this paper, we propose a gen-eral cryptographic framework to protect unattended systems. We alsodemonstrate that instantiating the framework with techniques from iden-tity based cryptography is particularly well-suited to efficiently secureunattended systems.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"abstract":[{"text":"We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes: a key-policy attribute-based KEM that is based on Goyal's key-policy ABE and a ciphertext-policy attribute-based KEM that is based on Waters' ciphertext-policy ABE. To achieve our goals, we use an appropriate hash function and need to extend the public parameters and the ciphertexts of the underlying CPA-secure encryption schemes only by a single group element. Moreover, we use the same hardness assumptions as the underlying CPA-secure encryption schemes.","lang":"eng"}],"department":[{"_id":"64"}],"type":"preprint","date_created":"2017-10-17T12:42:37Z","file":[{"file_size":389797,"access_level":"closed","file_name":"538-AB-KEM_01.pdf","date_updated":"2018-03-15T10:35:04Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1292","creator":"florida","date_created":"2018-03-15T10:35:04Z"}],"date_updated":"2022-01-06T07:01:51Z","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"full_name":"Liske, Gennadij","first_name":"Gennadij","last_name":"Liske"}],"title":"Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles","year":"2013","main_file_link":[{"url":"https://eprint.iacr.org/2013/646","open_access":"1"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"citation":{"mla":"Blömer, Johannes, and Gennadij Liske. <i>Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles</i>. Universität Paderborn, 2013.","ama":"Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 2013.","bibtex":"@article{Blömer_Liske_2013, title={Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles}, publisher={Universität Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2013} }","apa":"Blömer, J., &#38; Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.","ieee":"J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","short":"J. Blömer, G. Liske, (2013).","chicago":"Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013."},"file_date_updated":"2018-03-15T10:35:04Z","oa":"1","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"25078","_id":"538","publisher":"Universität Paderborn"},{"user_id":"477","_id":"553","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:57Z","title":"Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise","year":"2013","status":"public","author":[{"last_name":"Kohn","first_name":"Kathlén","full_name":"Kohn, Kathlén"}],"type":"bachelorsthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:42:40Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"citation":{"mla":"Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.","ama":"Kohn K. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn; 2013.","bibtex":"@book{Kohn_2013, title={Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}, publisher={Universität Paderborn}, author={Kohn, Kathlén}, year={2013} }","apa":"Kohn, K. (2013). <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn.","ieee":"K. Kohn, <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.","short":"K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise, Universität Paderborn, 2013.","chicago":"Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}]},{"place":"New York, NY, USA","date_created":"2018-06-05T07:41:14Z","department":[{"_id":"64"}],"type":"conference","citation":{"mla":"Ackermann, Marcel Rudolf, et al. <i>StreamKM++: A Clustering Algorithm for Data Streams</i>. Vol. 17, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2133803.2184450\">10.1145/2133803.2184450</a>.","ama":"Ackermann MR, Märtens M, Raupach C, Swierkot K, Lammersen C, Sohler C. StreamKM++: A clustering algorithm for data streams. 2012;17. doi:<a href=\"https://doi.org/10.1145/2133803.2184450\">10.1145/2133803.2184450</a>","bibtex":"@article{Ackermann_Märtens_Raupach_Swierkot_Lammersen_Sohler_2012, place={New York, NY, USA}, series={ACM Journal of Experimental Algorithmics}, title={StreamKM++: A clustering algorithm for data streams}, volume={17}, DOI={<a href=\"https://doi.org/10.1145/2133803.2184450\">10.1145/2133803.2184450</a>}, publisher={ACM}, author={Ackermann, Marcel Rudolf and Märtens, Marcus and Raupach, Christoph and Swierkot, Kamil and Lammersen, Christiane and Sohler, Christian}, year={2012}, collection={ACM Journal of Experimental Algorithmics} }","apa":"Ackermann, M. R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., &#38; Sohler, C. (2012). StreamKM++: A clustering algorithm for data streams. New York, NY, USA: ACM. <a href=\"https://doi.org/10.1145/2133803.2184450\">https://doi.org/10.1145/2133803.2184450</a>","ieee":"M. R. Ackermann, M. Märtens, C. Raupach, K. Swierkot, C. Lammersen, and C. Sohler, “StreamKM++: A clustering algorithm for data streams,” vol. 17. ACM, New York, NY, USA, 2012.","chicago":"Ackermann, Marcel Rudolf, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, and Christian Sohler. “StreamKM++: A Clustering Algorithm for Data Streams.” ACM Journal of Experimental Algorithmics. New York, NY, USA: ACM, 2012. <a href=\"https://doi.org/10.1145/2133803.2184450\">https://doi.org/10.1145/2133803.2184450</a>.","short":"M.R. Ackermann, M. Märtens, C. Raupach, K. Swierkot, C. Lammersen, C. Sohler, 17 (2012)."},"publisher":"ACM","_id":"2982","series_title":"ACM Journal of Experimental Algorithmics","volume":17,"doi":"10.1145/2133803.2184450","user_id":"25078","author":[{"full_name":"Ackermann, Marcel Rudolf","last_name":"Ackermann","first_name":"Marcel Rudolf"},{"full_name":"Märtens, Marcus","first_name":"Marcus","last_name":"Märtens"},{"first_name":"Christoph","last_name":"Raupach","full_name":"Raupach, Christoph"},{"full_name":"Swierkot, Kamil","last_name":"Swierkot","first_name":"Kamil"},{"first_name":"Christiane","last_name":"Lammersen","full_name":"Lammersen, Christiane"},{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"}],"title":"StreamKM++: A clustering algorithm for data streams","year":"2012","status":"public","intvolume":"        17","date_updated":"2022-01-06T06:58:50Z","publication_status":"published"},{"status":"public","user_id":"25078","volume":35,"_id":"2984","quality_controlled":"1","citation":{"mla":"Blömer, Johannes. “Turing Und Kryptografie.” <i>Informatik-Spektrum</i>, vol. 35, no. 4, 2012, doi:<a href=\"https://doi.org/10.1007/s00287-012-0622-7\">10.1007/s00287-012-0622-7</a>.","bibtex":"@article{Blömer_2012, title={Turing und Kryptografie}, volume={35}, DOI={<a href=\"https://doi.org/10.1007/s00287-012-0622-7\">10.1007/s00287-012-0622-7</a>}, number={4}, journal={Informatik-Spektrum}, author={Blömer, Johannes}, year={2012} }","ama":"Blömer J. Turing und Kryptografie. <i>Informatik-Spektrum</i>. 2012;35(4). doi:<a href=\"https://doi.org/10.1007/s00287-012-0622-7\">10.1007/s00287-012-0622-7</a>","ieee":"J. Blömer, “Turing und Kryptografie,” <i>Informatik-Spektrum</i>, vol. 35, no. 4, 2012.","apa":"Blömer, J. (2012). Turing und Kryptografie. <i>Informatik-Spektrum</i>, <i>35</i>(4). <a href=\"https://doi.org/10.1007/s00287-012-0622-7\">https://doi.org/10.1007/s00287-012-0622-7</a>","short":"J. Blömer, Informatik-Spektrum 35 (2012).","chicago":"Blömer, Johannes. “Turing Und Kryptografie.” <i>Informatik-Spektrum</i> 35, no. 4 (2012). <a href=\"https://doi.org/10.1007/s00287-012-0622-7\">https://doi.org/10.1007/s00287-012-0622-7</a>."},"date_updated":"2022-01-06T06:58:50Z","publication_status":"published","intvolume":"        35","title":"Turing und Kryptografie","year":"2012","author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"publication_identifier":{"issn":["1432-122X"]},"doi":"10.1007/s00287-012-0622-7","language":[{"iso":"eng"}],"abstract":[{"text":"Ich beschreibe die deutsche Enigma-Verschlüsselungsmaschine und skizziere, wie sie von den Codebrechern von Bletchely Park um Alan Turing gebrochen wurde. Besonderes Augenmerk lege ich auf die Beiträge Alan Turings und die Bedeutung seiner Leistung für die Entwicklung moderner Kryptografie. ","lang":"eng"}],"issue":"4","publication":"Informatik-Spektrum","type":"journal_article","department":[{"_id":"64"}],"date_created":"2018-06-05T07:42:38Z"},{"type":"bachelorsthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:42:50Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"chicago":"Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","short":"N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas, Universität Paderborn, 2012.","ieee":"N. Löken, <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","apa":"Löken, N. (2012). <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn.","bibtex":"@book{Löken_2012, title={Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2012} }","ama":"Löken N. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn; 2012.","mla":"Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012."},"user_id":"13703","publisher":"Universität Paderborn","_id":"606","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:02:51Z","title":"Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas","status":"public","year":"2012","author":[{"id":"13703","last_name":"Löken","first_name":"Nils","full_name":"Löken, Nils"}]},{"type":"bachelorsthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:42:50Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"ama":"Haarhoff T. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn; 2012.","bibtex":"@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn}, author={Haarhoff, Thomas}, year={2012} }","mla":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","chicago":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","short":"T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2, Universität Paderborn, 2012.","apa":"Haarhoff, T. (2012). <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn.","ieee":"T. Haarhoff, <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"user_id":"477","_id":"607","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","title":"Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2","status":"public","year":"2012","author":[{"full_name":"Haarhoff, Thomas","first_name":"Thomas","last_name":"Haarhoff"}]},{"language":[{"iso":"ger"}],"_id":"629","publisher":"Universität Paderborn","user_id":"477","year":"2012","status":"public","title":"Attribute-basierte Verschlüsselung","author":[{"first_name":"Patrick","last_name":"Schleiter","full_name":"Schleiter, Patrick"}],"date_updated":"2022-01-06T07:03:00Z","date_created":"2017-10-17T12:42:54Z","type":"bachelorsthesis","department":[{"_id":"64"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"citation":{"short":"P. Schleiter, Attribute-basierte Verschlüsselung, Universität Paderborn, 2012.","chicago":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","apa":"Schleiter, P. (2012). <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn.","ieee":"P. Schleiter, <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","ama":"Schleiter P. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn; 2012.","bibtex":"@book{Schleiter_2012, title={Attribute-basierte Verschlüsselung}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2012} }","mla":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}]},{"date_created":"2018-05-24T13:24:41Z","file":[{"access_level":"closed","file_size":569819,"file_name":"2011_Boettger_BicriteriaApproximationFuerDasKMediansClusteringMitBregmanDivergenzen.pdf","date_updated":"2018-05-24T13:23:12Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"2873","creator":"feidens","date_created":"2018-05-24T13:23:12Z"}],"department":[{"_id":"64"}],"type":"bachelorsthesis","citation":{"ama":"Böttger T. <i>Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen</i>.; 2011.","bibtex":"@book{Böttger_2011, title={Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen}, author={Böttger, Timm}, year={2011} }","mla":"Böttger, Timm. <i>Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen</i>. 2011.","chicago":"Böttger, Timm. <i>Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen</i>, 2011.","short":"T. Böttger, Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen, 2011.","apa":"Böttger, T. (2011). <i>Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen</i>.","ieee":"T. Böttger, <i>Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen</i>. 2011."},"supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"file_date_updated":"2018-05-24T13:23:12Z","_id":"2872","user_id":"25078","ddc":["000"],"author":[{"last_name":"Böttger","first_name":"Timm","full_name":"Böttger, Timm"}],"status":"public","title":"Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen","year":"2011","has_accepted_license":"1","date_updated":"2022-01-06T06:58:18Z"},{"author":[{"first_name":"Marcus","last_name":"Märtens","full_name":"Märtens, Marcus"}],"year":"2011","status":"public","title":"The Monotone Complexity of Computing k-Clique on Random Graphs","date_updated":"2022-01-06T06:58:44Z","_id":"2902","user_id":"25078","citation":{"ieee":"M. Märtens, <i>The Monotone Complexity of Computing k-Clique on Random Graphs</i>. 2011.","apa":"Märtens, M. (2011). <i>The Monotone Complexity of Computing k-Clique on Random Graphs</i>.","chicago":"Märtens, Marcus. <i>The Monotone Complexity of Computing K-Clique on Random Graphs</i>, 2011.","short":"M. Märtens, The Monotone Complexity of Computing K-Clique on Random Graphs, 2011.","mla":"Märtens, Marcus. <i>The Monotone Complexity of Computing K-Clique on Random Graphs</i>. 2011.","bibtex":"@book{Märtens_2011, title={The Monotone Complexity of Computing k-Clique on Random Graphs}, author={Märtens, Marcus}, year={2011} }","ama":"Märtens M. <i>The Monotone Complexity of Computing K-Clique on Random Graphs</i>.; 2011."},"supervisor":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"date_created":"2018-05-25T09:46:27Z","department":[{"_id":"64"}],"type":"mastersthesis"},{"department":[{"_id":"64"}],"type":"conference","date_created":"2018-06-05T07:47:21Z","citation":{"ieee":"M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability of Bregman Clustering Problems.” 2011.","mla":"Ackermann, Marcel R., et al. <i>Hardness and Non-Approximability of Bregman Clustering Problems.</i> 2011.","apa":"Ackermann, M. R., Blömer, J., &#38; Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.","bibtex":"@article{Ackermann_Blömer_Scholz_2011, series={Electronic Colloquium on Computational Complexity (ECCC)}, title={Hardness and Non-Approximability of Bregman Clustering Problems.}, author={Ackermann, Marcel R and Blömer, Johannes and Scholz, Christoph}, year={2011}, collection={Electronic Colloquium on Computational Complexity (ECCC)} }","chicago":"Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011.","short":"M.R. Ackermann, J. Blömer, C. Scholz, (2011).","ama":"Ackermann MR, Blömer J, Scholz C. Hardness and Non-Approximability of Bregman Clustering Problems. 2011."},"user_id":"25078","_id":"2985","series_title":"Electronic Colloquium on Computational Complexity (ECCC)","publication_status":"published","date_updated":"2022-01-06T06:58:50Z","author":[{"full_name":"Ackermann, Marcel R","first_name":"Marcel R","last_name":"Ackermann"},{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"},{"last_name":"Scholz","first_name":"Christoph","full_name":"Scholz, Christoph"}],"year":"2011","status":"public","title":"Hardness and Non-Approximability of Bregman Clustering Problems."},{"publication_identifier":{"isbn":["9783642153273","9783642153280"]},"author":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"title":"How to Share a Secret","status":"public","year":"2011","date_updated":"2022-01-06T06:58:50Z","publication_status":"published","_id":"2986","publisher":"Springer Berlin Heidelberg","page":"159-168","doi":"10.1007/978-3-642-15328-0_17","user_id":"25078","citation":{"mla":"Blömer, Johannes. “How to Share a Secret.” <i>Algorithms Unplugged</i>, Springer Berlin Heidelberg, 2011, pp. 159–68, doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">10.1007/978-3-642-15328-0_17</a>.","ama":"Blömer J. How to Share a Secret. In: <i>Algorithms Unplugged</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:159-168. doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">10.1007/978-3-642-15328-0_17</a>","bibtex":"@inbook{Blömer_2011, place={Berlin, Heidelberg}, title={How to Share a Secret}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">10.1007/978-3-642-15328-0_17</a>}, booktitle={Algorithms Unplugged}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2011}, pages={159–168} }","apa":"Blömer, J. (2011). How to Share a Secret. In <i>Algorithms Unplugged</i> (pp. 159–168). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">https://doi.org/10.1007/978-3-642-15328-0_17</a>","ieee":"J. Blömer, “How to Share a Secret,” in <i>Algorithms Unplugged</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.","short":"J. Blömer, in: Algorithms Unplugged, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 159–168.","chicago":"Blömer, Johannes. “How to Share a Secret.” In <i>Algorithms Unplugged</i>, 159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_17\">https://doi.org/10.1007/978-3-642-15328-0_17</a>."},"publication":"Algorithms Unplugged","place":"Berlin, Heidelberg","date_created":"2018-06-05T07:48:25Z","department":[{"_id":"64"}],"type":"book_chapter"},{"file_date_updated":"2018-03-14T13:47:44Z","citation":{"bibtex":"@book{Liske_2011, title={Fault attacks in pairing-based cryptography}, publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2011} }","ama":"Liske G. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität Paderborn; 2011.","mla":"Liske, Gennadij. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität Paderborn, 2011.","short":"G. Liske, Fault Attacks in Pairing-Based Cryptography, Universität Paderborn, 2011.","chicago":"Liske, Gennadij. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität Paderborn, 2011.","ieee":"G. Liske, <i>Fault attacks in pairing-based cryptography</i>. Universität Paderborn, 2011.","apa":"Liske, G. (2011). <i>Fault attacks in pairing-based cryptography</i>. Universität Paderborn."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"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"}],"file":[{"date_updated":"2018-03-14T13:47:44Z","relation":"main_file","access_level":"closed","file_size":1795920,"file_name":"659-MA_Fault_attacks_in_pairing-based_cryptography_01.pdf","success":1,"content_type":"application/pdf","file_id":"1218","creator":"florida","date_created":"2018-03-14T13:47:44Z"}],"date_created":"2017-10-17T12:43:00Z","type":"mastersthesis","department":[{"_id":"64"}],"status":"public","title":"Fault attacks in pairing-based cryptography","year":"2011","author":[{"full_name":"Liske, Gennadij","first_name":"Gennadij","last_name":"Liske"}],"date_updated":"2022-01-06T07:03:13Z","has_accepted_license":"1","publisher":"Universität Paderborn","_id":"659","user_id":"25078","ddc":["040"]},{"publication_status":"published","date_updated":"2024-08-08T12:17:02Z","year":"2011","title":"Algorithms for lattice problems with respect to general norms","status":"public","author":[{"id":"1971","last_name":" Naewe","first_name":"Stefanie","full_name":" Naewe, Stefanie"}],"user_id":"49063","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-8047"}],"language":[{"iso":"eng"}],"_id":"2910","publisher":"Universität Paderborn","citation":{"ieee":"S.  Naewe, <i>Algorithms for lattice problems with respect to general norms</i>. Universität Paderborn, 2011.","apa":"Naewe, S. (2011). <i>Algorithms for lattice problems with respect to general norms</i>. Universität Paderborn.","chicago":"Naewe, Stefanie. <i>Algorithms for Lattice Problems with Respect to General Norms</i>. Universität Paderborn, 2011.","short":"S.  Naewe, Algorithms for Lattice Problems with Respect to General Norms, Universität Paderborn, 2011.","mla":"Naewe, Stefanie. <i>Algorithms for Lattice Problems with Respect to General Norms</i>. Universität Paderborn, 2011.","bibtex":"@book{ Naewe_2011, title={Algorithms for lattice problems with respect to general norms}, publisher={Universität Paderborn}, author={ Naewe, Stefanie}, year={2011} }","ama":"Naewe S. <i>Algorithms for Lattice Problems with Respect to General Norms</i>. Universität Paderborn; 2011."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"type":"dissertation","department":[{"_id":"64"}],"date_created":"2018-05-25T10:08:44Z"}]