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

A Generalized Wiener Attack on RSA
J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.
LibreCat: /record/3012
DOI: 10.1007/978-3-540-24632-9_1

A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices
J. Blömer, J. Bobolz, L.A. Porzenheim, in: 2023.
LibreCat: /record/43458

A lower bound for a class of graph based loss resilient codes
J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science, ETH Zürich (1998).
LibreCat: /record/3028

A new CRT-RSA algorithm secure against bellcore attacks
J. Blömer, M. Otto, J.-P. Seifert, in: Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03, ACM Press, 2004.
LibreCat: /record/3017
DOI: 10.1145/948109.948151

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

A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers
J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162.
LibreCat: /record/3026
DOI: 10.1007/3-540-68530-8_13

A Theoretical Analysis of the Fuzzy K-Means Problem
J. Blömer, S. Brauer, K. Bujna, in: 2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–810.
LibreCat: /record/2367
DOI: 10.1109/icdm.2016.0094

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

A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267.
LibreCat: /record/3006
DOI: 10.1007/11426639_15

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

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

Algorithms for lattice problems with respect to general norms
S. Naewe, Algorithms for Lattice Problems with Respect to General Norms, Universität Paderborn, 2011.
LibreCat: /record/2910

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

An Approach for Determining Optimal Contrast in Visual Cryptography
J. Juhnke, H. Lefmann, V. Strehl, An Approach for Determining Optimal Contrast in Visual Cryptography, Fortschritt-Berichte VDI, 2013.
LibreCat: /record/2917

An XOR-based erasure-resilient coding scheme
J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, D. Zuckerman, An XOR-Based Erasure-Resilient Coding Scheme, Berkeley, USA, 1995.
LibreCat: /record/3038

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

Analysis of Countermeasures Against Access Driven Cache Attacks on AES
J. Blömer, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 96–109.
LibreCat: /record/3002
DOI: 10.1007/978-3-540-77360-3_7

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

Approximate matching of polygonal shapes
H. Alt, B. Behrends, J. Blömer, Annals of Mathematics and Artificial Intelligence 13 (1995).
LibreCat: /record/3037

Approximate matching of polygonal shapes (extended abstract)
H. Alt, B. Behrends, J. Blömer, in: Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91, ACM Press, 1991.
LibreCat: /record/3048
DOI: 10.1145/109648.109669

Approximation of convex polygons
H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.
LibreCat: /record/3050
DOI: 10.1007/bfb0032068

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

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

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

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

Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Cloud Architectures for Searchable Encryption
J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.
LibreCat: /record/2965
DOI: 10.1145/3230833.3230853

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

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

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

Computing sums of radicals in polynomial time
J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991.
LibreCat: /record/3049
DOI: 10.1109/sfcs.1991.185434

Computing sums of radicals in polynomial time
J. Blömer, in: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.
LibreCat: /record/3041
DOI: 10.1109/sfcs.1991.185434

Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.
LibreCat: /record/3015
DOI: 10.1007/978-3-540-28628-8_13

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

Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.
LibreCat: /record/208
DOI: 10.1007/978-3-319-29485-8_25

Coresets and Approximate Clustering for Bregman Divergences
M.R. Ackermann, J. Blömer, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009, pp. 1088–1097.
LibreCat: /record/2995
DOI: 10.1137/1.9781611973068.118

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

Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 242–256.
LibreCat: /record/3019
DOI: 10.1007/3-540-45708-9_16

Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes
J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (2021).
LibreCat: /record/26645

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

Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures
J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography &; Network Security, n.d.
LibreCat: /record/2379
DOI: 10.1007/978-3-319-93387-0_12

Denesting by bounded degree radicals
J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Denesting by Bounded Degree Radicals
J. Blömer, Algorithmica 28 (2002) 2–15.
LibreCat: /record/35857
DOI: 10.1007/s004530010028

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

Dimension Reduction Methods for Convolution Modular Lattices
A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125.
LibreCat: /record/3022
DOI: 10.1007/3-540-44670-2_10

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

Dynamic Searchable Encryption with Access Control
J. Blömer, N. Löken, in: 12th International Symposium on Foundations and Practice of Security, FPS 2019, Springer, 2019.
LibreCat: /record/13557

Efficient and Compact CCA Security from Partitioned IBKEM
J. Schrieb, (2010).
LibreCat: /record/2993

Effizienz und Sicherheit paarungsbasierter Kryptographie
J. Blömer, P. Günther, Effizienz Und Sicherheit Paarungsbasierter Kryptographie, Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
LibreCat: /record/2971