Achtung:

Sie haben Javascript deaktiviert!
Sie haben versucht eine Funktion zu nutzen, die nur mit Javascript möglich ist. Um sämtliche Funktionalitäten unserer Internetseite zu nutzen, aktivieren Sie bitte Javascript in Ihrem Browser.

AG Codes and Kryptographie Bildinformationen anzeigen

AG Codes and Kryptographie

Publikationen

2017

  • Sascha Brauer
    A Technical Report on PLS-Completeness of Single-Swap for Unweighted Metric Facility Location and K-Means
    In: Computing Research Repository, 2017, [Download]
  • Sascha Brauer
    Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
    In: 10th International Conference on Algorithms and Complexity (CIAC), 2017, [DOI], [Full Version]
  • Nils Löken
    Searchable Encryption with Access Control
    In: International Conference on Availability, Reliability and Security (ARES), 2017, [Full Version]
  • Johannes Blömer, Peter Günther, Volker Krummel, Nils Löken
    Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations
    In: 10th International Symposium on Foundations & Practice of Security, 2017

2016

  • Johannes Blömer, Christiane Lammersen, Melanie Schmidt, Christian Sohler
    Theoretical Analysis of the k-Means Algorithm -- A Survey
    In: Algorithm Engineering: Selected Results and Surveys, Springer International Publishing, 2016, [DOI]
  • Johannes Blömer, Sascha Brauer, Kathrin Bujna
    A Theoretical Analysis of the Fuzzy K-Means Problem
    In: IEEE International Conference on Data Mining (ICDM), 2016, [DOI]
  • Johannes Blömer, Sascha Brauer, Kathrin Bujna
    Hard-Clustering with Gaussian Mixture Models
    In: Computing Research Repository, 2016, [Download]
  • Johannes Blömer, Kathrin Bujna
    Adaptive Seeding for Gaussian Mixture Models
    In: Proceedings of the 20th Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD), 2016, [DOI]
  • Johannes Blömer, Peter Günther
    Effizienz und Sicherheit paarungsbasierter Kryptographie
    In: Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016
  • Johannes Blömer, Gennadij Liske
    Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
    In: CT-RSA, 2016, [DOI], [Download]

2015

  • Johannes Blömer, Sascha Brauer, Kathrin Bujna
    Complexity and Approximation of the Fuzzy K-Means Problem
    In: Computing Research Repository, 2015, [Download]
  • Johannes Blömer, Jakob Juhnke, Christina Kolb
    Anonymous and Publicly Linkable Reputation Systems
    In: Financial Cryptography and Data Security (FC), 2015, [DOI], [Download]
  • Johannes Blömer, Jakob Juhnke, Nils Löken
    Short Group Signatures with Distributed Traceability
    In: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015
  • Johannes Blömer, Kathlén Kohn
    Voronoi Cells of Lattices with Respect to Arbitrary Norms
    In: ArXiv e-prints, 2015, [Download]
  • Peter Günther, Johannes Blömer
    Singular Curve Point Decompression Attack
    In: Proceedings of Fault Tolerance and Diagnosis in Cryptography (FDTC), 2015, [DOI]
  • Volker Krummel, Peter Günther
    Implementing Cryptographic Pairings on Accumulator based Smart Card Architectures
    In: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015

