Hemmrich, Simon, Jan Bobolz, Daniel Beverungen, and Johannes Blömer. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” In ECIS 2023 Research Papers, 2023.
LibreCat: /record/44855

Blömer, Johannes, Jan Bobolz, and Henrik Bröcher. “On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC,” 2023.
LibreCat: /record/35014

Blömer, Johannes, Jan Bobolz, and Laurens Alexander Porzenheim. “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” 2023.
LibreCat: /record/43458

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

Bobolz, Jan, Fabian Eidens, Raphael Heitjohann, and Jeremy Fell. “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.
LibreCat: /record/26645

Bobolz, Jan, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, and Kai Samelin. “Issuer-Hiding Attribute-Based Credentials.”https://doi.org/10.1007/978-3-030-92548-2_9__In Cryptology and Network Security. Cham: Springer International Publishing, 2021.https://doi.org/10.1007/978-3-030-92548-2_9 .
LibreCat: /record/29566
DOI: 10.1007/978-3-030-92548-2_9

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical Study of Fuzzy K-Means.”https://doi.org/10.1145/3409385__ACM Transactions on Algorithms 16, no. 4 (2020): 1–25.https://doi.org/10.1145/3409385 .
LibreCat: /record/20888
DOI: 10.1145/3409385

Bobolz, Jan, Fabian Eidens, Stephan Krenn, Daniel Slamanig, and Christoph Striecks. “Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection.”https://doi.org/10.1145/3320269.3384769__In Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),. New York, NY, USA: ACM, 2020.https://doi.org/10.1145/3320269.3384769 .
LibreCat: /record/16487
DOI: 10.1145/3320269.3384769

Blömer, Johannes, Sascha Brauer, Kathrin Bujna, and Daniel Kuntze. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.”https://doi.org/10.1007/s11634-019-00366-7__Advances in Data Analysis and Classification 14 (2020): 147–173.https://doi.org/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.https://doi.org/10.17619/UNIPB/1-854 .
LibreCat: /record/15482
DOI: 10.17619/UNIPB/1-854

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

Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.”https://doi.org/10.1007/978-3-030-31511-5_9__In Security and Trust Management, STM 2019, Vol. 11738. LNCS, 2019.https://doi.org/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.” In 12th International Symposium on Foundations and Practice of Security, FPS 2019, Vol. 12056. LNCS. Springer, 2019.
LibreCat: /record/13557

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

Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens. “Updatable Anonymous Credentials and Applications to Incentive Systems.”https://doi.org/10.1145/3319535.3354223__In Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.https://doi.org/10.1145/3319535.3354223 .
LibreCat: /record/13904
DOI: 10.1145/3319535.3354223

Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.”https://doi.org/10.1007/978-3-319-76953-0_25__In Topics in Cryptology - CT-RSA 2018 - The Cryptographers’ Track at the RSA Conference 2018, Proceedings, 470–90. Cham: Springer International Publishing, 2018.https://doi.org/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.”https://doi.org/10.1137/17M1132045__SIAM Journal on Applied Algebra and Geometry. 2, no. 2 (2018): 314–38.https://doi.org/10.1137/17M1132045 .
LibreCat: /record/2685
DOI: 10.1137/17M1132045

Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials with Reputation System.”https://doi.org/10.1145/3230833.3234517__In Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM, n.d.https://doi.org/10.1145/3230833.3234517 .
LibreCat: /record/3265
DOI: 10.1145/3230833.3234517

Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.”https://doi.org/10.1145/3230833.3230853__In Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, 25:1--25:10. New York, NY, USA: ACM, n.d.https://doi.org/10.1145/3230833.3230853 .
LibreCat: /record/2965
DOI: 10.1145/3230833.3230853

Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. Provably Anonymous Communication Based on Trusted Execution Environments, n.d.
LibreCat: /record/5820

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy K-Means with Applications.”https://doi.org/10.4230/LIPIcs.ISAAC.2018.46__In 29th International Symposium on Algorithms and Computation  (ISAAC 2018), 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.https://doi.org/10.4230/LIPIcs.ISAAC.2018.46 .
LibreCat: /record/4344
DOI: 10.4230/LIPIcs.ISAAC.2018.46

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

Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Enhanced Security of Attribute-Based Signatures.”https://doi.org/10.1007/978-3-030-00434-7_12__In The International Conference on Cryptology And Network Security (CANS), 11124:235–55. Lecture Notes in Computer Science. Springer, 2018.https://doi.org/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.”https://doi.org/10.1007/978-3-319-93387-0_12__In ACNS 2018 Applied Cryptography &; Network Security. LNCS, n.d.https://doi.org/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.https://doi.org/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.”https://doi.org/10.1007/978-3-319-72453-9_35__In Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), 10693:438–53. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017.https://doi.org/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.https://doi.org/10.17619/UNIPB/1-220 .
LibreCat: /record/116
DOI: 10.17619/UNIPB/1-220

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

Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.”https://doi.org/10.1007/978-3-319-75650-9_1__In Foundations and Practice of Security, 3–17. Cham: Springer International Publishing, 2017.https://doi.org/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.”https://doi.org/10.1007/978-3-319-57586-5_11__In Lecture Notes in Computer Science, edited by Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, 10236:116–27. Cham: Springer International Publishing, 2017.https://doi.org/10.1007/978-3-319-57586-5_11 .
LibreCat: /record/2381
DOI: 10.1007/978-3-319-57586-5_11

Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.”https://doi.org/10.1109/fdtc.2015.17__In 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE, 2016.https://doi.org/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.”https://doi.org/10.1007/978-3-319-32859-1_13__In Mathematical Aspects of Computer and Information Sciences, 151–65. Cham: Springer International Publishing, 2016.https://doi.org/10.1007/978-3-319-32859-1_13 .
LibreCat: /record/2948
DOI: 10.1007/978-3-319-32859-1_13

