Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical Study of Fuzzy K-Means.”https://doi.org/10.1145/3409385__ACM Transactions on Algorithms 16, no. 4 (2020): 1–25.https://doi.org/10.1145/3409385 .
LibreCat: /record/20888
DOI: 10.1145/3409385

Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”https://doi.org/10.1007/978-3-540-24632-9_1__In Public Key Cryptography – PKC 2004, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-24632-9_1 .
LibreCat: /record/3012
DOI: 10.1007/978-3-540-24632-9_1

Blömer, Johannes, Jan Bobolz, and Laurens Alexander Porzenheim. “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” 2023.
LibreCat: /record/43458

Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” Technical Report/Departement of Computer Science, ETH Zürich, 1998.
LibreCat: /record/3028

Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.”https://doi.org/10.1145/948109.948151__In Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03. ACM Press, 2004.https://doi.org/10.1145/948109.948151 .
LibreCat: /record/3017
DOI: 10.1145/948109.948151

Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer, and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.”https://doi.org/10.1109/FDTC.2014.22__In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 123--136, 2014.https://doi.org/10.1109/FDTC.2014.22 .
LibreCat: /record/463
DOI: 10.1109/FDTC.2014.22

Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.”https://doi.org/10.1007/3-540-68530-8_13__In Algorithms — ESA’ 98, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-68530-8_13 .
LibreCat: /record/3026
DOI: 10.1007/3-540-68530-8_13

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis of the Fuzzy K-Means Problem.”https://doi.org/10.1109/icdm.2016.0094__In 2016 IEEE 16th International Conference on Data Mining (ICDM), 805–10. IEEE, 2016.https://doi.org/10.1109/icdm.2016.0094 .
LibreCat: /record/2367
DOI: 10.1109/icdm.2016.0094

Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.”https://doi.org/10.1109/icpr.2014.253__In 2014 22nd International Conference on Pattern Recognition. IEEE, 2014.https://doi.org/10.1109/icpr.2014.253 .
LibreCat: /record/2977
DOI: 10.1109/icpr.2014.253

Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.”https://doi.org/10.1007/11426639_15__In EUROCRYPT 2005, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005.https://doi.org/10.1007/11426639_15 .
LibreCat: /record/3006
DOI: 10.1007/11426639_15

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”https://doi.org/10.1007/978-3-319-31750-2_24__In Advances in Knowledge Discovery and Data Mining, 296–308. Cham: Springer International Publishing, 2016.https://doi.org/10.1007/978-3-319-31750-2_24 .
LibreCat: /record/2970
DOI: 10.1007/978-3-319-31750-2_24

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”https://doi.org/10.1007/978-3-319-31750-2_24__In Advances in Knowledge Discovery and Data Mining, 296–308. Cham: Springer International Publishing, 2016.https://doi.org/10.1007/978-3-319-31750-2_24 .
LibreCat: /record/2978
DOI: 10.1007/978-3-319-31750-2_24

Naewe, Stefanie. Algorithms for Lattice Problems with Respect to General Norms. Universität Paderborn, 2011.
LibreCat: /record/2910

Ackermann, Marcel Rudolf. Algorithms for the Bregman K-Median Problem. Universität Paderborn, 2009.
LibreCat: /record/2911

Juhnke, Jakob, Hanno Lefmann, and Volker Strehl. An Approach for Determining Optimal Contrast in Visual Cryptography. Fortschritt-Berichte VDI, 2013.
LibreCat: /record/2917

Blömer, Johannes, Malik Kalfane, Richard Karp, Marek Karpinski, Michael Luby, and David Zuckerman. An XOR-Based Erasure-Resilient Coding Scheme. Technical Report, International Computer Science Institute. Berkeley, USA, 1995.
LibreCat: /record/3038

Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian Sohler. “Analysis of Agglomerative Clustering.”https://doi.org/10.1007/s00453-012-9717-4__Algorithmica 69 (2014).https://doi.org/10.1007/s00453-012-9717-4 .
LibreCat: /record/2976
DOI: 10.1007/s00453-012-9717-4

Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.”https://doi.org/10.1007/978-3-540-77360-3_7__In Selected Areas in Cryptography, 96–109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/978-3-540-77360-3_7 .
LibreCat: /record/3002
DOI: 10.1007/978-3-540-77360-3_7

Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.”https://doi.org/10.1007/978-3-662-47854-7_29__In Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 478--488. LNCS, 2015.https://doi.org/10.1007/978-3-662-47854-7_29 .
LibreCat: /record/322
DOI: 10.1007/978-3-662-47854-7_29

Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence 13, no. 3 (1995).
LibreCat: /record/3037

Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes (Extended Abstract).”https://doi.org/10.1145/109648.109669__In Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91. ACM Press, 1991.https://doi.org/10.1145/109648.109669 .
LibreCat: /record/3048
DOI: 10.1145/109648.109669

Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.”https://doi.org/10.1007/bfb0032068__In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990.https://doi.org/10.1007/bfb0032068 .
LibreCat: /record/3050
DOI: 10.1007/bfb0032068

Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.”https://doi.org/10.1007/978-3-319-75650-9_1__In Foundations and Practice of Security, 3–17. Cham: Springer International Publishing, 2017.https://doi.org/10.1007/978-3-319-75650-9_1 .
LibreCat: /record/2344
DOI: 10.1007/978-3-319-75650-9_1

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”https://doi.org/10.1007/978-3-642-13731-0_21__In SWAT 2010, 212–23. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.https://doi.org/10.1007/978-3-642-13731-0_21 .
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

Liske, Gennadij. CCA-Security for Predicate Encryption Schemes. Universität Paderborn, 2017.https://doi.org/10.17619/UNIPB/1-220 .
LibreCat: /record/116
DOI: 10.17619/UNIPB/1-220

