Johannes Blömer

Affiliations:
  • University of Paderborn, Department of Computer Science, Germany
  • ETH Zurich, Institute of Theoretical Computer Science, Switzerland (former)
  • International Computer Science Institute (ICSI), Berkeley, CA, USA (former)
  • FU Berlin, Department of Mathematics and Computer Science, Germany (PhD 1993)


According to our database1, Johannes Blömer authored at least 74 papers between 1990 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
A Complexity Theoretical Study of Fuzzy <i>K</i>-Means.
ACM Trans. Algorithms, 2020

How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models.
Adv. Data Anal. Classif., 2020

2019
Dynamic Searchable Encryption with Access Control.
IACR Cryptol. ePrint Arch., 2019

Updatable Anonymous Credentials and Applications to Incentive Systems.
IACR Cryptol. ePrint Arch., 2019

Personal Cross-Platform Reputation.
Proceedings of the Security and Trust Management - 15th International Workshop, 2019

2018
Voronoi Cells of Lattices with Respect to Arbitrary Norms.
SIAM J. Appl. Algebra Geom., 2018

Enhanced Security of Attribute-Based Signatures.
IACR Cryptol. ePrint Arch., 2018

Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems.
IACR Cryptol. ePrint Arch., 2018

Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures.
IACR Cryptol. ePrint Arch., 2018

Fully-Featured Anonymous Credentials with Reputation System.
IACR Cryptol. ePrint Arch., 2018

Coresets for Fuzzy K-Means with Applications.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Cloud Architectures for Searchable Encryption.
Proceedings of the 13th International Conference on Availability, Reliability and Security, 2018

2017
Subtleties in Security Definitions for Predicate Encryption with Public Index.
IACR Cryptol. ePrint Arch., 2017

Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.
Proceedings of the Foundations and Practice of Security - 10th International Symposium, 2017

2016
Theoretical Analysis of the k-Means Algorithm - A Survey.
Proceedings of the Algorithm Engineering - Selected Results and Surveys, 2016

Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.
IACR Cryptol. ePrint Arch., 2016

Theoretical Analysis of the $k$-Means Algorithm - A Survey.
CoRR, 2016

On Coreset Constructions for the Fuzzy $K$-Means Problem.
CoRR, 2016

Hard-Clustering with Gaussian Mixture Models.
CoRR, 2016

Adaptive Seeding for Gaussian Mixture Models.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2016

A Theoretical Analysis of the Fuzzy K-Means Problem.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015
Complexity and Approximation of the Fuzzy K-Means Problem.
CoRR, 2015

Short Group Signatures with Distributed Traceability.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Singular Curve Point Decompression Attack.
Proceedings of the 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2015

2014
A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.
IACR Cryptol. ePrint Arch., 2014

Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions.
IACR Cryptol. ePrint Arch., 2014

Anonymous and Publicly Linkable Reputation Systems.
IACR Cryptol. ePrint Arch., 2014

Analysis of Agglomerative Clustering.
Algorithmica, 2014

A Theoretical and Experimental Comparison of the EM and SEM Algorithm.
Proceedings of the 22nd International Conference on Pattern Recognition, 2014

Tampering Attacks in Pairing-Based Cryptography.
Proceedings of the 2014 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2014

2013
Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.
IACR Cryptol. ePrint Arch., 2013

Simple Methods for Initializing the EM Algorithm for Gaussian Mixture Models.
CoRR, 2013

2012
Turing und Kryptografie.
Inform. Spektrum, 2012

2011
Improved Side Channel Attacks on Pairing Based Cryptography.
IACR Cryptol. ePrint Arch., 2011

Hardness and Non-Approximability of Bregman Clustering Problems.
Electron. Colloquium Comput. Complex., 2011

Solving the Closest Vector Problem with respect to ℓ<sub>p</sub> Norms
CoRR, 2011

How to Share a Secret.
Proceedings of the Algorithms Unplugged, 2011

2010
Clustering for metric and nonmetric distance measures.
ACM Trans. Algorithms, 2010

Bregman Clustering for Separable Instances.
Proceedings of the Algorithm Theory, 2010

Engineering self-coordinating software intensive systems.
Proceedings of the Workshop on Future of Software Engineering Research, 2010

On the Initialization of Dynamic Models for Speech Features.
Proceedings of the 9. ITG-Fachtagung Sprachkommunikation 2010, 2010

2009
Sampling methods for shortest vectors, closest vectors and successive minima.
Theor. Comput. Sci., 2009

Coresets and approximate clustering for Bregman divergences.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
Teilen von Geheimnissen.
Proceedings of the Taschenbuch der Algorithmen, 2008

Clustering for metric and non-metric distance measures.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Analysis of countermeasures against access driven cache attacks on AES.
IACR Cryptol. ePrint Arch., 2007

07381 Abstracts Collection -- Cryptography.
Proceedings of the Cryptography, 16.09. - 21.09.2007, 2007

07381 Executive Summary - Cryptography.
Proceedings of the Cryptography, 16.09. - 21.09.2007, 2007

2006
Randomness and Secrecy - A Brief Introduction.
J. Univers. Comput. Sci., 2006

Wagner's Attack on a Secure CRT-RSA Algorithm Reconsidered.
Proceedings of the Fault Diagnosis and Tolerance in Cryptography, 2006

Fault Based Collision Attacks on AES.
Proceedings of the Fault Diagnosis and Tolerance in Cryptography, 2006

2005
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.
Proceedings of the Advances in Cryptology, 2005

2004
Provably Secure Masking of AES.
IACR Cryptol. ePrint Arch., 2004

Sign Change Fault Attacks On Elliptic Curve Cryptosystems.
IACR Cryptol. ePrint Arch., 2004

A Generalized Wiener Attack on RSA.
Proceedings of the Public Key Cryptography, 2004

2003
Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).
Proceedings of the Financial Cryptography, 2003

New Partial Key Exposure Attacks on RSA.
Proceedings of the Advances in Cryptology, 2003

A new CRT-RSA algorithm secure against bellcore attacks.
Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003

2002
Fault based cryptanalysis of the Advanced Encryption Standard.
IACR Cryptol. ePrint Arch., 2002

2001
Key Revocation with Interval Cover Families.
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

Low Secret Exponent RSA Revisited.
Proceedings of the Cryptography and Lattices, International Conference, 2001

2000
Denesting by Bounded Degree Radicals.
Algorithmica, 2000

Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

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, 1999

1998
A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers.
Proceedings of the Algorithms, 1998

1997
The rank of sparse random matrices over finite fields.
Random Struct. Algorithms, 1997

1996
Priority encoding transmission.
IEEE Trans. Inf. Theory, 1996

1995
Approximate Matching of Polygonal Shapes.
Ann. Math. Artif. Intell., 1995

1993
Simplifying expressions involving radicals.
PhD thesis, 1993

1992
How to Denest Ramanujan's Nested Radicals
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Resemblance and Symmetries of Geometric Patterns.
Proceedings of the Data Structures and Efficient Algorithms, 1992

1991
Computing Sums of Radicals in Polynomial Time
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Approximate Matching of Polygonal Shapes (Extended Abstract).
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990
Approximation of Convex Polygons.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990


  Loading...