[{"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"citation":{"short":"S. Brauer, A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures, 2014.","chicago":"Brauer, Sascha. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>, 2014.","apa":"Brauer, S. (2014). <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>.","ieee":"S. Brauer, <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>. 2014.","ama":"Brauer S. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>.; 2014.","bibtex":"@book{Brauer_2014, title={A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures}, author={Brauer, Sascha}, year={2014} }","mla":"Brauer, Sascha. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures</i>. 2014."},"file_date_updated":"2018-05-25T09:45:33Z","date_created":"2018-05-25T09:45:38Z","file":[{"file_id":"2901","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-05-25T09:45:33Z","file_name":"2014_Brauer_AProbabilisticExpectationMaximizationAlgorithmForMultivariateLaplacianMixtures.pdf","access_level":"closed","file_size":971935,"date_created":"2018-05-25T09:45:33Z","creator":"feidens"}],"department":[{"_id":"64"}],"type":"mastersthesis","author":[{"id":"13291","full_name":"Brauer, Sascha","first_name":"Sascha","last_name":"Brauer"}],"title":"A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures","status":"public","year":"2014","has_accepted_license":"1","date_updated":"2022-01-06T06:58:44Z","_id":"2900","ddc":["000"],"user_id":"25078"},{"date_created":"2017-10-17T12:42:12Z","type":"mastersthesis","department":[{"_id":"64"}],"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"citation":{"chicago":"Jochheim, Janek. <i>Hiding Software Components Using Functional Encryption</i>. Universität Paderborn, 2014.","short":"J. Jochheim, Hiding Software Components Using Functional Encryption, Universität Paderborn, 2014.","apa":"Jochheim, J. (2014). <i>Hiding software components using functional encryption</i>. Universität Paderborn.","ieee":"J. Jochheim, <i>Hiding software components using functional encryption</i>. Universität Paderborn, 2014.","ama":"Jochheim J. <i>Hiding Software Components Using Functional Encryption</i>. Universität Paderborn; 2014.","bibtex":"@book{Jochheim_2014, title={Hiding software components using functional encryption}, publisher={Universität Paderborn}, author={Jochheim, Janek}, year={2014} }","mla":"Jochheim, Janek. <i>Hiding Software Components Using Functional Encryption</i>. Universität Paderborn, 2014."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"43","name":"Securing the Financial Cloud"}],"_id":"414","publisher":"Universität Paderborn","user_id":"25078","status":"public","year":"2014","title":"Hiding software components using functional encryption","author":[{"first_name":"Janek","last_name":"Jochheim","full_name":"Jochheim, Janek"}],"date_updated":"2022-01-06T07:00:23Z"},{"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"citation":{"short":"P. Bemmann, Group Signature Schemes with Strong Exculpability, Universität Paderborn, 2014.","chicago":"Bemmann, Pascal. <i>Group Signature Schemes with Strong Exculpability</i>. Universität Paderborn, 2014.","ieee":"P. Bemmann, <i>Group Signature Schemes with Strong Exculpability</i>. Universität Paderborn, 2014.","apa":"Bemmann, P. (2014). <i>Group Signature Schemes with Strong Exculpability</i>. Universität Paderborn.","bibtex":"@book{Bemmann_2014, title={Group Signature Schemes with Strong Exculpability}, publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2014} }","ama":"Bemmann P. <i>Group Signature Schemes with Strong Exculpability</i>. Universität Paderborn; 2014.","mla":"Bemmann, Pascal. <i>Group Signature Schemes with Strong Exculpability</i>. Universität Paderborn, 2014."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:13Z","department":[{"_id":"64"}],"type":"bachelorsthesis","author":[{"id":"32571","full_name":"Bemmann, Pascal","first_name":"Pascal","last_name":"Bemmann"}],"status":"public","title":"Group Signature Schemes with Strong Exculpability","year":"2014","date_updated":"2022-01-06T07:00:26Z","_id":"416","publisher":"Universität Paderborn","user_id":"25078"},{"supervisor":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"}],"citation":{"bibtex":"@book{Lippert_2014, title={Fujisaki-Okamoto Transformation}, publisher={Universität Paderborn}, author={Lippert, Jan}, year={2014} }","ama":"Lippert J. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn; 2014.","mla":"Lippert, Jan. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn, 2014.","chicago":"Lippert, Jan. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn, 2014.","short":"J. Lippert, Fujisaki-Okamoto Transformation, Universität Paderborn, 2014.","ieee":"J. Lippert, <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn, 2014.","apa":"Lippert, J. (2014). <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn."},"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:14Z","department":[{"_id":"64"}],"type":"bachelorsthesis","author":[{"full_name":"Lippert, Jan","last_name":"Lippert","first_name":"Jan"}],"year":"2014","title":"Fujisaki-Okamoto Transformation","status":"public","date_updated":"2022-01-06T07:00:36Z","_id":"421","publisher":"Universität Paderborn","user_id":"25078"},{"department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2018-05-24T13:16:41Z","citation":{"ama":"Laudemann S. <i>Themenmodellierung Zur Identifikation Und Gruppierung von Spam-Webseiten</i>.; 2013.","bibtex":"@book{Laudemann_2013, title={Themenmodellierung zur Identifikation und Gruppierung von Spam-Webseiten}, author={Laudemann, Stefan}, year={2013} }","mla":"Laudemann, Stefan. <i>Themenmodellierung Zur Identifikation Und Gruppierung von Spam-Webseiten</i>. 2013.","chicago":"Laudemann, Stefan. <i>Themenmodellierung Zur Identifikation Und Gruppierung von Spam-Webseiten</i>, 2013.","short":"S. Laudemann, Themenmodellierung Zur Identifikation Und Gruppierung von Spam-Webseiten, 2013.","apa":"Laudemann, S. (2013). <i>Themenmodellierung zur Identifikation und Gruppierung von Spam-Webseiten</i>.","ieee":"S. Laudemann, <i>Themenmodellierung zur Identifikation und Gruppierung von Spam-Webseiten</i>. 2013."},"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"user_id":"25078","_id":"2868","date_updated":"2022-01-06T06:58:17Z","author":[{"last_name":"Laudemann","first_name":"Stefan","full_name":"Laudemann, Stefan"}],"year":"2013","title":"Themenmodellierung zur Identifikation und Gruppierung von Spam-Webseiten","status":"public"},{"status":"public","title":"Nichtapproximierbarkeitsresultate zu Radius- und Durchmesserclustering unter Verwendung von L_p-Metriken","year":"2013","author":[{"full_name":"Leder, Lennart","last_name":"Leder","first_name":"Lennart"}],"date_updated":"2022-01-06T06:58:17Z","_id":"2869","user_id":"25078","supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"citation":{"mla":"Leder, Lennart. <i>Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering Unter Verwendung von L_p-Metriken</i>. 2013.","ama":"Leder L. <i>Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering Unter Verwendung von L_p-Metriken</i>.; 2013.","bibtex":"@book{Leder_2013, title={Nichtapproximierbarkeitsresultate zu Radius- und Durchmesserclustering unter Verwendung von L_p-Metriken}, author={Leder, Lennart}, year={2013} }","apa":"Leder, L. (2013). <i>Nichtapproximierbarkeitsresultate zu Radius- und Durchmesserclustering unter Verwendung von L_p-Metriken</i>.","ieee":"L. Leder, <i>Nichtapproximierbarkeitsresultate zu Radius- und Durchmesserclustering unter Verwendung von L_p-Metriken</i>. 2013.","short":"L. Leder, Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering Unter Verwendung von L_p-Metriken, 2013.","chicago":"Leder, Lennart. <i>Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering Unter Verwendung von L_p-Metriken</i>, 2013."},"date_created":"2018-05-24T13:17:53Z","type":"bachelorsthesis","department":[{"_id":"64"}]},{"_id":"2909","publisher":"Universität Paderborn","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12721"}],"user_id":"25078","author":[{"last_name":"Kuntze","first_name":"Daniel","full_name":"Kuntze, Daniel"}],"status":"public","title":"Practical algorithms for clustering and modeling large data sets - Analysis and improvements","year":"2013","date_updated":"2022-01-06T06:58:46Z","date_created":"2018-05-25T10:07:42Z","department":[{"_id":"64"}],"type":"dissertation","supervisor":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"citation":{"ieee":"D. Kuntze, <i>Practical algorithms for clustering and modeling large data sets - Analysis and improvements</i>. Universität Paderborn, 2013.","apa":"Kuntze, D. (2013). <i>Practical algorithms for clustering and modeling large data sets - Analysis and improvements</i>. Universität Paderborn.","short":"D. Kuntze, Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements, 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.","mla":"Kuntze, Daniel. <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} }","ama":"Kuntze D. <i>Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements</i>. Universität Paderborn; 2013."}},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"citation":{"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} }","ama":"Tezer A. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. 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.","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.","ieee":"A. Tezer, <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","apa":"Tezer, A. (2013). <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn."},"department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:42:23Z","date_updated":"2022-01-06T07:01:19Z","author":[{"last_name":"Tezer","first_name":"Alina","full_name":"Tezer, Alina"}],"status":"public","title":"Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen","year":"2013","user_id":"477","_id":"471","publisher":"Universität Paderborn","language":[{"iso":"ger"}]},{"department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:42:27Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"citation":{"mla":"Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013.","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.","ieee":"O. Otte, <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013.","apa":"Otte, O. (2013). <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn.","short":"O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie, Universität Paderborn, 2013.","chicago":"Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013."},"user_id":"477","_id":"486","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:27Z","author":[{"full_name":"Otte, Oliver","first_name":"Oliver","last_name":"Otte"}],"title":"Seitenkanalresistenz paarungsbasierter Kryptographie","year":"2013","status":"public"},{"_id":"553","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"477","author":[{"first_name":"Kathlén","last_name":"Kohn","full_name":"Kohn, Kathlén"}],"year":"2013","title":"Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise","status":"public","date_updated":"2022-01-06T07:01:57Z","date_created":"2017-10-17T12:42:40Z","department":[{"_id":"64"}],"type":"bachelorsthesis","supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"chicago":"Kohn, Kathlén. <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.","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.","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} }","mla":"Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}]},{"date_updated":"2022-01-06T07:02:51Z","year":"2012","title":"Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas","status":"public","author":[{"first_name":"Nils","last_name":"Löken","full_name":"Löken, Nils","id":"13703"}],"user_id":"13703","_id":"606","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"citation":{"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.","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.","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.","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.","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.","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} }"},"type":"bachelorsthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:42:50Z"},{"user_id":"477","language":[{"iso":"ger"}],"_id":"607","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:51Z","status":"public","title":"Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2","year":"2012","author":[{"full_name":"Haarhoff, Thomas","first_name":"Thomas","last_name":"Haarhoff"}],"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"},{"name":"SFB 901 - Project Area C","_id":"4"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"citation":{"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.","ieee":"T. Haarhoff, <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. 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.","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} }","ama":"Haarhoff T. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn; 2012.","mla":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012."}},{"department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:42:54Z","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"}],"citation":{"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.","short":"P. Schleiter, Attribute-basierte Verschlüsselung, Universität Paderborn, 2012.","chicago":"Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn, 2012.","mla":"Schleiter, Patrick. <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} }"},"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"user_id":"477","publisher":"Universität Paderborn","_id":"629","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:03:00Z","author":[{"last_name":"Schleiter","first_name":"Patrick","full_name":"Schleiter, Patrick"}],"status":"public","title":"Attribute-basierte Verschlüsselung","year":"2012"},{"_id":"2902","user_id":"25078","status":"public","title":"The Monotone Complexity of Computing k-Clique on Random Graphs","year":"2011","author":[{"last_name":"Märtens","first_name":"Marcus","full_name":"Märtens, Marcus"}],"date_updated":"2022-01-06T06:58:44Z","date_created":"2018-05-25T09:46:27Z","type":"mastersthesis","department":[{"_id":"64"}],"supervisor":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"citation":{"short":"M. Märtens, The Monotone Complexity of Computing K-Clique on Random Graphs, 2011.","chicago":"Märtens, Marcus. <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>.","ieee":"M. Märtens, <i>The Monotone Complexity of Computing k-Clique on Random Graphs</i>. 2011.","ama":"Märtens M. <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} }","mla":"Märtens, Marcus. <i>The Monotone Complexity of Computing K-Clique on Random Graphs</i>. 2011."}},{"date_created":"2017-10-17T12:43:00Z","file":[{"creator":"florida","date_created":"2018-03-14T13:47:44Z","relation":"main_file","date_updated":"2018-03-14T13:47:44Z","file_name":"659-MA_Fault_attacks_in_pairing-based_cryptography_01.pdf","file_size":1795920,"access_level":"closed","file_id":"1218","content_type":"application/pdf","success":1}],"department":[{"_id":"64"}],"type":"mastersthesis","citation":{"mla":"Liske, Gennadij. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität Paderborn, 2011.","ama":"Liske G. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität Paderborn; 2011.","bibtex":"@book{Liske_2011, title={Fault attacks in pairing-based cryptography}, publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2011} }","apa":"Liske, G. (2011). <i>Fault attacks in pairing-based cryptography</i>. Universität Paderborn.","ieee":"G. Liske, <i>Fault attacks in pairing-based cryptography</i>. Universität Paderborn, 2011.","chicago":"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."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"file_date_updated":"2018-03-14T13:47:44Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"publisher":"Universität Paderborn","_id":"659","user_id":"25078","ddc":["040"],"author":[{"full_name":"Liske, Gennadij","last_name":"Liske","first_name":"Gennadij"}],"title":"Fault attacks in pairing-based cryptography","status":"public","year":"2011","has_accepted_license":"1","date_updated":"2022-01-06T07:03:13Z"},{"status":"public","title":"Algorithms for lattice problems with respect to general norms","year":"2011","author":[{"full_name":" Naewe, Stefanie","first_name":"Stefanie","last_name":" Naewe","id":"1971"}],"date_updated":"2024-08-08T12:17:02Z","publication_status":"published","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-8047"}],"_id":"2910","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"49063","supervisor":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"citation":{"mla":"Naewe, Stefanie. <i>Algorithms for Lattice Problems with Respect to General Norms</i>. Universität Paderborn, 2011.","ama":"Naewe S. <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} }","apa":"Naewe, S. (2011). <i>Algorithms for lattice problems with respect to general norms</i>. Universität Paderborn.","ieee":"S.  Naewe, <i>Algorithms for lattice problems with respect to general norms</i>. Universität Paderborn, 2011.","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."},"date_created":"2018-05-25T10:08:44Z","type":"dissertation","department":[{"_id":"64"}]},{"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"citation":{"ieee":"C. Schröer, <i>Hierarchisches Clustering mit minimalen Cluster-Durchmessern</i>. 2009.","apa":"Schröer, C. (2009). <i>Hierarchisches Clustering mit minimalen Cluster-Durchmessern</i>.","short":"C. Schröer, Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern, 2009.","chicago":"Schröer, Carsten. <i>Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern</i>, 2009.","mla":"Schröer, Carsten. <i>Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern</i>. 2009.","bibtex":"@book{Schröer_2009, title={Hierarchisches Clustering mit minimalen Cluster-Durchmessern}, author={Schröer, Carsten}, year={2009} }","ama":"Schröer C. <i>Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern</i>.; 2009."},"file_date_updated":"2018-05-25T09:07:18Z","date_created":"2018-05-25T09:07:25Z","file":[{"file_id":"2881","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-05-25T09:07:18Z","file_name":"2009_Schroeer_HierarchischesDurchmesserClustering.pdf","file_size":626531,"access_level":"closed","date_created":"2018-05-25T09:07:18Z","creator":"feidens"}],"department":[{"_id":"64"}],"type":"bachelorsthesis","author":[{"full_name":"Schröer, Carsten","first_name":"Carsten","last_name":"Schröer"}],"status":"public","year":"2009","title":"Hierarchisches Clustering mit minimalen Cluster-Durchmessern","has_accepted_license":"1","date_updated":"2022-01-06T06:58:25Z","_id":"2880","ddc":["000"],"user_id":"25078"},{"_id":"2904","user_id":"25078","ddc":["000"],"author":[{"full_name":"Scholz, Christoph","first_name":"Christoph","last_name":"Scholz"}],"status":"public","title":"Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen","year":"2009","has_accepted_license":"1","date_updated":"2022-01-06T06:58:44Z","date_created":"2018-05-25T09:48:17Z","file":[{"content_type":"application/pdf","success":1,"file_id":"2905","date_updated":"2018-05-25T09:48:10Z","relation":"main_file","file_size":844164,"access_level":"closed","file_name":"2009_Scholz_DieSchwierigkeitDesKMedianClusteringsFuerBregmanDivergenzen.pdf","date_created":"2018-05-25T09:48:10Z","creator":"feidens"}],"department":[{"_id":"64"}],"type":"mastersthesis","citation":{"chicago":"Scholz, Christoph. <i>Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen</i>, 2009.","short":"C. Scholz, Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen, 2009.","apa":"Scholz, C. (2009). <i>Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen</i>.","ieee":"C. Scholz, <i>Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen</i>. 2009.","ama":"Scholz C. <i>Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen</i>.; 2009.","bibtex":"@book{Scholz_2009, title={Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen}, author={Scholz, Christoph}, year={2009} }","mla":"Scholz, Christoph. <i>Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen</i>. 2009."},"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"file_date_updated":"2018-05-25T09:48:10Z"},{"_id":"2911","publisher":"Universität Paderborn","main_file_link":[{"url":"http://digital.ub.uni-paderborn.de/hs/content/titleinfo/1561"}],"user_id":"25078","author":[{"first_name":"Marcel Rudolf","last_name":"Ackermann","full_name":"Ackermann, Marcel Rudolf"}],"status":"public","year":"2009","title":"Algorithms for the Bregman k-Median Problem","date_updated":"2022-01-06T06:58:46Z","date_created":"2018-05-25T10:48:51Z","department":[{"_id":"64"}],"type":"dissertation","supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"citation":{"chicago":"Ackermann, Marcel Rudolf. <i>Algorithms for the Bregman K-Median Problem</i>. Universität Paderborn, 2009.","short":"M.R. Ackermann, Algorithms for the Bregman K-Median Problem, Universität Paderborn, 2009.","ieee":"M. R. Ackermann, <i>Algorithms for the Bregman k-Median Problem</i>. Universität Paderborn, 2009.","apa":"Ackermann, M. R. (2009). <i>Algorithms for the Bregman k-Median Problem</i>. Universität Paderborn.","bibtex":"@book{Ackermann_2009, title={Algorithms for the Bregman k-Median Problem}, publisher={Universität Paderborn}, author={Ackermann, Marcel Rudolf}, year={2009} }","ama":"Ackermann MR. <i>Algorithms for the Bregman K-Median Problem</i>. Universität Paderborn; 2009.","mla":"Ackermann, Marcel Rudolf. <i>Algorithms for the Bregman K-Median Problem</i>. Universität Paderborn, 2009."}},{"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"citation":{"bibtex":"@book{Krummel_2007, title={Tamper Resistance of AES -- Models, Attacks and Countermeasures}, publisher={Universität Paderborn}, author={Krummel, Volker}, year={2007} }","chicago":"Krummel, Volker. <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>. Universität Paderborn, 2007.","short":"V. Krummel, Tamper Resistance of AES -- Models, Attacks and Countermeasures, Universität Paderborn, 2007.","ama":"Krummel V. <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>. Universität Paderborn; 2007.","ieee":"V. Krummel, <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>. Universität Paderborn, 2007.","mla":"Krummel, Volker. <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>. Universität Paderborn, 2007.","apa":"Krummel, V. (2007). <i>Tamper Resistance of AES -- Models, Attacks and Countermeasures</i>. Universität Paderborn."},"type":"dissertation","department":[{"_id":"64"}],"date_created":"2018-05-25T10:49:53Z","date_updated":"2022-01-06T06:58:46Z","status":"public","title":"Tamper Resistance of AES -- Models, Attacks and Countermeasures","year":"2007","author":[{"last_name":"Krummel","first_name":"Volker","full_name":"Krummel, Volker"}],"user_id":"25078","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20080110018"}],"publisher":"Universität Paderborn","_id":"2912"}]