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., &; May, A. (2004). A Generalized Wiener Attack on RSA. In Public Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-24632-9_1 

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., &; Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. Technical Report/Departement of Computer Science, ETH Zürich.

Blömer, J., Otto, M., &; Seifert, J.-P. (2004). A new CRT-RSA algorithm secure against bellcore attacks. In Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03. ACM Press.https://doi.org/10.1145/948109.948151 

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. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-68530-8_13 

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., 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., &; May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/11426639_15 

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., &; 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 

Naewe, S. (2011). Algorithms for lattice problems with respect to general norms. Universität Paderborn.

Ackermann, M. R. (2009). Algorithms for the Bregman k-Median Problem. Universität Paderborn.

Juhnke, J., Lefmann, H., &; Strehl, V. (2013). An Approach for Determining Optimal Contrast in Visual Cryptography. Fortschritt-Berichte VDI.

Blömer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., &; Zuckerman, D. (1995). An XOR-based erasure-resilient coding scheme. Berkeley, USA.

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., &; 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 

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 

Alt, H., Behrends, B., &; Blömer, J. (1995). Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence, 13(3).

Alt, H., Behrends, B., &; Blömer, J. (1991). Approximate matching of polygonal shapes (extended abstract). In Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91. ACM Press.https://doi.org/10.1145/109648.109669 

Alt, H., Blömer, J., &; Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag.https://doi.org/10.1007/bfb0032068 

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 

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 

Liske, G. (2017). CCA-Security for Predicate Encryption Schemes. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-220 

Brauer, S. (2019). Classification and Approximation of Geometric Location Problems. Paderborn.https://doi.org/10.17619/UNIPB/1-816 

Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-45022-x_22 

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 

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 

Brauer, S. (2019). Complexity of single-swap heuristics for metric facility location and related problems. Theoretical Computer Science, 754, 88–106.https://doi.org/10.1016/j.tcs.2018.04.048 

Brauer, S. (2017). Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems. In D. Fotakis, A. Pagourtzis, &; V. T. Paschos (Eds.), Lecture Notes in Computer Science (Vol. 10236, pp. 116–127). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-57586-5_11 

Blömer, J. (1991). Computing sums of radicals in polynomial time. In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press.https://doi.org/10.1109/sfcs.1991.185434 

Blömer, J. (2002). Computing sums of radicals in polynomial time. [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.https://doi.org/10.1109/sfcs.1991.185434 

May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In Advances in Cryptology – CRYPTO 2004 (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-540-28628-8_13 

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., &; 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 

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

May, A. (2007). Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In Advances in Cryptology — CRYPTO 2002 (pp. 242–256). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-45708-9_16 

Bobolz, J., Eidens, F., Heitjohann, R., &; Fell, J. (2021). Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. IACR eprint.

Löken, N. (2020). Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work.https://doi.org/10.17619/UNIPB/1-854 

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. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-63397-9_5 

Blömer, J. (2002). Denesting by Bounded Degree Radicals. Algorithmica, 28(1), 2–15.https://doi.org/10.1007/s004530010028 

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.

May, A., &; Silverman, J. H. (2007). Dimension Reduction Methods for Convolution Modular Lattices. In Lecture Notes in Computer Science (pp. 110–125). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-44670-2_10 

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

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.

Schrieb, J. (2010). Efficient and Compact CCA Security from Partitioned IBKEM.

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