Naewe, S. (2011). Algorithms for lattice problems with respect to general norms. Universität Paderborn.

Ackermann, M. R. (2009). Algorithms for the Bregman k-Median Problem. Universität Paderborn.

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

Brauer, S. (2019). Classification and Approximation of Geometric Location Problems. Paderborn.https://doi.org/10.17619/UNIPB/1-816 

Löken, N. (2020). Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work.https://doi.org/10.17619/UNIPB/1-854 

Otto, M. (2005). Fault Attacks and Countermeasures. Universität Paderborn.

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

May, A. (2003). New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn.

Günther, P. (2016). Physical attacks on pairing-based cryptography. Universität Paderborn.

Kuntze, D. (2013). Practical algorithms for clustering and modeling large data sets - Analysis and improvements. Universität Paderborn.

Eidens, F. (2022). Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials.https://doi.org/10.17619/UNIPB/1-1653 

Blömer, J. (1992). Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik.

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

Krummel, V. (2007). Tamper Resistance of AES -- Models, Attacks and Countermeasures. Universität Paderborn.