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
1991 | Conference Paper | LibreCat-ID: 3048
Approximate matching of polygonal shapes (extended abstract)
H. Alt, B. Behrends, J. Blömer, in: Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91, ACM Press, 1991.
LibreCat
| DOI
H. Alt, B. Behrends, J. Blömer, in: Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91, ACM Press, 1991.
1990 | Book Chapter | LibreCat-ID: 3050
Approximation of convex polygons
H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.
LibreCat
| DOI
H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.
2017 | Conference Paper | LibreCat-ID: 2344 | 
Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations
J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice of Security, Springer International Publishing, Cham, 2017, pp. 3–17.
LibreCat
| Files available
| DOI
J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice of Security, Springer International Publishing, Cham, 2017, pp. 3–17.
2010 | Book Chapter | LibreCat-ID: 2988
Bregman Clustering for Separable Instances
M.R. Ackermann, J. Blömer, in: SWAT 2010, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 212–223.
LibreCat
| DOI
M.R. Ackermann, J. Blömer, in: SWAT 2010, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 212–223.
2017 | Dissertation | LibreCat-ID: 116
CCA-Security for Predicate Encryption Schemes
G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn, 2017.
LibreCat
| DOI
| Download (ext.)
G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn, 2017.
2019 | Dissertation | LibreCat-ID: 13679
Classification and Approximation of Geometric Location Problems
S. Brauer, Classification and Approximation of Geometric Location Problems, Paderborn, 2019.
LibreCat
| DOI
S. Brauer, Classification and Approximation of Geometric Location Problems, Paderborn, 2019.
2000 | Book Chapter | LibreCat-ID: 3023
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.
LibreCat
| DOI
J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.
2018 | Conference Paper | LibreCat-ID: 2965
Cloud Architectures for Searchable Encryption
J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.
LibreCat
| Files available
| DOI
J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.
2010 | Journal Article | LibreCat-ID: 2990
Clustering for Metric and Nonmetric Distance Measures
M.R. Ackermann, J. Blömer, C. Sohler, ACM Trans. Algorithms (2010) 59:1--59:26.
LibreCat
| DOI
M.R. Ackermann, J. Blömer, C. Sohler, ACM Trans. Algorithms (2010) 59:1--59:26.
2019 | Journal Article | LibreCat-ID: 2916
Complexity of single-swap heuristics for metric facility location and related problems
S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
LibreCat
| DOI
S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
2017 | Book Chapter | LibreCat-ID: 2381
Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
S. Brauer, in: D. Fotakis, A. Pagourtzis, V.T. Paschos (Eds.), Lecture Notes in Computer Science, Springer International Publishing, Cham, 2017, pp. 116–127.
LibreCat
| DOI
S. Brauer, in: D. Fotakis, A. Pagourtzis, V.T. Paschos (Eds.), Lecture Notes in Computer Science, Springer International Publishing, Cham, 2017, pp. 116–127.
1991 | Conference Paper | LibreCat-ID: 3049
Computing sums of radicals in polynomial time
J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991.
LibreCat
| DOI
J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991.
2002 | Conference Paper | LibreCat-ID: 3041
Computing sums of radicals in polynomial time
J. Blömer, in: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.
LibreCat
| Files available
| DOI
J. Blömer, in: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.
2004 | Book Chapter | LibreCat-ID: 3015
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.
LibreCat
| DOI
A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.
2014 | Preprint | LibreCat-ID: 442 |
Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions
J. Blömer, G. Liske, (2014).
LibreCat
| Files available
| Download (ext.)
J. Blömer, G. Liske, (2014).
2016 | Conference Paper | LibreCat-ID: 208
Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.
LibreCat
| Files available
| DOI
J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.
2009 | Book Chapter | LibreCat-ID: 2995
Coresets and Approximate Clustering for Bregman Divergences
M.R. Ackermann, J. Blömer, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009, pp. 1088–1097.
LibreCat
| DOI
M.R. Ackermann, J. Blömer, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2009, pp. 1088–1097.
2018 | Conference Paper | LibreCat-ID: 4344
Coresets for Fuzzy K-Means with Applications
J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms and Computation (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12.
LibreCat
| DOI
J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms and Computation (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12.
2007 | Book Chapter | LibreCat-ID: 3019
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 242–256.
LibreCat
| DOI
A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 242–256.
2021 | Preprint | LibreCat-ID: 26645 |
Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes
J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (2021).
LibreCat
| Download (ext.)
J. Bobolz, F. Eidens, R. Heitjohann, J. Fell, (2021).
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)