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 .