Blömer, Johannes, Christiane Lammersen, Melanie Schmidt, and Christian Sohler. “Theoretical Analysis of the K-Means Algorithm – A Survey.”https://doi.org/10.1007/978-3-319-49487-6_3__In Algorithm Engineering, 81–116. Cham: Springer International Publishing, 2016.https://doi.org/10.1007/978-3-319-49487-6_3 .
LibreCat: /record/2968
DOI: 10.1007/978-3-319-49487-6_3

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “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.”https://doi.org/10.1007/978-3-319-31750-2_24__In Advances in Knowledge Discovery and Data Mining, 296–308. Cham: Springer International Publishing, 2016.https://doi.org/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

Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis of the Fuzzy K-Means Problem.”https://doi.org/10.1109/icdm.2016.0094__In 2016 IEEE 16th International Conference on Data Mining (ICDM), 805–10. IEEE, 2016.https://doi.org/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.”https://doi.org/10.1007/978-3-319-29485-8_25__In Proceedings of the CT-RSA 2016, 431–47. LNCS, 2016.https://doi.org/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

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

Blömer, Johannes, Jakob Juhnke, and Nils Löken. “Short Group Signatures with Distributed Traceability.”https://doi.org/10.1007/978-3-319-32859-1_14__In Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 166–80. LNCS, 2015.https://doi.org/10.1007/978-3-319-32859-1_14 .
LibreCat: /record/253
DOI: 10.1007/978-3-319-32859-1_14

Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly Linkable Reputation Systems.”https://doi.org/10.1007/978-3-662-47854-7_29__In Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 478--488. LNCS, 2015.https://doi.org/10.1007/978-3-662-47854-7_29 .
LibreCat: /record/322
DOI: 10.1007/978-3-662-47854-7_29

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

