Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
229 Publications
- 1
- 2
- 3 (current)
- 4
- 5
2013 | Preprint | LibreCat-ID: 538 | 
Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.
LibreCat
| Files available
| Download (ext.)
2013 | Bachelorsthesis | LibreCat-ID: 553
Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013.
LibreCat
2012 | Conference Paper | LibreCat-ID: 2982
Ackermann, Marcel Rudolf, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, and Christian Sohler. “StreamKM++: A Clustering Algorithm for Data Streams.” ACM Journal of Experimental Algorithmics. New York, NY, USA: ACM, 2012. https://doi.org/10.1145/2133803.2184450.
LibreCat
| DOI
2012 | Journal Article | LibreCat-ID: 2984
Blömer, Johannes. “Turing Und Kryptografie.” Informatik-Spektrum 35, no. 4 (2012). https://doi.org/10.1007/s00287-012-0622-7.
LibreCat
| DOI
2012 | Bachelorsthesis | LibreCat-ID: 606
Löken, Nils. 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
2012 | Bachelorsthesis | LibreCat-ID: 607
Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012.
LibreCat
2012 | Bachelorsthesis | LibreCat-ID: 629
Schleiter, Patrick. Attribute-basierte Verschlüsselung. Universität Paderborn, 2012.
LibreCat
2011 | Bachelorsthesis | LibreCat-ID: 2872
Böttger, Timm. Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen, 2011.
LibreCat
| Files available
2011 | Mastersthesis | LibreCat-ID: 2902
Märtens, Marcus. The Monotone Complexity of Computing K-Clique on Random Graphs, 2011.
LibreCat
2011 | Dissertation | LibreCat-ID: 2910
Naewe, Stefanie. Algorithms for Lattice Problems with Respect to General Norms. Universität Paderborn, 2011.
LibreCat
| Download (ext.)
2011 | Conference Paper | LibreCat-ID: 2985
Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on Computational Complexity (ECCC), 2011.
LibreCat
2011 | Book Chapter | LibreCat-ID: 2986
Blömer, Johannes. “How to Share a Secret.” In Algorithms Unplugged, 159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. https://doi.org/10.1007/978-3-642-15328-0_17.
LibreCat
| DOI
2011 | Preprint | LibreCat-ID: 2987
Blömer, Johannes, and Stefanie Naewe. “Solving the Closest Vector Problem with Respect to Lp Norms.” ArXiv:1104.3720, 2011.
LibreCat
2011 | Mastersthesis | LibreCat-ID: 659
Liske, Gennadij. Fault Attacks in Pairing-Based Cryptography. Universität Paderborn, 2011.
LibreCat
| Files available
2010 | Book Chapter | LibreCat-ID: 2988
Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.” In SWAT 2010, 212–23. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13731-0_21.
LibreCat
| DOI
2010 | Journal Article | LibreCat-ID: 2990
Ackermann, Marcel R., Johannes Blömer, and Christian Sohler. “Clustering for Metric and Nonmetric Distance Measures.” ACM Trans. Algorithms, no. 4 (2010): 59:1--59:26. https://doi.org/10.1145/1824777.1824779.
LibreCat
| DOI
2010 | Journal Article | LibreCat-ID: 2991
Krueger, Alexander, Volker Leutnant, Reinhold Haeb-Umbach, Marcel Ackermann, and Johannes Blömer. “On the Initialization of Dynamic Models for Speech Features.” Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany, 2010.
LibreCat
2010 | Conference Paper | LibreCat-ID: 2993
Schrieb, Jonas. “Efficient and Compact CCA Security from Partitioned IBKEM.” Proceedings of the 3rd Western European Workshop on Research in Cryptology, 2010.
LibreCat
2010 | Conference Paper | LibreCat-ID: 2994
Schäfer, Wilhelm, Ansgar Trächtler, Mauro Birattari, Johannes Blömer, Marco Dorigo, Gregor Engels, Rehan O’Grady, Marco Platzner, Franz Rammig, and Wolfgang Reif. “Engineering Self-Coordinating Software Intensive Systems.” In Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10. ACM Press, 2010. https://doi.org/10.1145/1882362.1882428.
LibreCat
| DOI
2010 | Misc | LibreCat-ID: 47684 |
Postler, Tim. Smart Card basierte Berechnung einer Gruppensignatur als Teil einer biometrischen Authentisierung, 2010.
LibreCat
| Files available
2009 | Bachelorsthesis | LibreCat-ID: 2880
Schröer, Carsten. Hierarchisches Clustering Mit Minimalen Cluster-Durchmessern, 2009.
LibreCat
| Files available
2009 | Bachelorsthesis | LibreCat-ID: 2896 |
Liske, Gennadij. Analyse Und Evaluation Eines Identitätsbasierten Signcryption-Verfahrens, 2009.
LibreCat
| Files available
2009 | Mastersthesis | LibreCat-ID: 2904
Scholz, Christoph. Die Schwierigkeit Des K-Median Clusterings Für Bregman-Divergenzen, 2009.
LibreCat
| Files available
2009 | Dissertation | LibreCat-ID: 2911
Ackermann, Marcel Rudolf. Algorithms for the Bregman K-Median Problem. Universität Paderborn, 2009.
LibreCat
| Download (ext.)
2009 | Book Chapter | LibreCat-ID: 2995
Ackermann, Marcel R., and Johannes Blömer. “Coresets and Approximate Clustering for Bregman Divergences.” In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 1088–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2009. https://doi.org/10.1137/1.9781611973068.118.
LibreCat
| DOI
2009 | Journal Article | LibreCat-ID: 2999
Blömer, Johannes, and Stefanie Naewe. “Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima.” Theoretical Computer Science, no. 18 (2009): 1648–65. https://doi.org/10.1016/j.tcs.2008.12.045.
LibreCat
| DOI
2009 | Book Chapter | LibreCat-ID: 3000
Schrieb, Jonas, Heike Wehrheim, and Daniel Wonisch. “Three-Valued Spotlight Abstractions.” In FM 2009: Formal Methods, 106–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. https://doi.org/10.1007/978-3-642-05089-3_8.
LibreCat
| DOI
2008 | Conference Paper | LibreCat-ID: 3001
Stern, Claudius, Philipp Adelt, Volker Krummel, and Marcel Rudolf Ackermann. “Reliable Evidence of Data Integrity from an Untrusted Storage Service.” In Fourth International Conference on Networking and Services (Icns 2008). IEEE, 2008. https://doi.org/10.1109/icns.2008.28.
LibreCat
| DOI
2008 | Misc | LibreCat-ID: 47685 |
Schrieb, Jonas. Construction and Applications of Identity-Based Encryption without Pairings, 2008.
LibreCat
| Files available
2007 | Dissertation | LibreCat-ID: 2912
Krummel, Volker. Tamper Resistance of AES -- Models, Attacks and Countermeasures. Universität Paderborn, 2007.
LibreCat
| Download (ext.)
2007 | Book Chapter | LibreCat-ID: 3002 |
Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against Access Driven Cache Attacks on AES.” In Selected Areas in Cryptography, 96–109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/978-3-540-77360-3_7.
LibreCat
| DOI
| Download (ext.)
2007 | Book Chapter | LibreCat-ID: 3019
May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.” In Advances in Cryptology — CRYPTO 2002, 242–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-45708-9_16.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3020
Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” In Lecture Notes in Computer Science, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-44670-2_2.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3021
Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” In Selected Areas in Cryptography, 325–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-45537-x_26.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3022
May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” In Lecture Notes in Computer Science, 110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-44670-2_10.
LibreCat
| DOI
2007 | Book Chapter | LibreCat-ID: 3026
Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” In Algorithms — ESA’ 98, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-68530-8_13.
LibreCat
| DOI
2007 | Bachelorsthesis | LibreCat-ID: 47650
Ziegert, Steffen. Approximierbarkeit durch konstante Stichproben unter Berücksichtigung verschiedener Divergenz- und Ähnlichkeitsmaße beim k-Clustering-Problem, 2007.
LibreCat
2007 | Bachelorsthesis | LibreCat-ID: 47651
Richert, Manuel. Sichere Kryptosysteme durch Zero-Knowledge, 2007.
LibreCat
2007 | Misc | LibreCat-ID: 47688
Klein, Wiebke. Angriffe auf RSA-Varianten bei partiell bekannten geheimen Schlüsseln, 2007.
LibreCat
2007 | Misc | LibreCat-ID: 47690
Käthler, Olga. Kryptanalyse des EAC-Protokolls biometrischer Reisepässe, 2007.
LibreCat
2007 | Misc | LibreCat-ID: 47687 |
Brieden, Benedikt. Analyse von verallgemeinerten RSA Polynomen mit Hilfe der Coppersmithschen Methode, 2007.
LibreCat
| Files available
2007 | Misc | LibreCat-ID: 47689 |
Kuntze, Daniel. Untersuchung von Clusteringalgorithmen für die Kullback-Leibler Divergenz, 2007.
LibreCat
| Files available
2007 | Misc | LibreCat-ID: 47686 |
Borghoff, Julia. Vergleich multivariater Varianten der Methode von Coppersmith, 2007.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 2887 |
Landwehr, Andreas Cord. Untersuchungen zur Sicherheit einzelner RSA Bits, 2007.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 47653 |
Klose, Jaroslaw. Ein erschöpfende Suche vermeidender Algorithmus für allgemeines k-SAT, 2007.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 47652 |
Niemeier, Martin. Reduktionen von CVP mit wenigen Lösungen auf CVP mit eindeutigen Lösungen, 2007.
LibreCat
| Files available
2007 | Bachelorsthesis | LibreCat-ID: 47654 |
Birkner, Stefan. Behandlung von Korrekturtermen in der Methode von Coppersmith, 2007.
LibreCat
| Files available
2006 | Journal Article | LibreCat-ID: 3003
Blömer, Johannes. “Randomness and Secrecy - A Brief Introduction.” Journal of Universal Computer Science (J.UCS), no. 6 (2006): 654--671. https://doi.org/10.3217/jucs-012-06-0654.
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3004
Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” In Lecture Notes in Computer Science, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_11.
LibreCat
| DOI
2006 | Book Chapter | LibreCat-ID: 3005
Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” In Lecture Notes in Computer Science, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_2.
LibreCat
| DOI
- 1
- 2
- 3 (current)
- 4
- 5