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

Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.”10.1145/3230833.3234517__Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, doi:10.1145/3230833.3234517.
LibreCat: /record/3265
DOI: 10.1145/3230833.3234517

Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.”10.1145/3230833.3230853__Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, pp. 25:1--25:10, doi:10.1145/3230833.3230853.
LibreCat: /record/2965
DOI: 10.1145/3230833.3230853

Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat: /record/5820

Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.”10.4230/LIPIcs.ISAAC.2018.46__29th International Symposium on Algorithms and Computation  (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:10.4230/LIPIcs.ISAAC.2018.46.
LibreCat: /record/4344
DOI: 10.4230/LIPIcs.ISAAC.2018.46

von Heißen, Oliver. Implementierung und Analyse von Searchable Encryption. 2018.
LibreCat: /record/5426

Juhnke, Jakob. Models and Constructions for Secure Reputation Systems. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-570.
LibreCat: /record/6597
DOI: 10.17619/UNIPB/1-570

Blömer, Johannes, et al. “Enhanced Security of Attribute-Based Signatures.”10.1007/978-3-030-00434-7_12__The International Conference on Cryptology And Network Security (CANS), vol. 11124, Springer, 2018, pp. 235–55, doi:10.1007/978-3-030-00434-7_12.
LibreCat: /record/3873
DOI: 10.1007/978-3-030-00434-7_12

Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.”10.1007/978-3-319-93387-0_12__ACNS 2018 Applied Cryptography &; Network Security, doi:10.1007/978-3-319-93387-0_12.
LibreCat: /record/2379
DOI: 10.1007/978-3-319-93387-0_12

Bujna, Kathrin. Soft Clustering Algorithms - Theoretical and Practical Improvements. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-226.
LibreCat: /record/2908
DOI: 10.17619/UNIPB/1-226

Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.”10.1007/978-3-319-72453-9_35__Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), vol. 10693, Springer International Publishing, 2017, pp. 438–53, doi:10.1007/978-3-319-72453-9_35.
LibreCat: /record/2967
DOI: 10.1007/978-3-319-72453-9_35

Liske, Gennadij. CCA-Security for Predicate Encryption Schemes. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-220.
LibreCat: /record/116
DOI: 10.17619/UNIPB/1-220

Löken, Nils. “Searchable Encryption with Access Control.”10.1145/3098954.3098987__Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17, 24, ACM Press, 2017, doi:10.1145/3098954.3098987.
LibreCat: /record/2343
DOI: 10.1145/3098954.3098987

Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.”10.1007/978-3-319-75650-9_1__Foundations and Practice of Security, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-75650-9_1.
LibreCat: /record/2344
DOI: 10.1007/978-3-319-75650-9_1

Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.”10.1007/978-3-319-57586-5_11__Lecture Notes in Computer Science, edited by Dimitris Fotakis et al., vol. 10236, Springer International Publishing, 2017, pp. 116–27, doi:10.1007/978-3-319-57586-5_11.
LibreCat: /record/2381
DOI: 10.1007/978-3-319-57586-5_11

Niehus, David. Semantically Secure Attribute-Based Searchable Encryption. Universität Paderborn, 2017.
LibreCat: /record/60

Ganesh Athreya, Advait. Instantiating a Predicate Encryption Scheme via Pair Encodings. Universität Paderborn, 2017.
LibreCat: /record/88

Jürgens, Mirko. Provably Secure Key-Derivation-Functions for Certain Types of Applications. Universität Paderborn, 2017.
LibreCat: /record/67

Diemert, Denis. EAX - An Authenticated Encryption Mode for Block Ciphers. Universität Paderborn, 2017.
LibreCat: /record/104

Bemmann, Pascal. Attribute-Based Signatures Using Structure Preserving Signatures. Universität Paderborn, 2017.
LibreCat: /record/117

Weis, Eduard. Searchable Encryption. 2016.
LibreCat: /record/2898

Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.”10.1109/fdtc.2015.17__2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2016, doi:10.1109/fdtc.2015.17.
LibreCat: /record/2947
DOI: 10.1109/fdtc.2015.17

Günther, Peter, and Volker Krummel. “Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures.”10.1007/978-3-319-32859-1_13__Mathematical Aspects of Computer and Information Sciences, Springer International Publishing, 2016, pp. 151–65, doi:10.1007/978-3-319-32859-1_13.
LibreCat: /record/2948
DOI: 10.1007/978-3-319-32859-1_13

Blömer, Johannes, et al. “Theoretical Analysis of the K-Means Algorithm – A Survey.”10.1007/978-3-319-49487-6_3__Algorithm Engineering, Springer International Publishing, 2016, pp. 81–116, doi:10.1007/978-3-319-49487-6_3.
LibreCat: /record/2968
DOI: 10.1007/978-3-319-49487-6_3

Blömer, Johannes, et al. Hard-Clustering with Gaussian Mixture Models. Computing Research Repository, 2016.
LibreCat: /record/2969

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”10.1007/978-3-319-31750-2_24__Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.
LibreCat: /record/2970
DOI: 10.1007/978-3-319-31750-2_24

Blömer, Johannes, and Peter Günther. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
LibreCat: /record/2971

Porzenheim, Laurens. Comparison of Different Definitions of Chosen-Ciphertext Security in Encryption Schemes. Universität Paderborn, 2016.
LibreCat: /record/213

Bemmann, Kai Sören. Commitment Schemes - Definitions, Variants, and Security. Universität Paderborn, 2016.
LibreCat: /record/214

Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.”10.1109/icdm.2016.0094__2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–10, doi:10.1109/icdm.2016.0094.
LibreCat: /record/2367
DOI: 10.1109/icdm.2016.0094

Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.”10.1007/978-3-319-29485-8_25__Proceedings of the CT-RSA 2016, 2016, pp. 431–47, doi:10.1007/978-3-319-29485-8_25.
LibreCat: /record/208
DOI: 10.1007/978-3-319-29485-8_25

Günther, Peter. Physical Attacks on Pairing-Based Cryptography. Universität Paderborn, 2016.
LibreCat: /record/167

Hamm, Julian. Symmetric Anonymous Credentials with Protocols for Relations on Attributes. Universität Paderborn, 2016.
LibreCat: /record/146

Dallmeier, Fynn. Short Randomizable Aggregatable Signatures: Constructions and Security Analysis. Universität Paderborn, 2016.
LibreCat: /record/152

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”10.1007/978-3-319-31750-2_24__Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.
LibreCat: /record/2978
DOI: 10.1007/978-3-319-31750-2_24

Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.”10.1007/978-3-319-32859-1_14__Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–80, doi:10.1007/978-3-319-32859-1_14.
LibreCat: /record/253
DOI: 10.1007/978-3-319-32859-1_14

Kalde, Benedikt. Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup. Universität Paderborn, 2015.
LibreCat: /record/286

Strotmann, Daniela. Singulärwertzerlegung Für ;c-Ähnliche Bregman-Divergenzen. 2015.
LibreCat: /record/2865

Eisenhofer, Thorsten. Protokolle zur authentifizierten Schüsselvereinbarung. Universität Paderborn, 2015.
LibreCat: /record/261

Eidens, Fabian. Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption. Universität Paderborn, 2015.
LibreCat: /record/321

Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.”10.1007/978-3-662-47854-7_29__Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488, doi:10.1007/978-3-662-47854-7_29.
LibreCat: /record/322
DOI: 10.1007/978-3-662-47854-7_29

Löken, Nils. A Group Signature Scheme with Distributed Group Management - An Application of Threshold Encryption. Universität Paderborn, 2015.
LibreCat: /record/325

Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption. Universität Paderborn, 2015.
LibreCat: /record/326

Sosniak, Martin. Evaluation of Pairing Optimization for Embedded Platforms. Universität Paderborn, 2015.
LibreCat: /record/297

Gerken, Britta. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie. Universität Paderborn, 2015.
LibreCat: /record/299

Bobolz, Jan. Efficient Verifier-Local Revocation for Anonymous Credentials. Universität Paderborn, 2015.
LibreCat: /record/301

Stroh, Christian. Efficient Attributes for Pairing-Based Anonymous Credentials. Universität Paderborn, 2015.
LibreCat: /record/302

Schleiter, Patrick. Constructions of Fully Secure Predicate Encryption Schemes. Universität Paderborn, 2015.
LibreCat: /record/312

Kohn, Kathlén. Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.
LibreCat: /record/273

Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.
LibreCat: /record/233

Biermeier, Felix. Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen Bezüglich Den Komplexitätsklassen L Und SL. 2014.
LibreCat: /record/2866

Sauer, Malte. Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen. 2014.
LibreCat: /record/2867

Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.”10.1109/FDTC.2014.10__Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7, doi:10.1109/FDTC.2014.10.
LibreCat: /record/355
DOI: 10.1109/FDTC.2014.10

Rath, Timo. RSA-Full Domain Hash Revisited. Universität Paderborn, 2014.
LibreCat: /record/369

Brauer, Sascha. A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures. 2014.
LibreCat: /record/2900

Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.”10.1007/s00453-012-9717-4__Algorithmica, vol. 69, Springer US, 2014, doi:10.1007/s00453-012-9717-4.
LibreCat: /record/2976
DOI: 10.1007/s00453-012-9717-4

Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.”10.1109/icpr.2014.253__2014 22nd International Conference on Pattern Recognition, IEEE, 2014, doi:10.1109/icpr.2014.253.
LibreCat: /record/2977
DOI: 10.1109/icpr.2014.253

