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.

230 Publications


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

2013 | Bachelorsthesis | LibreCat-ID: 553
K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.
LibreCat
 

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
 

2012 | Bachelorsthesis | LibreCat-ID: 606
N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012.
LibreCat
 

2012 | Bachelorsthesis | LibreCat-ID: 607
T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.
LibreCat
 

2012 | Bachelorsthesis | LibreCat-ID: 629
P. Schleiter, Attribute-basierte Verschlüsselung. Universität Paderborn, 2012.
LibreCat
 

2011 | Bachelorsthesis | LibreCat-ID: 2872
T. Böttger, Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen. 2011.
LibreCat | Files available
 

2011 | Mastersthesis | LibreCat-ID: 2902
M. Märtens, The Monotone Complexity of Computing k-Clique on Random Graphs. 2011.
LibreCat
 

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 | Mastersthesis | LibreCat-ID: 659
G. Liske, Fault attacks in pairing-based cryptography. Universität Paderborn, 2011.
LibreCat | Files available
 

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
 

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

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
 

2010 | Journal Article | LibreCat-ID: 2990
M. R. Ackermann, J. Blömer, and C. Sohler, “Clustering for Metric and Nonmetric Distance Measures,” ACM Trans. Algorithms, no. 4, pp. 59:1--59:26, 2010.
LibreCat | DOI
 

2010 | Journal Article | LibreCat-ID: 2991
A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, and J. Blömer, “On the initialization of dynamic models for speech features,” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat
 

2010 | Conference Paper | LibreCat-ID: 2993
J. Schrieb, “Efficient and Compact CCA Security from Partitioned IBKEM.” 2010.
LibreCat
 

2010 | Conference Paper | LibreCat-ID: 2994
W. Schäfer et al., “Engineering self-coordinating software intensive systems,” in Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10, 2010.
LibreCat | DOI
 

2010 | Misc | LibreCat-ID: 47684 | OA
T. Postler, Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung. 2010.
LibreCat | Files available
 

Filters and Search Terms

department=64

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed