Blömer, Johannes, et al. “A Complexity Theoretical Study of Fuzzy K-Means.”10.1145/3409385__ACM Transactions on Algorithms, vol. 16, no. 4, 2020, pp. 1–25, doi:10.1145/3409385.
LibreCat: /record/20888
DOI: 10.1145/3409385

Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.”10.1007/978-3-540-24632-9_1__Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, 2004, pp. 1–13, doi:10.1007/978-3-540-24632-9_1.
LibreCat: /record/3012
DOI: 10.1007/978-3-540-24632-9_1

Blömer, Johannes, et al. A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. 2023.
LibreCat: /record/43458

Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” Technical Report/Departement of Computer Science, ETH Zürich, 1998.
LibreCat: /record/3028

Blömer, Johannes, et al. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.”10.1145/948109.948151__Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03, ACM Press, 2004, doi:10.1145/948109.948151.
LibreCat: /record/3017
DOI: 10.1145/948109.948151

Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.”10.1109/FDTC.2014.22__Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136, doi:10.1109/FDTC.2014.22.
LibreCat: /record/463
DOI: 10.1109/FDTC.2014.22

Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.”10.1007/3-540-68530-8_13__Algorithms — ESA’ 98, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:10.1007/3-540-68530-8_13.
LibreCat: /record/3026
DOI: 10.1007/3-540-68530-8_13

Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.”10.1109/icdm.2016.0094__2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–10, doi:10.1109/icdm.2016.0094.
LibreCat: /record/2367
DOI: 10.1109/icdm.2016.0094

Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the EM and SEM Algorithm.”10.1109/icpr.2014.253__2014 22nd International Conference on Pattern Recognition, IEEE, 2014, doi:10.1109/icpr.2014.253.
LibreCat: /record/2977
DOI: 10.1109/icpr.2014.253

Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.”10.1007/11426639_15__EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:10.1007/11426639_15.
LibreCat: /record/3006
DOI: 10.1007/11426639_15

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”10.1007/978-3-319-31750-2_24__Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.
LibreCat: /record/2970
DOI: 10.1007/978-3-319-31750-2_24

Blömer, Johannes, and Kathrin Bujna. “Adaptive Seeding for Gaussian Mixture Models.”10.1007/978-3-319-31750-2_24__Advances in Knowledge Discovery and Data Mining, Springer International Publishing, 2016, pp. 296–308, doi:10.1007/978-3-319-31750-2_24.
LibreCat: /record/2978
DOI: 10.1007/978-3-319-31750-2_24

Blömer, Johannes, et al. An XOR-Based Erasure-Resilient Coding Scheme. 1995.
LibreCat: /record/3038

Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.”10.1007/s00453-012-9717-4__Algorithmica, vol. 69, Springer US, 2014, doi:10.1007/s00453-012-9717-4.
LibreCat: /record/2976
DOI: 10.1007/s00453-012-9717-4

Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.”10.1007/978-3-540-77360-3_7__Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 96–109, doi:10.1007/978-3-540-77360-3_7.
LibreCat: /record/3002
DOI: 10.1007/978-3-540-77360-3_7

Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.”10.1007/978-3-662-47854-7_29__Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488, doi:10.1007/978-3-662-47854-7_29.
LibreCat: /record/322
DOI: 10.1007/978-3-662-47854-7_29

Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
LibreCat: /record/3037

Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes (Extended Abstract).”10.1145/109648.109669__Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91, ACM Press, 1991, doi:10.1145/109648.109669.
LibreCat: /record/3048
DOI: 10.1145/109648.109669

Alt, Helmut, et al. “Approximation of Convex Polygons.”10.1007/bfb0032068__Automata, Languages and Programming, Springer-Verlag, 1990, pp. 703–16, doi:10.1007/bfb0032068.
LibreCat: /record/3050
DOI: 10.1007/bfb0032068

Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.”10.1007/978-3-319-75650-9_1__Foundations and Practice of Security, Springer International Publishing, 2017, pp. 3–17, doi:10.1007/978-3-319-75650-9_1.
LibreCat: /record/2344
DOI: 10.1007/978-3-319-75650-9_1

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”10.1007/978-3-642-13731-0_21__SWAT 2010, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:10.1007/978-3-642-13731-0_21.
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.”10.1007/3-540-45022-x_22__Automata, Languages and Programming, Springer Berlin Heidelberg, 2000, pp. 248–59, doi:10.1007/3-540-45022-x_22.
LibreCat: /record/3023
DOI: 10.1007/3-540-45022-x_22

Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.”10.1145/3230833.3230853__Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, pp. 25:1--25:10, doi:10.1145/3230833.3230853.
LibreCat: /record/2965
DOI: 10.1145/3230833.3230853