Blömer, Johannes, and Gennadij Liske. Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions. Universität Paderborn, 2014.
LibreCat: /record/442

Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.”10.1109/FDTC.2014.22__Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136, doi:10.1109/FDTC.2014.22.
LibreCat: /record/463
DOI: 10.1109/FDTC.2014.22

Jochheim, Janek. Hiding Software Components Using Functional Encryption. Universität Paderborn, 2014.
LibreCat: /record/414

Bemmann, Pascal. Group Signature Schemes with Strong Exculpability. Universität Paderborn, 2014.
LibreCat: /record/416

Lippert, Jan. Fujisaki-Okamoto Transformation. Universität Paderborn, 2014.
LibreCat: /record/421

Laudemann, Stefan. Themenmodellierung Zur Identifikation Und Gruppierung von Spam-Webseiten. 2013.
LibreCat: /record/2868

Leder, Lennart. Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering Unter Verwendung von L_p-Metriken. 2013.
LibreCat: /record/2869

Kuntze, Daniel. Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements. Universität Paderborn, 2013.
LibreCat: /record/2909

Juhnke, Jakob, et al. An Approach for Determining Optimal Contrast in Visual Cryptography. Fortschritt-Berichte VDI, 2013.
LibreCat: /record/2917

Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.”10.1007/978-3-642-40026-1_10__Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, 2013, pp. 154–68, doi:10.1007/978-3-642-40026-1_10.
LibreCat: /record/2979
DOI: 10.1007/978-3-642-40026-1_10

Tezer, Alina. Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.
LibreCat: /record/471

Otte, Oliver. Seitenkanalresistenz paarungsbasierter Kryptographie. Universität Paderborn, 2013.
LibreCat: /record/486

Bobolz, Jan. Security Proofs for Pairing-Based Cryptography in the Generic Group Model. Universität Paderborn, 2013.
LibreCat: /record/487

Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.
LibreCat: /record/488

Blömer, Johannes, and Gennadij Liske. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn, 2013.
LibreCat: /record/538

Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.
LibreCat: /record/553

Ackermann, Marcel Rudolf, et al. StreamKM++: A Clustering Algorithm for Data Streams. Vol. 17, ACM, 2012, doi:10.1145/2133803.2184450.
LibreCat: /record/2982
DOI: 10.1145/2133803.2184450

Blömer, Johannes. “Turing Und Kryptografie.”10.1007/s00287-012-0622-7__Informatik-Spektrum, vol. 35, no. 4, 2012, doi:10.1007/s00287-012-0622-7.
LibreCat: /record/2984
DOI: 10.1007/s00287-012-0622-7

Löken, Nils. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012.
LibreCat: /record/606

Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.
LibreCat: /record/607

Schleiter, Patrick. Attribute-basierte Verschlüsselung. Universität Paderborn, 2012.
LibreCat: /record/629

Böttger, Timm. Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen. 2011.
LibreCat: /record/2872

Märtens, Marcus. The Monotone Complexity of Computing K-Clique on Random Graphs. 2011.
LibreCat: /record/2902

Naewe, Stefanie. Algorithms for Lattice Problems with Respect to General Norms. Universität Paderborn, 2011.
LibreCat: /record/2910

Ackermann, Marcel R., et al. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.
LibreCat: /record/2985

Blömer, Johannes. “How to Share a Secret.”10.1007/978-3-642-15328-0_17__Algorithms Unplugged, Springer Berlin Heidelberg, 2011, pp. 159–68, doi:10.1007/978-3-642-15328-0_17.
LibreCat: /record/2986
DOI: 10.1007/978-3-642-15328-0_17

Blömer, Johannes, and Stefanie Naewe. “Solving the Closest Vector Problem with Respect to Lp Norms.” ArXiv:1104.3720, 2011.
LibreCat: /record/2987

Liske, Gennadij. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn, 2011.
LibreCat: /record/659

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”10.1007/978-3-642-13731-0_21__SWAT 2010, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:10.1007/978-3-642-13731-0_21.
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

Ackermann, Marcel R., et al. “Clustering for Metric and Nonmetric Distance Measures.”10.1145/1824777.1824779__ACM Trans. Algorithms, no. 4, 2010, pp. 59:1--59:26, doi:10.1145/1824777.1824779.
LibreCat: /record/2990
DOI: 10.1145/1824777.1824779

Krueger, Alexander, et al. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat: /record/2991

Schrieb, Jonas. Efficient and Compact CCA Security from Partitioned IBKEM. 2010.
LibreCat: /record/2993

Schäfer, Wilhelm, et al. “Engineering Self-Coordinating Software Intensive Systems.”10.1145/1882362.1882428__Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010, doi:10.1145/1882362.1882428.
LibreCat: /record/2994
DOI: 10.1145/1882362.1882428

Postler, Tim. Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung. 2010.
LibreCat: /record/47684