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

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

Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.”10.1007/978-3-319-75650-9_1__Foundations and Practice of Security, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-75650-9_1.

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”10.1007/978-3-319-57586-5_11__Lecture Notes in Computer Science, edited by Dimitris Fotakis et al., vol. 10236, Springer International Publishing, 2017, pp. 116–27, doi: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.”10.1109/fdtc.2015.17__2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2016, doi:10.1109/fdtc.2015.17.

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

Blömer, Johannes, et al. “Theoretical Analysis of the K-Means Algorithm – A Survey.”10.1007/978-3-319-49487-6_3__Algorithm Engineering, Springer International Publishing, 2016, pp. 81–116, doi:10.1007/978-3-319-49487-6_3.

Blömer, Johannes, et al. Hard-Clustering with Gaussian Mixture Models. Computing Research Repository, 2016.

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”10.1007/978-3-319-31750-2_24__Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi: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, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.”10.1109/icdm.2016.0094__2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–10, doi:10.1109/icdm.2016.0094.

Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.”10.1007/978-3-319-29485-8_25__Proceedings of the CT-RSA 2016, 2016, pp. 431–47, doi: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.”10.1007/978-3-319-31750-2_24__Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.

Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.”10.1007/978-3-319-32859-1_14__Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–80, doi: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, et al. “Anonymous and Publicly Linkable Reputation Systems.”10.1007/978-3-662-47854-7_29__Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488, doi:10.1007/978-3-662-47854-7_29.

Löken, Nils. A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption. Universität Paderborn, 2015.

Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption. Universität Paderborn, 2015.

Sosniak, Martin. Evaluation of Pairing Optimization for Embedded Platforms. Universität Paderborn, 2015.

Gerken, Britta. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie. Universität Paderborn, 2015.

Bobolz, Jan. Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn, 2015.

Stroh, Christian. Efficient Attributes for Pairing-Based Anonymous Credentials. Universität Paderborn, 2015.

Schleiter, Patrick. Constructions of Fully Secure Predicate Encryption Schemes. Universität Paderborn, 2015.

Kohn, Kathlén. Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.

Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.

Biermeier, Felix. Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen Bezüglich Den Komplexitätsklassen L Und SL. 2014.

Sauer, Malte. Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen. 2014.

Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.”10.1109/FDTC.2014.10__Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7, doi:10.1109/FDTC.2014.10.

Rath, Timo. RSA-Full Domain Hash Revisited. Universität Paderborn, 2014.

Brauer, Sascha. A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures. 2014.

Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.”10.1007/s00453-012-9717-4__Algorithmica, vol. 69, Springer US, 2014, doi:10.1007/s00453-012-9717-4.

Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.”10.1109/icpr.2014.253__2014 22nd International Conference on Pattern Recognition, IEEE, 2014, doi:10.1109/icpr.2014.253.

Blömer, Johannes, and Gennadij Liske. Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions. Universität Paderborn, 2014.

Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.”10.1109/FDTC.2014.22__Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136, doi:10.1109/FDTC.2014.22.

Jochheim, Janek. Hiding Software Components Using Functional Encryption. Universität Paderborn, 2014.

Bemmann, Pascal. Group Signature Schemes with Strong Exculpability. Universität Paderborn, 2014.