Ackermann, Marcel R., et al. “Clustering for Metric and Nonmetric Distance Measures.”10.1145/1824777.1824779__ACM Trans. Algorithms, no. 4, 2010, pp. 59:1--59:26, doi:10.1145/1824777.1824779.
LibreCat: /record/2990
DOI: 10.1145/1824777.1824779

Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.”10.1109/sfcs.1991.185434__Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991, doi:10.1109/sfcs.1991.185434.
LibreCat: /record/3049
DOI: 10.1109/sfcs.1991.185434

Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.”10.1109/sfcs.1991.185434__[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002, doi:10.1109/sfcs.1991.185434.
LibreCat: /record/3041
DOI: 10.1109/sfcs.1991.185434

Blömer, Johannes, and Gennadij Liske. Constructing CCA-Secure Predicate Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions. Universität Paderborn, 2014.
LibreCat: /record/442

Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.”10.1007/978-3-319-29485-8_25__Proceedings of the CT-RSA 2016, 2016, pp. 431–47, doi:10.1007/978-3-319-29485-8_25.
LibreCat: /record/208
DOI: 10.1007/978-3-319-29485-8_25

Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.”10.1137/1.9781611973068.118__Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2009, pp. 1088–97, doi:10.1137/1.9781611973068.118.
LibreCat: /record/2995
DOI: 10.1137/1.9781611973068.118

Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.”10.4230/LIPIcs.ISAAC.2018.46__29th International Symposium on Algorithms and Computation  (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:10.4230/LIPIcs.ISAAC.2018.46.
LibreCat: /record/4344
DOI: 10.4230/LIPIcs.ISAAC.2018.46

Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures.”10.1007/978-3-319-93387-0_12__ACNS 2018 Applied Cryptography &; Network Security, doi:10.1007/978-3-319-93387-0_12.
LibreCat: /record/2379
DOI: 10.1007/978-3-319-93387-0_12

Blömer, Johannes. “Denesting by Bounded Degree Radicals.”10.1007/3-540-63397-9_5__Algorithms — ESA ’97, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:10.1007/3-540-63397-9_5.
LibreCat: /record/3029
DOI: 10.1007/3-540-63397-9_5

Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.” ECIS 2023 Research Papers, 2023.
LibreCat: /record/44855

Blömer, Johannes, and Gennadij Liske. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn, 2013.
LibreCat: /record/538

Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access Control.” 12th International Symposium on Foundations and Practice of Security, FPS 2019, vol. 12056, Springer, 2019.
LibreCat: /record/13557

Blömer, Johannes, and Peter Günther. Effizienz Und Sicherheit Paarungsbasierter Kryptographie. Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
LibreCat: /record/2971

Schäfer, Wilhelm, et al. “Engineering Self-Coordinating Software Intensive Systems.”10.1145/1882362.1882428__Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010, doi:10.1145/1882362.1882428.
LibreCat: /record/2994
DOI: 10.1145/1882362.1882428

Blömer, Johannes, et al. “Enhanced Security of Attribute-Based Signatures.”10.1007/978-3-030-00434-7_12__The International Conference on Cryptology And Network Security (CANS), vol. 11124, Springer, 2018, pp. 235–55, doi:10.1007/978-3-030-00434-7_12.
LibreCat: /record/3873
DOI: 10.1007/978-3-030-00434-7_12

Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”10.1007/11889700_11__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:10.1007/11889700_11.
LibreCat: /record/3004
DOI: 10.1007/11889700_11

Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).”10.1007/978-3-540-45126-6_12__Financial Cryptography, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:10.1007/978-3-540-45126-6_12.
LibreCat: /record/3018
DOI: 10.1007/978-3-540-45126-6_12

Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation System.”10.1145/3230833.3234517__Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, doi:10.1145/3230833.3234517.
LibreCat: /record/3265
DOI: 10.1145/3230833.3234517

Blömer, Johannes, et al. Hard-Clustering with Gaussian Mixture Models. Computing Research Repository, 2016.
LibreCat: /record/2969

Ackermann, Marcel R., et al. Hardness and Non-Approximability of Bregman Clustering Problems. 2011.
LibreCat: /record/2985

Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.”10.1109/sfcs.1992.267807__Proceedings., 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, doi:10.1109/sfcs.1992.267807.
LibreCat: /record/3047
DOI: 10.1109/sfcs.1992.267807

Blömer, Johannes. “How to Share a Secret.”10.1007/978-3-642-15328-0_17__Algorithms Unplugged, Springer Berlin Heidelberg, 2011, pp. 159–68, doi:10.1007/978-3-642-15328-0_17.
LibreCat: /record/2986
DOI: 10.1007/978-3-642-15328-0_17

Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture Models.”10.1007/s11634-019-00366-7__Advances in Data Analysis and Classification, vol. 14, 2020, pp. 147–173, doi:10.1007/s11634-019-00366-7.
LibreCat: /record/10790
DOI: 10.1007/s11634-019-00366-7

Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.”10.1007/978-3-642-40026-1_10__Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, 2013, pp. 154–68, doi:10.1007/978-3-642-40026-1_10.
LibreCat: /record/2979
DOI: 10.1007/978-3-642-40026-1_10

Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.”10.1007/3-540-45537-x_26__Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:10.1007/3-540-45537-x_26.
LibreCat: /record/3021
DOI: 10.1007/3-540-45537-x_26

Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.”10.1007/3-540-44670-2_2__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2.
LibreCat: /record/3020
DOI: 10.1007/3-540-44670-2_2

Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.”10.1007/978-3-540-45146-4_2__Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:10.1007/978-3-540-45146-4_2.
LibreCat: /record/3016
DOI: 10.1007/978-3-540-45146-4_2

Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.”10.1145/301250.301441__Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99, ACM Press, 1999, doi:10.1145/301250.301441.
LibreCat: /record/3024
DOI: 10.1145/301250.301441

Blömer, Johannes, et al. On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC. 2023.
LibreCat: /record/35014

Krueger, Alexander, et al. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat: /record/2991

Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.”10.1007/978-3-030-31511-5_9__Security and Trust Management, STM 2019, vol. 11738, 2019, doi:10.1007/978-3-030-31511-5_9.
LibreCat: /record/13554
DOI: 10.1007/978-3-030-31511-5_9

Blömer, Johannes, et al. “Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems.”10.5281/zenodo.8068755__On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–46, doi:10.5281/zenodo.8068755.
LibreCat: /record/45901
DOI: 10.5281/zenodo.8068755

Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.”10.1007/978-3-319-76953-0_25__Topics in Cryptology - CT-RSA 2018 - The Cryptographers’ Track at the RSA Conference 2018, Proceedings, Springer International Publishing, 2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25.
LibreCat: /record/2862
DOI: 10.1007/978-3-319-76953-0_25

Albanese, Andres, et al. “Priority Encoding Transmission.”10.1109/18.556670__IEEE Transactions on Information Theory, vol. 42, no. 6, Institute of Electrical and Electronics Engineers (IEEE), 2002, pp. 1737–44, doi:10.1109/18.556670.
LibreCat: /record/3034
DOI: 10.1109/18.556670

Albanese, A., et al. “Priority Encoding Transmission.”10.1109/sfcs.1994.365731__Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002, doi:10.1109/sfcs.1994.365731.
LibreCat: /record/3040
DOI: 10.1109/sfcs.1994.365731

Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat: /record/5820

Blömer, Johannes, et al. “Provably Secure Masking of AES.”10.1007/978-3-540-30564-4_5__Selected Areas in Cryptography, Springer Berlin Heidelberg, 2004, pp. 69–83, doi:10.1007/978-3-540-30564-4_5.
LibreCat: /record/3011
DOI: 10.1007/978-3-540-30564-4_5

Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.”10.3217/jucs-012-06-0654__Journal of Universal Computer Science (J.UCS), no. 6, 2006, pp. 654--671, doi:10.3217/jucs-012-06-0654.
LibreCat: /record/3003
DOI: 10.3217/jucs-012-06-0654

Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.”10.1007/3-540-55488-2_19__Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, 1992, pp. 1–24, doi:10.1007/3-540-55488-2_19.
LibreCat: /record/3046
DOI: 10.1007/3-540-55488-2_19

Blömer, Johannes, et al. “Robustness and Security.”10.5281/zenodo.8068629__On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64, doi:10.5281/zenodo.8068629.
LibreCat: /record/45891
DOI: 10.5281/zenodo.8068629

Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.”10.1016/j.tcs.2008.12.045__Theoretical Computer Science, no. 18, 2009, pp. 1648–65, doi:10.1016/j.tcs.2008.12.045.
LibreCat: /record/2999
DOI: 10.1016/j.tcs.2008.12.045

Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.
LibreCat: /record/488

Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.”10.1007/978-3-319-32859-1_14__Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–80, doi:10.1007/978-3-319-32859-1_14.
LibreCat: /record/253
DOI: 10.1007/978-3-319-32859-1_14

Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”10.1007/11889700_4__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 36–52, doi:10.1007/11889700_4.
LibreCat: /record/3007
DOI: 10.1007/11889700_4

Blömer, Johannes. Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
LibreCat: /record/3043

Blömer, Johannes, and Peter Günther. “Singular Curve Point Decompression Attack.”10.1109/fdtc.2015.17__2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2016, doi:10.1109/fdtc.2015.17.
LibreCat: /record/2947
DOI: 10.1109/fdtc.2015.17

Blömer, Johannes, and Stefanie Naewe. “Solving the Closest Vector Problem with Respect to Lp Norms.” ArXiv:1104.3720, 2011.
LibreCat: /record/2987

Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for Predicate Encryption with Public Index.”10.1007/978-3-319-72453-9_35__Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), vol. 10693, Springer International Publishing, 2017, pp. 438–53, doi:10.1007/978-3-319-72453-9_35.
LibreCat: /record/2967
DOI: 10.1007/978-3-319-72453-9_35

Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.”10.1109/FDTC.2014.10__Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 1--7, doi:10.1109/FDTC.2014.10.
LibreCat: /record/355
DOI: 10.1109/FDTC.2014.10

