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

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

Bobolz, Jan, Fabian Eidens, Stephan Krenn, Daniel Slamanig, and Christoph Striecks. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.”https://doi.org/10.1145/3320269.3384769__In Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),. New York, NY, USA: ACM, 2020.https://doi.org/10.1145/3320269.3384769 .
LibreCat: /record/16487
DOI: 10.1145/3320269.3384769

Blömer, Johannes, Sascha Brauer, Kathrin Bujna, and Daniel Kuntze. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.”https://doi.org/10.1007/s11634-019-00366-7__Advances in Data Analysis and Classification 14 (2020): 147–173.https://doi.org/10.1007/s11634-019-00366-7 .
LibreCat: /record/10790
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.https://doi.org/10.17619/UNIPB/1-854 .
LibreCat: /record/15482
DOI: 10.17619/UNIPB/1-854

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

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”https://doi.org/10.1016/j.tcs.2018.04.048__Theoretical Computer Science 754 (2019): 88–106.https://doi.org/10.1016/j.tcs.2018.04.048 .
LibreCat: /record/2916
DOI: 10.1016/j.tcs.2018.04.048

Otte, Oliver. Outsourced Decryption of Attribute-Based Ciphertexts, 2019.
LibreCat: /record/15746

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

Leutnant, Matthias. Experimentelle Untersuchung Des SEM-Algorithmus, 2019.
LibreCat: /record/15819

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

Porzenheim, Laurens Alexander. Post-Quantum Secure Group Signatures, 2019.
LibreCat: /record/10306

Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.”https://doi.org/10.1007/978-3-030-31511-5_9__In Security and Trust Management, STM 2019, Vol. 11738. LNCS, 2019.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, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” In 12th International Symposium on Foundations and Practice of Security, FPS 2019, Vol. 12056. LNCS. Springer, 2019.
LibreCat: /record/13557

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

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

Brauer, Sascha. Classification and Approximation of Geometric Location Problems. Paderborn, 2019.https://doi.org/10.17619/UNIPB/1-816 .
LibreCat: /record/13679
DOI: 10.17619/UNIPB/1-816

Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens. “Updatable Anonymous Credentials and Applications to Incentive Systems.”https://doi.org/10.1145/3319535.3354223__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.https://doi.org/10.1145/3319535.3354223 .
LibreCat: /record/13904
DOI: 10.1145/3319535.3354223

Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.”https://doi.org/10.1007/978-3-319-76953-0_25__In Topics in Cryptology - CT-RSA 2018 - The Cryptographers’ Track at the RSA Conference 2018, Proceedings, 470–90. Cham: Springer International Publishing, 2018.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, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.”https://doi.org/10.1137/17M1132045__SIAM Journal on Applied Algebra and Geometry. 2, no. 2 (2018): 314–38.https://doi.org/10.1137/17M1132045 .
LibreCat: /record/2685
DOI: 10.1137/17M1132045