79 Publications

Mark all

[79]
2023 | Conference Paper | LibreCat-ID: 44855
Hemmrich, S., Bobolz, J., Beverungen, D., & Blömer, J. (2023). Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. ECIS 2023 Research Papers. ECIS 2023.
LibreCat | Files available | Download (ext.)
 
[78]
2023 | Book Chapter | LibreCat-ID: 45901 | OA
Blömer, J., Bobolz, J., Eidens, F., Jager, T., & Kramer, P. (2023). Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 237–246). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068755
LibreCat | Files available | DOI
 
[77]
2023 | Book Chapter | LibreCat-ID: 45891 | OA
Blömer, J., Eidens, F., Jager, T., Niehues, D., & Scheideler, C. (2023). Robustness and Security. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 145–164). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068629
LibreCat | Files available | DOI
 
[76]
2023 | Conference Paper | LibreCat-ID: 35014 | OA
Blömer, J., Bobolz, J., & Bröcher, H. (2023). On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. TCC 2023, Taipeh, Taiwan.
LibreCat | Download (ext.)
 
[75]
2023 | Conference Paper | LibreCat-ID: 43458 | OA
Blömer, J., Bobolz, J., & Porzenheim, L. A. (2023). A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. Asiacrypt 2023, Guangzhou, China.
LibreCat | Download (ext.)
 
[74]
2020 | Journal Article | LibreCat-ID: 20888
Blömer, J., Brauer, S., & Bujna, K. (2020). A Complexity Theoretical Study of Fuzzy K-Means. ACM Transactions on Algorithms, 16(4), 1–25. https://doi.org/10.1145/3409385
LibreCat | DOI
 
[73]
2020 | Journal Article | LibreCat-ID: 10790
Blömer, J., Brauer, S., Bujna, K., & Kuntze, D. (2020). How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. Advances in Data Analysis and Classification, 14, 147–173. https://doi.org/10.1007/s11634-019-00366-7
LibreCat | DOI
 
[72]
2019 | Conference Paper | LibreCat-ID: 13554 | OA
Blömer, J., & Löken, N. (2019). Personal Cross-Platform Reputation. In Security and Trust Management, STM 2019 (Vol. 11738). https://doi.org/10.1007/978-3-030-31511-5_9
LibreCat | Files available | DOI
 
[71]
2019 | Conference Paper | LibreCat-ID: 13557 | OA
Blömer, J., & Löken, N. (2019). Dynamic Searchable Encryption with Access Control. In 12th International Symposium on Foundations and Practice of Security, FPS 2019 (Vol. 12056). Springer.
LibreCat | Download (ext.)
 
[70]
2019 | Conference Paper | LibreCat-ID: 13904 | OA
Blömer, J., Bobolz, J., Diemert, D. P., & Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. 26th ACM Conference on Computer and Communications Security, London. https://doi.org/10.1145/3319535.3354223
LibreCat | Files available | DOI | Download (ext.)
 
[69]
2018 | Conference Paper | LibreCat-ID: 2862 | OA
Blömer, J., Eidens, F., & Juhnke, J. (2018). 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 (pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25
LibreCat | Files available | DOI | Download (ext.)
 
[68]
2018 | Journal Article | LibreCat-ID: 2685
Blömer, J., & Kohn, K. (2018). Voronoi Cells of Lattices with Respect to Arbitrary Norms. SIAM Journal on Applied Algebra and Geometry., 2(2), 314–338. https://doi.org/10.1137/17M1132045
LibreCat | Files available | DOI
 
[67]
2018 | Conference Paper | LibreCat-ID: 3265 | OA
Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F., … Stienemeier, M. (n.d.). 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. https://doi.org/10.1145/3230833.3234517
LibreCat | Files available | DOI | Download (ext.)
 
[66]
2018 | Conference Paper | LibreCat-ID: 2965
Blömer, J., & Löken, N. (n.d.). Cloud Architectures for Searchable Encryption. In Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018 (pp. 25:1--25:10). New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3230853
LibreCat | Files available | DOI
 
[65]
2018 | Working Paper | LibreCat-ID: 5820
Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat | Files available
 
[64]
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
 
[63]
2018 | Conference Paper | LibreCat-ID: 3873 | OA
Blömer, J., Eidens, F., & Juhnke, J. (2018). Enhanced Security of Attribute-Based Signatures. The International Conference on Cryptology And Network Security (CANS), 11124, 235–255. https://doi.org/10.1007/978-3-030-00434-7_12
LibreCat | Files available | DOI | Download (ext.)
 
[62]
2018 | Conference Paper | LibreCat-ID: 2379 | OA
Blömer, J., & Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. ACNS 2018 Applied Cryptography & Network Security. The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium. https://doi.org/10.1007/978-3-319-93387-0_12
LibreCat | Files available | DOI | Download (ext.)
 
[61]
2017 | Conference Paper | LibreCat-ID: 2967 | OA
Blömer, J., & Liske, G. (2017). 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, pp. 438–453). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-72453-9_35
LibreCat | Files available | DOI | Download (ext.)
 
[60]
2017 | Conference Paper | LibreCat-ID: 2344 | OA
Blömer, J., Günther, P., Krummel, V., & Löken, N. (2017). Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In Foundations and Practice of Security (pp. 3–17). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-75650-9_1
LibreCat | Files available | DOI
 
[59]
2016 | Conference Paper | LibreCat-ID: 2947
Blömer, J., & Günther, P. (2016). Singular Curve Point Decompression Attack. In 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE. https://doi.org/10.1109/fdtc.2015.17
LibreCat | DOI
 
[58]
2016 | Book Chapter | LibreCat-ID: 2968
Blömer, J., Lammersen, C., Schmidt, M., & Sohler, C. (2016). Theoretical Analysis of the k-Means Algorithm – A Survey. In Algorithm Engineering (pp. 81–116). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-49487-6_3
LibreCat | DOI
 
[57]
2016 | Preprint | LibreCat-ID: 2969 | OA
Blömer, J., Brauer, S., & Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository.
LibreCat | Download (ext.)
 
[56]
2016 | Book Chapter | LibreCat-ID: 2970
Blömer, J., & Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In Advances in Knowledge Discovery and Data Mining (pp. 296–308). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-31750-2_24
LibreCat | DOI
 
[55]
2016 | Report | LibreCat-ID: 2971
Blömer, J., & Günther, P. (2016). Effizienz und Sicherheit paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops.
LibreCat
 
[54]
2016 | Conference Paper | LibreCat-ID: 2367
Blömer, J., Brauer, S., & Bujna, K. (2016). A Theoretical Analysis of the Fuzzy K-Means Problem. In 2016 IEEE 16th International Conference on Data Mining (ICDM) (pp. 805–810). Barcelona, Spain: IEEE. https://doi.org/10.1109/icdm.2016.0094
LibreCat | DOI
 
[53]
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
 
[52]
2016 | Book Chapter | LibreCat-ID: 2978
Blömer, J., & Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In Advances in Knowledge Discovery and Data Mining (pp. 296–308). Springer International Publishing. https://doi.org/10.1007/978-3-319-31750-2_24
LibreCat | DOI
 
[51]
2015 | Conference Paper | LibreCat-ID: 253
Blömer, J., Juhnke, J., & Löken, N. (2015). Short Group Signatures with Distributed Traceability. In Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS) (pp. 166–180). https://doi.org/10.1007/978-3-319-32859-1_14
LibreCat | Files available | DOI
 
[50]
2015 | Conference Paper | LibreCat-ID: 322 | OA
Blömer, J., Juhnke, J., & Kolb, C. (2015). Anonymous and Publicly Linkable Reputation Systems. In Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC) (pp. 478--488). https://doi.org/10.1007/978-3-662-47854-7_29
LibreCat | Files available | DOI | Download (ext.)
 
[49]
2015 | Report | LibreCat-ID: 233 | OA
Blömer, J., & Kohn, K. (2015). Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn.
LibreCat | Files available | Download (ext.)
 
[48]
2014 | Conference Paper | LibreCat-ID: 355
Blömer, J., Günther, P., & Liske, G. (2014). Tampering attacks in pairing-based cryptography. In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp. 1--7). https://doi.org/10.1109/FDTC.2014.10
LibreCat | Files available | DOI
 
[47]
2014 | Journal Article | LibreCat-ID: 2976
Ackermann, M. R., Blömer, J., Kuntze, D., & Sohler, C. (2014). Analysis of Agglomerative Clustering. Algorithmica, 69. https://doi.org/10.1007/s00453-012-9717-4
LibreCat | DOI
 
[46]
2014 | Conference Paper | LibreCat-ID: 2977
Blömer, J., Bujna, K., & Kuntze, D. (2014). A Theoretical and Experimental Comparison of the EM and SEM Algorithm. In 2014 22nd International Conference on Pattern Recognition. IEEE. https://doi.org/10.1109/icpr.2014.253
LibreCat | DOI
 
