Hemmrich S, Bobolz J, Beverungen D, Blömer J. Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. In: ECIS 2023 Research Papers. ; 2023.

Blömer J, Bobolz J, Eidens F, Jager T, Kramer P. Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:237-246. doi:10.5281/zenodo.8068755

Blömer J, Eidens F, Jager T, Niehues D, Scheideler C. Robustness and Security. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:145-164. doi:10.5281/zenodo.8068629

Blömer J, Bobolz J, Bröcher H. On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. In: ; 2023.

Blömer J, Bobolz J, Porzenheim LA. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. In: ; 2023.

Blömer J, Brauer S, Bujna K. A Complexity Theoretical Study of Fuzzy K-Means. ACM Transactions on Algorithms. 2020;16(4):1-25. doi:10.1145/3409385

Blömer J, Brauer S, Bujna K, Kuntze D. How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. Advances in Data Analysis and Classification. 2020;14:147–173. doi:10.1007/s11634-019-00366-7

Blömer J, Löken N. Personal Cross-Platform Reputation. In: Security and Trust Management, STM 2019. Vol 11738. LNCS. ; 2019. doi:10.1007/978-3-030-31511-5_9

Blömer J, Löken N. Dynamic Searchable Encryption with Access Control. In: 12th International Symposium on Foundations and Practice of Security, FPS 2019. Vol 12056. LNCS. Springer; 2019.

Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials and Applications to Incentive Systems. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. ; 2019. doi:10.1145/3319535.3354223

Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: Topics in Cryptology - CT-RSA 2018 - The Cryptographers’ Track at the RSA Conference 2018, Proceedings. Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25

Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. SIAM Journal on Applied Algebra and Geometry. 2018;2(2):314-338. doi:10.1137/17M1132045

Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM. doi:10.1145/3230833.3234517

Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018. New York, NY, USA: ACM; :25:1--25:10. doi:10.1145/3230833.3230853

Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication Based on Trusted Execution Environments.

Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications. In: 29th International Symposium on Algorithms and Computation  (ISAAC 2018). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:10.4230/LIPIcs.ISAAC.2018.46

Blömer J, Eidens F, Juhnke J. Enhanced Security of Attribute-Based Signatures. In: The International Conference on Cryptology And Network Security (CANS). Vol 11124. Lecture Notes in Computer Science. Springer; 2018:235-255. doi:10.1007/978-3-030-00434-7_12

Blömer J, Bobolz J. Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. In: ACNS 2018 Applied Cryptography &; Network Security. LNCS. doi:10.1007/978-3-319-93387-0_12

Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption with Public Index. In: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS). Vol 10693. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:10.1007/978-3-319-72453-9_35

Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In: Foundations and Practice of Security. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-75650-9_1

Blömer J, Günther P. Singular Curve Point Decompression Attack. In: 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE; 2016. doi:10.1109/fdtc.2015.17

Blömer J, Lammersen C, Schmidt M, Sohler C. Theoretical Analysis of the k-Means Algorithm – A Survey. In: Algorithm Engineering. Cham: Springer International Publishing; 2016:81-116. doi:10.1007/978-3-319-49487-6_3

Blömer J, Brauer S, Bujna K. Hard-Clustering with Gaussian Mixture Models. 2016.

Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances in Knowledge Discovery and Data Mining. Cham: Springer International Publishing; 2016:296-308. doi:10.1007/978-3-319-31750-2_24

Blömer J, Günther P. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops; 2016.

Blömer J, Brauer S, Bujna K. A Theoretical Analysis of the Fuzzy K-Means Problem. In: 2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE; 2016:805-810. doi:10.1109/icdm.2016.0094

Blömer J, Liske G. Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In: Proceedings of the CT-RSA 2016. LNCS. ; 2016:431-447. doi:10.1007/978-3-319-29485-8_25

Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances in Knowledge Discovery and Data Mining. Springer International Publishing; 2016:296-308. doi:10.1007/978-3-319-31750-2_24

Blömer J, Juhnke J, Löken N. Short Group Signatures with Distributed Traceability. In: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS). LNCS. ; 2015:166-180. doi:10.1007/978-3-319-32859-1_14

Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems. In: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC). LNCS. ; 2015:478--488. doi:10.1007/978-3-662-47854-7_29

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