S. Hemmrich, J. Bobolz, D. Beverungen, and J. Blömer, “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain,” presented at the ECIS 2023, 2023.

J. Blömer, J. Bobolz, and H. Bröcher, “On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC,” presented at the TCC 2023, Taipeh, Taiwan, 2023.

J. Blömer, J. Bobolz, and L. A. Porzenheim, “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” presented at the Asiacrypt 2023, Guangzhou, China, 2023.

F. Eidens, Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials. 2022.

J. Bobolz, F. Eidens, R. Heitjohann, and J. Fell, “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.

J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, and K. Samelin, “Issuer-Hiding Attribute-Based Credentials,”10.1007/978-3-030-92548-2_9__2021, doi:10.1007/978-3-030-92548-2_9 .

J. Blömer, S. Brauer, and K. Bujna, “A Complexity Theoretical Study of Fuzzy K-Means,” ACM Transactions on Algorithms, vol. 16, no. 4, pp. 1–25, 2020.

J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, and C. Striecks, “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), Taiwan, 2020.

J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models,” Advances in Data Analysis and Classification, vol. 14, pp. 147–173, 2020.

N. Löken, Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work. 2020.

S. Brauer, “Complexity of single-swap heuristics for metric facility location and related problems,” Theoretical Computer Science, vol. 754, pp. 88–106, 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.

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. .