Bröcher H. Rational Secure Multiparty Computation. Universität Paderborn; 2019.

Porzenheim LA. Post-Quantum Secure Group Signatures.; 2019.

Blömer J, Löken N. Personal Cross-Platform Reputation. In: Security and Trust Management, STM 2019. Vol 11738. LNCS. ; 2019. doi:10.1007/978-3-030-31511-5_9

Blömer J, Löken N. Dynamic Searchable Encryption with Access Control. In: 12th International Symposium on Foundations and Practice of Security, FPS 2019. Vol 12056. LNCS. Springer; 2019.

Pilot M. Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java. Universität Paderborn; 2019.

Scholz S. Implementation and Comparison of Elliptic Curve Algorithms in Java. Universität Paderborn; 2019.

Brauer S. Classification and Approximation of Geometric Location Problems. Paderborn; 2019. doi:10.17619/UNIPB/1-816

Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials and Applications to Incentive Systems. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. ; 2019. doi:10.1145/3319535.3354223

Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: Topics in Cryptology - CT-RSA 2018 - The Cryptographers’ Track at the RSA Conference 2018, Proceedings. Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25

Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. SIAM Journal on Applied Algebra and Geometry. 2018;2(2):314-338. doi:10.1137/17M1132045

Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM. doi:10.1145/3230833.3234517

Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018. New York, NY, USA: ACM; :25:1--25:10. doi:10.1145/3230833.3230853

Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication Based on Trusted Execution Environments.

Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications. In: 29th International Symposium on Algorithms and Computation  (ISAAC 2018). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:10.4230/LIPIcs.ISAAC.2018.46

von Heißen O. Implementierung und Analyse von Searchable Encryption.; 2018.

Juhnke J. Models and Constructions for Secure Reputation Systems. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-570

Blömer J, Eidens F, Juhnke J. Enhanced Security of Attribute-Based Signatures. In: The International Conference on Cryptology And Network Security (CANS). Vol 11124. Lecture Notes in Computer Science. Springer; 2018:235-255. doi:10.1007/978-3-030-00434-7_12

Blömer J, Bobolz J. Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. In: ACNS 2018 Applied Cryptography &; Network Security. LNCS. doi:10.1007/978-3-319-93387-0_12

Bujna K. Soft Clustering Algorithms - Theoretical and Practical Improvements. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-226

Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption with Public Index. In: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS). Vol 10693. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:10.1007/978-3-319-72453-9_35

Liske G. CCA-Security for Predicate Encryption Schemes. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-220

Löken N. Searchable Encryption with Access Control. In: Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17. ICPS. ACM Press; 2017. doi:10.1145/3098954.3098987

Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In: Foundations and Practice of Security. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-75650-9_1

Brauer S. Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems. In: Fotakis D, Pagourtzis A, Paschos VT, eds. Lecture Notes in Computer Science. Vol 10236. Cham: Springer International Publishing; 2017:116-127. doi:10.1007/978-3-319-57586-5_11

Niehus D. Semantically Secure Attribute-Based Searchable Encryption. Universität Paderborn; 2017.

Ganesh Athreya A. Instantiating a Predicate Encryption Scheme via Pair Encodings. Universität Paderborn; 2017.

Jürgens M. Provably Secure Key-Derivation-Functions for Certain Types of Applications. Universität Paderborn; 2017.

Diemert D. EAX - An Authenticated Encryption Mode for Block Ciphers. Universität Paderborn; 2017.

Bemmann P. Attribute-Based Signatures Using Structure Preserving Signatures. Universität Paderborn; 2017.

Weis E. Searchable Encryption.; 2016.

Blömer J, Günther P. Singular Curve Point Decompression Attack. In: 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE; 2016. doi:10.1109/fdtc.2015.17

Günther P, Krummel V. Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures. In: Mathematical Aspects of Computer and Information Sciences. Cham: Springer International Publishing; 2016:151-165. doi:10.1007/978-3-319-32859-1_13

Blömer J, Lammersen C, Schmidt M, Sohler C. Theoretical Analysis of the k-Means Algorithm – A Survey. In: Algorithm Engineering. Cham: Springer International Publishing; 2016:81-116. doi:10.1007/978-3-319-49487-6_3

Blömer J, Brauer S, Bujna K. Hard-Clustering with Gaussian Mixture Models. 2016.

Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances in Knowledge Discovery and Data Mining. Cham: Springer International Publishing; 2016:296-308. doi:10.1007/978-3-319-31750-2_24

Blömer J, Günther P. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops; 2016.

Porzenheim L. Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes. Universität Paderborn; 2016.

Bemmann KS. Commitment Schemes - Definitions, Variants, and Security. Universität Paderborn; 2016.

Blömer J, Brauer S, Bujna K. A Theoretical Analysis of the Fuzzy K-Means Problem. In: 2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE; 2016:805-810. doi:10.1109/icdm.2016.0094

Blömer J, Liske G. Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In: Proceedings of the CT-RSA 2016. LNCS. ; 2016:431-447. doi:10.1007/978-3-319-29485-8_25

Günther P. Physical Attacks on Pairing-Based Cryptography. Universität Paderborn; 2016.

Hamm J. Symmetric Anonymous Credentials with Protocols for Relations on Attributes. Universität Paderborn; 2016.

Dallmeier F. Short Randomizable Aggregatable Signatures: Constructions and Security Analysis. Universität Paderborn; 2016.

Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances in Knowledge Discovery and Data Mining. Springer International Publishing; 2016:296-308. doi:10.1007/978-3-319-31750-2_24

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

Kalde B. Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup. Universität Paderborn; 2015.

Strotmann D. Singulärwertzerlegung Für ;c-Ähnliche Bregman-Divergenzen.; 2015.

Eisenhofer T. Protokolle zur authentifizierten Schüsselvereinbarung. Universität Paderborn; 2015.

Eidens F. Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption. Universität Paderborn; 2015.

Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems. In: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC). LNCS. ; 2015:478--488. doi:10.1007/978-3-662-47854-7_29

Löken N. A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption. Universität Paderborn; 2015.

Heihoff F. A Group Signature Scheme Based on the LSRW Assumption. Universität Paderborn; 2015.

Sosniak M. Evaluation of Pairing Optimization for Embedded Platforms. Universität Paderborn; 2015.

Gerken B. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie. Universität Paderborn; 2015.

Bobolz J. Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn; 2015.

Stroh C. Efficient Attributes for Pairing-Based Anonymous Credentials. Universität Paderborn; 2015.

Schleiter P. Constructions of Fully Secure Predicate Encryption Schemes. Universität Paderborn; 2015.

Kohn K. Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms. Universität Paderborn; 2015.

Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn; 2015.

Biermeier F. Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen Bezüglich Den Komplexitätsklassen L Und SL.; 2014.

Sauer M. Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen.; 2014.

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

Rath T. RSA-Full Domain Hash Revisited. Universität Paderborn; 2014.

Brauer S. A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures.; 2014.

Ackermann MR, Blömer J, Kuntze D, Sohler C. Analysis of Agglomerative Clustering. Algorithmica. 2014;69. doi:10.1007/s00453-012-9717-4

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

Blömer J, Liske G. Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. 2014.

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

Jochheim J. Hiding Software Components Using Functional Encryption. Universität Paderborn; 2014.

Bemmann P. Group Signature Schemes with Strong Exculpability. Universität Paderborn; 2014.

Lippert J. Fujisaki-Okamoto Transformation. Universität Paderborn; 2014.

Laudemann S. Themenmodellierung Zur Identifikation Und Gruppierung von Spam-Webseiten.; 2013.

Leder L. Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering Unter Verwendung von L_p-Metriken.; 2013.

Kuntze D. Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements. Universität Paderborn; 2013.

Juhnke J, Lefmann H, Strehl V. An Approach for Determining Optimal Contrast in Visual Cryptography. Fortschritt-Berichte VDI; 2013.

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

Tezer A. Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn; 2013.

Otte O. Seitenkanalresistenz paarungsbasierter Kryptographie. Universität Paderborn; 2013.

Bobolz J. Security Proofs for Pairing-Based Cryptography in the Generic Group Model. Universität Paderborn; 2013.

Blömer J, Günther P, Krummel V. 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:98-105.

Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 2013.

Kohn K. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn; 2013.

Ackermann MR, Märtens M, Raupach C, Swierkot K, Lammersen C, Sohler C. StreamKM++: A clustering algorithm for data streams. 2012;17. doi:10.1145/2133803.2184450

Blömer J. Turing und Kryptografie. Informatik-Spektrum. 2012;35(4). doi:10.1007/s00287-012-0622-7

Löken N. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn; 2012.

Haarhoff T. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn; 2012.

Schleiter P. Attribute-basierte Verschlüsselung. Universität Paderborn; 2012.

Böttger T. Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen.; 2011.

Märtens M. The Monotone Complexity of Computing K-Clique on Random Graphs.; 2011.

Naewe S. Algorithms for Lattice Problems with Respect to General Norms. Universität Paderborn; 2011.

Ackermann MR, Blömer J, Scholz C. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.

Blömer J. How to Share a Secret. In: Algorithms Unplugged. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:159-168. doi:10.1007/978-3-642-15328-0_17

Blömer J, Naewe S. Solving the Closest Vector Problem with respect to Lp Norms. arXiv:11043720. 2011.

Liske G. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn; 2011.

Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: SWAT 2010. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:212-223. doi:10.1007/978-3-642-13731-0_21

Ackermann MR, Blömer J, Sohler C. Clustering for Metric and Nonmetric Distance Measures. ACM Trans Algorithms. 2010;(4):59:1--59:26. doi:10.1145/1824777.1824779

Krueger A, Leutnant V, Haeb-Umbach R, Ackermann M, Blömer J. On the initialization of dynamic models for speech features. Proc of ITG Fachtagung Sprachkommunikation ITG, Bochum, Germany. 2010.

Schrieb J. Efficient and Compact CCA Security from Partitioned IBKEM. 2010.

Schäfer W, Trächtler A, Birattari M, et al. Engineering self-coordinating software intensive systems. In: Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10. ACM Press; 2010. doi:10.1145/1882362.1882428

Postler T. Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung.; 2010.