Com­pleted Mas­ter's theses

Private Set Intersection using Third Generation FHE

A. Anonymous, Private Set Intersection Using Third Generation FHE, 2023.


Rational Models in Cryptography Applied to Matching

A. Anonymous, Rational Models in Cryptography Applied to Matching, 2023.


Updatable Privacy-Preserving Reputation System based on Blockchain

M. Pilot, Updatable Privacy-Preserving Reputation System Based on Blockchain, 2023.


A Formal Comparison of Advanced Digital Signature Primitives

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


On Transforming Lattice-Based Cryptography to the Ring Setting

P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting, 2022.


Cost of Privacy-preserving SMPC Protocols for NN-Based Inference

A. Anonymous, Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference, 2022.


Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development

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


A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries

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


Performance Analysis of FHE Libraries

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


Device-Independent Security Proofs Via Entropy Accumulation

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


Outsourced Decryption of Attribute-based Ciphertexts

O. Otte, Outsourced Decryption of Attribute-Based Ciphertexts, 2019.


Rational Secure Multiparty Computation

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


Post-Quantum Secure Group Signatures

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


Implementation and Comparison of Elliptic Curve Algorithms in Java

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


Semantically Secure Attribute-based Searchable Encryption

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


Attribute-based Signatures using Structure Preserving Signatures

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


Searchable Encryption

E. Weis, Searchable Encryption, 2016.


Symmetric Anonymous Credentials with Protocols for Relations on Attributes

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


Anonymous credential system based on q-Strong Diffie-Hellman Assumption

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


A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption

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


Evaluation of Pairing Optimization for Embedded Platforms

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


Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie

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


Efficient Verifier-Local Revocation for Anonymous Credentials

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


Efficient Attributes for Pairing-Based Anonymous Credentials

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


Constructions of Fully Secure Predicate Encryption Schemes

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


Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms

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


A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures

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


Hiding software components using functional encryption

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


The Monotone Complexity of Computing k-Clique on Random Graphs

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


Fault attacks in pairing-based cryptography

G. Liske, Fault Attacks in Pairing-Based Cryptography, Universität Paderborn, 2011.


Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen

C. Scholz, Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen, 2009.


Show all publications

Com­pleted Dip­loma theses

Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung

T. Postler, Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung, 2010.


Construction and Applications of Identity-Based Encryption without Pairings

J. Schrieb, Construction and Applications of Identity-Based Encryption without Pairings, 2008.


Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln

W. Klein, Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln, 2007.


Kryptanalyse des EAC-Protokolls biometrischer Reisepässe

O. Käthler, Kryptanalyse des EAC-Protokolls biometrischer Reisepässe, 2007.


Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode

B. Brieden, Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode, 2007.


Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz

D. Kuntze, Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz, 2007.


Vergleich multivariater Varianten der Methode von Coppersmith

J. Borghoff, Vergleich multivariater Varianten der Methode von Coppersmith, 2007.


Boomerang- und Rechteckangriff auf AES

M. Gorski, Boomerang- Und Rechteckangriff Auf AES, 2006.


Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit

S. Naewe, Samplemethoden in der algorithmischen Geometrie der Zahlen, Diplomarbeit, Universität Paderborn, 2006.


Analyse von RSA mittels Coppersmith Methode

M. Ernst, Analyse von RSA mittels Coppersmith Methode, 2005.


Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA

C. Spanke, Implementierung der Coppersmith-Methode zur Untersuchung von Schwachstellen bei RSA, 2005.


Markovprozesse zur Modellierung bei Codekompression

U. Hoppe, Markovprozesse zur Modellierung bei Codekompression, 2003.


Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten

M.R. Ackermann, Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten, 2003.


Construction of Pseudorandom Functions

B. Fricke, Construction of Pseudorandom Functions, 2002.


Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems

D. Deveci, Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems, 2002.


The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography

A. Helbich, The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography, 2002.


Timing Attacks for Cryptosystems based on Elliptic Curves

D. Schepers, Timing Attacks for Cryptosystems Based on Elliptic Curves, 2002.


Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael

V. Krummel, Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael, 2001.


Brauer Addition-Subtraction Chains

M. Otto, Brauer Addition-Subtraction Chains, 2001.


Show all publications