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
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 | 
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
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 |
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 |
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 |
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
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
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
2014 | Preprint | LibreCat-ID: 442 |
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
2018 | Conference Paper | LibreCat-ID: 2379 |
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
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.)
2013 | Preprint | LibreCat-ID: 538 |
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 |
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.)
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
2010 | Conference Paper | LibreCat-ID: 2994
Schäfer W, Trächtler A, Birattari M, et al. Engineering self-coordinating software intensive systems. In: Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10. ACM Press; 2010. doi:10.1145/1882362.1882428
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 3873 |
Blömer J, Eidens F, Juhnke J. Enhanced Security of Attribute-Based Signatures. In: The International Conference on Cryptology And Network Security (CANS). Vol 11124. Lecture Notes in Computer Science. Springer; 2018:235-255. doi:10.1007/978-3-030-00434-7_12
LibreCat
| Files available
| DOI
| Download (ext.)
2006 | Book Chapter | LibreCat-ID: 3004
Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:106-120. doi:10.1007/11889700_11
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3018
Blömer J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In: Financial Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:162-181. doi:10.1007/978-3-540-45126-6_12
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 3265 |
Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials with Reputation System. In: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM. doi:10.1145/3230833.3234517
LibreCat
| Files available
| DOI
| Download (ext.)
2016 | Preprint | LibreCat-ID: 2969 |
Blömer J, Brauer S, Bujna K. Hard-Clustering with Gaussian Mixture Models. 2016.
LibreCat
| Download (ext.)
2011 | Conference Paper | LibreCat-ID: 2985
Ackermann MR, Blömer J, Scholz C. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.
LibreCat
1992 | Conference Paper | LibreCat-ID: 3047
Blömer J. How to denest Ramanujan’s nested radicals. In: 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 J. How to Share a Secret. In: Algorithms Unplugged. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:159-168. doi:10.1007/978-3-642-15328-0_17
LibreCat
| DOI
2020 | Journal Article | LibreCat-ID: 10790
Blömer J, Brauer S, Bujna K, Kuntze D. How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. Advances in Data Analysis and Classification. 2020;14:147–173. doi:10.1007/s11634-019-00366-7
LibreCat
| DOI
2013 | Book Chapter | LibreCat-ID: 2979
Blömer J, Günther P, Liske G. Improved Side Channel Attacks on Pairing Based Cryptography. In: Constructive Side-Channel Analysis and Secure Design. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:154-168. doi:10.1007/978-3-642-40026-1_10
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3021
Blömer J, May A. Key Revocation with Interval Cover Families. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341. doi:10.1007/3-540-45537-x_26
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3020
Blömer J, May A. Low Secret Exponent RSA Revisited. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19. doi:10.1007/3-540-44670-2_2
LibreCat
| DOI
2003 | Book Chapter | LibreCat-ID: 3016
Blömer J, May A. New Partial Key Exposure Attacks on RSA. In: Advances in Cryptology - CRYPTO 2003. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:27-43. doi:10.1007/978-3-540-45146-4_2
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
Blömer J, Seifert J-P. On the complexity of computing short linearly independent vectors and short bases in a lattice. In: 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 J, Bobolz J, Bröcher H. On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. In: ; 2023.
LibreCat
| Download (ext.)
2010 | Journal Article | LibreCat-ID: 2991
Krueger A, Leutnant V, Haeb-Umbach R, Ackermann M, Blömer J. 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 J, Löken N. Personal Cross-Platform Reputation. In: Security and Trust Management, STM 2019. Vol 11738. LNCS. ; 2019. doi:10.1007/978-3-030-31511-5_9
LibreCat
| Files available
| DOI
2023 | Book Chapter | LibreCat-ID: 45901 |
Blömer J, Bobolz J, Eidens F, Jager T, Kramer P. Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:237-246. doi:10.5281/zenodo.8068755
LibreCat
| Files available
| DOI
2018 | Conference Paper | LibreCat-ID: 2862 |
Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. In: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings. Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25
LibreCat
| Files available
| DOI
| Download (ext.)
2002 | Journal Article | LibreCat-ID: 3034
Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. IEEE Transactions on Information Theory. 2002;42(6):1737-1744. doi:10.1109/18.556670
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. In: 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 J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat
| Files available
2004 | Book Chapter | LibreCat-ID: 3011
Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:10.1007/978-3-540-30564-4_5
LibreCat
| DOI
2006 | Journal Article | LibreCat-ID: 3003
Blömer J. Randomness and Secrecy - A Brief Introduction. Journal of Universal Computer Science (JUCS). 2006;(6):654--671. doi:10.3217/jucs-012-06-0654
LibreCat
| DOI
1992 | Book Chapter | LibreCat-ID: 3046
Alt H, Blömer J. Resemblance and symmetries of geometric patterns. In: Data Structures and Efficient Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg; 1992:1-24. doi:10.1007/3-540-55488-2_19
LibreCat
| DOI
2023 | Book Chapter | LibreCat-ID: 45891 |
Blömer J, Eidens F, Jager T, Niehues D, Scheideler C. Robustness and Security. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:145-164. doi:10.5281/zenodo.8068629
LibreCat
| Files available
| DOI
2009 | Journal Article | LibreCat-ID: 2999
Blömer J, Naewe S. Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science. 2009;(18):1648-1665. doi:10.1016/j.tcs.2008.12.045
LibreCat
| DOI
2013 | Conference Paper | LibreCat-ID: 488
Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study. In: Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS). ; 2013:98-105.
LibreCat
| Files available
2015 | Conference Paper | LibreCat-ID: 253
Blömer J, Juhnke J, Löken N. Short Group Signatures with Distributed Traceability. In: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS). LNCS. ; 2015:166-180. doi:10.1007/978-3-319-32859-1_14
LibreCat
| Files available
| DOI
2006 | Book Chapter | LibreCat-ID: 3007
Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:36-52. doi:10.1007/11889700_4
LibreCat
| Files available
| DOI
1992 | Dissertation | LibreCat-ID: 3043
Blömer J. Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik; 1992.
LibreCat
| Files available
2016 | Conference Paper | LibreCat-ID: 2947
Blömer J, Günther P. Singular Curve Point Decompression Attack. In: 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE; 2016. doi:10.1109/fdtc.2015.17
LibreCat
| DOI
2011 | Preprint | LibreCat-ID: 2987
Blömer J, Naewe S. Solving the Closest Vector Problem with respect to Lp Norms. arXiv:11043720. 2011.
LibreCat
2017 | Conference Paper | LibreCat-ID: 2967 |
Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption with Public Index. In: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS). Vol 10693. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:10.1007/978-3-319-72453-9_35
LibreCat
| Files available
| DOI
| Download (ext.)
2014 | Conference Paper | LibreCat-ID: 355
Blömer J, Günther P, Liske G. Tampering attacks in pairing-based cryptography. In: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC). ; 2014:1--7. doi:10.1109/FDTC.2014.10
LibreCat
| Files available
| DOI
1997 | Journal Article | LibreCat-ID: 3033
Blömer J, Karp R, Welzl E. The rank of sparse random matrices over finite fields. Random Structures \& Algorithms. 1997;(4):407-419. doi:10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
LibreCat
| DOI
2016 | Book Chapter | LibreCat-ID: 2968
Blömer J, Lammersen C, Schmidt M, Sohler C. Theoretical Analysis of the k-Means Algorithm – A Survey. In: Algorithm Engineering. Cham: Springer International Publishing; 2016:81-116. doi:10.1007/978-3-319-49487-6_3
LibreCat
| DOI
2012 | Journal Article | LibreCat-ID: 2984
Blömer J. Turing und Kryptografie. Informatik-Spektrum. 2012;35(4). doi:10.1007/s00287-012-0622-7
LibreCat
| DOI
2019 | Conference Paper | LibreCat-ID: 13904 |
Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials and Applications to Incentive Systems. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. ; 2019. doi:10.1145/3319535.3354223
LibreCat
| Files available
| DOI
| Download (ext.)
2018 | Journal Article | LibreCat-ID: 2685
Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. SIAM Journal on Applied Algebra and Geometry. 2018;2(2):314-338. doi:10.1137/17M1132045
LibreCat
| Files available
| DOI
2015 | Report | LibreCat-ID: 233 |
Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn; 2015.
LibreCat
| Files available
| Download (ext.)
2006 | Book Chapter | LibreCat-ID: 3005
Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:13-23. doi:10.1007/11889700_2
LibreCat
| DOI