J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.
LibreCat: /record/538

K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.
LibreCat: /record/553

M. R. Ackermann, M. Märtens, C. Raupach, K. Swierkot, C. Lammersen, and C. Sohler, “StreamKM++: A clustering algorithm for data streams,” vol. 17. ACM, New York, NY, USA, 2012.
LibreCat: /record/2982
DOI: 10.1145/2133803.2184450

J. Blömer, “Turing und Kryptografie,” Informatik-Spektrum, vol. 35, no. 4, 2012.
LibreCat: /record/2984
DOI: 10.1007/s00287-012-0622-7

N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012.
LibreCat: /record/606

T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.
LibreCat: /record/607

P. Schleiter, Attribute-basierte Verschlüsselung. Universität Paderborn, 2012.
LibreCat: /record/629

T. Böttger, Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen. 2011.
LibreCat: /record/2872

M. Märtens, The Monotone Complexity of Computing k-Clique on Random Graphs. 2011.
LibreCat: /record/2902

S. Naewe, Algorithms for lattice problems with respect to general norms. Universität Paderborn, 2011.
LibreCat: /record/2910

M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability of Bregman Clustering Problems.” 2011.
LibreCat: /record/2985

J. Blömer, “How to Share a Secret,” in Algorithms Unplugged, Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.
LibreCat: /record/2986
DOI: 10.1007/978-3-642-15328-0_17

J. Blömer and S. Naewe, “Solving the Closest Vector Problem with respect to Lp Norms,” arXiv:1104.3720. 2011.
LibreCat: /record/2987

G. Liske, Fault attacks in pairing-based cryptography. Universität Paderborn, 2011.
LibreCat: /record/659

M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,” in SWAT 2010, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 212–223.
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

M. R. Ackermann, J. Blömer, and C. Sohler, “Clustering for Metric and Nonmetric Distance Measures,” ACM Trans. Algorithms, no. 4, pp. 59:1--59:26, 2010.
LibreCat: /record/2990
DOI: 10.1145/1824777.1824779

A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, and J. Blömer, “On the initialization of dynamic models for speech features,” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat: /record/2991

J. Schrieb, “Efficient and Compact CCA Security from Partitioned IBKEM.” 2010.
LibreCat: /record/2993

W. Schäfer et al., “Engineering self-coordinating software intensive systems,” in Proceedings of the FSE/SDP workshop on Future of software engineering research - FoSER ’10, 2010.
LibreCat: /record/2994
DOI: 10.1145/1882362.1882428

T. Postler, Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung. 2010.
LibreCat: /record/47684

C. Schröer, Hierarchisches Clustering mit minimalen Cluster-Durchmessern. 2009.
LibreCat: /record/2880

G. Liske, Analyse und Evaluation eines identitätsbasierten Signcryption-Verfahrens. 2009.
LibreCat: /record/2896

C. Scholz, Die Schwierigkeit des k-Median Clusterings für Bregman-Divergenzen. 2009.
LibreCat: /record/2904

M. R. Ackermann, Algorithms for the Bregman k-Median Problem. Universität Paderborn, 2009.
LibreCat: /record/2911

M. R. Ackermann and J. Blömer, “Coresets and Approximate Clustering for Bregman Divergences,” in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009, pp. 1088–1097.
LibreCat: /record/2995
DOI: 10.1137/1.9781611973068.118

J. Blömer and S. Naewe, “Sampling methods for shortest vectors, closest vectors and successive minima,” Theoretical Computer Science, no. 18, pp. 1648–1665, 2009.
LibreCat: /record/2999
DOI: 10.1016/j.tcs.2008.12.045

J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.
LibreCat: /record/3000
DOI: 10.1007/978-3-642-05089-3_8

C. Stern, P. Adelt, V. Krummel, and M. R. Ackermann, “Reliable Evidence of Data Integrity from an Untrusted Storage Service,” in Fourth International Conference on Networking and Services (icns 2008), 2008.
LibreCat: /record/3001
DOI: 10.1109/icns.2008.28

J. Schrieb, Construction and Applications of Identity-Based Encryption without Pairings. 2008.
LibreCat: /record/47685

V. Krummel, Tamper Resistance of AES -- Models, Attacks and Countermeasures. Universität Paderborn, 2007.
LibreCat: /record/2912

J. Blömer and V. Krummel, “Analysis of Countermeasures Against Access Driven Cache Attacks on AES,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 96–109.
LibreCat: /record/3002
DOI: 10.1007/978-3-540-77360-3_7

A. May, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent,” in Advances in Cryptology — CRYPTO 2002, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 242–256.
LibreCat: /record/3019
DOI: 10.1007/3-540-45708-9_16

J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.
LibreCat: /record/3020
DOI: 10.1007/3-540-44670-2_2

J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.
LibreCat: /record/3021
DOI: 10.1007/3-540-45537-x_26

A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution Modular Lattices,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–125.
LibreCat: /record/3022
DOI: 10.1007/3-540-44670-2_10

J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.
LibreCat: /record/3026
DOI: 10.1007/3-540-68530-8_13

S. Ziegert, Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem. 2007.
LibreCat: /record/47650

M. Richert, Sichere Kryptosysteme durch Zero-Knowledge. 2007.
LibreCat: /record/47651

W. Klein, Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln. 2007.
LibreCat: /record/47688

O. Käthler, Kryptanalyse des EAC-Protokolls biometrischer Reisepässe. 2007.
LibreCat: /record/47690

B. Brieden, Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode. 2007.
LibreCat: /record/47687

D. Kuntze, Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz. 2007.
LibreCat: /record/47689

J. Borghoff, Vergleich multivariater Varianten der Methode von Coppersmith. 2007.
LibreCat: /record/47686

A. C. Landwehr, Untersuchungen zur Sicherheit einzelner RSA Bits. 2007.
LibreCat: /record/2887

J. Klose, Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT. 2007.
LibreCat: /record/47653

M. Niemeier, Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen. 2007.
LibreCat: /record/47652

S. Birkner, Behandlung von Korrekturtermen in der Methode von Coppersmith. 2007.
LibreCat: /record/47654

J. Blömer, “Randomness and Secrecy - A Brief Introduction,” Journal of Universal Computer Science (J.UCS), no. 6, pp. 654--671, 2006.
LibreCat: /record/3003
DOI: 10.3217/jucs-012-06-0654

J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120.
LibreCat: /record/3004
DOI: 10.1007/11889700_11

J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.
LibreCat: /record/3005
DOI: 10.1007/11889700_2