Löken, N. (2015). A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption. Universität Paderborn.
LibreCat: /record/325

Heihoff, F. (2015). A group signature scheme based on the LSRW assumption. Universität Paderborn.
LibreCat: /record/326

Sosniak, M. (2015). Evaluation of Pairing Optimization for Embedded Platforms. Universität Paderborn.
LibreCat: /record/297

Gerken, B. (2015). Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie. Universität Paderborn.
LibreCat: /record/299

Bobolz, J. (2015). Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn.
LibreCat: /record/301

Stroh, C. (2015). Efficient Attributes for Pairing-Based Anonymous Credentials. Universität Paderborn.
LibreCat: /record/302

Schleiter, P. (2015). Constructions of Fully Secure Predicate Encryption Schemes. Universität Paderborn.
LibreCat: /record/312

Kohn, K. (2015). Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms. Universität Paderborn.
LibreCat: /record/273

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

Biermeier, F. (2014). Untersuchung des Erreichbarkeitsproblems in ungerichteten Graphen bezüglich den Komplexitätsklassen L und SL.
LibreCat: /record/2866

Sauer, M. (2014). Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen.
LibreCat: /record/2867

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

Rath, T. (2014). RSA-Full Domain Hash Revisited. Universität Paderborn.
LibreCat: /record/369

Brauer, S. (2014). A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures.
LibreCat: /record/2900

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

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

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

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

Jochheim, J. (2014). Hiding software components using functional encryption. Universität Paderborn.
LibreCat: /record/414

Bemmann, P. (2014). Group Signature Schemes with Strong Exculpability. Universität Paderborn.
LibreCat: /record/416

Lippert, J. (2014). Fujisaki-Okamoto Transformation. Universität Paderborn.
LibreCat: /record/421

Laudemann, S. (2013). Themenmodellierung zur Identifikation und Gruppierung von Spam-Webseiten.
LibreCat: /record/2868

Leder, L. (2013). Nichtapproximierbarkeitsresultate zu Radius- und Durchmesserclustering unter Verwendung von L_p-Metriken.
LibreCat: /record/2869

Kuntze, D. (2013). Practical algorithms for clustering and modeling large data sets - Analysis and improvements. Universität Paderborn.
LibreCat: /record/2909

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

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

Tezer, A. (2013). Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn.
LibreCat: /record/471

Otte, O. (2013). Seitenkanalresistenz paarungsbasierter Kryptographie. Universität Paderborn.
LibreCat: /record/486

Bobolz, J. (2013). Security Proofs for Pairing-Based Cryptography in the Generic Group Model. Universität Paderborn.
LibreCat: /record/487

Blömer, J., Günther, P., &; Krummel, V. (2013). 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) (pp. 98–105).
LibreCat: /record/488

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

Kohn, K. (2013). Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn.
LibreCat: /record/553

Ackermann, M. R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., &; Sohler, C. (2012). StreamKM++: A clustering algorithm for data streams. New York, NY, USA: ACM.https://doi.org/10.1145/2133803.2184450 
LibreCat: /record/2982
DOI: 10.1145/2133803.2184450

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

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

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

Schleiter, P. (2012). Attribute-basierte Verschlüsselung. Universität Paderborn.
LibreCat: /record/629

Böttger, T. (2011). Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen.
LibreCat: /record/2872

Märtens, M. (2011). The Monotone Complexity of Computing k-Clique on Random Graphs.
LibreCat: /record/2902

Naewe, S. (2011). Algorithms for lattice problems with respect to general norms. Universität Paderborn.
LibreCat: /record/2910

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

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

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

Liske, G. (2011). Fault attacks in pairing-based cryptography. Universität Paderborn.
LibreCat: /record/659

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

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

Krueger, A., Leutnant, V., Haeb-Umbach, R., Ackermann, M., &; Blömer, J. (2010). On the initialization of dynamic models for speech features. Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany.
LibreCat: /record/2991

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

Schäfer, W., Trächtler, A., Birattari, M., Blömer, J., Dorigo, M., Engels, G.,https://doi.org/10.1145/1882362.1882428__Reif, W. (2010). Engineering self-coordinating software intensive systems. In Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10. ACM Press.https://doi.org/10.1145/1882362.1882428 
LibreCat: /record/2994
DOI: 10.1145/1882362.1882428

Postler, T. (2010). Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung.
LibreCat: /record/47684