Lattice reductions and their applications to cryptographic systems
J.N. Siemer, Lattice Reductions and Their Applications to Cryptographic Systems, 2021.

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

IND-CCA Secure PKE Schemes - Based on Lattices
M.A.E. Böttger, IND-CCA Secure PKE Schemes - Based on Lattices, 2021.

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

On Batch Proofs of Partial Knowledge
P. Manegold, On Batch Proofs of Partial Knowledge, 2020.

Measuring the Performance of SNARK Libraries
A. Anonymous, Measuring the Performance of SNARK Libraries, 2020.

Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions
M. Westerwelle, Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions, 2020.

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

A Complexity Theoretical Study of Fuzzy K-Means
J. Blömer, S. Brauer, K. Bujna, ACM Transactions on Algorithms 16 (2020) 1–25.

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

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

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

Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection
J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, C. Striecks, in: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), ACM, New York, NY, USA, 2020.

How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models
J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and Classification 14 (2020) 147–173.

Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work
N. Löken, Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work, 2020.

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

Complexity of single-swap heuristics for metric facility location and related problems
S. Brauer, Theoretical Computer Science 754 (2019) 88–106.

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

On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model
N.C. Wördenweber, On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model, 2019.

Experimentelle Untersuchung des SEM-Algorithmus
M. Leutnant, Experimentelle Untersuchung Des SEM-Algorithmus, 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.

Personal Cross-Platform Reputation
J. Blömer, N. Löken, in: Security and Trust Management, STM 2019, 2019.

Dynamic Searchable Encryption with Access Control
J. Blömer, N. Löken, in: 12th International Symposium on Foundations and Practice of Security, FPS 2019, Springer, 2019.

Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java
M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java, Universität Paderborn, 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.

Classification and Approximation of Geometric Location Problems
S. Brauer, Classification and Approximation of Geometric Location Problems, Paderborn, 2019.

Updatable Anonymous Credentials and Applications to Incentive Systems
J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.

Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems
J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - CT-RSA 2018 - The Cryptographers’ Track at the RSA Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.

Voronoi Cells of Lattices with Respect to Arbitrary Norms
J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018) 314–338.

Fully-Featured Anonymous Credentials with Reputation System
K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L. Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling, M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA, n.d.

Cloud Architectures for Searchable Encryption
J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.

Provably Anonymous Communication Based on Trusted Execution Environments
J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.

Coresets for Fuzzy K-Means with Applications
J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms and Computation  (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12.

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

Models and Constructions for Secure Reputation Systems
J. Juhnke, Models and Constructions for Secure Reputation Systems, Universität Paderborn, 2018.

Enhanced Security of Attribute-Based Signatures
J. Blömer, F. Eidens, J. Juhnke, in: The International Conference on Cryptology And Network Security (CANS), Springer, 2018, pp. 235–255.

Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures
J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography &; Network Security, n.d.

Soft Clustering Algorithms - Theoretical and Practical Improvements
K. Bujna, Soft Clustering Algorithms - Theoretical and Practical Improvements, Universität Paderborn, 2017.

Subtleties in Security Definitions for Predicate Encryption with Public Index
J. Blömer, G. Liske, in: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International Publishing, Cham, 2017, pp. 438–453.

CCA-Security for Predicate Encryption Schemes
G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn, 2017.

Searchable Encryption with Access Control
N. Löken, in: Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17, ACM Press, 2017.

Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations
J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice of Security, Springer International Publishing, Cham, 2017, pp. 3–17.

Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
S. Brauer, in: D. Fotakis, A. Pagourtzis, V.T. Paschos (Eds.), Lecture Notes in Computer Science, Springer International Publishing, Cham, 2017, pp. 116–127.

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

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

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

EAX - An Authenticated Encryption Mode for Block Ciphers
D. Diemert, EAX - An Authenticated Encryption Mode for Block Ciphers, 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.