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


2020 | Journal Article | LibreCat-ID: 20888
Blömer J, Brauer S, Bujna K. A Complexity Theoretical Study of Fuzzy K-Means. ACM Transactions on Algorithms. 2020;16(4):1-25. doi:10.1145/3409385
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3012
Blömer J, May A. A Generalized Wiener Attack on RSA. In: Public Key Cryptography – PKC 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:10.1007/978-3-540-24632-9_1
LibreCat | Files available | DOI
 

2023 | Conference Paper | LibreCat-ID: 43458 | OA
Blömer J, Bobolz J, Porzenheim LA. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. In: ; 2023.
LibreCat | Download (ext.)
 

1998 | Journal Article | LibreCat-ID: 3028
Blömer J, Trachsler B. A lower bound for a class of graph based loss resilient codes. Technical report/Departement of Computer Science, ETH Zürich. 1998.
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 3017
Blömer J, Otto M, Seifert J-P. A new CRT-RSA algorithm secure against bellcore attacks. In: Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03. ACM Press; 2004. doi:10.1145/948109.948151
LibreCat | DOI
 

2014 | Conference Paper | LibreCat-ID: 463
Blömer J, Gomes da Silva R, Günther P, Krämer J, Seifert J-P. A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC). ; 2014:123--136. doi:10.1109/FDTC.2014.22
LibreCat | Files available | DOI
 

2007 | Book Chapter | LibreCat-ID: 3026
Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In: Algorithms — ESA’ 98. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:151-162. doi:10.1007/3-540-68530-8_13
LibreCat | DOI
 

2016 | Conference Paper | LibreCat-ID: 2367
Blömer J, Brauer S, Bujna K. A Theoretical Analysis of the Fuzzy K-Means Problem. In: 2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE; 2016:805-810. doi:10.1109/icdm.2016.0094
LibreCat | DOI
 

2014 | Conference Paper | LibreCat-ID: 2977
Blömer J, Bujna K, Kuntze D. A Theoretical and Experimental Comparison of the EM and SEM Algorithm. In: 2014 22nd International Conference on Pattern Recognition. IEEE; 2014. doi:10.1109/icpr.2014.253
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 3006
Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: EUROCRYPT 2005. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:10.1007/11426639_15
LibreCat | Files available | DOI
 

2016 | Book Chapter | LibreCat-ID: 2970
Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances in Knowledge Discovery and Data Mining. Cham: Springer International Publishing; 2016:296-308. doi:10.1007/978-3-319-31750-2_24
LibreCat | DOI
 

2016 | Book Chapter | LibreCat-ID: 2978
Blömer J, Bujna K. Adaptive Seeding for Gaussian Mixture Models. In: Advances in Knowledge Discovery and Data Mining. Springer International Publishing; 2016:296-308. doi:10.1007/978-3-319-31750-2_24
LibreCat | DOI
 

2011 | Dissertation | LibreCat-ID: 2910
Naewe S. Algorithms for Lattice Problems with Respect to General Norms. Universität Paderborn; 2011.
LibreCat | Download (ext.)
 

2009 | Dissertation | LibreCat-ID: 2911
Ackermann MR. Algorithms for the Bregman K-Median Problem. Universität Paderborn; 2009.
LibreCat | Download (ext.)
 

2013 | Report | LibreCat-ID: 2917
Juhnke J, Lefmann H, Strehl V. An Approach for Determining Optimal Contrast in Visual Cryptography. Fortschritt-Berichte VDI; 2013.
LibreCat
 

1995 | Report | LibreCat-ID: 3038
Blömer J, Kalfane M, Karp R, Karpinski M, Luby M, Zuckerman D. An XOR-Based Erasure-Resilient Coding Scheme. Berkeley, USA; 1995.
LibreCat | Files available
 

2014 | Journal Article | LibreCat-ID: 2976
Ackermann MR, Blömer J, Kuntze D, Sohler C. Analysis of Agglomerative Clustering. Algorithmica. 2014;69. doi:10.1007/s00453-012-9717-4
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3002 | OA
Blömer J, Krummel V. Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:96-109. doi:10.1007/978-3-540-77360-3_7
LibreCat | DOI | Download (ext.)
 

2015 | Conference Paper | LibreCat-ID: 322 | OA
Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems. In: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC). LNCS. ; 2015:478--488. doi:10.1007/978-3-662-47854-7_29
LibreCat | Files available | DOI | Download (ext.)
 

1995 | Journal Article | LibreCat-ID: 3037
Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence. 1995;13(3).
LibreCat
 

1991 | Conference Paper | LibreCat-ID: 3048
Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes (extended abstract). In: Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91. ACM Press; 1991. doi:10.1145/109648.109669
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 3050
Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: Automata, Languages and Programming. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:10.1007/bfb0032068
LibreCat | DOI
 

2017 | Conference Paper | LibreCat-ID: 2344 | OA
Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In: Foundations and Practice of Security. Cham: Springer International Publishing; 2017:3-17. doi:10.1007/978-3-319-75650-9_1
LibreCat | Files available | DOI
 

2010 | Book Chapter | LibreCat-ID: 2988
Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: SWAT 2010. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:212-223. doi:10.1007/978-3-642-13731-0_21
LibreCat | DOI
 

2017 | Dissertation | LibreCat-ID: 116
Liske G. CCA-Security for Predicate Encryption Schemes. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-220
LibreCat | DOI | Download (ext.)
 

2019 | Dissertation | LibreCat-ID: 13679
Brauer S. Classification and Approximation of Geometric Location Problems. Paderborn; 2019. doi:10.17619/UNIPB/1-816
LibreCat | DOI
 

