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, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.” Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, doi:10.1145/3230833.3234517.
LibreCat
| Files available
| DOI
| Download (ext.)
2016 | Preprint | LibreCat-ID: 2969 |
Blömer, Johannes, et al. Hard-Clustering with Gaussian Mixture Models. Computing Research Repository, 2016.
LibreCat
| Download (ext.)
2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, Marcel R., et al. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.
LibreCat
1992 | Conference Paper | LibreCat-ID: 3047
Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.” Proceedings., 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, doi:10.1109/sfcs.1992.267807.
LibreCat
| DOI
2011 | Book Chapter | LibreCat-ID: 2986
Blömer, Johannes. “How to Share a Secret.” Algorithms Unplugged, Springer Berlin Heidelberg, 2011, pp. 159–68, doi:10.1007/978-3-642-15328-0_17.
LibreCat
| DOI
2020 | Journal Article | LibreCat-ID: 10790
Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.” Advances in Data Analysis and Classification, vol. 14, 2020, pp. 147–173, doi:10.1007/s11634-019-00366-7.
LibreCat
| DOI
2013 | Book Chapter | LibreCat-ID: 2979
Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.” Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, 2013, pp. 154–68, doi:10.1007/978-3-642-40026-1_10.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3021
Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:10.1007/3-540-45537-x_26.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3020
Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2.
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:10.1007/978-3-540-45146-4_2.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, Johannes, and Jean-Pierre Seifert. “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, ACM Press, 1999, doi:10.1145/301250.301441.
LibreCat
| Files available
| DOI
2023 | Conference Paper | LibreCat-ID: 35014 |
Blömer, Johannes, et al. On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC. 2023.
LibreCat
| Download (ext.)
2010 | Journal Article | LibreCat-ID: 2991
Krueger, Alexander, et al. “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 |
Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” Security and Trust Management, STM 2019, vol. 11738, 2019, doi:10.1007/978-3-030-31511-5_9.
LibreCat
| Files available
| DOI
2023 | Book Chapter | LibreCat-ID: 45901 |
Blömer, Johannes, et al. “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–46, doi:10.5281/zenodo.8068755.
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 2862 |
Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.” 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
| Files available
| DOI
| Download (ext.)
2002 | Journal Article | LibreCat-ID: 3034
Albanese, Andres, et al. “Priority Encoding Transmission.” IEEE Transactions on Information Theory, vol. 42, no. 6, Institute of Electrical and Electronics Engineers (IEEE), 2002, pp. 1737–44, doi:10.1109/18.556670.
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., et al. “Priority Encoding Transmission.” Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002, doi:10.1109/sfcs.1994.365731.
LibreCat
| DOI
2018 | Working Paper | LibreCat-ID: 5820
Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat
| Files available
2004 | Book Chapter | LibreCat-ID: 3011
Blömer, Johannes, et al. “Provably Secure Masking of AES.” Selected Areas in Cryptography, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:10.1007/978-3-540-30564-4_5.
LibreCat
| DOI