Schröer, C. (2009). Hierarchisches Clustering mit minimalen Cluster-Durchmessern.

Liske, G. (2009). Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens.

Scholz, C. (2009). Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen.

Ackermann, M. R. (2009). Algorithms for the Bregman k-Median Problem. Universität Paderborn.

Ackermann, M. R., &; Blömer, J. (2009). Coresets and Approximate Clustering for Bregman Divergences. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1088–1097). Philadelphia, PA: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611973068.118 

Blömer, J., &; Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science, (18), 1648–1665.https://doi.org/10.1016/j.tcs.2008.12.045 

Schrieb, J., Wehrheim, H., &; Wonisch, D. (2009). Three-Valued Spotlight Abstractions. In FM 2009: Formal Methods (pp. 106–122). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-05089-3_8 

Stern, C., Adelt, P., Krummel, V., &; Ackermann, M. R. (2008). Reliable Evidence of Data Integrity from an Untrusted Storage Service. In Fourth International Conference on Networking and Services (icns 2008). IEEE.https://doi.org/10.1109/icns.2008.28 

Schrieb, J. (2008). Construction and Applications of Identity-Based Encryption without Pairings.

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

Blömer, J., &; Krummel, V. (2007). Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In Selected Areas in Cryptography (pp. 96–109). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-77360-3_7 

May, A. (2007). Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In Advances in Cryptology — CRYPTO 2002 (pp. 242–256). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-45708-9_16 

Blömer, J., &; May, A. (2007). Low Secret Exponent RSA Revisited. In Lecture Notes in Computer Science (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-44670-2_2 

Blömer, J., &; May, A. (2007). Key Revocation with Interval Cover Families. In Selected Areas in Cryptography (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-45537-x_26 

May, A., &; Silverman, J. H. (2007). Dimension Reduction Methods for Convolution Modular Lattices. In Lecture Notes in Computer Science (pp. 110–125). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-44670-2_10 

Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-68530-8_13 

Ziegert, S. (2007). Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem.

Richert, M. (2007). Sichere Kryptosysteme durch Zero-Knowledge.

Klein, W. (2007). Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln.

Käthler, O. (2007). Kryptanalyse des EAC-Protokolls biometrischer Reisepässe.