Pilot, Matthias. Updatable Privacy-Preserving Reputation System Based on Blockchain. 2023.
LibreCat: /record/40440

Schürmann, Patrick.  A Formal Comparison of Advanced Digital Signature Primitives. 2023.
LibreCat: /record/43374

Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” ECIS 2023 Research Papers, 2023.
LibreCat: /record/44855

Koch, Angelina. Privacy-Preserving Collection and Evaluation of Log Files. 2023.
LibreCat: /record/43375

Blömer, Johannes, et al. On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC. 2023.
LibreCat: /record/35014

Blömer, Johannes, et al. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. 2023.
LibreCat: /record/43458

Anonymous, A. Private Set Intersection Using Third Generation FHE. 2023.
LibreCat: /record/47658

Anonymous, A. Rational Models in Cryptography Applied to Matching. 2023.
LibreCat: /record/47659

Vahle, Ella. Modelling and Proving Security for a Secure MPC Protocol for Stable Matching. 2022.
LibreCat: /record/32399

Siek, Hanna. Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes. 2022.
LibreCat: /record/32398

Kramer, Paul. On Transforming Lattice-Based Cryptography to the Ring Setting. 2022.
LibreCat: /record/31485

Anonymous, A. Evaluating Database Systems Relying on Secure Multiparty Computation. 2022.
LibreCat: /record/34962

Anonymous, A. Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference. 2022.
LibreCat: /record/34963

Lohse, Jan. Lattice Revocation Mechanisms. 2022.
LibreCat: /record/35772

Eidens, Fabian. Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials. 2022, doi:10.17619/UNIPB/1-1653.
LibreCat: /record/35188
DOI: 10.17619/UNIPB/1-1653

Anonymous, Anonymous.  Comparison of Open Source Software in Quantum Computing from the Perspective of Software Development. 2022.
LibreCat: /record/45255

Anonymous, Anonymous. A Detailed Survey and Comparison of the Selected Homomorphic Encryption Libraries. 2022.
LibreCat: /record/45256

Beckmann, Marvin. Analysis of an Interactive Lattice Based Aggregated Signature Scheme. 2022.
LibreCat: /record/45257

Bobolz, Jan, et al. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. IACR eprint, 2021.
LibreCat: /record/26645

Bobolz, Jan, et al. “Issuer-Hiding Attribute-Based Credentials.”10.1007/978-3-030-92548-2_9__Cryptology and Network Security, Springer International Publishing, 2021, doi:10.1007/978-3-030-92548-2_9.
LibreCat: /record/29566
DOI: 10.1007/978-3-030-92548-2_9

Siemer, Jan Niklas. Lattice Reductions and Their Applications to Cryptographic Systems. 2021.
LibreCat: /record/32401

Anonymous, Anonymous. Performance Analysis of FHE Libraries. 2021.
LibreCat: /record/32400

Böttger, Meret Amalia Elisabeth. IND-CCA Secure PKE Schemes - Based on Lattices. 2021.
LibreCat: /record/32402

Anonymous, Anonymous. Device-Independent Security Proofs Via Entropy Accumulation. 2021.
LibreCat: /record/45254

Manegold, Philipp. On Batch Proofs of Partial Knowledge. 2020.
LibreCat: /record/21117

Anonymous, Anonymous. Measuring the Performance of SNARK Libraries. 2020.
LibreCat: /record/21118

Westerwelle, Max. Trapdoors and Sampling Procedures for Lattice-Based Cryptographic Constructions. 2020.
LibreCat: /record/21119

Anonymous, Anonymous. Benchmarking the Efficiency of Secure Multiparty Computation for Real World Problems. 2020.
LibreCat: /record/21121

Blömer, Johannes, et al. “A Complexity Theoretical Study of Fuzzy K-Means.”10.1145/3409385__ACM Transactions on Algorithms, vol. 16, no. 4, 2020, pp. 1–25, doi:10.1145/3409385.
LibreCat: /record/20888
DOI: 10.1145/3409385

Heimann, Jonas. Distributed Key Generation for Attribute-Based Signatures. 2020.
LibreCat: /record/18085

Schürmann, Patrick. A Group Signature Scheme from Flexible Public Key Signatures and Structure-Preserving Signatures on Equivalence Classes. Universität Paderborn, 2020.
LibreCat: /record/18637

Terfort, Tobias. Enhancing Security by Usage of Universal One-Way Hash Functions. Universität Paderborn, 2020.
LibreCat: /record/18639

Bobolz, Jan, et al. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.”10.1145/3320269.3384769__Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), ACM, 2020, doi:10.1145/3320269.3384769.
LibreCat: /record/16487
DOI: 10.1145/3320269.3384769

Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.”10.1007/s11634-019-00366-7__Advances in Data Analysis and Classification, vol. 14, 2020, pp. 147–173, doi:10.1007/s11634-019-00366-7.
LibreCat: /record/10790
DOI: 10.1007/s11634-019-00366-7

Löken, Nils. Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work. 2020, doi:10.17619/UNIPB/1-854.
LibreCat: /record/15482
DOI: 10.17619/UNIPB/1-854

Kramer, Paul. Comparison of Zero-Knowledge Range Proofs. Universität Paderborn, 2020.
LibreCat: /record/18638

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”10.1016/j.tcs.2018.04.048__Theoretical Computer Science, vol. 754, Elsevier, 2019, pp. 88–106, doi:10.1016/j.tcs.2018.04.048.
LibreCat: /record/2916
DOI: 10.1016/j.tcs.2018.04.048

Otte, Oliver. Outsourced Decryption of Attribute-Based Ciphertexts. 2019.
LibreCat: /record/15746

Wördenweber, Nico Christof. On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model. 2019.
LibreCat: /record/15747

Leutnant, Matthias. Experimentelle Untersuchung Des SEM-Algorithmus. 2019.
LibreCat: /record/15819

Bröcher, Henrik. Rational Secure Multiparty Computation. Universität Paderborn, 2019.
LibreCat: /record/13128

Porzenheim, Laurens Alexander. Post-Quantum Secure Group Signatures. 2019.
LibreCat: /record/10306

Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.”10.1007/978-3-030-31511-5_9__Security and Trust Management, STM 2019, vol. 11738, 2019, doi:10.1007/978-3-030-31511-5_9.
LibreCat: /record/13554
DOI: 10.1007/978-3-030-31511-5_9

Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” 12th International Symposium on Foundations and Practice of Security, FPS 2019, vol. 12056, Springer, 2019.
LibreCat: /record/13557

Pilot, Matthias. Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java. Universität Paderborn, 2019.
LibreCat: /record/13592

Scholz, Swante. Implementation and Comparison of Elliptic Curve Algorithms in Java. Universität Paderborn, 2019.
LibreCat: /record/13648

Brauer, Sascha. Classification and Approximation of Geometric Location Problems. 2019, doi:10.17619/UNIPB/1-816.
LibreCat: /record/13679
DOI: 10.17619/UNIPB/1-816

Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.”10.1145/3319535.3354223__Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019, doi:10.1145/3319535.3354223.
LibreCat: /record/13904
DOI: 10.1145/3319535.3354223

Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.”10.1007/978-3-319-76953-0_25__Topics in Cryptology - CT-RSA 2018 - The Cryptographers’ Track at the RSA Conference 2018, Proceedings, Springer International Publishing, 2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25.
LibreCat: /record/2862
DOI: 10.1007/978-3-319-76953-0_25

Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.”10.1137/17M1132045__SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, 2018, pp. 314–38, doi:10.1137/17M1132045.
LibreCat: /record/2685
DOI: 10.1137/17M1132045