[45]
2014 | Preprint | LibreCat-ID: 442 | OA
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.)
 
[44]
2014 | Conference Paper | LibreCat-ID: 463
Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., & Seifert, J.-P. (2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp. 123--136). https://doi.org/10.1109/FDTC.2014.22
LibreCat | Files available | DOI
 
[43]
2013 | Book Chapter | LibreCat-ID: 2979
Blömer, J., Günther, P., & Liske, G. (2013). Improved Side Channel Attacks on Pairing Based Cryptography. In Constructive Side-Channel Analysis and Secure Design (pp. 154–168). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-40026-1_10
LibreCat | DOI
 
[42]
2013 | Conference Paper | LibreCat-ID: 488
Blömer, J., Günther, P., & Krummel, V. (2013). 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) (pp. 98–105).
LibreCat | Files available
 
[41]
2013 | Preprint | LibreCat-ID: 538 | OA
Blömer, J., & Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.
LibreCat | Files available | Download (ext.)
 
[40]
2012 | Journal Article | LibreCat-ID: 2984
Blömer, J. (2012). Turing und Kryptografie. Informatik-Spektrum, 35(4). https://doi.org/10.1007/s00287-012-0622-7
LibreCat | DOI
 
[39]
2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, M. R., Blömer, J., & Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.
LibreCat
 
[38]
2011 | Book Chapter | LibreCat-ID: 2986
Blömer, J. (2011). How to Share a Secret. In Algorithms Unplugged (pp. 159–168). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_17
LibreCat | DOI
 
[37]
2011 | Preprint | LibreCat-ID: 2987
Blömer, J., & Naewe, S. (2011). Solving the Closest Vector Problem with respect to Lp Norms. ArXiv:1104.3720.
LibreCat
 
[36]
2010 | Book Chapter | LibreCat-ID: 2988
Ackermann, M. R., & Blömer, J. (2010). Bregman Clustering for Separable Instances. In SWAT 2010 (pp. 212–223). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_21
LibreCat | DOI
 
[35]
2010 | Journal Article | LibreCat-ID: 2990
Ackermann, M. R., Blömer, J., & Sohler, C. (2010). Clustering for Metric and Nonmetric Distance Measures. ACM Trans. Algorithms, (4), 59:1--59:26. https://doi.org/10.1145/1824777.1824779
LibreCat | DOI
 
[34]
2010 | Journal Article | LibreCat-ID: 2991
Krueger, A., Leutnant, V., Haeb-Umbach, R., Ackermann, M., & Blömer, J. (2010). On the initialization of dynamic models for speech features. Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany.
LibreCat
 
[33]
2010 | Conference Paper | LibreCat-ID: 2994
Schäfer, W., Trächtler, A., Birattari, M., Blömer, J., Dorigo, M., Engels, G., … Reif, W. (2010). Engineering self-coordinating software intensive systems. In Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10. ACM Press. https://doi.org/10.1145/1882362.1882428
LibreCat | DOI
 
[32]
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
 
[31]
2009 | Journal Article | LibreCat-ID: 2999
Blömer, J., & Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science, (18), 1648–1665. https://doi.org/10.1016/j.tcs.2008.12.045
LibreCat | DOI
 
[30]
2007 | Book Chapter | LibreCat-ID: 3002 | OA
Blömer, J., & Krummel, V. (2007). Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In Selected Areas in Cryptography (pp. 96–109). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-77360-3_7
LibreCat | DOI | Download (ext.)
 
