Sauer, Malte. Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen. 2014.

Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.”10.1109/FDTC.2014.10__Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7, doi:10.1109/FDTC.2014.10.

Rath, Timo. RSA-Full Domain Hash Revisited. Universität Paderborn, 2014.

Brauer, Sascha. A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures. 2014.

Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.”10.1007/s00453-012-9717-4__Algorithmica, vol. 69, Springer US, 2014, doi:10.1007/s00453-012-9717-4.

Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.”10.1109/icpr.2014.253__2014 22nd International Conference on Pattern Recognition, IEEE, 2014, doi:10.1109/icpr.2014.253.

Blömer, Johannes, and Gennadij Liske. Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions. Universität Paderborn, 2014.

Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.”10.1109/FDTC.2014.22__Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136, doi:10.1109/FDTC.2014.22.

Jochheim, Janek. Hiding Software Components Using Functional Encryption. Universität Paderborn, 2014.

Bemmann, Pascal. Group Signature Schemes with Strong Exculpability. Universität Paderborn, 2014.

Lippert, Jan. Fujisaki-Okamoto Transformation. Universität Paderborn, 2014.

Laudemann, Stefan. Themenmodellierung Zur Identifikation Und Gruppierung von Spam-Webseiten. 2013.

Leder, Lennart. Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering Unter Verwendung von L_p-Metriken. 2013.

Kuntze, Daniel. Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements. Universität Paderborn, 2013.

Juhnke, Jakob, et al. An Approach for Determining Optimal Contrast in Visual Cryptography. Fortschritt-Berichte VDI, 2013.

Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.”10.1007/978-3-642-40026-1_10__Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, 2013, pp. 154–68, doi:10.1007/978-3-642-40026-1_10.

Tezer, Alina. Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.

Otte, Oliver. Seitenkanalresistenz paarungsbasierter Kryptographie. Universität Paderborn, 2013.

Bobolz, Jan. Security Proofs for Pairing-Based Cryptography in the Generic Group Model. Universität Paderborn, 2013.

Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.

Blömer, Johannes, and Gennadij Liske. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn, 2013.

Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.

Ackermann, Marcel Rudolf, et al. StreamKM++: A Clustering Algorithm for Data Streams. Vol. 17, ACM, 2012, doi:10.1145/2133803.2184450.

Blömer, Johannes. “Turing Und Kryptografie.”10.1007/s00287-012-0622-7__Informatik-Spektrum, vol. 35, no. 4, 2012, doi:10.1007/s00287-012-0622-7.

Löken, Nils. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012.

Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.

Schleiter, Patrick. Attribute-basierte Verschlüsselung. Universität Paderborn, 2012.

Böttger, Timm. Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen. 2011.

Märtens, Marcus. The Monotone Complexity of Computing K-Clique on Random Graphs. 2011.

Naewe, Stefanie. Algorithms for Lattice Problems with Respect to General Norms. Universität Paderborn, 2011.

Ackermann, Marcel R., et al. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.

Blömer, Johannes. “How to Share a Secret.”10.1007/978-3-642-15328-0_17__Algorithms Unplugged, Springer Berlin Heidelberg, 2011, pp. 159–68, doi:10.1007/978-3-642-15328-0_17.

Blömer, Johannes, and Stefanie Naewe. “Solving the Closest Vector Problem with Respect to Lp Norms.” ArXiv:1104.3720, 2011.

Liske, Gennadij. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn, 2011.

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”10.1007/978-3-642-13731-0_21__SWAT 2010, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:10.1007/978-3-642-13731-0_21.

Ackermann, Marcel R., et al. “Clustering for Metric and Nonmetric Distance Measures.”10.1145/1824777.1824779__ACM Trans. Algorithms, no. 4, 2010, pp. 59:1--59:26, doi:10.1145/1824777.1824779.

Krueger, Alexander, et al. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.

Schrieb, Jonas. Efficient and Compact CCA Security from Partitioned IBKEM. 2010.

Schäfer, Wilhelm, et al. “Engineering Self-Coordinating Software Intensive Systems.”10.1145/1882362.1882428__Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010, doi:10.1145/1882362.1882428.

Postler, Tim. Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung. 2010.

Schröer, Carsten. Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern. 2009.

Liske, Gennadij. Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens. 2009.

Scholz, Christoph. Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen. 2009.

Ackermann, Marcel Rudolf. Algorithms for the Bregman K-Median Problem. Universität Paderborn, 2009.

Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.”10.1137/1.9781611973068.118__Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2009, pp. 1088–97, doi:10.1137/1.9781611973068.118.

Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.”10.1016/j.tcs.2008.12.045__Theoretical Computer Science, no. 18, 2009, pp. 1648–65, doi:10.1016/j.tcs.2008.12.045.

Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.”10.1007/978-3-642-05089-3_8__FM 2009: Formal Methods, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:10.1007/978-3-642-05089-3_8.

Stern, Claudius, et al. “Reliable Evidence of Data Integrity from an Untrusted Storage Service.”10.1109/icns.2008.28__Fourth International Conference on Networking and Services (Icns 2008), IEEE, 2008, doi:10.1109/icns.2008.28.

Schrieb, Jonas. Construction and Applications of Identity-Based Encryption without Pairings. 2008.

Krummel, Volker. Tamper Resistance of AES -- Models, Attacks and Countermeasures. Universität Paderborn, 2007.