@misc{299,
  author       = {{Gerken, Britta}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie}}},
  year         = {{2015}},
}

@misc{301,
  author       = {{Bobolz, Jan}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Efficient Verifier-Local Revocation for Anonymous Credentials}}},
  year         = {{2015}},
}

@misc{302,
  author       = {{Stroh, Christian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Efficient Attributes for Pairing-Based Anonymous Credentials}}},
  year         = {{2015}},
}

@misc{312,
  author       = {{Schleiter, Patrick}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Constructions of Fully Secure Predicate Encryption Schemes}}},
  year         = {{2015}},
}

@misc{273,
  author       = {{Kohn, Kathlén}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms}}},
  year         = {{2015}},
}

@techreport{233,
  abstract     = {{Motivated by the deterministic single exponential time algorithm of Micciancio and Voulgaris for solving the shortest and closest vector problem for the Euclidean norm, we study the geometry and complexity of Voronoi cells of lattices with respect to arbitrary norms.On the positive side, we show that for strictly convex and smooth norms the geometry of Voronoi cells of lattices in any dimension is similar to the Euclidean case, i.e., the Voronoi cells are defined by the so-called Voronoi-relevant vectors and the facets of a Voronoi cell are in one-to-one correspondence with these vectors. On the negative side, we show that combinatorially Voronoi cells for arbitrary strictly convex and smooth norms are much more complicated than in the Euclidean case.In particular, we construct a family of three-dimensional lattices whose number of Voronoi-relevant vectors with respect to the l_3-norm is unbounded.Since the algorithm of Micciancio and Voulgaris and its run time analysis crucially dependonthefactthatfortheEuclidean normthenumber of Voronoi-relevant vectors is single exponential in the lattice dimension, this indicates that the techniques of Micciancio and Voulgaris cannot be extended to achieve deterministic single exponential time algorithms for lattice problems with respect to arbitrary l_p-norms.}},
  author       = {{Blömer, Johannes and Kohn, Kathlén}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Voronoi Cells of Lattices with Respect to Arbitrary Norms}}},
  year         = {{2015}},
}

@misc{2866,
  author       = {{Biermeier, Felix}},
  title        = {{{Untersuchung des Erreichbarkeitsproblems in ungerichteten Graphen bezüglich den Komplexitätsklassen L und SL}}},
  year         = {{2014}},
}

@misc{2867,
  author       = {{Sauer, Malte}},
  title        = {{{Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen}}},
  year         = {{2014}},
}

@inproceedings{355,
  abstract     = {{In the last decade pairings have become an important, and often indispensable, ingredient in the construction of identity-based and attribute-based cryptosystems, as well as group signatures and credential systems. Consequently, the applicability of timing, power, or fault attacks to implementations of pairings is an important research topic. We will review some of the known results in this area.}},
  author       = {{Blömer, Johannes and Günther, Peter and Liske, Gennadij}},
  booktitle    = {{Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}},
  pages        = {{1----7}},
  title        = {{{Tampering attacks in pairing-based cryptography}}},
  doi          = {{10.1109/FDTC.2014.10}},
  year         = {{2014}},
}

