Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Johannes Blömer
2010 – today
- 2013
[c31]Johannes Blömer, Peter Günther, Gennadij Liske: Improved Side Channel Attacks on Pairing Based Cryptography. COSADE 2013: 154-168- 2012
- [j8]
- 2011
- [c30]Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler: Analysis of Agglomerative Clustering. STACS 2011: 308-319
- [p2]
- [i8]Johannes Blömer, Stefanie Naewe: Solving the Closest Vector Problem with respect to $\ell_p$ Norms. CoRR abs/1104.3720 (2011)
- [i7]Marcel R. Ackermann, Johannes Blömer, Christoph Scholz: Hardness and Non-Approximability of Bregman Clustering Problems. Electronic Colloquium on Computational Complexity (ECCC) 18: 15 (2011)
- [i6]Johannes Blömer, Peter Günther, Gennadij Liske: Improved Side Channel Attacks on Pairing Based Cryptography. IACR Cryptology ePrint Archive 2011: 706 (2011)
- 2010
- [j7]Marcel R. Ackermann, Johannes Blömer, Christian Sohler: Clustering for metric and nonmetric distance measures. ACM Transactions on Algorithms 6(4) (2010)
- [c29]Wilhelm Schäfer, Mauro Birattari, Johannes Blömer, Marco Dorigo, Gregor Engels, Rehan O'Grady, Marco Platzner, Franz-Josef Rammig, Wolfgang Reif, Ansgar Trächtler: Engineering self-coordinating software intensive systems. FoSER 2010: 321-324
- [c28]Marcel R. Ackermann, Johannes Blömer: Bregman Clustering for Separable Instances. SWAT 2010: 212-223
- [i5]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)
- [c27]Marcel R. Ackermann, Johannes Blömer: Coresets and approximate clustering for Bregman divergences. SODA 2009: 1088-1097
- 2008
- [c26]Marcel R. Ackermann, Johannes Blömer, Christian Sohler: Clustering for metric and non-metric distance measures. SODA 2008: 799-808
- [p1]
- [e1]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer (Eds.): Cryptography, 16.09. - 21.09.2007. Dagstuhl Seminar Proceedings 07381, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- 2007
- [c25]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer: 07381 Executive Summary - Cryptography. Cryptography 2007
- [c24]Johannes Blömer, Dan Boneh, Ronald Cramer, Ueli M. Maurer: 07381 Abstracts Collection -- Cryptography. Cryptography 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
- [i4]Johannes Blömer, Volker Krummel: Analysis of countermeasures against access driven cache attacks on AES. IACR Cryptology ePrint Archive 2007: 282 (2007)
- 2006
- [j5]
- [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]
- 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 Cryptology ePrint Archive 2004: 101 (2004)
- [i2]Johannes Blömer, Martin Otto, Jean-Pierre Seifert: Sign Change Fault Attacks On Elliptic Curve Cryptosystems. IACR Cryptology ePrint Archive 2004: 227 (2004)
- 2003
- [c15]Johannes Blömer, Martin Otto, Jean-Pierre Seifert: A new CRT-RSA algorithm secure against bellcore attacks. ACM Conference on Computer and Communications Security 2003: 311-320
- [c14]
- [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 Cryptology ePrint Archive 2002: 75 (2002)
- 2001
- [c12]
- [c11]Johannes Blömer, Alexander May: Key Revocation with Interval Cover Families. Selected Areas in Cryptography 2001: 325-341
- 2000
- [j4]
- [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]
- 1996
- [j2]Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan: Priority encoding transmission. IEEE Transactions on Information 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
- 1992
- [c5]Helmut Alt, Johannes Blömer: Resemblance and Symmetries of Geometric Patterns. Data Structures and Efficient Algorithms 1992: 1-24
- [c4]
- 1991
- [c3]Helmut Alt, Bernd Behrends, Johannes Blömer: Approximate Matching of Polygonal Shapes (Extended Abstract). Symposium on Computational Geometry 1991: 186-193
- [c2]
- 1990
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:04 CEST by the dblp team