Anonymous, A. Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference. 2022.

Eidens, Fabian. Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials. 2022, doi:10.17619/UNIPB/1-1653.

Bobolz, Jan, et al. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. IACR eprint, 2021.

Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.”10.1007/978-3-030-92548-2_9__Cryptology and Network Security, Springer International Publishing, 2021, doi:10.1007/978-3-030-92548-2_9.

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.

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

Bröcher, Henrik. Rational Secure Multiparty Computation. Universität Paderborn, 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.

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.

Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.”10.1145/3230833.3234517__Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, doi:10.1145/3230833.3234517.

Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.”10.1145/3230833.3230853__Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, pp. 25:1--25:10, doi:10.1145/3230833.3230853.

Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.

Juhnke, Jakob. Models and Constructions for Secure Reputation Systems. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-570.

Blömer, Johannes, et al. “Enhanced Security of Attribute-Based Signatures.”10.1007/978-3-030-00434-7_12__The International Conference on Cryptology And Network Security (CANS), vol. 11124, Springer, 2018, pp. 235–55, doi:10.1007/978-3-030-00434-7_12.

Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.”10.1007/978-3-319-93387-0_12__ACNS 2018 Applied Cryptography &; Network Security, doi:10.1007/978-3-319-93387-0_12.