Blömer, Johannes, Peter Günther, and Gennadij Liske. “Tampering Attacks in Pairing-Based Cryptography.”https://doi.org/10.1109/FDTC.2014.10__In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 1--7, 2014.https://doi.org/10.1109/FDTC.2014.10 .
LibreCat: /record/355
DOI: 10.1109/FDTC.2014.10

Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian Sohler. “Analysis of Agglomerative Clustering.”https://doi.org/10.1007/s00453-012-9717-4__Algorithmica 69 (2014).https://doi.org/10.1007/s00453-012-9717-4 .
LibreCat: /record/2976
DOI: 10.1007/s00453-012-9717-4

Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.”https://doi.org/10.1109/icpr.2014.253__In 2014 22nd International Conference on Pattern Recognition. IEEE, 2014.https://doi.org/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, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer, and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.”https://doi.org/10.1109/FDTC.2014.22__In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 123--136, 2014.https://doi.org/10.1109/FDTC.2014.22 .
LibreCat: /record/463
DOI: 10.1109/FDTC.2014.22

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

Juhnke, Jakob, Hanno Lefmann, and Volker Strehl. An Approach for Determining Optimal Contrast in Visual Cryptography. Fortschritt-Berichte VDI, 2013.
LibreCat: /record/2917

Blömer, Johannes, Peter Günther, and Gennadij Liske. “Improved Side Channel Attacks on Pairing Based Cryptography.”https://doi.org/10.1007/978-3-642-40026-1_10__In Constructive Side-Channel Analysis and Secure Design, 154–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.https://doi.org/10.1007/978-3-642-40026-1_10 .
LibreCat: /record/2979
DOI: 10.1007/978-3-642-40026-1_10

Blömer, Johannes, Peter Günther, and Volker Krummel. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” In Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 98–105, 2013.
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

Ackermann, Marcel Rudolf, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, and Christian Sohler. “StreamKM++: A Clustering Algorithm for Data Streams.”https://doi.org/10.1145/2133803.2184450__ACM Journal of Experimental Algorithmics. New York, NY, USA: ACM, 2012.https://doi.org/10.1145/2133803.2184450 .
LibreCat: /record/2982
DOI: 10.1145/2133803.2184450

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

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

Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011.
LibreCat: /record/2985

Blömer, Johannes. “How to Share a Secret.”https://doi.org/10.1007/978-3-642-15328-0_17__In Algorithms Unplugged, 159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011.https://doi.org/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

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”https://doi.org/10.1007/978-3-642-13731-0_21__In SWAT 2010, 212–23. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.https://doi.org/10.1007/978-3-642-13731-0_21 .
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering for Metric and Nonmetric Distance Measures.”https://doi.org/10.1145/1824777.1824779__ACM Trans. Algorithms, no. 4 (2010): 59:1--59:26.https://doi.org/10.1145/1824777.1824779 .
LibreCat: /record/2990
DOI: 10.1145/1824777.1824779

Krueger, Alexander, Volker Leutnant, Reinhold Haeb-Umbach, Marcel Ackermann, and Johannes Blömer. “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.” Proceedings of the 3rd Western European Workshop on Research in Cryptology, 2010.
LibreCat: /record/2993

Schäfer, Wilhelm, Ansgar Trächtler, Mauro Birattari, Johannes Blömer, Marco Dorigo, Gregor Engels, Rehan O’Grady, Marco Platzner, Franz Rammig, and Wolfgang Reif. “Engineering Self-Coordinating Software Intensive Systems.”https://doi.org/10.1145/1882362.1882428__In Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10. ACM Press, 2010.https://doi.org/10.1145/1882362.1882428 .
LibreCat: /record/2994
DOI: 10.1145/1882362.1882428

Ackermann, Marcel Rudolf. Algorithms for the Bregman K-Median Problem. Universität Paderborn, 2009.
LibreCat: /record/2911

Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.”https://doi.org/10.1137/1.9781611973068.118__In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 1088–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009.https://doi.org/10.1137/1.9781611973068.118 .
LibreCat: /record/2995
DOI: 10.1137/1.9781611973068.118

Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.”https://doi.org/10.1016/j.tcs.2008.12.045__Theoretical Computer Science, no. 18 (2009): 1648–65.https://doi.org/10.1016/j.tcs.2008.12.045 .
LibreCat: /record/2999
DOI: 10.1016/j.tcs.2008.12.045

