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.

Ackermann MR, Märtens M, Raupach C, Swierkot K, Lammersen C, Sohler C. StreamKM++: A clustering algorithm for data streams. 2012;17. doi:10.1145/2133803.2184450

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

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

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.

Schrieb J. Efficient and Compact CCA Security from Partitioned IBKEM. 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. Algorithms for the Bregman K-Median Problem. Universität Paderborn; 2009.

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

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

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

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