[29]
2007 | Book Chapter | LibreCat-ID: 3020
Blömer, J., & May, A. (2007). Low Secret Exponent RSA Revisited. In Lecture Notes in Computer Science (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44670-2_2
LibreCat | DOI
 
[28]
2007 | Book Chapter | LibreCat-ID: 3021
Blömer, J., & May, A. (2007). Key Revocation with Interval Cover Families. In Selected Areas in Cryptography (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45537-x_26
LibreCat | DOI
 
[27]
2007 | Book Chapter | LibreCat-ID: 3026
Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-68530-8_13
LibreCat | DOI
 
[26]
2006 | Journal Article | LibreCat-ID: 3003
Blömer, J. (2006). Randomness and Secrecy - A Brief Introduction. Journal of Universal Computer Science (J.UCS), (6), 654--671. https://doi.org/10.3217/jucs-012-06-0654
LibreCat | DOI
 
[25]
2006 | Book Chapter | LibreCat-ID: 3004
Blömer, J., & Krummel, V. (2006). Fault Based Collision Attacks on AES. In Lecture Notes in Computer Science (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_11
LibreCat | DOI
 
[24]
2006 | Book Chapter | LibreCat-ID: 3005
Blömer, J., & Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In Lecture Notes in Computer Science (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_2
LibreCat | DOI
 
[23]
2006 | Book Chapter | LibreCat-ID: 3007
Blömer, J., Otto, M., & Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In Lecture Notes in Computer Science (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_4
LibreCat | Files available | DOI
 
[22]
2005 | Book Chapter | LibreCat-ID: 3006
Blömer, J., & May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_15
LibreCat | Files available | DOI
 
[21]
2004 | Book Chapter | LibreCat-ID: 3011
Blömer, J., Guajardo, J., & Krummel, V. (2004). Provably Secure Masking of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_5
LibreCat | DOI
 
[20]
2004 | Book Chapter | LibreCat-ID: 3012
Blömer, J., & May, A. (2004). A Generalized Wiener Attack on RSA. In Public Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_1
LibreCat | Files available | DOI
 
[19]
2004 | Conference Paper | LibreCat-ID: 3017
Blömer, J., Otto, M., & Seifert, J.-P. (2004). 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. https://doi.org/10.1145/948109.948151
LibreCat | DOI
 
[18]
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, J., & May, A. (2003). New Partial Key Exposure Attacks on RSA. In Advances in Cryptology - CRYPTO 2003 (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45146-4_2
LibreCat | DOI
 
[17]
2003 | Book Chapter | LibreCat-ID: 3018
Blömer, J., & Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In Financial Cryptography (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45126-6_12
LibreCat | DOI
 
[16]
2002 | Journal Article | LibreCat-ID: 3034
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. IEEE Transactions on Information Theory, 42(6), 1737–1744. https://doi.org/10.1109/18.556670
LibreCat | Files available | DOI
 
[15]
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1994.365731
LibreCat | DOI
 
[14]
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
 
[13]
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45022-x_22
LibreCat | DOI
 
[12]
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, J., & Seifert, J.-P. (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99. https://doi.org/10.1145/301250.301441
LibreCat | Files available | DOI
 
[11]
1998 | Journal Article | LibreCat-ID: 3028
Blömer, J., & Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. Technical Report/Departement of Computer Science, ETH Zürich.
LibreCat | Files available
 
[10]
1997 | Book Chapter | LibreCat-ID: 3029
Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-63397-9_5
LibreCat | Files available | DOI
 
[9]
1997 | Journal Article | LibreCat-ID: 3033
Blömer, J., Karp, R., & Welzl, E. (1997). The rank of sparse random matrices over finite fields. Random Structures \& Algorithms, (4), 407–419. https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
LibreCat | DOI
 
[8]
1995 | Journal Article | LibreCat-ID: 3037
Alt, H., Behrends, B., & Blömer, J. (1995). Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence, 13(3).
LibreCat
 
[7]
1995 | Report | LibreCat-ID: 3038
Blömer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., & Zuckerman, D. (1995). An XOR-based erasure-resilient coding scheme. Berkeley, USA.
LibreCat | Files available
 
[6]
1992 | Dissertation | LibreCat-ID: 3043
Blömer, J. (1992). Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik.
LibreCat | Files available
 
[5]
1992 | Book Chapter | LibreCat-ID: 3046
Alt, H., & Blömer, J. (1992). Resemblance and symmetries of geometric patterns. In Data structures and efficient algorithms (pp. 1–24). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55488-2_19
LibreCat | DOI
 
[4]
1992 | Conference Paper | LibreCat-ID: 3047
Blömer, J. (1992). How to denest Ramanujan’s nested radicals. In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE. https://doi.org/10.1109/sfcs.1992.267807
LibreCat | DOI
 
[3]
1991 | Conference Paper | LibreCat-ID: 3048
Alt, H., Behrends, B., & Blömer, J. (1991). Approximate matching of polygonal shapes (extended abstract). In Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91. ACM Press. https://doi.org/10.1145/109648.109669
LibreCat | DOI
 
[2]
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
 
[1]
1990 | Book Chapter | LibreCat-ID: 3050
Alt, H., Blömer, J., & Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag. https://doi.org/10.1007/bfb0032068
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

79 Publications

Mark all

[79]
2023 | Conference Paper | LibreCat-ID: 44855
Hemmrich, S., Bobolz, J., Beverungen, D., & Blömer, J. (2023). Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain. ECIS 2023 Research Papers. ECIS 2023.
LibreCat | Files available | Download (ext.)
 
[78]
2023 | Book Chapter | LibreCat-ID: 45901 | OA
Blömer, J., Bobolz, J., Eidens, F., Jager, T., & Kramer, P. (2023). Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 237–246). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068755
LibreCat | Files available | DOI
 
[77]
2023 | Book Chapter | LibreCat-ID: 45891 | OA
Blömer, J., Eidens, F., Jager, T., Niehues, D., & Scheideler, C. (2023). Robustness and Security. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp. 145–164). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068629
LibreCat | Files available | DOI
 
[76]
2023 | Conference Paper | LibreCat-ID: 35014 | OA
Blömer, J., Bobolz, J., & Bröcher, H. (2023). On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. TCC 2023, Taipeh, Taiwan.
LibreCat | Download (ext.)
 
[75]
2023 | Conference Paper | LibreCat-ID: 43458 | OA
Blömer, J., Bobolz, J., & Porzenheim, L. A. (2023). A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. Asiacrypt 2023, Guangzhou, China.
LibreCat | Download (ext.)
 
[74]
2020 | Journal Article | LibreCat-ID: 20888
Blömer, J., Brauer, S., & Bujna, K. (2020). A Complexity Theoretical Study of Fuzzy K-Means. ACM Transactions on Algorithms, 16(4), 1–25. https://doi.org/10.1145/3409385
LibreCat | DOI
 
[73]
2020 | Journal Article | LibreCat-ID: 10790
Blömer, J., Brauer, S., Bujna, K., & Kuntze, D. (2020). How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. Advances in Data Analysis and Classification, 14, 147–173. https://doi.org/10.1007/s11634-019-00366-7
LibreCat | DOI
 
[72]
2019 | Conference Paper | LibreCat-ID: 13554 | OA
Blömer, J., & Löken, N. (2019). Personal Cross-Platform Reputation. In Security and Trust Management, STM 2019 (Vol. 11738). https://doi.org/10.1007/978-3-030-31511-5_9
LibreCat | Files available | DOI
 
[71]
2019 | Conference Paper | LibreCat-ID: 13557 | OA
Blömer, J., & Löken, N. (2019). Dynamic Searchable Encryption with Access Control. In 12th International Symposium on Foundations and Practice of Security, FPS 2019 (Vol. 12056). Springer.
LibreCat | Download (ext.)
 
[70]
2019 | Conference Paper | LibreCat-ID: 13904 | OA
Blömer, J., Bobolz, J., Diemert, D. P., & Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. 26th ACM Conference on Computer and Communications Security, London. https://doi.org/10.1145/3319535.3354223
LibreCat | Files available | DOI | Download (ext.)
 
[69]
2018 | Conference Paper | LibreCat-ID: 2862 | OA
Blömer, J., Eidens, F., & Juhnke, J. (2018). 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 (pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25
LibreCat | Files available | DOI | Download (ext.)
 
[68]
2018 | Journal Article | LibreCat-ID: 2685
Blömer, J., & Kohn, K. (2018). Voronoi Cells of Lattices with Respect to Arbitrary Norms. SIAM Journal on Applied Algebra and Geometry., 2(2), 314–338. https://doi.org/10.1137/17M1132045
LibreCat | Files available | DOI
 
[67]
2018 | Conference Paper | LibreCat-ID: 3265 | OA
Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens, F., … Stienemeier, M. (n.d.). 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. https://doi.org/10.1145/3230833.3234517
LibreCat | Files available | DOI | Download (ext.)
 
[66]
2018 | Conference Paper | LibreCat-ID: 2965
Blömer, J., & Löken, N. (n.d.). Cloud Architectures for Searchable Encryption. In Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018 (pp. 25:1--25:10). New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3230853
LibreCat | Files available | DOI
 
[65]
2018 | Working Paper | LibreCat-ID: 5820
Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat | Files available
 
[64]
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
 
[63]
2018 | Conference Paper | LibreCat-ID: 3873 | OA
Blömer, J., Eidens, F., & Juhnke, J. (2018). Enhanced Security of Attribute-Based Signatures. The International Conference on Cryptology And Network Security (CANS), 11124, 235–255. https://doi.org/10.1007/978-3-030-00434-7_12
LibreCat | Files available | DOI | Download (ext.)
 
[62]
2018 | Conference Paper | LibreCat-ID: 2379 | OA
Blömer, J., & Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. ACNS 2018 Applied Cryptography & Network Security. The 16th International Conference on Applied Cryptography and Network Security, Leuven, Belgium. https://doi.org/10.1007/978-3-319-93387-0_12
LibreCat | Files available | DOI | Download (ext.)
 
[61]
2017 | Conference Paper | LibreCat-ID: 2967 | OA
Blömer, J., & Liske, G. (2017). 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, pp. 438–453). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-72453-9_35
LibreCat | Files available | DOI | Download (ext.)
 
[60]
2017 | Conference Paper | LibreCat-ID: 2344 | OA
Blömer, J., Günther, P., Krummel, V., & Löken, N. (2017). Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In Foundations and Practice of Security (pp. 3–17). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-75650-9_1
LibreCat | Files available | DOI
 
[59]
2016 | Conference Paper | LibreCat-ID: 2947
Blömer, J., & Günther, P. (2016). Singular Curve Point Decompression Attack. In 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC). IEEE. https://doi.org/10.1109/fdtc.2015.17
LibreCat | DOI
 
[58]
2016 | Book Chapter | LibreCat-ID: 2968
Blömer, J., Lammersen, C., Schmidt, M., & Sohler, C. (2016). Theoretical Analysis of the k-Means Algorithm – A Survey. In Algorithm Engineering (pp. 81–116). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-49487-6_3
LibreCat | DOI
 
[57]
2016 | Preprint | LibreCat-ID: 2969 | OA
Blömer, J., Brauer, S., & Bujna, K. (2016). Hard-Clustering with Gaussian Mixture Models. Computing Research Repository.
LibreCat | Download (ext.)
 
[56]
2016 | Book Chapter | LibreCat-ID: 2970
Blömer, J., & Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In Advances in Knowledge Discovery and Data Mining (pp. 296–308). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-31750-2_24
LibreCat | DOI
 
[55]
2016 | Report | LibreCat-ID: 2971
Blömer, J., & Günther, P. (2016). Effizienz und Sicherheit paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops.
LibreCat
 
[54]
2016 | Conference Paper | LibreCat-ID: 2367
Blömer, J., Brauer, S., & Bujna, K. (2016). A Theoretical Analysis of the Fuzzy K-Means Problem. In 2016 IEEE 16th International Conference on Data Mining (ICDM) (pp. 805–810). Barcelona, Spain: IEEE. https://doi.org/10.1109/icdm.2016.0094
LibreCat | DOI
 
[53]
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
 
[52]
2016 | Book Chapter | LibreCat-ID: 2978
Blömer, J., & Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In Advances in Knowledge Discovery and Data Mining (pp. 296–308). Springer International Publishing. https://doi.org/10.1007/978-3-319-31750-2_24
LibreCat | DOI
 
[51]
2015 | Conference Paper | LibreCat-ID: 253
Blömer, J., Juhnke, J., & Löken, N. (2015). Short Group Signatures with Distributed Traceability. In Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS) (pp. 166–180). https://doi.org/10.1007/978-3-319-32859-1_14
LibreCat | Files available | DOI
 
[50]
2015 | Conference Paper | LibreCat-ID: 322 | OA
Blömer, J., Juhnke, J., & Kolb, C. (2015). Anonymous and Publicly Linkable Reputation Systems. In Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC) (pp. 478--488). https://doi.org/10.1007/978-3-662-47854-7_29
LibreCat | Files available | DOI | Download (ext.)
 
[49]
2015 | Report | LibreCat-ID: 233 | OA
Blömer, J., & Kohn, K. (2015). Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn.
LibreCat | Files available | Download (ext.)
 
[48]
2014 | Conference Paper | LibreCat-ID: 355
Blömer, J., Günther, P., & Liske, G. (2014). Tampering attacks in pairing-based cryptography. In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp. 1--7). https://doi.org/10.1109/FDTC.2014.10
LibreCat | Files available | DOI
 
[47]
2014 | Journal Article | LibreCat-ID: 2976
Ackermann, M. R., Blömer, J., Kuntze, D., & Sohler, C. (2014). Analysis of Agglomerative Clustering. Algorithmica, 69. https://doi.org/10.1007/s00453-012-9717-4
LibreCat | DOI
 
[46]
2014 | Conference Paper | LibreCat-ID: 2977
Blömer, J., Bujna, K., & Kuntze, D. (2014). A Theoretical and Experimental Comparison of the EM and SEM Algorithm. In 2014 22nd International Conference on Pattern Recognition. IEEE. https://doi.org/10.1109/icpr.2014.253
LibreCat | DOI
 
[45]
2014 | Preprint | LibreCat-ID: 442 | OA
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.)
 
[44]
2014 | Conference Paper | LibreCat-ID: 463
Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., & Seifert, J.-P. (2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp. 123--136). https://doi.org/10.1109/FDTC.2014.22
LibreCat | Files available | DOI
 
[43]
2013 | Book Chapter | LibreCat-ID: 2979
Blömer, J., Günther, P., & Liske, G. (2013). Improved Side Channel Attacks on Pairing Based Cryptography. In Constructive Side-Channel Analysis and Secure Design (pp. 154–168). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-40026-1_10
LibreCat | DOI
 
[42]
2013 | Conference Paper | LibreCat-ID: 488
Blömer, J., Günther, P., & Krummel, V. (2013). 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) (pp. 98–105).
LibreCat | Files available
 
