Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn; 2015.

Blömer J, Günther P, Liske G. Tampering attacks in pairing-based cryptography. In: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC). ; 2014:1--7. doi:10.1109/FDTC.2014.10

Ackermann MR, Blömer J, Kuntze D, Sohler C. Analysis of Agglomerative Clustering. Algorithmica. 2014;69. doi:10.1007/s00453-012-9717-4

Blömer J, Bujna K, Kuntze D. A Theoretical and Experimental Comparison of the EM and SEM Algorithm. In: 2014 22nd International Conference on Pattern Recognition. IEEE; 2014. doi:10.1109/icpr.2014.253

Blömer J, Liske G. Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. 2014.

Blömer J, Gomes da Silva R, Günther P, Krämer J, Seifert J-P. A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC). ; 2014:123--136. doi:10.1109/FDTC.2014.22

Blömer J, Günther P, Liske G. Improved Side Channel Attacks on Pairing Based Cryptography. In: Constructive Side-Channel Analysis and Secure Design. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:154-168. doi:10.1007/978-3-642-40026-1_10

Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study. In: Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS). ; 2013:98-105.

Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 2013.

Blömer J. Turing und Kryptografie. Informatik-Spektrum. 2012;35(4). doi:10.1007/s00287-012-0622-7

Ackermann MR, Blömer J, Scholz C. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.

Blömer J. How to Share a Secret. In: Algorithms Unplugged. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:159-168. doi:10.1007/978-3-642-15328-0_17

Blömer J, Naewe S. Solving the Closest Vector Problem with respect to Lp Norms. arXiv:11043720. 2011.

Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: SWAT 2010. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:212-223. doi:10.1007/978-3-642-13731-0_21

Ackermann MR, Blömer J, Sohler C. Clustering for Metric and Nonmetric Distance Measures. ACM Trans Algorithms. 2010;(4):59:1--59:26. doi:10.1145/1824777.1824779

Krueger A, Leutnant V, Haeb-Umbach R, Ackermann M, Blömer J. On the initialization of dynamic models for speech features. Proc of ITG Fachtagung Sprachkommunikation ITG, Bochum, Germany. 2010.

Schäfer W, Trächtler A, Birattari M, et al. Engineering self-coordinating software intensive systems. In: Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10. ACM Press; 2010. doi:10.1145/1882362.1882428

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

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

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