Blömer, Johannes, et al. “The Rank of Sparse Random Matrices over Finite Fields.”10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y__Random Structures \'26; Algorithms, no. 4, 1997, pp. 407–19, doi:10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y.
LibreCat: /record/3033
DOI: 10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y

Blömer, Johannes, et al. “Theoretical Analysis of the K-Means Algorithm – A Survey.”10.1007/978-3-319-49487-6_3__Algorithm Engineering, Springer International Publishing, 2016, pp. 81–116, doi:10.1007/978-3-319-49487-6_3.
LibreCat: /record/2968
DOI: 10.1007/978-3-319-49487-6_3

Blömer, Johannes. “Turing Und Kryptografie.”10.1007/s00287-012-0622-7__Informatik-Spektrum, vol. 35, no. 4, 2012, doi:10.1007/s00287-012-0622-7.
LibreCat: /record/2984
DOI: 10.1007/s00287-012-0622-7

Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.”10.1145/3319535.3354223__Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019, doi:10.1145/3319535.3354223.
LibreCat: /record/13904
DOI: 10.1145/3319535.3354223

Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect to Arbitrary Norms.”10.1137/17M1132045__SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, 2018, pp. 314–38, doi:10.1137/17M1132045.
LibreCat: /record/2685
DOI: 10.1137/17M1132045

Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect to Arbitrary Norms. Universität Paderborn, 2015.
LibreCat: /record/233

Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.”10.1007/11889700_2__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:10.1007/11889700_2.
LibreCat: /record/3005
DOI: 10.1007/11889700_2