Schrieb, Jonas, Heike Wehrheim, and Daniel Wonisch. “Three-Valued Spotlight Abstractions.”https://doi.org/10.1007/978-3-642-05089-3_8__In FM 2009: Formal Methods, 106–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.https://doi.org/10.1007/978-3-642-05089-3_8 .
LibreCat: /record/3000
DOI: 10.1007/978-3-642-05089-3_8

Stern, Claudius, Philipp Adelt, Volker Krummel, and Marcel Rudolf Ackermann. “Reliable Evidence of Data Integrity from an Untrusted Storage Service.”https://doi.org/10.1109/icns.2008.28__In Fourth International Conference on Networking and Services (Icns 2008). IEEE, 2008.https://doi.org/10.1109/icns.2008.28 .
LibreCat: /record/3001
DOI: 10.1109/icns.2008.28

Krummel, Volker. Tamper Resistance of AES -- Models, Attacks and Countermeasures. Universität Paderborn, 2007.
LibreCat: /record/2912

Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.”https://doi.org/10.1007/978-3-540-77360-3_7__In Selected Areas in Cryptography, 96–109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/978-3-540-77360-3_7 .
LibreCat: /record/3002
DOI: 10.1007/978-3-540-77360-3_7

May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”https://doi.org/10.1007/3-540-45708-9_16__In Advances in Cryptology — CRYPTO 2002, 242–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-45708-9_16 .
LibreCat: /record/3019
DOI: 10.1007/3-540-45708-9_16

Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.”https://doi.org/10.1007/3-540-44670-2_2__In Lecture Notes in Computer Science, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-44670-2_2 .
LibreCat: /record/3020
DOI: 10.1007/3-540-44670-2_2

Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.”https://doi.org/10.1007/3-540-45537-x_26__In Selected Areas in Cryptography, 325–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-45537-x_26 .
LibreCat: /record/3021
DOI: 10.1007/3-540-45537-x_26

May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.”https://doi.org/10.1007/3-540-44670-2_10__In Lecture Notes in Computer Science, 110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-44670-2_10 .
LibreCat: /record/3022
DOI: 10.1007/3-540-44670-2_10

Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.”https://doi.org/10.1007/3-540-68530-8_13__In Algorithms — ESA’ 98, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-68530-8_13 .
LibreCat: /record/3026
DOI: 10.1007/3-540-68530-8_13

Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.”https://doi.org/10.3217/jucs-012-06-0654__Journal of Universal Computer Science (J.UCS), no. 6 (2006): 654--671.https://doi.org/10.3217/jucs-012-06-0654 .
LibreCat: /record/3003
DOI: 10.3217/jucs-012-06-0654

Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”https://doi.org/10.1007/11889700_11__In Lecture Notes in Computer Science, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11889700_11 .
LibreCat: /record/3004
DOI: 10.1007/11889700_11

Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.”https://doi.org/10.1007/11889700_2__In Lecture Notes in Computer Science, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11889700_2 .
LibreCat: /record/3005
DOI: 10.1007/11889700_2

Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”https://doi.org/10.1007/11889700_4__In Lecture Notes in Computer Science, 36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11889700_4 .
LibreCat: /record/3007
DOI: 10.1007/11889700_4

Otto, Martin. Fault Attacks and Countermeasures. Universität Paderborn, 2005.
LibreCat: /record/2913

Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.”https://doi.org/10.1007/11426639_15__In EUROCRYPT 2005, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005.https://doi.org/10.1007/11426639_15 .
LibreCat: /record/3006
DOI: 10.1007/11426639_15

Ernst, Matthias, Ellen Jochemsz, Alexander May, and Benne de Weger. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.”https://doi.org/10.1007/11426639_22__In EUROCRYPT 2005, 371–86. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005.https://doi.org/10.1007/11426639_22 .
LibreCat: /record/3010
DOI: 10.1007/11426639_22

