Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

109 Publications


2015 | Conference Paper | LibreCat-ID: 253
J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed Traceability,” in Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.
LibreCat | Files available | DOI
 

2015 | Conference Paper | LibreCat-ID: 322 | OA
J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.
LibreCat | Files available | DOI | Download (ext.)
 

2015 | Report | LibreCat-ID: 233 | OA
J. Blömer and K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.
LibreCat | Files available | Download (ext.)
 

2014 | Conference Paper | LibreCat-ID: 355
J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,” in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.
LibreCat | Files available | DOI
 

2014 | Journal Article | LibreCat-ID: 2976
M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler, “Analysis of Agglomerative Clustering,” Algorithmica, vol. 69, 2014.
LibreCat | DOI
 

2014 | Conference Paper | LibreCat-ID: 2977
J. Blömer, K. Bujna, and D. Kuntze, “A Theoretical and Experimental Comparison of the EM and SEM Algorithm,” in 2014 22nd International Conference on Pattern Recognition, 2014.
LibreCat | DOI
 

2014 | Preprint | LibreCat-ID: 442 | OA
J. Blömer and G. Liske, “Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions.” Universität Paderborn, 2014.
LibreCat | Files available | Download (ext.)
 

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

2013 | Dissertation | LibreCat-ID: 2909
D. Kuntze, Practical algorithms for clustering and modeling large data sets - Analysis and improvements. Universität Paderborn, 2013.
LibreCat | Download (ext.)
 

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

2013 | Book Chapter | LibreCat-ID: 2979
J. Blömer, P. Günther, and G. Liske, “Improved Side Channel Attacks on Pairing Based Cryptography,” in Constructive Side-Channel Analysis and Secure Design, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 154–168.
LibreCat | DOI
 

2013 | Conference Paper | LibreCat-ID: 488
J. Blömer, P. Günther, and V. Krummel, “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), 2013, pp. 98–105.
LibreCat | Files available
 

2013 | Preprint | LibreCat-ID: 538 | OA
J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.
LibreCat | Files available | Download (ext.)
 

2012 | Conference Paper | LibreCat-ID: 2982
M. R. Ackermann, M. Märtens, C. Raupach, K. Swierkot, C. Lammersen, and C. Sohler, “StreamKM++: A clustering algorithm for data streams,” vol. 17. ACM, New York, NY, USA, 2012.
LibreCat | DOI
 

2012 | Journal Article | LibreCat-ID: 2984
J. Blömer, “Turing und Kryptografie,” Informatik-Spektrum, vol. 35, no. 4, 2012.
LibreCat | DOI
 

2011 | Dissertation | LibreCat-ID: 2910
S. Naewe, Algorithms for lattice problems with respect to general norms. Universität Paderborn, 2011.
LibreCat | Download (ext.)
 

2011 | Conference Paper | LibreCat-ID: 2985
M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability of Bregman Clustering Problems.” 2011.
LibreCat
 

2011 | Book Chapter | LibreCat-ID: 2986
J. Blömer, “How to Share a Secret,” in Algorithms Unplugged, Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.
LibreCat | DOI
 

2011 | Preprint | LibreCat-ID: 2987
J. Blömer and S. Naewe, “Solving the Closest Vector Problem with respect to Lp Norms,” arXiv:1104.3720. 2011.
LibreCat
 

2010 | Book Chapter | LibreCat-ID: 2988
M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,” in SWAT 2010, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 212–223.
LibreCat | DOI
 

Filters and Search Terms

(department=64) AND (type=book OR type=book_editor OR type=book_chapter OR type=publicationtype_review OR type=conference_abstract OR type=conference_editor OR type=conference OR type=dissertation OR type=encyclopedia_article OR type=journal_article OR type=journal_editor OR type=newspaper_article OR type=patent OR type=preprint OR type=report OR type=translation OR type=translation_chapter OR type=working_paper OR type=research_data)

status=public

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed