Bröcher, H. (2019). Rational Secure Multiparty Computation. Universität Paderborn.

Porzenheim, L. A. (2019). Post-Quantum Secure Group Signatures.

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

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

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

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

Brauer, S. (2019). Classification and Approximation of Geometric Location Problems. Paderborn.https://doi.org/10.17619/UNIPB/1-816 

Blömer, J., Bobolz, J., Diemert, D. P., &; Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. 26th ACM Conference on Computer and Communications Security, London.https://doi.org/10.1145/3319535.3354223 

Blömer, J., Eidens, F., &; Juhnke, J. (2018). 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 (pp. 470–490). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-76953-0_25 

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

Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F.,https://doi.org/10.1145/3230833.3234517__Stienemeier, M. (n.d.). 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.https://doi.org/10.1145/3230833.3234517 

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

Blömer, J., Bobolz, J., Scheideler, C., &; Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.

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

von Heißen, O. (2018). Implementierung und Analyse von Searchable Encryption.

Juhnke, J. (2018). Models and Constructions for Secure Reputation Systems. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-570 

Blömer, J., Eidens, F., &; Juhnke, J. (2018). Enhanced Security of Attribute-Based Signatures. The International Conference on Cryptology And Network Security (CANS), 11124, 235–255.https://doi.org/10.1007/978-3-030-00434-7_12 

Blömer, J., &; Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. ACNS 2018 Applied Cryptography &; Network Security. The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium.https://doi.org/10.1007/978-3-319-93387-0_12 

Bujna, K. (2017). Soft Clustering Algorithms - Theoretical and Practical Improvements. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-226 

Blömer, J., &; Liske, G. (2017). 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, pp. 438–453). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-72453-9_35 

Liske, G. (2017). CCA-Security for Predicate Encryption Schemes. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-220 

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

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

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

Niehus, D. (2017). Semantically Secure Attribute-based Searchable Encryption. Universität Paderborn.

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

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

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

Bemmann, P. (2017). Attribute-based Signatures using Structure Preserving Signatures. Universität Paderborn.

Weis, E. (2016). Searchable Encryption.

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

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

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

Blömer, J., Brauer, S., &; Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository.

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

Blömer, J., &; Günther, P. (2016). Effizienz und Sicherheit paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops.

Porzenheim, L. (2016). Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes. Universität Paderborn.

Bemmann, K. S. (2016). Commitment Schemes - Definitions, Variants, and Security. Universität Paderborn.

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

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

Günther, P. (2016). Physical attacks on pairing-based cryptography. Universität Paderborn.

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

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

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

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

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

Strotmann, D. (2015). Singulärwertzerlegung für ;c-ähnliche Bregman-Divergenzen.

Eisenhofer, T. (2015). Protokolle zur authentifizierten Schüsselvereinbarung. Universität Paderborn.

Eidens, F. (2015). Anonymous credential system based on q-Strong Diffie-Hellman Assumption. Universität Paderborn.

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