Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
79 Publications
2018 | Conference Paper | LibreCat-ID: 3265 | 
Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation System. In Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3234517
LibreCat
| Files available
| DOI
| Download (ext.)
2016 | Preprint | LibreCat-ID: 2969 |
Blömer, J., Brauer, S., & Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository.
LibreCat
| Download (ext.)
2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, M. R., Blömer, J., & Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.
LibreCat
1992 | Conference Paper | LibreCat-ID: 3047
Blömer, J. (1992). How to denest Ramanujan’s nested radicals. In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE. https://doi.org/10.1109/sfcs.1992.267807
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 2986
Blömer, J. (2011). How to Share a Secret. In Algorithms Unplugged (pp. 159–168). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_17
LibreCat
| DOI
2020 | Journal Article | LibreCat-ID: 10790
Blömer, J., Brauer, S., Bujna, K., & Kuntze, D. (2020). How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. Advances in Data Analysis and Classification, 14, 147–173. https://doi.org/10.1007/s11634-019-00366-7
LibreCat
| DOI
2013 | Book Chapter | LibreCat-ID: 2979
Blömer, J., Günther, P., & Liske, G. (2013). Improved Side Channel Attacks on Pairing Based Cryptography. In Constructive Side-Channel Analysis and Secure Design (pp. 154–168). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-40026-1_10
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3021
Blömer, J., & May, A. (2007). Key Revocation with Interval Cover Families. In Selected Areas in Cryptography (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45537-x_26
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3020
Blömer, J., & May, A. (2007). Low Secret Exponent RSA Revisited. In Lecture Notes in Computer Science (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44670-2_2
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, J., & May, A. (2003). New Partial Key Exposure Attacks on RSA. In Advances in Cryptology - CRYPTO 2003 (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45146-4_2
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, J., & Seifert, J.-P. (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99. https://doi.org/10.1145/301250.301441
LibreCat
| Files available
| DOI
2023 | Conference Paper | LibreCat-ID: 35014 |
Blömer, J., Bobolz, J., & Bröcher, H. (2023). On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. TCC 2023, Taipeh, Taiwan.
LibreCat
| Download (ext.)
2010 | Journal Article | LibreCat-ID: 2991
Krueger, A., Leutnant, V., Haeb-Umbach, R., Ackermann, M., & Blömer, J. (2010). On the initialization of dynamic models for speech features. Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany.
LibreCat
2019 | Conference Paper | LibreCat-ID: 13554 |
Blömer, J., & Löken, N. (2019). Personal Cross-Platform Reputation. In Security and Trust Management, STM 2019 (Vol. 11738). https://doi.org/10.1007/978-3-030-31511-5_9
LibreCat
| Files available
| DOI
2023 | Book Chapter | LibreCat-ID: 45901 |
Blömer, J., Bobolz, J., Eidens, F., Jager, T., & Kramer, P. (2023). Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 237–246). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068755
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 2862 |
Blömer, J., Eidens, F., & Juhnke, J. (2018). Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings (pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25
LibreCat
| Files available
| DOI
| Download (ext.)
2002 | Journal Article | LibreCat-ID: 3034
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. IEEE Transactions on Information Theory, 42(6), 1737–1744. https://doi.org/10.1109/18.556670
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1994.365731
LibreCat
| DOI
2018 | Working Paper | LibreCat-ID: 5820
Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat
| Files available
2004 | Book Chapter | LibreCat-ID: 3011
Blömer, J., Guajardo, J., & Krummel, V. (2004). Provably Secure Masking of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_5
LibreCat
| DOI