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

Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption. Universität Paderborn, 2015.
LibreCat: /record/326

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

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

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

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

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

Kohn, Kathlén. Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.
LibreCat: /record/273

Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.
LibreCat: /record/233

Biermeier, Felix. Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen Bezüglich Den Komplexitätsklassen L Und SL, 2014.
LibreCat: /record/2866

Sauer, Malte. Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen, 2014.
LibreCat: /record/2867

Blömer, Johannes, Peter Günther, and Gennadij Liske. “Tampering Attacks in Pairing-Based Cryptography.”https://doi.org/10.1109/FDTC.2014.10__In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 1--7, 2014.https://doi.org/10.1109/FDTC.2014.10 .
LibreCat: /record/355
DOI: 10.1109/FDTC.2014.10

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

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

Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian Sohler. “Analysis of Agglomerative Clustering.”https://doi.org/10.1007/s00453-012-9717-4__Algorithmica 69 (2014).https://doi.org/10.1007/s00453-012-9717-4 .
LibreCat: /record/2976
DOI: 10.1007/s00453-012-9717-4

Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.”https://doi.org/10.1109/icpr.2014.253__In 2014 22nd International Conference on Pattern Recognition. IEEE, 2014.https://doi.org/10.1109/icpr.2014.253 .
LibreCat: /record/2977
DOI: 10.1109/icpr.2014.253

Blömer, Johannes, and Gennadij Liske. “Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.” Universität Paderborn, 2014.
LibreCat: /record/442

Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer, and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.”https://doi.org/10.1109/FDTC.2014.22__In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 123--136, 2014.https://doi.org/10.1109/FDTC.2014.22 .
LibreCat: /record/463
DOI: 10.1109/FDTC.2014.22

Jochheim, Janek. Hiding Software Components Using Functional Encryption. Universität Paderborn, 2014.
LibreCat: /record/414

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

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

Laudemann, Stefan. Themenmodellierung Zur Identifikation Und Gruppierung von Spam-Webseiten, 2013.
LibreCat: /record/2868

Leder, Lennart. Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering Unter Verwendung von L_p-Metriken, 2013.
LibreCat: /record/2869

Kuntze, Daniel. Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements. Universität Paderborn, 2013.
LibreCat: /record/2909

Juhnke, Jakob, Hanno Lefmann, and Volker Strehl. An Approach for Determining Optimal Contrast in Visual Cryptography. Fortschritt-Berichte VDI, 2013.
LibreCat: /record/2917

Blömer, Johannes, Peter Günther, and Gennadij Liske. “Improved Side Channel Attacks on Pairing Based Cryptography.”https://doi.org/10.1007/978-3-642-40026-1_10__In Constructive Side-Channel Analysis and Secure Design, 154–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.https://doi.org/10.1007/978-3-642-40026-1_10 .
LibreCat: /record/2979
DOI: 10.1007/978-3-642-40026-1_10

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

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

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

Blömer, Johannes, Peter Günther, and Volker 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), 98–105, 2013.
LibreCat: /record/488

Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.
LibreCat: /record/538

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

Ackermann, Marcel Rudolf, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, and Christian Sohler. “StreamKM++: A Clustering Algorithm for Data Streams.”https://doi.org/10.1145/2133803.2184450__ACM Journal of Experimental Algorithmics. New York, NY, USA: ACM, 2012.https://doi.org/10.1145/2133803.2184450 .
LibreCat: /record/2982
DOI: 10.1145/2133803.2184450

Blömer, Johannes. “Turing Und Kryptografie.”https://doi.org/10.1007/s00287-012-0622-7__Informatik-Spektrum 35, no. 4 (2012).https://doi.org/10.1007/s00287-012-0622-7 .
LibreCat: /record/2984
DOI: 10.1007/s00287-012-0622-7

Löken, Nils. 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: /record/606

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

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

Böttger, Timm. Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen, 2011.
LibreCat: /record/2872

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

Naewe, Stefanie. Algorithms for Lattice Problems with Respect to General Norms. Universität Paderborn, 2011.
LibreCat: /record/2910

Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011.
LibreCat: /record/2985

Blömer, Johannes. “How to Share a Secret.”https://doi.org/10.1007/978-3-642-15328-0_17__In Algorithms Unplugged, 159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.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, Johannes, and Stefanie Naewe. “Solving the Closest Vector Problem with Respect to Lp Norms.” ArXiv:1104.3720, 2011.
LibreCat: /record/2987

Liske, Gennadij. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn, 2011.
LibreCat: /record/659

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”https://doi.org/10.1007/978-3-642-13731-0_21__In SWAT 2010, 212–23. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.https://doi.org/10.1007/978-3-642-13731-0_21 .
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering for Metric and Nonmetric Distance Measures.”https://doi.org/10.1145/1824777.1824779__ACM Trans. Algorithms, no. 4 (2010): 59:1--59:26.https://doi.org/10.1145/1824777.1824779 .
LibreCat: /record/2990
DOI: 10.1145/1824777.1824779

Krueger, Alexander, Volker Leutnant, Reinhold Haeb-Umbach, Marcel Ackermann, and Johannes Blömer. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat: /record/2991

Schrieb, Jonas. “Efficient and Compact CCA Security from Partitioned IBKEM.” Proceedings of the 3rd Western European Workshop on Research in Cryptology, 2010.
LibreCat: /record/2993

Schäfer, Wilhelm, Ansgar Trächtler, Mauro Birattari, Johannes Blömer, Marco Dorigo, Gregor Engels, Rehan O’Grady, Marco Platzner, Franz Rammig, and Wolfgang Reif. “Engineering Self-Coordinating Software Intensive Systems.”https://doi.org/10.1145/1882362.1882428__In Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10. ACM Press, 2010.https://doi.org/10.1145/1882362.1882428 .
LibreCat: /record/2994
DOI: 10.1145/1882362.1882428

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