Blömer, Johannes, Jorge Guajardo, and Volker Krummel. “Provably Secure Masking of AES.”https://doi.org/10.1007/978-3-540-30564-4_5__In Selected Areas in Cryptography, 69–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-30564-4_5 .
LibreCat: /record/3011
DOI: 10.1007/978-3-540-30564-4_5

Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”https://doi.org/10.1007/978-3-540-24632-9_1__In Public Key Cryptography – PKC 2004, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-24632-9_1 .
LibreCat: /record/3012
DOI: 10.1007/978-3-540-24632-9_1

May, Alexander. “Secret Exponent Attacks on RSA-Type Schemes with Moduli N=p^rq.”https://doi.org/10.1007/978-3-540-24632-9_16__In Public Key Cryptography – PKC 2004, 218–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-24632-9_16 .
LibreCat: /record/3014
DOI: 10.1007/978-3-540-24632-9_16

May, Alexander. “Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring.”https://doi.org/10.1007/978-3-540-28628-8_13__In Advances in Cryptology – CRYPTO 2004, 213–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.https://doi.org/10.1007/978-3-540-28628-8_13 .
LibreCat: /record/3015
DOI: 10.1007/978-3-540-28628-8_13

Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.”https://doi.org/10.1145/948109.948151__In Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03. ACM Press, 2004.https://doi.org/10.1145/948109.948151 .
LibreCat: /record/3017
DOI: 10.1145/948109.948151

May, Alexander. New RSA Vulnerabilities Using Lattice Reduction Methods. Universität Paderborn, 2003.
LibreCat: /record/2914

Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.”https://doi.org/10.1007/978-3-540-45146-4_2__In Advances in Cryptology - CRYPTO 2003, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003.https://doi.org/10.1007/978-3-540-45146-4_2 .
LibreCat: /record/3016
DOI: 10.1007/978-3-540-45146-4_2

Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).”https://doi.org/10.1007/978-3-540-45126-6_12__In Financial Cryptography, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003.https://doi.org/10.1007/978-3-540-45126-6_12 .
LibreCat: /record/3018
DOI: 10.1007/978-3-540-45126-6_12

Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu Sudan. “Priority Encoding Transmission.”https://doi.org/10.1109/18.556670__IEEE Transactions on Information Theory 42, no. 6 (2002): 1737–44.https://doi.org/10.1109/18.556670 .
LibreCat: /record/3034
DOI: 10.1109/18.556670

Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority Encoding Transmission.”https://doi.org/10.1109/sfcs.1994.365731__In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press, 2002.https://doi.org/10.1109/sfcs.1994.365731 .
LibreCat: /record/3040
DOI: 10.1109/sfcs.1994.365731

Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.”https://doi.org/10.1109/sfcs.1991.185434__In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 2002.https://doi.org/10.1109/sfcs.1991.185434 .
LibreCat: /record/3041
DOI: 10.1109/sfcs.1991.185434

Blömer, J. “Denesting by Bounded Degree Radicals.”https://doi.org/10.1007/s004530010028__Algorithmica 28, no. 1 (2002): 2–15.https://doi.org/10.1007/s004530010028 .
LibreCat: /record/35857
DOI: 10.1007/s004530010028

Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.”https://doi.org/10.1007/3-540-45022-x_22__In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000.https://doi.org/10.1007/3-540-45022-x_22 .
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.”https://doi.org/10.1145/301250.301441__In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99. ACM Press, 1999.https://doi.org/10.1145/301250.301441 .
LibreCat: /record/3024
DOI: 10.1145/301250.301441

Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” Technical Report/Departement of Computer Science, ETH Zürich, 1998.
LibreCat: /record/3028

Blömer, Johannes. “Denesting by Bounded Degree Radicals.”https://doi.org/10.1007/3-540-63397-9_5__In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997.https://doi.org/10.1007/3-540-63397-9_5 .
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random Matrices over Finite Fields.”https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y__Random Structures \'26; Algorithms, no. 4 (1997): 407–19.https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y .
LibreCat: /record/3033
DOI: 10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y