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

Blömer, J., Bobolz, J., Eidens, F., Jager, T., &; Kramer, P. (2023). Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &; H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 237–246). Heinz Nixdorf Institut, Universität Paderborn.https://doi.org/10.5281/zenodo.8068755 

Blömer, J., Eidens, F., Jager, T., Niehues, D., &; Scheideler, C. (2023). Robustness and Security. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &; H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 145–164). Heinz Nixdorf Institut, Universität Paderborn.https://doi.org/10.5281/zenodo.8068629 

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

Blömer, J., Bobolz, J., &; Porzenheim, L. A. (2023). A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. Asiacrypt 2023, Guangzhou, China.

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

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

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

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

Blömer, J., Bobolz, J., Diemert, D. P., &; Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. 26th ACM Conference on Computer and Communications Security, London.https://doi.org/10.1145/3319535.3354223 

Blömer, J., Eidens, F., &; Juhnke, J. (2018). 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 (pp. 470–490). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-76953-0_25 

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

Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F.,https://doi.org/10.1145/3230833.3234517__Stienemeier, M. (n.d.). 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.https://doi.org/10.1145/3230833.3234517 

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

Blömer, J., Bobolz, J., Scheideler, C., &; Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.

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

Blömer, J., Eidens, F., &; Juhnke, J. (2018). Enhanced Security of Attribute-Based Signatures. The International Conference on Cryptology And Network Security (CANS), 11124, 235–255.https://doi.org/10.1007/978-3-030-00434-7_12 

Blömer, J., &; Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. ACNS 2018 Applied Cryptography &; Network Security. The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium.https://doi.org/10.1007/978-3-319-93387-0_12 

Blömer, J., &; Liske, G. (2017). 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, pp. 438–453). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-72453-9_35 

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

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

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

Blömer, J., Brauer, S., &; Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository.

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

Blömer, J., &; Günther, P. (2016). Effizienz und Sicherheit paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops.

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

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

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

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

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

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

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 

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 

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 

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.

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 

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 

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).

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

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

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

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 

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

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 

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 

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.

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 

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 

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 

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