@phdthesis{2909,
  author       = {{Kuntze, Daniel}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Practical algorithms for clustering and modeling large data sets - Analysis and improvements}}},
  year         = {{2013}},
}

@techreport{2917,
  author       = {{Juhnke, Jakob and Lefmann, Hanno and Strehl, Volker}},
  publisher    = {{Fortschritt-Berichte VDI}},
  title        = {{{An Approach for Determining Optimal Contrast in Visual Cryptography}}},
  year         = {{2013}},
}

@inbook{2979,
  author       = {{Blömer, Johannes and Günther, Peter and Liske, Gennadij}},
  booktitle    = {{Constructive Side-Channel Analysis and Secure Design}},
  isbn         = {{9783642400254}},
  issn         = {{0302-9743}},
  pages        = {{154--168}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Improved Side Channel Attacks on Pairing Based Cryptography}}},
  doi          = {{10.1007/978-3-642-40026-1_10}},
  year         = {{2013}},
}

@misc{471,
  author       = {{Tezer, Alina}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen}}},
  year         = {{2013}},
}

@misc{486,
  author       = {{Otte, Oliver}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Seitenkanalresistenz paarungsbasierter Kryptographie}}},
  year         = {{2013}},
}

@misc{487,
  author       = {{Bobolz, Jan}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Security Proofs for Pairing-Based Cryptography in the Generic Group Model}}},
  year         = {{2013}},
}

@inproceedings{488,
  abstract     = {{Unattended systems are key ingredients of various critical infrastruc-tures like networks of self service terminals or automated teller machines.For cost and efficiency reasons they should mostly run autonomously.Unattended systems are attractive and lucrative targets for various kindsof attacks, including attacks on the integrity of their components and thecommunication between components. In this paper, we propose a gen-eral cryptographic framework to protect unattended systems. We alsodemonstrate that instantiating the framework with techniques from iden-tity based cryptography is particularly well-suited to efficiently secureunattended systems.}},
  author       = {{Blömer, Johannes and Günther, Peter and Krummel, Volker}},
  booktitle    = {{Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}},
  pages        = {{98--105}},
  title        = {{{Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study}}},
  year         = {{2013}},
}

@unpublished{538,
  abstract     = {{We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes: a key-policy attribute-based KEM that is based on Goyal's key-policy ABE and a ciphertext-policy attribute-based KEM that is based on Waters' ciphertext-policy ABE. To achieve our goals, we use an appropriate hash function and need to extend the public parameters and the ciphertexts of the underlying CPA-secure encryption schemes only by a single group element. Moreover, we use the same hardness assumptions as the underlying CPA-secure encryption schemes.}},
  author       = {{Blömer, Johannes and Liske, Gennadij}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles}}},
  year         = {{2013}},
}

@misc{553,
  author       = {{Kohn, Kathlén}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}}},
  year         = {{2013}},
}

@inproceedings{2982,
  author       = {{Ackermann, Marcel Rudolf and Märtens, Marcus and Raupach, Christoph and Swierkot, Kamil and Lammersen, Christiane and Sohler, Christian}},
  publisher    = {{ACM}},
  title        = {{{StreamKM++: A clustering algorithm for data streams}}},
  doi          = {{10.1145/2133803.2184450}},
  volume       = {{17}},
  year         = {{2012}},
}

@article{2984,
  abstract     = {{Ich beschreibe die deutsche Enigma-Verschlüsselungsmaschine und skizziere, wie sie von den Codebrechern von Bletchely Park um Alan Turing gebrochen wurde. Besonderes Augenmerk lege ich auf die Beiträge Alan Turings und die Bedeutung seiner Leistung für die Entwicklung moderner Kryptografie. }},
  author       = {{Blömer, Johannes}},
  issn         = {{1432-122X}},
  journal      = {{Informatik-Spektrum}},
  number       = {{4}},
  title        = {{{Turing und Kryptografie}}},
  doi          = {{10.1007/s00287-012-0622-7}},
  volume       = {{35}},
  year         = {{2012}},
}

@misc{606,
  author       = {{Löken, Nils}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas}}},
  year         = {{2012}},
}

@misc{607,
  author       = {{Haarhoff, Thomas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}}},
  year         = {{2012}},
}

@misc{629,
  author       = {{Schleiter, Patrick}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Attribute-basierte Verschlüsselung}}},
  year         = {{2012}},
}

@misc{2872,
  author       = {{Böttger, Timm}},
  title        = {{{Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen}}},
  year         = {{2011}},
}

@misc{2902,
  author       = {{Märtens, Marcus}},
  title        = {{{The Monotone Complexity of Computing k-Clique on Random Graphs}}},
  year         = {{2011}},
}

@inproceedings{2985,
  author       = {{Ackermann, Marcel R and Blömer, Johannes and Scholz, Christoph}},
  title        = {{{Hardness and Non-Approximability of Bregman Clustering Problems.}}},
  year         = {{2011}},
}

@inbook{2986,
  author       = {{Blömer, Johannes}},
  booktitle    = {{Algorithms Unplugged}},
  isbn         = {{9783642153273}},
  pages        = {{159--168}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{How to Share a Secret}}},
  doi          = {{10.1007/978-3-642-15328-0_17}},
  year         = {{2011}},
}

@misc{659,
  author       = {{Liske, Gennadij}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Fault attacks in pairing-based cryptography}}},
  year         = {{2011}},
}

@phdthesis{2910,
  author       = {{ Naewe, Stefanie}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Algorithms for lattice problems with respect to general norms}}},
  year         = {{2011}},
}