Johannes Blömer

Sascha Brauer

Kathrin Bujna

CoRR, 2015

Short Group Signatures with Distributed Traceability.

[BibT_eX]

[DOI]

Jakob Juhnke

Nils Löken

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

Singular Curve Point Decompression Attack.

[BibT_eX]

[DOI]

Proceedings of the 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2015

Anonymous and Publicly Linkable Reputation Systems.

[BibT_eX]

[DOI]

Jakob Juhnke

Christina Kolb

Proceedings of the Financial Cryptography and Data Security, 2015

2014

Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

A Theoretical and Experimental Comparison of the EM and SEM Algorithm.

[BibT_eX]

[DOI]

Kathrin Bujna

Daniel Kuntze

Proceedings of the 22nd International Conference on Pattern Recognition, 2014

A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.

[BibT_eX]

[DOI]

Ricardo Gomes da Silva

Juliane Krämer

Proceedings of the 2014 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2014

Tampering Attacks in Pairing-Based Cryptography.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Simple Methods for Initializing the EM Algorithm for Gaussian Mixture Models.

[BibT_eX]

[DOI]

Kathrin Bujna

CoRR, 2013

Improved Side Channel Attacks on Pairing Based Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Constructive Side-Channel Analysis and Secure Design, 2013

2012

Turing und Kryptografie.

[BibT_eX]

[DOI]

Inform. Spektrum, 2012

2011

Hardness and Non-Approximability of Bregman Clustering Problems.

[BibT_eX]

[DOI]

Christoph Scholz

Electron. Colloquium Comput. Complex., 2011

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

[BibT_eX]

[DOI]

Stefanie Naewe

CoRR, 2011

Analysis of Agglomerative Clustering.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

How to Share a Secret.

[BibT_eX]

[DOI]

Proceedings of the Algorithms Unplugged, 2011

2010

Clustering for metric and nonmetric distance measures.

[BibT_eX]

[DOI]

Christian Sohler

ACM Trans. Algorithms, 2010

Bregman Clustering for Separable Instances.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2010

Engineering self-coordinating software intensive systems.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Future of Software Engineering Research, 2010

On the Initialization of Dynamic Models for Speech Features.

[BibT_eX]

[DOI]

Proceedings of the 9. ITG-Fachtagung Sprachkommunikation 2010, 2010

2009

Coresets and approximate clustering for Bregman divergences.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Teilen von Geheimnissen.

[BibT_eX]

[DOI]

Proceedings of the Taschenbuch der Algorithmen, 2008

Clustering for metric and non-metric distance measures.

[BibT_eX]

[DOI]

Christian Sohler

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007

Analysis of Countermeasures Against Access Driven Cache Attacks on AES.

[BibT_eX]

[DOI]

Volker Krummel

Proceedings of the Selected Areas in Cryptography, 14th International Workshop, 2007

Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.

[BibT_eX]

[DOI]

Stefanie Naewe

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

07381 Abstracts Collection -- Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Cryptography, 16.09. - 21.09.2007, 2007

07381 Executive Summary - Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Cryptography, 16.09. - 21.09.2007, 2007

2006

Randomness and Secrecy - A Brief Introduction.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2006

Sign Change Fault Attacks on Elliptic Curve Cryptosystems.

[BibT_eX]

[DOI]

Martin Otto

Proceedings of the Fault Diagnosis and Tolerance in Cryptography, 2006

Wagner's Attack on a Secure CRT-RSA Algorithm Reconsidered.

[BibT_eX]

[DOI]

Martin Otto

Proceedings of the Fault Diagnosis and Tolerance in Cryptography, 2006

Fault Based Collision Attacks on AES.

[BibT_eX]

[DOI]

Volker Krummel

Proceedings of the Fault Diagnosis and Tolerance in Cryptography, 2006

2005

A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

2004

Provably Secure Masking of AES.

[BibT_eX]

[DOI]

Jorge Guajardo

Volker Krummel

Proceedings of the Selected Areas in Cryptography, 11th International Workshop, 2004

A Generalized Wiener Attack on RSA.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2004

2003

Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography, 2003

New Partial Key Exposure Attacks on RSA.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2003

A new CRT-RSA algorithm secure against bellcore attacks.

[BibT_eX]

[DOI]

Martin Otto

Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003

2002

Fault based cryptanalysis of the Advanced Encryption Standard.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

2001

Key Revocation with Interval Cover Families.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

Low Secret Exponent RSA Revisited.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Lattices, International Conference, 2001

2000

Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1998

1997

The rank of sparse random matrices over finite fields.

[BibT_eX]

[DOI]

Richard M. Karp

Emo Welzl

Random Struct. Algorithms, 1997

Denesting by Bounded Degree Radicals.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1997

1995

Approximate Matching of Polygonal Shapes.

[BibT_eX]

[DOI]

Bernd Behrends

Ann. Math. Artif. Intell., 1995

1994

Priority Encoding Transmission

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Simplifying expressions involving radicals.

[BibT_eX]

[DOI]

PhD thesis, 1993

1992

How to Denest Ramanujan's Nested Radicals

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

Resemblance and Symmetries of Geometric Patterns.

[BibT_eX]

[DOI]

Proceedings of the Data Structures and Efficient Algorithms, 1992

1991

Computing Sums of Radicals in Polynomial Time

[BibT_eX]

[DOI]

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Approximate Matching of Polygonal Shapes (Extended Abstract).

[BibT_eX]

[DOI]

Bernd Behrends

Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

1990

Approximation of Convex Polygons.

[BibT_eX]

[DOI]