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.
80 Publications
2014 | Conference Paper | LibreCat-ID: 463
Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., & Seifert, J.-P. (2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp. 123--136). https://doi.org/10.1109/FDTC.2014.22
LibreCat
| Files available
| 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
2013 | Conference Paper | LibreCat-ID: 488
Blömer, J., Günther, P., & Krummel, V. (2013). 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) (pp. 98–105).
LibreCat
| Files available
2013 | Preprint | LibreCat-ID: 538 | 
Blömer, J., & Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.
LibreCat
| Files available
| Download (ext.)
2012 | Journal Article | LibreCat-ID: 2984
Blömer, J. (2012). Turing und Kryptografie. Informatik-Spektrum, 35(4). https://doi.org/10.1007/s00287-012-0622-7
LibreCat
| DOI
2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, M. R., Blömer, J., & Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.
LibreCat
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
2011 | Preprint | LibreCat-ID: 2987
Blömer, J., & Naewe, S. (2011). Solving the Closest Vector Problem with respect to Lp Norms. In arXiv:1104.3720.
LibreCat
2010 | Book Chapter | LibreCat-ID: 2988
Ackermann, M. R., & Blömer, J. (2010). Bregman Clustering for Separable Instances. In SWAT 2010 (pp. 212–223). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_21
LibreCat
| DOI
2010 | Journal Article | LibreCat-ID: 2990
Ackermann, M. R., Blömer, J., & Sohler, C. (2010). Clustering for Metric and Nonmetric Distance Measures. ACM Trans. Algorithms, (4), 59:1--59:26. https://doi.org/10.1145/1824777.1824779
LibreCat
| DOI
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
2010 | Conference Paper | LibreCat-ID: 2994
Schäfer, W., Trächtler, A., Birattari, M., Blömer, J., Dorigo, M., Engels, G., … Reif, W. (2010). Engineering self-coordinating software intensive systems. In Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10. ACM Press. https://doi.org/10.1145/1882362.1882428
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 2995
Ackermann, M. R., & Blömer, J. (2009). Coresets and Approximate Clustering for Bregman Divergences. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1088–1097). Philadelphia, PA: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973068.118
LibreCat
| DOI
2009 | Journal Article | LibreCat-ID: 2999
Blömer, J., & Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science, 410(18), 1648–1665. https://doi.org/10.1016/j.tcs.2008.12.045
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3002 |
Blömer, J., & Krummel, V. (2007). Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In Selected Areas in Cryptography (pp. 96–109). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-77360-3_7
LibreCat
| DOI
| Download (ext.)
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
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: 3026
Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-68530-8_13
LibreCat
| DOI
2007 | Conference Paper | LibreCat-ID: 55571
Blömer, J., & Naewe, S. (2007). Sampling methods for shortest vectors, closest vectors and successive minima. Proceedings of the 34th ICALP, 4596, 65–77.
LibreCat
2006 | Journal Article | LibreCat-ID: 3003
Blömer, J. (2006). Randomness and Secrecy - A Brief Introduction. Journal of Universal Computer Science (J.UCS), (6), 654--671. https://doi.org/10.3217/jucs-012-06-0654
LibreCat
| DOI