Schürmann P. A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn; 2020.

Terfort T. Enhancing Security by Usage of Universal One-Way Hash Functions. Universität Paderborn; 2020.

Bobolz J, Eidens F, Krenn S, Slamanig D, Striecks C. Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection. In: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),. New York, NY, USA: ACM; 2020. doi:10.1145/3320269.3384769

Blömer J, Brauer S, Bujna K, Kuntze D. How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. Advances in Data Analysis and Classification. 2020;14:147–173. doi:10.1007/s11634-019-00366-7

Löken N. Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work.; 2020. doi:10.17619/UNIPB/1-854

Kramer P. Comparison of Zero-Knowledge Range Proofs. Universität Paderborn; 2020.

Brauer S. Complexity of single-swap heuristics for metric facility location and related problems. Theoretical Computer Science. 2019;754:88-106. doi:10.1016/j.tcs.2018.04.048

Otte O. Outsourced Decryption of Attribute-Based Ciphertexts.; 2019.

Wördenweber NC. On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model.; 2019.

Leutnant M. Experimentelle Untersuchung Des SEM-Algorithmus.; 2019.

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