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 | OA
K. Bemmann et al., “Fully-Featured Anonymous Credentials with Reputation System,” in Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, Hamburg, Germany.
LibreCat | Files available | DOI | Download (ext.)
 

2016 | Preprint | LibreCat-ID: 2969 | OA
J. Blömer, S. Brauer, and K. Bujna, “Hard-Clustering with Gaussian Mixture Models.” Computing Research Repository, 2016.
LibreCat | Download (ext.)
 

2011 | Conference Paper | LibreCat-ID: 2985
M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability of Bregman Clustering Problems.” 2011.
LibreCat
 

1992 | Conference Paper | LibreCat-ID: 3047
J. Blömer, “How to denest Ramanujan’s nested radicals,” in Proceedings., 33rd Annual Symposium on Foundations of Computer Science, 1992.
LibreCat | DOI
 

2011 | Book Chapter | LibreCat-ID: 2986
J. Blömer, “How to Share a Secret,” in Algorithms Unplugged, Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.
LibreCat | DOI
 

2020 | Journal Article | LibreCat-ID: 10790
J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models,” Advances in Data Analysis and Classification, vol. 14, pp. 147–173, 2020.
LibreCat | DOI
 

2013 | Book Chapter | LibreCat-ID: 2979
J. Blömer, P. Günther, and G. Liske, “Improved Side Channel Attacks on Pairing Based Cryptography,” in Constructive Side-Channel Analysis and Secure Design, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 154–168.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3021
J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3020
J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3016
J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in Advances in Cryptology - CRYPTO 2003, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.
LibreCat | DOI
 

1999 | Conference Paper | LibreCat-ID: 3024
J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly independent vectors and short bases in a lattice,” 1999, doi: 10.1145/301250.301441.
LibreCat | Files available | DOI
 

2023 | Conference Paper | LibreCat-ID: 35014 | OA
J. Blömer, J. Bobolz, and H. Bröcher, “On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC,” presented at the TCC 2023, Taipeh, Taiwan, 2023.
LibreCat | Download (ext.)
 

2010 | Journal Article | LibreCat-ID: 2991
A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, and J. Blömer, “On the initialization of dynamic models for speech features,” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat
 

2019 | Conference Paper | LibreCat-ID: 13554 | OA
J. Blömer and N. Löken, “Personal Cross-Platform Reputation,” in Security and Trust Management, STM 2019, 2019, vol. 11738.
LibreCat | Files available | DOI
 

2023 | Book Chapter | LibreCat-ID: 45901 | OA
J. Blömer, J. Bobolz, F. Eidens, T. Jager, and P. Kramer, “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–246.
LibreCat | Files available | DOI
 

2018 | Conference Paper | LibreCat-ID: 2862 | OA
J. Blömer, F. Eidens, and J. Juhnke, “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, San Francisco, CA, USA, 2018, pp. 470–490.
LibreCat | Files available | DOI | Download (ext.)
 

2002 | Journal Article | LibreCat-ID: 3034
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1737–1744, 2002.
LibreCat | Files available | DOI
 

2002 | Conference Paper | LibreCat-ID: 3040
A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” in Proceedings 35th Annual Symposium on Foundations of Computer Science, 2002.
LibreCat | DOI
 

2018 | Working Paper | LibreCat-ID: 5820
J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments. .
LibreCat | Files available
 

2004 | Book Chapter | LibreCat-ID: 3011
J. Blömer, J. Guajardo, and V. Krummel, “Provably Secure Masking of AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 69–83.
LibreCat | DOI
 

Filters and Search Terms

(person=23)

status=public

Search

Filter Publications

Display / Sort

Sorted by: Title , First Author
Citation Style: IEEE

Export / Embed