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

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

Bobolz, Jan, et al. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.”10.1145/3320269.3384769__Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), ACM, 2020, doi:10.1145/3320269.3384769.

Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.”10.1007/s11634-019-00366-7__Advances in Data Analysis and Classification, vol. 14, 2020, pp. 147–173, doi:10.1007/s11634-019-00366-7.

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

Kramer, Paul. Comparison of Zero-Knowledge Range Proofs. Universität Paderborn, 2020.

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”10.1016/j.tcs.2018.04.048__Theoretical Computer Science, vol. 754, Elsevier, 2019, pp. 88–106, doi:10.1016/j.tcs.2018.04.048.

Otte, Oliver. Outsourced Decryption of Attribute-Based Ciphertexts. 2019.

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

Leutnant, Matthias. Experimentelle Untersuchung Des SEM-Algorithmus. 2019.

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

Porzenheim, Laurens Alexander. Post-Quantum Secure Group Signatures. 2019.

Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.”10.1007/978-3-030-31511-5_9__Security and Trust Management, STM 2019, vol. 11738, 2019, doi:10.1007/978-3-030-31511-5_9.

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

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

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

Brauer, Sascha. Classification and Approximation of Geometric Location Problems. 2019, doi:10.17619/UNIPB/1-816.

Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.”10.1145/3319535.3354223__Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019, doi:10.1145/3319535.3354223.

Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.”10.1007/978-3-319-76953-0_25__Topics in Cryptology - CT-RSA 2018 - The Cryptographers’ Track at the RSA Conference 2018, Proceedings, Springer International Publishing, 2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25.

Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.”10.1137/17M1132045__SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, 2018, pp. 314–38, doi:10.1137/17M1132045.