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

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

J. Blömer and N. Löken, “Personal Cross-Platform Reputation,” in Security and Trust Management, STM 2019, 2019, vol. 11738.

J. Blömer and N. Löken, “Dynamic Searchable Encryption with Access Control,” in 12th International Symposium on Foundations and Practice of Security, FPS 2019, 2019, vol. 12056.

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

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

S. Brauer, Classification and Approximation of Geometric Location Problems. Paderborn, 2019.

J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous Credentials and Applications to Incentive Systems,”10.1145/3319535.3354223__presented at the 26th ACM Conference on Computer and Communications Security, London, 2019, doi:10.1145/3319535.3354223 .

J. Blömer, F. Eidens, and J. Juhnke, “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, San Francisco, CA, USA, 2018, pp. 470–490.

J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary Norms,” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, pp. 314–338, 2018.

K. Bemmann et al., “Fully-Featured Anonymous Credentials with Reputation System,” in Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, Hamburg, Germany.

J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, Hamburg, Germany, pp. 25:1--25:10.

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

J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,” in 29th International Symposium on Algorithms and Computation  (ISAAC 2018), Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.

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

J. Juhnke, Models and Constructions for Secure Reputation Systems. Universität Paderborn, 2018.

J. Blömer, F. Eidens, and J. Juhnke, “Enhanced Security of Attribute-Based Signatures,”10.1007/978-3-030-00434-7_12__in The International Conference on Cryptology And Network Security (CANS), Naples, Italy, 2018, vol. 11124, pp. 235–255, doi:10.1007/978-3-030-00434-7_12 .

J. Blömer and J. Bobolz, “Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures,”10.1007/978-3-319-93387-0_12__presented at the The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium, doi:10.1007/978-3-319-93387-0_12 .

K. Bujna, Soft Clustering Algorithms - Theoretical and Practical Improvements. Universität Paderborn, 2017.

J. Blömer and G. Liske, “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), 2017, vol. 10693, pp. 438–453.