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
2004 | Book Chapter | LibreCat-ID: 3012
J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in Public Key Cryptography – PKC 2004, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.
LibreCat
| Files available
| DOI
2023 | Conference Paper | LibreCat-ID: 43458 |
J. Blömer, J. Bobolz, and L. A. Porzenheim, “A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices,” presented at the Asiacrypt 2023, Guangzhou, China, 2023.
LibreCat
| Download (ext.)
1998 | Journal Article | LibreCat-ID: 3028
J. Blömer and B. Trachsler, “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
2014 | Conference Paper | LibreCat-ID: 463
J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation,” in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136.
LibreCat
| Files available
| DOI
2005 | Book Chapter | LibreCat-ID: 3006
J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in EUROCRYPT 2005, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.
LibreCat
| Files available
| DOI
2011 | Dissertation | LibreCat-ID: 2910
S. Naewe, Algorithms for lattice problems with respect to general norms. Universität Paderborn, 2011.
LibreCat
| Download (ext.)
2009 | Dissertation | LibreCat-ID: 2911
M. R. Ackermann, Algorithms for the Bregman k-Median Problem. Universität Paderborn, 2009.
LibreCat
| Download (ext.)
2013 | Report | LibreCat-ID: 2917
J. Juhnke, H. Lefmann, and V. Strehl, An Approach for Determining Optimal Contrast in Visual Cryptography. Fortschritt-Berichte VDI, 2013.
LibreCat
1995 | Report | LibreCat-ID: 3038
J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, An XOR-based erasure-resilient coding scheme. Berkeley, USA, 1995.
LibreCat
| Files available
2007 | Book Chapter | LibreCat-ID: 3002 |
J. Blömer and V. Krummel, “Analysis of Countermeasures Against Access Driven Cache Attacks on AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 96–109.
LibreCat
| DOI
| Download (ext.)
2015 | Conference Paper | LibreCat-ID: 322 |
J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation Systems,” in Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.
LibreCat
| Files available
| DOI
| Download (ext.)
1995 | Journal Article | LibreCat-ID: 3037
H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
LibreCat
2017 | Conference Paper | LibreCat-ID: 2344 |
J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations,” in Foundations and Practice of Security, 2017, pp. 3–17.
LibreCat
| Files available
| DOI
2017 | Dissertation | LibreCat-ID: 116
G. Liske, CCA-Security for Predicate Encryption Schemes. Universität Paderborn, 2017.
LibreCat
| DOI
| Download (ext.)
2018 | Conference Paper | LibreCat-ID: 2965
J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, Hamburg, Germany, pp. 25:1--25:10.
LibreCat
| Files available
| DOI
2017 | Book Chapter | LibreCat-ID: 2381
S. Brauer, “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems,” in Lecture Notes in Computer Science, vol. 10236, D. Fotakis, A. Pagourtzis, and V. T. Paschos, Eds. Cham: Springer International Publishing, 2017, pp. 116–127.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
J. Blömer, “Computing sums of radicals in polynomial time,” 2002, doi: 10.1109/sfcs.1991.185434.
LibreCat
| Files available
| DOI
2014 | Preprint | LibreCat-ID: 442 |
J. Blömer and G. Liske, “Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions.” Universität Paderborn, 2014.
LibreCat
| Files available
| Download (ext.)
2016 | Conference Paper | LibreCat-ID: 208
J. Blömer and G. Liske, “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes,” in Proceedings of the CT-RSA 2016, 2016, pp. 431–447.
LibreCat
| Files available
| DOI
2009 | Book Chapter | LibreCat-ID: 2995
M. R. Ackermann and J. Blömer, “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, pp. 1088–1097.
LibreCat
| DOI
2021 | Preprint | LibreCat-ID: 26645 |
J. Bobolz, F. Eidens, R. Heitjohann, and J. Fell, “Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes.” IACR eprint, 2021.
LibreCat
| Download (ext.)
2018 | Conference Paper | LibreCat-ID: 2379 |
J. Blömer and J. Bobolz, “Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures,” presented at the The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium, doi: 10.1007/978-3-319-93387-0_12.
LibreCat
| Files available
| DOI
| Download (ext.)
1997 | Book Chapter | LibreCat-ID: 3029
J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA ’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.
LibreCat
| Files available
| DOI
2002 | Journal Article | LibreCat-ID: 35857
J. Blömer, “Denesting by Bounded Degree Radicals,” Algorithmica, vol. 28, no. 1, pp. 2–15, 2002, doi: 10.1007/s004530010028.
LibreCat
| DOI
2023 | Conference Paper | LibreCat-ID: 44855
S. Hemmrich, J. Bobolz, D. Beverungen, and J. Blömer, “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain,” presented at the ECIS 2023, 2023.
LibreCat
| Files available
| Download (ext.)
2013 | Preprint | LibreCat-ID: 538 |
J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.
LibreCat
| Files available
| Download (ext.)
2019 | Conference Paper | LibreCat-ID: 13557 |
J. Blömer and N. Löken, “Dynamic Searchable Encryption with Access Control,” in 12th International Symposium on Foundations and Practice of Security, FPS 2019, 2019, vol. 12056.
LibreCat
| Download (ext.)
2010 | Conference Paper | LibreCat-ID: 2993
J. Schrieb, “Efficient and Compact CCA Security from Partitioned IBKEM.” 2010.
LibreCat
2016 | Report | LibreCat-ID: 2971
J. Blömer and P. Günther, 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)