Blömer, J., &; Kohn, K. (2015). Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn.
LibreCat: /record/233

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

Ackermann, M. R., Blömer, J., Kuntze, D., &; Sohler, C. (2014). Analysis of Agglomerative Clustering. Algorithmica, 69.https://doi.org/10.1007/s00453-012-9717-4 
LibreCat: /record/2976
DOI: 10.1007/s00453-012-9717-4

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

Blömer, J., &; Liske, G. (2014). Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. Universität Paderborn.
LibreCat: /record/442

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

Blömer, J., Günther, P., &; Liske, G. (2013). Improved Side Channel Attacks on Pairing Based Cryptography. In Constructive Side-Channel Analysis and Secure Design (pp. 154–168). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-40026-1_10 
LibreCat: /record/2979
DOI: 10.1007/978-3-642-40026-1_10

Blömer, J., Günther, P., &; Krummel, V. (2013). 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) (pp. 98–105).
LibreCat: /record/488

Blömer, J., &; Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.
LibreCat: /record/538

Blömer, J. (2012). Turing und Kryptografie. Informatik-Spektrum, 35(4).https://doi.org/10.1007/s00287-012-0622-7 
LibreCat: /record/2984
DOI: 10.1007/s00287-012-0622-7

Ackermann, M. R., Blömer, J., &; Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.
LibreCat: /record/2985

Blömer, J. (2011). How to Share a Secret. In Algorithms Unplugged (pp. 159–168). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-15328-0_17 
LibreCat: /record/2986
DOI: 10.1007/978-3-642-15328-0_17

Blömer, J., &; Naewe, S. (2011). Solving the Closest Vector Problem with respect to Lp Norms. ArXiv:1104.3720.
LibreCat: /record/2987

Ackermann, M. R., &; Blömer, J. (2010). Bregman Clustering for Separable Instances. In SWAT 2010 (pp. 212–223). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-13731-0_21 
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

Ackermann, M. R., Blömer, J., &; Sohler, C. (2010). Clustering for Metric and Nonmetric Distance Measures. ACM Trans. Algorithms, (4), 59:1--59:26.https://doi.org/10.1145/1824777.1824779 
LibreCat: /record/2990
DOI: 10.1145/1824777.1824779

Krueger, A., Leutnant, V., Haeb-Umbach, R., Ackermann, M., &; Blömer, J. (2010). On the initialization of dynamic models for speech features. Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany.
LibreCat: /record/2991

Schäfer, W., Trächtler, A., Birattari, M., Blömer, J., Dorigo, M., Engels, G.,https://doi.org/10.1145/1882362.1882428__Reif, W. (2010). Engineering self-coordinating software intensive systems. In Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10. ACM Press.https://doi.org/10.1145/1882362.1882428 
LibreCat: /record/2994
DOI: 10.1145/1882362.1882428

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 
LibreCat: /record/2995
DOI: 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 
LibreCat: /record/2999
DOI: 10.1016/j.tcs.2008.12.045

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 
LibreCat: /record/3002
DOI: 10.1007/978-3-540-77360-3_7