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.
109 Publications
2017 | Book Chapter | LibreCat-ID: 2381
Brauer, S. (2017). Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems. In D. Fotakis, A. Pagourtzis, & V. T. Paschos (Eds.), Lecture Notes in Computer Science (Vol. 10236, pp. 116–127). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-57586-5_11
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3049
Blömer, J. (1991). Computing sums of radicals in polynomial time. In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1991.185434
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
Blömer, J. (2002). Computing sums of radicals in polynomial time. [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. https://doi.org/10.1109/sfcs.1991.185434
LibreCat
| Files available
| DOI
2004 | Book Chapter | LibreCat-ID: 3015
May, A. (2004). Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In Advances in Cryptology – CRYPTO 2004 (pp. 213–219). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_13
LibreCat
| DOI
2014 | Preprint | LibreCat-ID: 442 | 
Blömer, J., & Liske, G. (2014). Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. Universität Paderborn.
LibreCat
| Files available
| Download (ext.)
2016 | Conference Paper | LibreCat-ID: 208
Blömer, J., & Liske, G. (2016). Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In Proceedings of the CT-RSA 2016 (pp. 431–447). https://doi.org/10.1007/978-3-319-29485-8_25
LibreCat
| Files available
| 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
2018 | Conference Paper | LibreCat-ID: 4344
Blömer, J., Brauer, S., & Bujna, K. (2018). Coresets for Fuzzy K-Means with Applications. In 29th International Symposium on Algorithms and Computation (ISAAC 2018) (pp. 46:1--46:12). Jiaoxi, Yilan County, Taiwan: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2018.46
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3019
May, A. (2007). Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In Advances in Cryptology — CRYPTO 2002 (pp. 242–256). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45708-9_16
LibreCat
| DOI
2021 | Preprint | LibreCat-ID: 26645 |
Bobolz, J., Eidens, F., Heitjohann, R., & Fell, J. (2021). Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. IACR eprint.
LibreCat
| Download (ext.)
Filters and Search Terms
(department=64) AND (type=book OR type=book_editor OR type=book_chapter OR type=publicationtype_review OR type=conference_abstract OR type=conference_editor OR type=conference OR type=dissertation OR type=encyclopedia_article OR type=journal_article OR type=journal_editor OR type=newspaper_article OR type=patent OR type=preprint OR type=report OR type=translation OR type=translation_chapter OR type=working_paper OR type=research_data)