default search action
Johannes Blömer
Person information
- affiliation: University of Paderborn, Department of Computer Science, Germany
- affiliation (former): ETH Zurich, Institute of Theoretical Computer Science, Switzerland
- affiliation (former): International Computer Science Institute (ICSI), Berkeley, CA, USA
- affiliation (PhD 1993): FU Berlin, Department of Mathematics and Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [c53]Johannes Blömer
, Jan Bobolz
A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. ASIACRYPT (2) 2023: 418-452 - [c52]Simon Hemmrich, Jan Bobolz, Daniel Beverungen, Johannes Blömer:
Designing Business Reputation Ecosystems - a method for Issuing and Trading monetary Ratings on a Blockchain. ECIS 2023 - [c51]Johannes Blömer
On the Impossibility of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC. TCC (1) 2023: 380-410 - [i31]Johannes Blömer, Jan Bobolz, Laurens Porzenheim:
A Generic Construction of an Anonymous Reputation System and Instantiations from Lattices. IACR Cryptol. ePrint Arch. 2023: 464 (2023) - 2022
- [i30]Johannes Blömer, Jan Bobolz, Henrik Bröcher:
On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC. IACR Cryptol. ePrint Arch. 2022: 1762 (2022) - 2020
- [j12]Johannes Blömer, Sascha Brauer, Kathrin Bujna, Daniel Kuntze:
How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models. Adv. Data Anal. Classif. 14(1): 147-173 (2020) - [j11]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
A Complexity Theoretical Study of Fuzzy K-Means. ACM Trans. Algorithms 16(4): 53:1-53:25 (2020)
2010 – 2019
- 2019
- [c50]Johannes Blömer, Jan Bobolz, Denis Diemert, Fabian Eidens
Updatable Anonymous Credentials and Applications to Incentive Systems. CCS 2019: 1671-1685 - [c49]Johannes Blömer, Nils Löken:
Dynamic Searchable Encryption with Access Control. FPS 2019: 308-324 - [c48]Johannes Blömer, Nils Löken:
Personal Cross-Platform Reputation. STM 2019: 140-157 - [i29]Johannes Blömer, Jan Bobolz, Denis Diemert, Fabian Eidens:
Updatable Anonymous Credentials and Applications to Incentive Systems. IACR Cryptol. ePrint Arch. 2019: 169 (2019) - [i28]Johannes Blömer, Nils Löken:
Dynamic Searchable Encryption with Access Control. IACR Cryptol. ePrint Arch. 2019: 1038 (2019) - 2018
- [j10]Johannes Blömer, Kathlén Kohn
Voronoi Cells of Lattices with Respect to Arbitrary Norms. SIAM J. Appl. Algebra Geom. 2(2): 314-338 (2018) - [c47]Johannes Blömer, Nils Löken:
Cloud Architectures for Searchable Encryption. ARES 2018: 25:1-25:10 - [c46]Kai Bemmann, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Diemert, Fabian Eidens
Fully-Featured Anonymous Credentials with Reputation System. ARES 2018: 42:1-42:10 - [c45]Johannes Blömer, Jan Bobolz:
Delegatable Attribute-Based Anonymous Credentials from Dynamically Malleable Signatures. ACNS 2018: 221-239 - [c44]Johannes Blömer, Fabian Eidens
Enhanced Security of Attribute-Based Signatures. CANS 2018: 235-255 - [c43]Johannes Blömer, Fabian Eidens, Jakob Juhnke:
Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. CT-RSA 2018: 470-490 - [c42]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
Coresets for Fuzzy K-Means with Applications. ISAAC 2018: 46:1-46:12 - [i27]Johannes Blömer, Fabian Eidens, Jakob Juhnke:
Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems. IACR Cryptol. ePrint Arch. 2018: 29 (2018) - [i26]Johannes Blömer, Jan Bobolz:
Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures. IACR Cryptol. ePrint Arch. 2018: 340 (2018) - [i25]Kai Bemmann, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Diemert, Fabian Eidens, Lukas Eilers, Jan Haltermann, Jakob Juhnke, Burhan Otour, Laurens Porzenheim, Simon Pukrop, Erik Schilling, Michael Schlichtig, Marcel Stienemeier:
Fully-Featured Anonymous Credentials with Reputation System. IACR Cryptol. ePrint Arch. 2018: 835 (2018) - [i24]Johannes Blömer, Fabian Eidens, Jakob Juhnke:
Enhanced Security of Attribute-Based Signatures. IACR Cryptol. ePrint Arch. 2018: 874 (2018) - 2017
- [c41]Johannes Blömer, Peter Günther, Volker Krummel, Nils Löken:
Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. FPS 2017: 3-17 - [c40]Johannes Blömer, Gennadij Liske:
Subtleties in Security Definitions for Predicate Encryption with Public Index. MACIS 2017: 438-453 - [e2]Johannes Blömer, Ilias S. Kotsireas, Temur Kutsia, Dimitris E. Simos:
Mathematical Aspects of Computer and Information Sciences - 7th International Conference, MACIS 2017, Vienna, Austria, November 15-17, 2017, Proceedings. Lecture Notes in Computer Science 10693, Springer 2017, ISBN 978-3-319-72452-2 [contents] - [i23]Johannes Blömer, Gennadij Liske:
Subtleties in Security Definitions for Predicate Encryption with Public Index. IACR Cryptol. ePrint Arch. 2017: 453 (2017) - 2016
- [c39]Johannes Blömer, Gennadij Liske:
Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. CT-RSA 2016: 431-447 - [c38]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
A Theoretical Analysis of the Fuzzy K-Means Problem. ICDM 2016: 805-810 - [c37]Johannes Blömer, Kathrin Bujna:
Adaptive Seeding for Gaussian Mixture Models. PAKDD (2) 2016: 296-308 - [p3]Johannes Blömer, Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Theoretical Analysis of the k-Means Algorithm - A Survey. Algorithm Engineering 2016: 81-116 - [i22]Johannes Blömer, Christiane Lammersen, Melanie Schmidt, Christian Sohler:
Theoretical Analysis of the $k$-Means Algorithm - A Survey. CoRR abs/1602.08254 (2016) - [i21]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
Hard-Clustering with Gaussian Mixture Models. CoRR abs/1603.06478 (2016) - [i20]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
On Coreset Constructions for the Fuzzy $K$-Means Problem. CoRR abs/1612.07516 (2016) - [i19]Johannes Blömer, Gennadij Liske:
Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. IACR Cryptol. ePrint Arch. 2016: 206 (2016) - 2015
- [c36]Johannes Blömer, Jakob Juhnke, Christina Kolb:
Anonymous and Publicly Linkable Reputation Systems. Financial Cryptography 2015: 478-488 - [c35]Johannes Blömer, Peter Günther:
Singular Curve Point Decompression Attack. FDTC 2015: 71-84 - [c34]Johannes Blömer, Jakob Juhnke, Nils Löken:
Short Group Signatures with Distributed Traceability. MACIS 2015: 166-180 - [i18]Johannes Blömer, Kathlén Kohn:
Voronoi Cells of Lattices with Respect to Arbitrary Norms. CoRR abs/1512.00720 (2015) - [i17]Johannes Blömer, Sascha Brauer, Kathrin Bujna:
Complexity and Approximation of the Fuzzy K-Means Problem. CoRR abs/1512.05947 (2015) - 2014
- [j9]Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler
Analysis of Agglomerative Clustering. Algorithmica 69(1): 184-215 (2014) - [c33]Johannes Blömer, Peter Günther, Gennadij Liske:
Tampering Attacks in Pairing-Based Cryptography. FDTC 2014: 1-7 - [c32]Johannes Blömer, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer, Jean-Pierre Seifert:
A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. FDTC 2014: 123-136 - [c31]Johannes Blömer, Kathrin Bujna, Daniel Kuntze:
A Theoretical and Experimental Comparison of the EM and SEM Algorithm. ICPR 2014: 1419-1424 - [i16]Johannes Blömer, Gennadij Liske:
Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions. IACR Cryptol. ePrint Arch. 2014: 511 (2014) - [i15]Johannes Blömer, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer, Jean-Pierre Seifert:
A Practical Second-Order Fault Attack against a Real-World Pairing Implementation. IACR Cryptol. ePrint Arch. 2014: 543 (2014) - [i14]Johannes Blömer, Jakob Juhnke, Christina Kolb:
Anonymous and Publicly Linkable Reputation Systems. IACR Cryptol. ePrint Arch. 2014: 546 (2014) - 2013
- [c30]Johannes Blömer, Peter Günther, Gennadij Liske:
Improved Side Channel Attacks on Pairing Based Cryptography. COSADE 2013: 154-168 - [i13]Johannes Blömer, Kathrin Bujna, Daniel Kuntze:
A Theoretical and Experimental Comparison of the EM and SEM Algorithm. CoRR abs/1310.5034 (2013) - [i12]Johannes Blömer, Kathrin Bujna:
Simple Methods for Initializing the EM Algorithm for Gaussian Mixture Models. CoRR abs/1312.5946 (2013) - [i11]Johannes Blömer, Gennadij Liske:
Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. IACR Cryptol. ePrint Arch. 2013: 646 (2013) - 2012
- [j8]Johannes Blömer:
Turing und Kryptografie. Inform. Spektrum 35(4): 261-270 (2012) - 2011
- [c29]Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler
Analysis of Agglomerative Clustering. STACS 2011: 308-319 - [p2]Johannes Blömer:
How to Share a Secret. Algorithms Unplugged 2011: 159-168 - [i10]Johannes Blömer, Stefanie Naewe:
Solving the Closest Vector Problem with respect to ℓp Norms. CoRR abs/1104.3720 (2011) - [i9]Marcel R. Ackermann, Johannes Blömer, Christoph Scholz:
Hardness and Non-Approximability of Bregman Clustering Problems. Electron. Colloquium Comput. Complex. TR11 (2011) - [i8]Johannes Blömer, Peter Günther, Gennadij Liske:
Improved Side Channel Attacks on Pairing Based Cryptography. IACR Cryptol. ePrint Arch. 2011: 706 (2011) - 2010
- [j7]Marcel R. Ackermann
Clustering for metric and nonmetric distance measures. ACM Trans. Algorithms 6(4): 59:1-59:26 (2010) - [c28]Alexander Krueger, Volker Leutnant, Reinhold Haeb-Umbach, Marcel R. Ackermann, Johannes Blömer:
On the Initialization of Dynamic Models for Speech Features. Sprachkommunikation 2010: 1-4 - [c27]Wilhelm Schäfer, Mauro Birattari
Engineering self-coordinating software intensive systems. FoSER 2010: 321-324 - [c26]Marcel R. Ackermann
Bregman Clustering for Separable Instances. SWAT 2010: 212-223 - [i7]Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler:
Analysis of Agglomerative Clustering. CoRR abs/1012.3697 (2010)
2000 – 2009
- 2009
- [j6]Johannes Blömer, Stefanie Naewe:
Sampling methods for shortest vectors, closest vectors and successive minima. Theor. Comput. Sci. 410(18): 1648-1665 (2009) - [c25]Marcel R. Ackermann, Johannes Blömer:
Coresets and approximate clustering for Bregman divergences. SODA 2009: 1088-1097 - 2008
- [c24]Marcel R. Ackermann, Johannes Blömer, Christian Sohler
Clustering for metric and non-metric distance measures. SODA 2008: 799-808 - [p1]Johannes Blömer:
Teilen von Geheimnissen. Taschenbuch der Algorithmen 2008: 171-180 - [e1]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer:
Cryptography, 16.09. - 21.09.2007. Dagstuhl Seminar Proceedings 07381, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - 2007
- [c23]Johannes Blömer, Stefanie Naewe:
Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima. ICALP 2007: 65-77 - [c22]Johannes Blömer, Volker Krummel:
Analysis of Countermeasures Against Access Driven Cache Attacks on AES. Selected Areas in Cryptography 2007: 96-109 - [i6]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer:
07381 Executive Summary - Cryptography. Cryptography 2007 - [i5]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer:
07381 Abstracts Collection -- Cryptography. Cryptography 2007 - [i4]Johannes Blömer, Volker Krummel:
Analysis of countermeasures against access driven cache attacks on AES. IACR Cryptol. ePrint Arch. 2007 (2007) - 2006
- [j5]Johannes Blömer:
Randomness and Secrecy - A Brief Introduction. J. Univers. Comput. Sci. 12(6): 654-671 (2006) - [c21]Johannes Blömer, Martin Otto:
Wagner's Attack on a Secure CRT-RSA Algorithm Reconsidered. FDTC 2006: 13-23 - [c20]Johannes Blömer, Martin Otto, Jean-Pierre Seifert:
Sign Change Fault Attacks on Elliptic Curve Cryptosystems. FDTC 2006: 36-52 - [c19]Johannes Blömer, Volker Krummel:
Fault Based Collision Attacks on AES. FDTC 2006: 106-120 - 2005
- [c18]Johannes Blömer, Alexander May
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. EUROCRYPT 2005: 251-267 - 2004
- [c17]Johannes Blömer, Alexander May
A Generalized Wiener Attack on RSA. Public Key Cryptography 2004: 1-13 - [c16]Johannes Blömer, Jorge Guajardo, Volker Krummel:
Provably Secure Masking of AES. Selected Areas in Cryptography 2004: 69-83 - [i3]Johannes Blömer, Jorge Guajardo, Volker Krummel:
Provably Secure Masking of AES. IACR Cryptol. ePrint Arch. 2004: 101 (2004) - [i2]Johannes Blömer, Martin Otto, Jean-Pierre Seifert:
Sign Change Fault Attacks On Elliptic Curve Cryptosystems. IACR Cryptol. ePrint Arch. 2004: 227 (2004) - 2003
- [c15]Johannes Blömer, Martin Otto, Jean-Pierre Seifert:
A new CRT-RSA algorithm secure against bellcore attacks. CCS 2003: 311-320 - [c14]Johannes Blömer, Alexander May
New Partial Key Exposure Attacks on RSA. CRYPTO 2003: 27-43 - [c13]Johannes Blömer, Jean-Pierre Seifert:
Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). Financial Cryptography 2003: 162-181 - 2002
- [i1]Johannes Blömer, Jean-Pierre Seifert:
Fault based cryptanalysis of the Advanced Encryption Standard. IACR Cryptol. ePrint Arch. 2002: 75 (2002) - 2001
- [c12]Johannes Blömer, Alexander May
Low Secret Exponent RSA Revisited. CaLC 2001: 4-19 - [c11]Johannes Blömer, Alexander May
Key Revocation with Interval Cover Families. Selected Areas in Cryptography 2001: 325-341 - 2000
- [j4]Johannes Blömer:
Denesting by Bounded Degree Radicals. Algorithmica 28(1): 2-15 (2000) - [c10]Johannes Blömer:
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. ICALP 2000: 248-259
1990 – 1999
- 1999
- [c9]Johannes Blömer, Jean-Pierre Seifert:
On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice. STOC 1999: 711-720 - 1998
- [c8]Johannes Blömer:
A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers. ESA 1998: 151-162 - 1997
- [j3]Johannes Blömer, Richard M. Karp, Emo Welzl:
The rank of sparse random matrices over finite fields. Random Struct. Algorithms 10(4): 407-419 (1997) - [c7]Johannes Blömer:
Denesting by Bounded Degree Radicals. ESA 1997: 53-63 - 1996
- [j2]Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan:
Priority encoding transmission. IEEE Trans. Inf. Theory 42(6): 1737-1744 (1996) - 1995
- [j1]Helmut Alt, Bernd Behrends, Johannes Blömer:
Approximate Matching of Polygonal Shapes. Ann. Math. Artif. Intell. 13(3-4): 251-265 (1995) - 1994
- [c6]Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan:
Priority Encoding Transmission. FOCS 1994: 604-612 - 1993
- [b1]Johannes Blömer:
Simplifying expressions involving radicals. FU Berlin, Germany, 1993, pp. 1-157 - 1992
- [c5]Helmut Alt, Johannes Blömer:
Resemblance and Symmetries of Geometric Patterns. Data Structures and Efficient Algorithms 1992: 1-24 - [c4]Johannes Blömer:
How to Denest Ramanujan's Nested Radicals. FOCS 1992: 447-456 - 1991
- [c3]Helmut Alt, Bernd Behrends, Johannes Blömer:
Approximate Matching of Polygonal Shapes (Extended Abstract). SCG 1991: 186-193 - [c2]Johannes Blömer:
Computing Sums of Radicals in Polynomial Time. FOCS 1991: 670-677 - 1990
- [c1]Helmut Alt, Johannes Blömer, Hubert Wagener:
Approximation of Convex Polygons. ICALP 1990: 703-716
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: