Pilot, M. (2023). Updatable Privacy-Preserving Reputation System based on Blockchain.

Schürmann, P. (2023).  A Formal Comparison of Advanced Digital Signature Primitives.

Koch, A. (2023). Privacy-Preserving Collection and Evaluation of Log Files.

Vahle, E. (2022). Modelling and Proving Security for a Secure MPC Protocol for Stable Matching.

Siek, H. (2022). Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes.

Anonymous, A. (2022). Evaluating database systems relying on secure multiparty computation.

Anonymous, A. (2022). Cost of Privacy-preserving SMPC Protocols for NN-Based Inference.

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

Anonymous, A. (2022).  Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development.

Anonymous, A. (2022). A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries.

Siemer, J. N. (2021). Lattice reductions and their applications to cryptographic systems.

Anonymous, A. (2021). Performance Analysis of FHE Libraries.

Anonymous, A. (2021). Device-Independent Security Proofs Via Entropy Accumulation.

Anonymous, A. (2020). Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems.

Heimann, J. (2020). Distributed Key Generation for Attribute-Based Signatures.

Schürmann, P. (2020). A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn.

Terfort, T. (2020). Enhancing Security by Usage of Universal One-Way Hash Functions. Universität Paderborn.

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 

Kramer, P. (2020). Comparison of Zero-Knowledge Range Proofs. Universität Paderborn.

Leutnant, M. (2019). Experimentelle Untersuchung des SEM-Algorithmus.

Bröcher, H. (2019). Rational Secure Multiparty Computation. Universität Paderborn.

Porzenheim, L. A. (2019). Post-Quantum Secure Group Signatures.

Pilot, M. (2019). Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java. Universität Paderborn.

Scholz, S. (2019). Implementation and Comparison of Elliptic Curve Algorithms in Java. Universität Paderborn.

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

von Heißen, O. (2018). Implementierung und Analyse von Searchable Encryption.

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

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

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

Niehus, D. (2017). Semantically Secure Attribute-based Searchable Encryption. Universität Paderborn.

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

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

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

Bemmann, P. (2017). Attribute-based Signatures using Structure Preserving Signatures. Universität Paderborn.

Weis, E. (2016). Searchable Encryption.

Porzenheim, L. (2016). Comparison of different Definitions of Chosen-Ciphertext Security in Encryption schemes. Universität Paderborn.

Bemmann, K. S. (2016). Commitment Schemes - Definitions, Variants, and Security. Universität Paderborn.

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

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

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

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

Strotmann, D. (2015). Singulärwertzerlegung für ;c-ähnliche Bregman-Divergenzen.

Eisenhofer, T. (2015). Protokolle zur authentifizierten Schüsselvereinbarung. Universität Paderborn.

Eidens, F. (2015). Anonymous credential system based on q-Strong Diffie-Hellman Assumption. Universität Paderborn.

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

Heihoff, F. (2015). A group signature scheme based on the LSRW assumption. Universität Paderborn.

Sosniak, M. (2015). Evaluation of Pairing Optimization for Embedded Platforms. Universität Paderborn.

Gerken, B. (2015). Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie. Universität Paderborn.

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

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

Schleiter, P. (2015). Constructions of Fully Secure Predicate Encryption Schemes. Universität Paderborn.

Kohn, K. (2015). Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms. Universität Paderborn.

Biermeier, F. (2014). Untersuchung des Erreichbarkeitsproblems in ungerichteten Graphen bezüglich den Komplexitätsklassen L und SL.

Sauer, M. (2014). Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen.

Rath, T. (2014). RSA-Full Domain Hash Revisited. Universität Paderborn.

Brauer, S. (2014). A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures.

Jochheim, J. (2014). Hiding software components using functional encryption. Universität Paderborn.

Bemmann, P. (2014). Group Signature Schemes with Strong Exculpability. Universität Paderborn.

Lippert, J. (2014). Fujisaki-Okamoto Transformation. Universität Paderborn.

Laudemann, S. (2013). Themenmodellierung zur Identifikation und Gruppierung von Spam-Webseiten.

Leder, L. (2013). Nichtapproximierbarkeitsresultate zu Radius- und Durchmesserclustering unter Verwendung von L_p-Metriken.

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

Tezer, A. (2013). Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn.

Otte, O. (2013). Seitenkanalresistenz paarungsbasierter Kryptographie. Universität Paderborn.

Kohn, K. (2013). Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn.

Löken, N. (2012). Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn.

Haarhoff, T. (2012). Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn.

Schleiter, P. (2012). Attribute-basierte Verschlüsselung. Universität Paderborn.

Märtens, M. (2011). The Monotone Complexity of Computing k-Clique on Random Graphs.

Liske, G. (2011). Fault attacks in pairing-based cryptography. Universität Paderborn.

Schröer, C. (2009). Hierarchisches Clustering mit minimalen Cluster-Durchmessern.

Scholz, C. (2009). Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen.

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

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

Landwehr, A. C. (2007). Untersuchungen zur Sicherheit einzelner RSA Bits.

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

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