@misc{369,
  abstract     = {{RSA Full Domain Hash ist im Zufallsorakelmodell ein EUF-CMA sicheres Signaturverfahren (existentially unforgeable under chosen-message attacks). Der Sicherheitsbeweis wird unter anderem in der Vorlesung Einf{\"u}hrung in die Kryptographie vorgestellt. Auch bei einer genaueren Analyse verliert man bei der Reduktion einen Faktor \nicefrac{1}{q_{s}}(wobei q_{s}die Anzahl der Anfragen an das Signaturorakel darstellt), was f{\"u}r die Praxis in relativ großen Systemparametern (RSA-Modul) resultiert [1].Seit der Ver{\"o}ffentlichung von [2] wurde geglaubt, dass der Faktor \nicefrac{1}{q_{s}}optimal ist. Erst zehn Jahre sp{\"a}ter offenbarten die Autoren von [3] einen Fehler in [2] und zeigten eine bessere Reduktion allerdings unter einer etwas st{\"a}rkeren Sicherheitsannahme.Die Ergebnisse aus [3] lassen sich auf PSS-Verfahren (Probabilistic Signature Scheme), das z.B. in PKCS #1 benutzt wird, {\"u}bertragen und sind somit von großer Bedeutung f{\"u}r die Praxis. Weiterhin sind die in den Beweisen verwendete Techniken n{\"u}tzlich auch bei anderen kryptographischen Verfahren.In Rahmen dieser Arbeit sollen die entsprechenden Sicherheitsbeweise aufgearbeitet und dessen Auswirkungen f{\"u}r die Praxis analysiert werden.[1] J.S. Coron, “On the Exact Security of Full Domain Hash”, CRYPTO 2000. LNCS 1880, pp. 229-235, 2000.[2] J.S. Coron, “Optimal security proofs for PPS and other signature schemes”, EUROCRYPT 2002. LNCS 2332, pp 272-287, 2002.[3] S.A. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited”, in EUROCRYPT 2012. LNCS 7237, pp 537-553, 2012.}},
  author       = {{Rath, Timo}},
  publisher    = {{Universität Paderborn}},
  title        = {{{RSA-Full Domain Hash Revisited}}},
  year         = {{2014}},
}

@misc{2900,
  author       = {{Brauer, Sascha}},
  title        = {{{A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian Mixtures}}},
  year         = {{2014}},
}

@article{2976,
  author       = {{Ackermann, Marcel Rudolf and Blömer, Johannes and Kuntze, Daniel and Sohler, Christian}},
  issn         = {{0178-4617}},
  journal      = {{Algorithmica}},
  publisher    = {{Springer US}},
  title        = {{{Analysis of Agglomerative Clustering}}},
  doi          = {{10.1007/s00453-012-9717-4}},
  volume       = {{69}},
  year         = {{2014}},
}

@inproceedings{2977,
  author       = {{Blömer, Johannes and Bujna, Kathrin and Kuntze, Daniel}},
  booktitle    = {{2014 22nd International Conference on Pattern Recognition}},
  isbn         = {{9781479952090}},
  publisher    = {{IEEE}},
  title        = {{{A Theoretical and Experimental Comparison of the EM and SEM Algorithm}}},
  doi          = {{10.1109/icpr.2014.253}},
  year         = {{2014}},
}

@unpublished{442,
  abstract     = {{We present a new transformation of chosen-plaintext secure predicate encryption schemes with public index into chosen-ciphertext secure schemes. Our construction requires only a universal one-way hash function and is selectively secure in the standard model. The transformation is not generic but can be applied to various existing schemes constructed from bilinear groups. Using common structural properties of these schemes we provide an efficient and simple transformation without overhead in form of one-time signatures or message authentication codes as required in the known generic transformations.}},
  author       = {{Blömer, Johannes and Liske, Gennadij}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions}}},
  year         = {{2014}},
}

@inproceedings{463,
  abstract     = {{Several fault attacks against pairing-based cryptography have been described theoretically in recent years. Interestingly, none of these have been practically evaluated. We accomplished this task and prove that fault attacks against pairing-based cryptography are indeed possible and are even practical — thus posing a serious threat. Moreover, we successfully conducted a second-order fault attack against an open source implementation of the eta pairing on an AVR XMEGA A1. We injected the first fault into the computation of the Miller Algorithm and applied the second fault to skip the final exponentiation completely. We introduce a low-cost setup that allowed us to generate multiple independent faults in one computation. The setup implements these faults by clock glitches which induce instruction skips. With this setup we conducted the first practical fault attack against a complete pairing computation.}},
  author       = {{Blömer, Johannes and Gomes da Silva, Ricardo and Günther, Peter and Krämer, Juliane and Seifert, Jean-Pierre}},
  booktitle    = {{Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)}},
  pages        = {{123----136}},
  title        = {{{A Practical Second-Order Fault Attack against a Real-World Pairing Implementation}}},
  doi          = {{10.1109/FDTC.2014.22}},
  year         = {{2014}},
}

@misc{414,
  author       = {{Jochheim, Janek}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Hiding software components using functional encryption}}},
  year         = {{2014}},
}

@misc{416,
  author       = {{Bemmann, Pascal}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Group Signature Schemes with Strong Exculpability}}},
  year         = {{2014}},
}

@misc{421,
  author       = {{Lippert, Jan}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Fujisaki-Okamoto Transformation}}},
  year         = {{2014}},
}

@misc{2868,
  author       = {{Laudemann, Stefan}},
  title        = {{{Themenmodellierung zur Identifikation und Gruppierung von Spam-Webseiten}}},
  year         = {{2013}},
}

@misc{2869,
  author       = {{Leder, Lennart}},
  title        = {{{Nichtapproximierbarkeitsresultate zu Radius- und Durchmesserclustering unter Verwendung von L_p-Metriken}}},
  year         = {{2013}},
}