Schürmann, P. (2020). A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn.
LibreCat: /record/18637

Terfort, T. (2020). Enhancing Security by Usage of Universal One-Way Hash Functions. Universität Paderborn.
LibreCat: /record/18639

Bobolz, J., Eidens, F., Krenn, S., Slamanig, D., &; Striecks, C. (2020). 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.https://doi.org/10.1145/3320269.3384769 
LibreCat: /record/16487
DOI: 10.1145/3320269.3384769

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

Löken, N. (2020). Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work.https://doi.org/10.17619/UNIPB/1-854 
LibreCat: /record/15482
DOI: 10.17619/UNIPB/1-854

Kramer, P. (2020). Comparison of Zero-Knowledge Range Proofs. Universität Paderborn.
LibreCat: /record/18638

Brauer, S. (2019). Complexity of single-swap heuristics for metric facility location and related problems. Theoretical Computer Science, 754, 88–106.https://doi.org/10.1016/j.tcs.2018.04.048 
LibreCat: /record/2916
DOI: 10.1016/j.tcs.2018.04.048

Otte, O. (2019). Outsourced Decryption of Attribute-based Ciphertexts.
LibreCat: /record/15746

Wördenweber, N. C. (2019). On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model.
LibreCat: /record/15747

Leutnant, M. (2019). Experimentelle Untersuchung des SEM-Algorithmus.
LibreCat: /record/15819

Bröcher, H. (2019). Rational Secure Multiparty Computation. Universität Paderborn.
LibreCat: /record/13128

Porzenheim, L. A. (2019). Post-Quantum Secure Group Signatures.
LibreCat: /record/10306

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 
LibreCat: /record/13554
DOI: 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.
LibreCat: /record/13557

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

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

Brauer, S. (2019). Classification and Approximation of Geometric Location Problems. Paderborn.https://doi.org/10.17619/UNIPB/1-816 
LibreCat: /record/13679
DOI: 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 
LibreCat: /record/13904
DOI: 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 
LibreCat: /record/2862
DOI: 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 
LibreCat: /record/2685
DOI: 10.1137/17M1132045