J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,” in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.

J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over finite fields,” Random Structures \'26; Algorithms, no. 4, pp. 407–419, 1997.

J. Blömer, C. Lammersen, M. Schmidt, and C. Sohler, “Theoretical Analysis of the k-Means Algorithm – A Survey,” in Algorithm Engineering, Cham: Springer International Publishing, 2016, pp. 81–116.

J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.

J. Blömer, “Turing und Kryptografie,” Informatik-Spektrum, vol. 35, no. 4, 2012.

J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous Credentials and Applications to Incentive Systems,”10.1145/3319535.3354223__presented at the 26th ACM Conference on Computer and Communications Security, London, 2019, doi:10.1145/3319535.3354223 .

J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, pp. 314–338, 2018.

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

J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.