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

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.

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. Paderborn, 2019.https://doi.org/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 .

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 .

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 .

Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials with Reputation System.”https://doi.org/10.1145/3230833.3234517__In Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM, n.d.https://doi.org/10.1145/3230833.3234517 .

Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.”https://doi.org/10.1145/3230833.3230853__In Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, 25:1--25:10. New York, NY, USA: ACM, n.d.https://doi.org/10.1145/3230833.3230853 .

Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. Provably Anonymous Communication Based on Trusted Execution Environments, n.d.

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy K-Means with Applications.”https://doi.org/10.4230/LIPIcs.ISAAC.2018.46__In 29th International Symposium on Algorithms and Computation  (ISAAC 2018), 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.https://doi.org/10.4230/LIPIcs.ISAAC.2018.46 .

Heißen, Oliver von. Implementierung und Analyse von Searchable Encryption, 2018.

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

Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Enhanced Security of Attribute-Based Signatures.”https://doi.org/10.1007/978-3-030-00434-7_12__In The International Conference on Cryptology And Network Security (CANS), 11124:235–55. Lecture Notes in Computer Science. Springer, 2018.https://doi.org/10.1007/978-3-030-00434-7_12 .

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

Bujna, Kathrin. Soft Clustering Algorithms - Theoretical and Practical Improvements. Universität Paderborn, 2017.https://doi.org/10.17619/UNIPB/1-226 .

Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.”https://doi.org/10.1007/978-3-319-72453-9_35__In Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), 10693:438–53. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017.https://doi.org/10.1007/978-3-319-72453-9_35 .

Liske, Gennadij. CCA-Security for Predicate Encryption Schemes. Universität Paderborn, 2017.https://doi.org/10.17619/UNIPB/1-220 .

Löken, Nils. “Searchable Encryption with Access Control.”https://doi.org/10.1145/3098954.3098987__In Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17. ICPS. ACM Press, 2017.https://doi.org/10.1145/3098954.3098987 .

Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.”https://doi.org/10.1007/978-3-319-75650-9_1__In Foundations and Practice of Security, 3–17. Cham: Springer International Publishing, 2017.https://doi.org/10.1007/978-3-319-75650-9_1 .

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”https://doi.org/10.1007/978-3-319-57586-5_11__In Lecture Notes in Computer Science, edited by Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, 10236:116–27. Cham: Springer International Publishing, 2017.https://doi.org/10.1007/978-3-319-57586-5_11 .

Niehus, David. Semantically Secure Attribute-Based Searchable Encryption. Universität Paderborn, 2017.

Ganesh Athreya, Advait. Instantiating a Predicate Encryption Scheme via Pair Encodings. Universität Paderborn, 2017.

Jürgens, Mirko. Provably Secure Key-Derivation-Functions for Certain Types of Applications. Universität Paderborn, 2017.

Diemert, Denis. EAX - An Authenticated Encryption Mode for Block Ciphers. Universität Paderborn, 2017.

Bemmann, Pascal. Attribute-Based Signatures Using Structure Preserving Signatures. Universität Paderborn, 2017.

Weis, Eduard. Searchable Encryption, 2016.

Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.”https://doi.org/10.1109/fdtc.2015.17__In 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE, 2016.https://doi.org/10.1109/fdtc.2015.17 .

Günther, Peter, and Volker Krummel. “Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures.”https://doi.org/10.1007/978-3-319-32859-1_13__In Mathematical Aspects of Computer and Information Sciences, 151–65. Cham: Springer International Publishing, 2016.https://doi.org/10.1007/978-3-319-32859-1_13 .

Blömer, Johannes, Christiane Lammersen, Melanie Schmidt, and Christian Sohler. “Theoretical Analysis of the K-Means Algorithm – A Survey.”https://doi.org/10.1007/978-3-319-49487-6_3__In Algorithm Engineering, 81–116. Cham: Springer International Publishing, 2016.https://doi.org/10.1007/978-3-319-49487-6_3 .

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”https://doi.org/10.1007/978-3-319-31750-2_24__In Advances in Knowledge Discovery and Data Mining, 296–308. Cham: Springer International Publishing, 2016.https://doi.org/10.1007/978-3-319-31750-2_24 .

Blömer, Johannes, and Peter Günther. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.

Porzenheim, Laurens. Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes. Universität Paderborn, 2016.

Bemmann, Kai Sören. Commitment Schemes - Definitions, Variants, and Security. Universität Paderborn, 2016.

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis of the Fuzzy K-Means Problem.”https://doi.org/10.1109/icdm.2016.0094__In 2016 IEEE 16th International Conference on Data Mining (ICDM), 805–10. IEEE, 2016.https://doi.org/10.1109/icdm.2016.0094 .

Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.”https://doi.org/10.1007/978-3-319-29485-8_25__In Proceedings of the CT-RSA 2016, 431–47. LNCS, 2016.https://doi.org/10.1007/978-3-319-29485-8_25 .

Günther, Peter. Physical Attacks on Pairing-Based Cryptography. Universität Paderborn, 2016.

Hamm, Julian. Symmetric Anonymous Credentials with Protocols for Relations on Attributes. Universität Paderborn, 2016.

Dallmeier, Fynn. Short Randomizable Aggregatable Signatures: Constructions and Security Analysis. Universität Paderborn, 2016.

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”https://doi.org/10.1007/978-3-319-31750-2_24__In Advances in Knowledge Discovery and Data Mining, 296–308. Cham: Springer International Publishing, 2016.https://doi.org/10.1007/978-3-319-31750-2_24 .

Blömer, Johannes, Jakob Juhnke, and Nils Löken. “Short Group Signatures with Distributed Traceability.”https://doi.org/10.1007/978-3-319-32859-1_14__In Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 166–80. LNCS, 2015.https://doi.org/10.1007/978-3-319-32859-1_14 .

Kalde, Benedikt. Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup. Universität Paderborn, 2015.

Strotmann, Daniela. Singulärwertzerlegung Für ;c-Ähnliche Bregman-Divergenzen, 2015.

Eisenhofer, Thorsten. Protokolle zur authentifizierten Schüsselvereinbarung. Universität Paderborn, 2015.

Eidens, Fabian. Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption. Universität Paderborn, 2015.

Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.”https://doi.org/10.1007/978-3-662-47854-7_29__In Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 478--488. LNCS, 2015.https://doi.org/10.1007/978-3-662-47854-7_29 .