2014

  • Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler
    Analysis of Agglomerative Clustering
    In: Algorithmica, 2014, [DOI]
  • Johannes Blömer, Kathrin Bujna, Daniel Kuntze
    A Theoretical and Experimental Comparison of the EM and SEM Algorithm
    In: Proceedings of the 22nd International Conference on Pattern Recognition (ICPR) 2014, Stockholm, Sweden, 2014, [DOI]
  • Johannes Blömer, Peter Günther, Gennadij Liske
    Tampering Attacks in Pairing-Based Cryptography
    In: Proceedings of Fault Tolerance and Diagnosis in Cryptography (FDTC '14), 2014, [DOI]
  • Johannes Blömer, Gennadij Liske
    Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions
    In: Cryptology ePrint Archive, 2014, [Download]
  • 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
    In: Proceedings of Fault Tolerance and Diagnosis in Cryptography (FDTC '14), 2014, [DOI], [Download]

2013

  • Johannes Blömer, Kathrin Bujna
    Simple Methods for Initializing the EM Algorithm for Gaussian Mixture Models
    In: Computing Research Repository, 2013, [Download]
  • Johannes Blömer, Kathrin Bujna, Daniel Kuntze
    A Theoretical and Experimental Comparison of the EM and SEM Algorithm
    In: Computing Research Repository, 2013, [Download]
  • Johannes Blömer, Peter Günther, Gennadij Liske
    Improved Side Channel Attacks on Pairing Based Cryptography
    In: Constructive Side-Channel Analysis and Secure Design, 2013, [DOI]
  • Johannes Blömer, Volker Krummel, Peter Günther
    Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study
    In: Proceedings of the Fifth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013
  • Johannes Blömer, Gennadij Liske
    Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles
    In: Cryptology ePrint Archive, 2013, [Download]
  • Jakob Juhnke, Hanno Lefmann, Volker Strehl
    An Approach for Determining Optimal Contrast in Visual Cryptography
    In: Fortschritt-Berichte VDI, 2013
  • Daniel Kuntze
    Practical algorithms for clustering and modeling large data sets - Analysis and improvements
    PhD Thesis, Paderborn University, 2013, [Download]

2012

  • Marcel R. Ackermann, Christiane Lammersen, Marcus Märtens, Christoph Raupach, Christian Sohler, Kamil Swierkot
    StreamKM++: A Clustering Algorithm for Data Streams
    In: ACM Journal of Experimental Algorithmics, 2012, [DOI]
  • Johannes Bl̈omer
    Turing und Kryptografie
    In: Informatik Spektrum, 2012, [DOI]

2011

  • Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler
    Analysis of Agglomerative Clustering
    In: Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS '11), 2011, [DOI]
  • Marcel R. Ackermann, Johannes Blömer, Christoph Scholz
    Hardness and Non-Approximability of Bregman Clustering Problems
    In: Electronic Colloquium on Computational Complexity (ECCC), 2011, [Download]
  • Johannes Blömer
    How to Share a Secret
    In: Algorithms Unplugged, Springer, 2011, [DOI]
  • Johannes Blömer, Peter Günther, Gennadij Liske
    Improved Side Channel Attacks on Pairing Based Cryptography
    In: Cryptology ePrint Archive, 2011, [Download]
  • Johannes Blömer, Stefanie Naewe
    Solving the Closest Vector Problem with Respect to Lp Norms
    In: Computing Research Repository (CoRR), 2011, [Download]
  • Stefanie Naewe
    Algorithms for lattice problems with respect to general norms
    PhD Thesis, Paderborn University, 2011, [Download]

2010

  • Marcel R. Ackermann, Johannes Blömer
    Bregman Clustering for Separable Instances
    In: Proceedings of the 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT '10), 2010, [DOI]
  • Marcel R. Ackermann, Johannes Blömer, Daniel Kuntze, Christian Sohler
    Analysis of Agglomerative Clustering
    In: Computing Research Repository (CoRR), 2010, [Download]
  • Marcel R. Ackermann, Johannes Blömer, Christian Sohler
    Clustering for Metric and Non-Metric Distance Measures
    In: ACM Transactions on Algorithms, 2010, [DOI]
  • Marcel R. Ackermann, Christiane Lammersen, Marcus Märtens, Christoph Raupach, Christian Sohler, Kamil Swierkot
    StreamKM++: A Clustering Algorithm for Data Streams
    In: Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX '10), 2010, [DOI]
  • Alexander Krüger, Volker Leutnant, Reinhold Häb-Umbach, Marcel R. Ackermann, Johannes Blömer
    On the Initialisation of Dynamic Models for Speech Features
    In: Sprachkommunikation 2010 -- Beiträge der 9. ITG-Fachtagung, 2010
  • Jonas Schrieb
    Efficient and Compact CCA Security from Partitioned IBKEM
    In: Proceedings of the 3rd Western European Workshop on Research in Cryptology (WEWoRC '09), 2010
  • Wilhelm Schäfer, Mauro Birattari, Johannes Blömer, Marco Dorigo, Gregor Engels, Rehan O'Grady, Marco Platzner
    Engineering Self-Coordinating Software Intensive Systems
    In: Proceedings of the FSE/SDP Workshop on the Future of Software Engineering Research (FoSER '10), 2010, [DOI]

2009

  • Marcel R. Ackermann
    Algorithms for the Bregman k-Median Problem
    PhD Thesis, Paderborn University, 2009, [Download]
  • Marcel R. Ackermann, Johannes Blömer
    Coresets and Approximate Clustering for Bregman Divergences
    In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '09), 2009, [DOI], [Download]
  • Johannes Blömer, Stefanie Naewe
    Sampling methods for shortest vectors, closest vectors and successive minima
    In: Theoretical Computer Science, 2009, [DOI]
  • Jonas Schrieb, Heike Wehrheim, Daniel Wonisch
    Three-Valued Spotlight Abstractions
    In: 16th International Symposium on Formal Methods, 2009, [DOI], [Download]

2008

  • Marcel R. Ackermann, Johannes Blömer, Christian Sohler
    Clustering for Metric and Non-Metric Distance Measures
    In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08), 2008, [Download]
  • Claudius Stern, Volker Krummel, Marcel R. Ackermann, Philipp Adelt
    Reliable Evidence of Data Integrity from an Untrusted Storage Service
    In: Proceedings of the 4th International Conference on Networking and Services (ICNS '08), 2008, [DOI]

2007

  • Johannes Blömer, Volker Krummel
    Analysis of countermeasures against access driven cache attacks on AES
    In: Selected Areas in Cryptography (SAC '07), 2007, [DOI], [Download]
  • Johannes Blömer, Stefanie Naewe
    Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
    In: Proceedings of the 34th ICALP, 2007, [DOI], [Download]
  • Volker Krummel
    Tamper Resistance of AES -- Models, Attacks and Countermeasures
    PhD Thesis, Paderborn University, 2007, [Download]

2006

  • Johannes Blömer
    Randomness and Secrecy - A Brief Introduction
    In: Journal of Universal Computer Science (J.UCS), 2006, [DOI]
  • Johannes Blömer, Volker Krummel
    Fault Based Collision Attacks on AES
    In: Fault Diagnosis and Tolerance in Cryptography (FDTC '06), 2006, [DOI]
  • Johannes Blömer, Martin Otto
    Wagner's Attack on a Secure CRT-RSA Algorithm Reconsidered
    In: Fault Diagnosis and Tolerance in Cryptography, 2006, [DOI]

2005

  • Johannes Blömer, Alexander May
    A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
    In: Advances in Cryptology (Eurocrypt '05), 2005, [DOI], [Download]
  • Johannes Blömer, Martin Otto, Jean-Pierre Seifert
    Sign Change Fault Attacks on Elliptic Curve Cryptosystems
    In: Fault Diagnosis and Tolerance in Cryptography, 2005, [DOI], [Download]
  • Matthias Ernst, Ellen Jochemsz, Alexander May, Benne de Weger
    Partial Key Exposure Attacks on RSA up to Full Size Exponents
    In: Advances in Cryptology (Eurocrypt '05), 2005, [DOI]

2004

  • Johannes Blömer, Jorge Guajardo, Volker Krummel
    Provably Secure Masking of AES
    In: Proceedings Selected Areas in Cryptography (SAC), 2004, [DOI]
  • Johannes Blömer, Alexander May
    A Generalized Wiener Attack on RSA
    In: Practice and Theory in Public Key Cryptography (PKC '04), 2004, [DOI], [Download]
  • Alexander May
    Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^rq
    In: Practice and Theory in Public Key Cryptography (PKC '04), 2004, [DOI]
  • Alexander May
    Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring
    In: Advances in Cryptology (Crypto 2004), 2004, [DOI]
  • Martin Otto
    Fault Attacks and Countermeasures
    PhD Thesis, Paderborn University, 2004, [Download]

2003

  • Johannes Blömer, Alexander May
    New Partial Key Exposure Attacks on RSA
    In: Advances in Cryptology (Crypto '03), 2003, [DOI]
  • Johannes Blömer, Martin Otto, Jean-Pierre Seifert
    A New CRT-RSA Algorithm Secure Against Bellcore Attacks
    In: Proceedings of the 10th ACM Conference on Computer and Communications Security (CCS '03), 2003, [DOI]
  • Johannes Blömer, Jean-Pierre Seifert
    Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)
    In: Financial Cryptography (FC'03), 2003, [DOI]
  • Alexander May
    New RSA Vulnerabilities Using Lattice Reduction Methods
    PhD Thesis, Paderborn University, 2003, [Download]

2002

  • Alexander May
    Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
    In: Advances in Cryptology (Crypto '02), 2002, [DOI]

2001

  • Johannes Blömer, Alexander May
    Low Secret Exponent RSA Revisited
    In: Cryptography and Lattice Conference (CaLC '01), 2001, [DOI]
  • Johannes Blömer, Alexander May
    Key Revocation with Interval Cover Families
    In: Selected Areas in Cryptography (SAC '01), 2001, [DOI]
  • Alexander May, Joseph H. Silverman
    Dimension Reduction Methods for Convolution Modular Lattices
    In: Cryptography and Lattice Conference (CaLC 2001), 2001, [DOI]

2000

  • Johannes Blömer
    Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
    In: Automata, Languages and Programming (ICALP), 2000, [DOI]

1999

  • Johannes Blömer, Jean-Pierre Seifert
    On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice
    In: Proceedings of the 31st ACM Symposium on Theory of Computing, 1999, [DOI], [Download]

1998

  • Johannes Blömer
    A Probabilistic Zero Test for Expressions Involving Roots of Rational Numbers
    In: Proceedings of 6th European Symposium on Algorithms, ESA '98, 1998, [DOI]
  • Johannes Blömer, Beat Trachsler
    A Lower Bound for a Class of Graph Based Loss-Resilient Codes
    Technical Report, ETH Zürich, Swiss, 1998, [Download]

1997

  • Johannes Blömer
    Denesting by Bounded Degree Radicals
    In: Proceedings of the 5th European Symposium on Algorithms (ESA '97), 1997, [DOI], [Download]
  • Johannes Blömer, Richard Karp, Emo Welzl
    The Rank of Sparse Random Matrices over Finite Fields
    In: Random Structures and Algorithms, 1997, [DOI]

1996

  • Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
    Priority Encoding Transmission
    In: IEEE Transactions on Information Theory, 1996, [DOI], [Download]

1995

  • Helmut Alt, Bernd Behrends, Johannes Blömer
    Approximate Matching of Polygonal Shapes
    In: Annals of Mathematics and Artificial Intelligence, 1995, [DOI]
  • Johannes Blömer, Malik Kalfane, Richard Karp, Marek Karpinski, Michael Luby, David Zuckerman
    An XOR-based Erasure-resilient Coding Scheme
    Technical Report, International Computer Science Institute, Berkeley, USA, 1995, [Download]

1994

  • Andres Albanese, Johannes Blömer, Jeff Edmonds, Michael Luby, Madhu Sudan
    Priority Encoding Transmission
    In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (FOCS '94), 1994, [DOI]

1993

  • Johannes Blömer
    Computing Sums of Radicals in Polynomial Time
    Technical Report, FU Berlin, Fachbereich Mathematik und Informatik, Institut für Informatik, 1993, [Download]
  • Johannes Blömer
    Simplifying expressions involving radicals
    PhD Thesis, Freie Universität Berlin, 1993, [Download]
  • Johannes Blömer
    On Kummer Theory and the Number of Roots of Unity in Radical Extensions of Q
    Technical Report, FU Berlin, Fachbereich Mathematik und Informatik, Institut für Informatik, 1993, [Download]

1992

  • Helmut Alt, Johannes Blömer
    Resemblance and Symmetries of Geometric Patterns
    In: Data Structures and Efficient Algorithms, 1992, [DOI]
  • Johannes Blömer
    How to Denest Ramanujan's Nested Radicals
    In: Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (FOCS '92), 1992, [DOI]

1991

  • Helmut Alt, Bernd Behrends, Johannes Blömer
    Approximate Matching of Polygonal Shapes
    In: Proceedings of the 7th ACM Symposium on Computational Geometry (SoCG '91), 1991, [DOI]
  • Johannes Blömer
    Computing Sums of Radicals in Polynomial Time
    In: Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FOCS '91), 1991, [DOI]

1990

  • Helmut Alt, Johannes Blömer, Michael Godau, Hubert Wagener
    Approximation of Convex Polygons
    In: Proceedings of the 17th International Colloquium on Automata, Languages and Programming (ICALP '90), 1990, [DOI]

Die Universität der Informationsgesellschaft