[41]
2013 | Preprint | LibreCat-ID: 538 | OA
Blömer, J., & Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.
LibreCat | Files available | Download (ext.)
 
[40]
2012 | Journal Article | LibreCat-ID: 2984
Blömer, J. (2012). Turing und Kryptografie. Informatik-Spektrum, 35(4). https://doi.org/10.1007/s00287-012-0622-7
LibreCat | DOI
 
[39]
2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, M. R., Blömer, J., & Scholz, C. (2011). Hardness and Non-Approximability of Bregman Clustering Problems.
LibreCat
 
[38]
2011 | Book Chapter | LibreCat-ID: 2986
Blömer, J. (2011). How to Share a Secret. In Algorithms Unplugged (pp. 159–168). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_17
LibreCat | DOI
 
[37]
2011 | Preprint | LibreCat-ID: 2987
Blömer, J., & Naewe, S. (2011). Solving the Closest Vector Problem with respect to Lp Norms. ArXiv:1104.3720.
LibreCat
 
[36]
2010 | Book Chapter | LibreCat-ID: 2988
Ackermann, M. R., & Blömer, J. (2010). Bregman Clustering for Separable Instances. In SWAT 2010 (pp. 212–223). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_21
LibreCat | DOI
 
[35]
2010 | Journal Article | LibreCat-ID: 2990
Ackermann, M. R., Blömer, J., & Sohler, C. (2010). Clustering for Metric and Nonmetric Distance Measures. ACM Trans. Algorithms, (4), 59:1--59:26. https://doi.org/10.1145/1824777.1824779
LibreCat | DOI
 