2000 | Book Chapter | LibreCat-ID: 3023
Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In: Automata, Languages and Programming. Berlin, Heidelberg: Springer Berlin Heidelberg; 2000:248-259. doi:10.1007/3-540-45022-x_22
LibreCat | DOI
 

2018 | Conference Paper | LibreCat-ID: 2965
Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018. New York, NY, USA: ACM; :25:1--25:10. doi:10.1145/3230833.3230853
LibreCat | Files available | DOI
 

2010 | Journal Article | LibreCat-ID: 2990
Ackermann MR, Blömer J, Sohler C. Clustering for Metric and Nonmetric Distance Measures. ACM Trans Algorithms. 2010;(4):59:1--59:26. doi:10.1145/1824777.1824779
LibreCat | DOI
 

2019 | Journal Article | LibreCat-ID: 2916
Brauer S. Complexity of single-swap heuristics for metric facility location and related problems. Theoretical Computer Science. 2019;754:88-106. doi:10.1016/j.tcs.2018.04.048
LibreCat | DOI
 

2017 | Book Chapter | LibreCat-ID: 2381
Brauer S. Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems. In: Fotakis D, Pagourtzis A, Paschos VT, eds. Lecture Notes in Computer Science. Vol 10236. Cham: Springer International Publishing; 2017:116-127. doi:10.1007/978-3-319-57586-5_11
LibreCat | DOI
 

1991 | Conference Paper | LibreCat-ID: 3049
Blömer J. Computing sums of radicals in polynomial time. In: Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press; 1991. doi:10.1109/sfcs.1991.185434
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 3041
Blömer J. Computing sums of radicals in polynomial time. In: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press; 2002. doi:10.1109/sfcs.1991.185434
LibreCat | Files available | DOI
 

2004 | Book Chapter | LibreCat-ID: 3015
May A. Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring. In: Advances in Cryptology – CRYPTO 2004. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:213-219. doi:10.1007/978-3-540-28628-8_13
LibreCat | DOI
 

2014 | Preprint | LibreCat-ID: 442 | OA
Blömer J, Liske G. Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. 2014.
LibreCat | Files available | Download (ext.)
 

2016 | Conference Paper | LibreCat-ID: 208
Blömer J, Liske G. Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In: Proceedings of the CT-RSA 2016. LNCS. ; 2016:431-447. doi:10.1007/978-3-319-29485-8_25
LibreCat | Files available | DOI
 

2009 | Book Chapter | LibreCat-ID: 2995
Ackermann MR, Blömer J. Coresets and Approximate Clustering for Bregman Divergences. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics; 2009:1088-1097. doi:10.1137/1.9781611973068.118
LibreCat | DOI
 

2018 | Conference Paper | LibreCat-ID: 4344
Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications. In: 29th International Symposium on Algorithms and Computation  (ISAAC 2018). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:10.4230/LIPIcs.ISAAC.2018.46
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3019
May A. Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In: Advances in Cryptology — CRYPTO 2002. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:242-256. doi:10.1007/3-540-45708-9_16
LibreCat | DOI
 

2021 | Preprint | LibreCat-ID: 26645 | OA
Bobolz J, Eidens F, Heitjohann R, Fell J. Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes. Published online 2021.
LibreCat | Download (ext.)
 

2020 | Dissertation | LibreCat-ID: 15482
Löken N. Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work.; 2020. doi:10.17619/UNIPB/1-854
LibreCat | DOI
 

2018 | Conference Paper | LibreCat-ID: 2379 | OA
Blömer J, Bobolz J. Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. In: ACNS 2018 Applied Cryptography & Network Security. LNCS. doi:10.1007/978-3-319-93387-0_12
LibreCat | Files available | DOI | Download (ext.)
 

1997 | Book Chapter | LibreCat-ID: 3029
Blömer J. Denesting by bounded degree radicals. In: Algorithms — ESA ’97. Berlin, Heidelberg: Springer Berlin Heidelberg; 1997:53-63. doi:10.1007/3-540-63397-9_5
LibreCat | Files available | DOI
 

2002 | Journal Article | LibreCat-ID: 35857
Blömer J. Denesting by Bounded Degree Radicals. Algorithmica. 2002;28(1):2-15. doi:10.1007/s004530010028
LibreCat | DOI
 

2023 | Conference Paper | LibreCat-ID: 44855
Hemmrich S, Bobolz J, Beverungen D, Blömer J. Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. In: ECIS 2023 Research Papers. ; 2023.
LibreCat | Files available | Download (ext.)
 

2007 | Book Chapter | LibreCat-ID: 3022
May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:110-125. doi:10.1007/3-540-44670-2_10
LibreCat | DOI
 

2013 | Preprint | LibreCat-ID: 538 | OA
Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 2013.
LibreCat | Files available | Download (ext.)
 

2019 | Conference Paper | LibreCat-ID: 13557 | OA
Blömer J, Löken N. Dynamic Searchable Encryption with Access Control. In: 12th International Symposium on Foundations and Practice of Security, FPS 2019. Vol 12056. LNCS. Springer; 2019.
LibreCat | Download (ext.)
 

2010 | Conference Paper | LibreCat-ID: 2993
Schrieb J. Efficient and Compact CCA Security from Partitioned IBKEM. 2010.
LibreCat
 

2016 | Report | LibreCat-ID: 2971
Blömer J, Günther P. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops; 2016.
LibreCat
 

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)

status=public

Search

Filter Publications

Display / Sort

Sorted by: Title , First Author
Citation Style: AMA

Export / Embed