Brauer, Sascha. Classification and Approximation of Geometric Location Problems. Paderborn, 2019.https://doi.org/10.17619/UNIPB/1-816 .
LibreCat: /record/13679
DOI: 10.17619/UNIPB/1-816

Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.”https://doi.org/10.1007/3-540-45022-x_22__In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000.https://doi.org/10.1007/3-540-45022-x_22 .
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.”https://doi.org/10.1145/3230833.3230853__In Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, 25:1--25:10. New York, NY, USA: ACM, n.d.https://doi.org/10.1145/3230833.3230853 .
LibreCat: /record/2965
DOI: 10.1145/3230833.3230853

Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering for Metric and Nonmetric Distance Measures.”https://doi.org/10.1145/1824777.1824779__ACM Trans. Algorithms, no. 4 (2010): 59:1--59:26.https://doi.org/10.1145/1824777.1824779 .
LibreCat: /record/2990
DOI: 10.1145/1824777.1824779

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”https://doi.org/10.1016/j.tcs.2018.04.048__Theoretical Computer Science 754 (2019): 88–106.https://doi.org/10.1016/j.tcs.2018.04.048 .
LibreCat: /record/2916
DOI: 10.1016/j.tcs.2018.04.048

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”https://doi.org/10.1007/978-3-319-57586-5_11__In Lecture Notes in Computer Science, edited by Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, 10236:116–27. Cham: Springer International Publishing, 2017.https://doi.org/10.1007/978-3-319-57586-5_11 .
LibreCat: /record/2381
DOI: 10.1007/978-3-319-57586-5_11

Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.”https://doi.org/10.1109/sfcs.1991.185434__In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 1991.https://doi.org/10.1109/sfcs.1991.185434 .
LibreCat: /record/3049
DOI: 10.1109/sfcs.1991.185434

Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.”https://doi.org/10.1109/sfcs.1991.185434__In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 2002.https://doi.org/10.1109/sfcs.1991.185434 .
LibreCat: /record/3041
DOI: 10.1109/sfcs.1991.185434

May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.”https://doi.org/10.1007/978-3-540-28628-8_13__In Advances in Cryptology – CRYPTO 2004, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-28628-8_13 .
LibreCat: /record/3015
DOI: 10.1007/978-3-540-28628-8_13

Blömer, Johannes, and Gennadij Liske. “Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.” Universität Paderborn, 2014.
LibreCat: /record/442

Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.”https://doi.org/10.1007/978-3-319-29485-8_25__In Proceedings of the CT-RSA 2016, 431–47. LNCS, 2016.https://doi.org/10.1007/978-3-319-29485-8_25 .
LibreCat: /record/208
DOI: 10.1007/978-3-319-29485-8_25

Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.”https://doi.org/10.1137/1.9781611973068.118__In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 1088–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009.https://doi.org/10.1137/1.9781611973068.118 .
LibreCat: /record/2995
DOI: 10.1137/1.9781611973068.118

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy K-Means with Applications.”https://doi.org/10.4230/LIPIcs.ISAAC.2018.46__In 29th International Symposium on Algorithms and Computation  (ISAAC 2018), 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.https://doi.org/10.4230/LIPIcs.ISAAC.2018.46 .
LibreCat: /record/4344
DOI: 10.4230/LIPIcs.ISAAC.2018.46

May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”https://doi.org/10.1007/3-540-45708-9_16__In Advances in Cryptology — CRYPTO 2002, 242–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-45708-9_16 .
LibreCat: /record/3019
DOI: 10.1007/3-540-45708-9_16

Bobolz, Jan, Fabian Eidens, Raphael Heitjohann, and Jeremy Fell. “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.
LibreCat: /record/26645

Löken, Nils. Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work, 2020.https://doi.org/10.17619/UNIPB/1-854 .
LibreCat: /record/15482
DOI: 10.17619/UNIPB/1-854

Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.”https://doi.org/10.1007/978-3-319-93387-0_12__In ACNS 2018 Applied Cryptography &; Network Security. LNCS, n.d.https://doi.org/10.1007/978-3-319-93387-0_12 .
LibreCat: /record/2379
DOI: 10.1007/978-3-319-93387-0_12

Blömer, Johannes. “Denesting by Bounded Degree Radicals.”https://doi.org/10.1007/3-540-63397-9_5__In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997.https://doi.org/10.1007/3-540-63397-9_5 .
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Blömer, J. “Denesting by Bounded Degree Radicals.”https://doi.org/10.1007/s004530010028__Algorithmica 28, no. 1 (2002): 2–15.https://doi.org/10.1007/s004530010028 .
LibreCat: /record/35857
DOI: 10.1007/s004530010028

Hemmrich, Simon, Jan Bobolz, Daniel Beverungen, and Johannes Blömer. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” In ECIS 2023 Research Papers, 2023.
LibreCat: /record/44855

May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.”https://doi.org/10.1007/3-540-44670-2_10__In Lecture Notes in Computer Science, 110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-44670-2_10 .
LibreCat: /record/3022
DOI: 10.1007/3-540-44670-2_10

Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.
LibreCat: /record/538

Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” In 12th International Symposium on Foundations and Practice of Security, FPS 2019, Vol. 12056. LNCS. Springer, 2019.
LibreCat: /record/13557

Schrieb, Jonas. “Efficient and Compact CCA Security from Partitioned IBKEM.” Proceedings of the 3rd Western European Workshop on Research in Cryptology, 2010.
LibreCat: /record/2993

Blömer, Johannes, and Peter Günther. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
LibreCat: /record/2971