[34]
2010 | Journal Article | LibreCat-ID: 2991
Krueger, A., Leutnant, V., Haeb-Umbach, R., Ackermann, M., & Blömer, J. (2010). On the initialization of dynamic models for speech features. Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany.
LibreCat
 
[33]
2010 | Conference Paper | LibreCat-ID: 2994
Schäfer, W., Trächtler, A., Birattari, M., Blömer, J., Dorigo, M., Engels, G., … Reif, W. (2010). Engineering self-coordinating software intensive systems. In Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10. ACM Press. https://doi.org/10.1145/1882362.1882428
LibreCat | DOI
 
[32]
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
 
[31]
2009 | Journal Article | LibreCat-ID: 2999
Blömer, J., & Naewe, S. (2009). Sampling methods for shortest vectors, closest vectors and successive minima. Theoretical Computer Science, (18), 1648–1665. https://doi.org/10.1016/j.tcs.2008.12.045
LibreCat | DOI
 
[30]
2007 | Book Chapter | LibreCat-ID: 3002 | OA
Blömer, J., & Krummel, V. (2007). Analysis of Countermeasures Against Access Driven Cache Attacks on AES. In Selected Areas in Cryptography (pp. 96–109). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-77360-3_7
LibreCat | DOI | Download (ext.)
 
