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

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

Voronoi Cells of Lattices with Respect to Arbitrary Norms
J. Blömer, K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms, Universität Paderborn, 2015.
LibreCat: /record/233

Tampering attacks in pairing-based cryptography
J. Blömer, P. Günther, G. Liske, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.
LibreCat: /record/355
DOI: 10.1109/FDTC.2014.10

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

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

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

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

Practical algorithms for clustering and modeling large data sets - Analysis and improvements
D. Kuntze, Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements, Universität Paderborn, 2013.
LibreCat: /record/2909

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

Improved Side Channel Attacks on Pairing Based Cryptography
J. Blömer, P. Günther, G. Liske, in: Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 154–168.
LibreCat: /record/2979
DOI: 10.1007/978-3-642-40026-1_10

Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study
J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.
LibreCat: /record/488

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

StreamKM++: A clustering algorithm for data streams
M.R. Ackermann, M. Märtens, C. Raupach, K. Swierkot, C. Lammersen, C. Sohler, 17 (2012).
LibreCat: /record/2982
DOI: 10.1145/2133803.2184450

Turing und Kryptografie
J. Blömer, Informatik-Spektrum 35 (2012).
LibreCat: /record/2984
DOI: 10.1007/s00287-012-0622-7

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

Hardness and Non-Approximability of Bregman Clustering Problems.
M.R. Ackermann, J. Blömer, C. Scholz, (2011).
LibreCat: /record/2985

How to Share a Secret
J. Blömer, in: Algorithms Unplugged, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 159–168.
LibreCat: /record/2986
DOI: 10.1007/978-3-642-15328-0_17

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

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