[29]
2007 | Book Chapter | LibreCat-ID: 3020
Blömer, J., & May, A. (2007). Low Secret Exponent RSA Revisited. In Lecture Notes in Computer Science (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44670-2_2
LibreCat | DOI
 
[28]
2007 | Book Chapter | LibreCat-ID: 3021
Blömer, J., & May, A. (2007). Key Revocation with Interval Cover Families. In Selected Areas in Cryptography (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45537-x_26
LibreCat | DOI
 
[27]
2007 | Book Chapter | LibreCat-ID: 3026
Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-68530-8_13
LibreCat | DOI
 
[26]
2006 | Journal Article | LibreCat-ID: 3003
Blömer, J. (2006). Randomness and Secrecy - A Brief Introduction. Journal of Universal Computer Science (J.UCS), (6), 654--671. https://doi.org/10.3217/jucs-012-06-0654
LibreCat | DOI
 
[25]
2006 | Book Chapter | LibreCat-ID: 3004
Blömer, J., & Krummel, V. (2006). Fault Based Collision Attacks on AES. In Lecture Notes in Computer Science (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_11
LibreCat | DOI
 
[24]
2006 | Book Chapter | LibreCat-ID: 3005
Blömer, J., & Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In Lecture Notes in Computer Science (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_2
LibreCat | DOI
 
[23]
2006 | Book Chapter | LibreCat-ID: 3007
Blömer, J., Otto, M., & Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In Lecture Notes in Computer Science (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_4
LibreCat | Files available | DOI
 
[22]
2005 | Book Chapter | LibreCat-ID: 3006
Blömer, J., & May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11426639_15
LibreCat | Files available | DOI
 
[21]
2004 | Book Chapter | LibreCat-ID: 3011
Blömer, J., Guajardo, J., & Krummel, V. (2004). Provably Secure Masking of AES. In Selected Areas in Cryptography (pp. 69–83). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-30564-4_5
LibreCat | DOI
 
[20]
2004 | Book Chapter | LibreCat-ID: 3012
Blömer, J., & May, A. (2004). A Generalized Wiener Attack on RSA. In Public Key Cryptography – PKC 2004 (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-24632-9_1
LibreCat | Files available | DOI
 
[19]
2004 | Conference Paper | LibreCat-ID: 3017
Blömer, J., Otto, M., & Seifert, J.-P. (2004). 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. https://doi.org/10.1145/948109.948151
LibreCat | DOI
 
[18]
2003 | Book Chapter | LibreCat-ID: 3016
Blömer, J., & May, A. (2003). New Partial Key Exposure Attacks on RSA. In Advances in Cryptology - CRYPTO 2003 (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45146-4_2
LibreCat | DOI
 
[17]
2003 | Book Chapter | LibreCat-ID: 3018
Blömer, J., & Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In Financial Cryptography (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-45126-6_12
LibreCat | DOI
 
[16]
2002 | Journal Article | LibreCat-ID: 3034
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. IEEE Transactions on Information Theory, 42(6), 1737–1744. https://doi.org/10.1109/18.556670
LibreCat | Files available | DOI
 
[15]
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1994.365731
LibreCat | DOI
 
[14]
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
 
[13]
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45022-x_22
LibreCat | DOI
 
[12]
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, J., & Seifert, J.-P. (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99. https://doi.org/10.1145/301250.301441
LibreCat | Files available | DOI
 
[11]
1998 | Journal Article | LibreCat-ID: 3028
Blömer, J., & Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. Technical Report/Departement of Computer Science, ETH Zürich.
LibreCat | Files available
 
[10]
1997 | Book Chapter | LibreCat-ID: 3029
Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-63397-9_5
LibreCat | Files available | DOI
 
[9]
1997 | Journal Article | LibreCat-ID: 3033
Blömer, J., Karp, R., & Welzl, E. (1997). The rank of sparse random matrices over finite fields. Random Structures \& Algorithms, (4), 407–419. https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
LibreCat | DOI
 
[8]
1995 | Journal Article | LibreCat-ID: 3037
Alt, H., Behrends, B., & Blömer, J. (1995). Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence, 13(3).
LibreCat
 
[7]
1995 | Report | LibreCat-ID: 3038
Blömer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., & Zuckerman, D. (1995). An XOR-based erasure-resilient coding scheme. Berkeley, USA.
LibreCat | Files available
 
[6]
1992 | Dissertation | LibreCat-ID: 3043
Blömer, J. (1992). Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik.
LibreCat | Files available
 
[5]
1992 | Book Chapter | LibreCat-ID: 3046
Alt, H., & Blömer, J. (1992). Resemblance and symmetries of geometric patterns. In Data structures and efficient algorithms (pp. 1–24). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55488-2_19
LibreCat | DOI
 
[4]
1992 | Conference Paper | LibreCat-ID: 3047
Blömer, J. (1992). How to denest Ramanujan’s nested radicals. In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE. https://doi.org/10.1109/sfcs.1992.267807
LibreCat | DOI
 
[3]
1991 | Conference Paper | LibreCat-ID: 3048
Alt, H., Behrends, B., & Blömer, J. (1991). Approximate matching of polygonal shapes (extended abstract). In Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91. ACM Press. https://doi.org/10.1145/109648.109669
LibreCat | DOI
 
[2]
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
 
[1]
1990 | Book Chapter | LibreCat-ID: 3050
Alt, H., Blömer, J., & Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag. https://doi.org/10.1007/bfb0032068
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed