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.

109 Publications


2020 | Journal Article | LibreCat-ID: 20888
A Complexity Theoretical Study of Fuzzy K-Means
J. Blömer, S. Brauer, K. Bujna, ACM Transactions on Algorithms 16 (2020) 1–25.
LibreCat | DOI
 

2004 | Book Chapter | LibreCat-ID: 3012
A Generalized Wiener Attack on RSA
J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.
LibreCat | Files available | DOI
 

2023 | Conference Paper | LibreCat-ID: 43458 | OA LibreCat | Download (ext.)
 

1998 | Journal Article | LibreCat-ID: 3028
A lower bound for a class of graph based loss resilient codes
J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science, ETH Zürich (1998).
LibreCat | Files available
 

2004 | Conference Paper | LibreCat-ID: 3017
A new CRT-RSA algorithm secure against bellcore attacks
J. Blömer, M. Otto, J.-P. Seifert, in: Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03, ACM Press, 2004.
LibreCat | DOI
 

2014 | Conference Paper | LibreCat-ID: 463
A Practical Second-Order Fault Attack against a Real-World Pairing Implementation
J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, J.-P. Seifert, in: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp. 123--136.
LibreCat | Files available | DOI
 

2007 | Book Chapter | LibreCat-ID: 3026
A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers
J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162.
LibreCat | DOI
 

2016 | Conference Paper | LibreCat-ID: 2367
A Theoretical Analysis of the Fuzzy K-Means Problem
J. Blömer, S. Brauer, K. Bujna, in: 2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016, pp. 805–810.
LibreCat | DOI
 

2014 | Conference Paper | LibreCat-ID: 2977
A Theoretical and Experimental Comparison of the EM and SEM Algorithm
J. Blömer, K. Bujna, D. Kuntze, in: 2014 22nd International Conference on Pattern Recognition, IEEE, 2014.
LibreCat | DOI
 

2005 | Book Chapter | LibreCat-ID: 3006
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267.
LibreCat | Files available | DOI
 

2016 | Book Chapter | LibreCat-ID: 2970
Adaptive Seeding for Gaussian Mixture Models
J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.
LibreCat | DOI
 

2016 | Book Chapter | LibreCat-ID: 2978
Adaptive Seeding for Gaussian Mixture Models
J. Blömer, K. Bujna, in: Advances in Knowledge Discovery and Data Mining, Springer International Publishing, Cham, 2016, pp. 296–308.
LibreCat | DOI
 

2011 | Dissertation | LibreCat-ID: 2910
Algorithms for lattice problems with respect to general norms
S. Naewe, Algorithms for Lattice Problems with Respect to General Norms, Universität Paderborn, 2011.
LibreCat | Download (ext.)
 

2009 | Dissertation | LibreCat-ID: 2911
Algorithms for the Bregman k-Median Problem
M.R. Ackermann, Algorithms for the Bregman K-Median Problem, Universität Paderborn, 2009.
LibreCat | Download (ext.)
 

2013 | Report | LibreCat-ID: 2917
An Approach for Determining Optimal Contrast in Visual Cryptography
J. Juhnke, H. Lefmann, V. Strehl, An Approach for Determining Optimal Contrast in Visual Cryptography, Fortschritt-Berichte VDI, 2013.
LibreCat
 

1995 | Report | LibreCat-ID: 3038
An XOR-based erasure-resilient coding scheme
J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, D. Zuckerman, An XOR-Based Erasure-Resilient Coding Scheme, Berkeley, USA, 1995.
LibreCat | Files available
 

2014 | Journal Article | LibreCat-ID: 2976
Analysis of Agglomerative Clustering
M.R. Ackermann, J. Blömer, D. Kuntze, C. Sohler, Algorithmica 69 (2014).
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3002 | OA
Analysis of Countermeasures Against Access Driven Cache Attacks on AES
J. Blömer, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 96–109.
LibreCat | DOI | Download (ext.)
 

2015 | Conference Paper | LibreCat-ID: 322 | OA
Anonymous and Publicly Linkable Reputation Systems
J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.
LibreCat | Files available | DOI | Download (ext.)
 

1995 | Journal Article | LibreCat-ID: 3037
Approximate matching of polygonal shapes
H. Alt, B. Behrends, J. Blömer, Annals of Mathematics and Artificial Intelligence 13 (1995).
LibreCat
 

1991 | Conference Paper | LibreCat-ID: 3048
Approximate matching of polygonal shapes (extended abstract)
H. Alt, B. Behrends, J. Blömer, in: Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91, ACM Press, 1991.
LibreCat | DOI
 

1990 | Book Chapter | LibreCat-ID: 3050
Approximation of convex polygons
H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.
LibreCat | DOI
 

2017 | Conference Paper | LibreCat-ID: 2344 | OA
Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations
J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice of Security, Springer International Publishing, Cham, 2017, pp. 3–17.
LibreCat | Files available | DOI
 

2010 | Book Chapter | LibreCat-ID: 2988
Bregman Clustering for Separable Instances
M.R. Ackermann, J. Blömer, in: SWAT 2010, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 212–223.
LibreCat | DOI
 

2017 | Dissertation | LibreCat-ID: 116
CCA-Security for Predicate Encryption Schemes
G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn, 2017.
LibreCat | DOI | Download (ext.)
 

2019 | Dissertation | LibreCat-ID: 13679
Classification and Approximation of Geometric Location Problems
S. Brauer, Classification and Approximation of Geometric Location Problems, Paderborn, 2019.
LibreCat | DOI
 

2000 | Book Chapter | LibreCat-ID: 3023
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.
LibreCat | DOI
 

2018 | Conference Paper | LibreCat-ID: 2965
Cloud Architectures for Searchable Encryption
J. Blömer, N. Löken, in: Proceedings of the 13th International Conference on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA, n.d., pp. 25:1--25:10.
LibreCat | Files available | DOI
 

2010 | Journal Article | LibreCat-ID: 2990
Clustering for Metric and Nonmetric Distance Measures
M.R. Ackermann, J. Blömer, C. Sohler, ACM Trans. Algorithms (2010) 59:1--59:26.
LibreCat | DOI
 

2019 | Journal Article | LibreCat-ID: 2916
Complexity of single-swap heuristics for metric facility location and related problems
S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
LibreCat | DOI
 

2017 | Book Chapter | LibreCat-ID: 2381
Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
S. Brauer, in: D. Fotakis, A. Pagourtzis, V.T. Paschos (Eds.), Lecture Notes in Computer Science, Springer International Publishing, Cham, 2017, pp. 116–127.
LibreCat | DOI
 

1991 | Conference Paper | LibreCat-ID: 3049
Computing sums of radicals in polynomial time
J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991.
LibreCat | DOI
 

2002 | Conference Paper | LibreCat-ID: 3041
Computing sums of radicals in polynomial time
J. Blömer, in: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.
LibreCat | Files available | DOI
 

2004 | Book Chapter | LibreCat-ID: 3015
Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.
LibreCat | DOI
 
 

2016 | Conference Paper | LibreCat-ID: 208
Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.
LibreCat | Files available | DOI
 

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

2018 | Conference Paper | LibreCat-ID: 4344
Coresets for Fuzzy K-Means with Applications
J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms and Computation  (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3019
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 242–256.
LibreCat | DOI
 

2021 | Preprint | LibreCat-ID: 26645 | OA LibreCat | Download (ext.)
 

2020 | Dissertation | LibreCat-ID: 15482
Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work
N. Löken, Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work, 2020.
LibreCat | DOI
 

2018 | Conference Paper | LibreCat-ID: 2379 | OA
Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures
J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography & Network Security, n.d.
LibreCat | Files available | DOI | Download (ext.)
 

1997 | Book Chapter | LibreCat-ID: 3029
Denesting by bounded degree radicals
J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.
LibreCat | Files available | DOI
 

2002 | Journal Article | LibreCat-ID: 35857
Denesting by Bounded Degree Radicals
J. Blömer, Algorithmica 28 (2002) 2–15.
LibreCat | DOI
 

2023 | Conference Paper | LibreCat-ID: 44855
Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain
S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, in: ECIS 2023 Research Papers, 2023.
LibreCat | Files available | Download (ext.)
 

2007 | Book Chapter | LibreCat-ID: 3022
Dimension Reduction Methods for Convolution Modular Lattices
A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125.
LibreCat | DOI
 
 

2019 | Conference Paper | LibreCat-ID: 13557 | OA
Dynamic Searchable Encryption with Access Control
J. Blömer, N. Löken, in: 12th International Symposium on Foundations and Practice of Security, FPS 2019, Springer, 2019.
LibreCat | Download (ext.)
 

2010 | Conference Paper | LibreCat-ID: 2993 LibreCat
 

2016 | Report | LibreCat-ID: 2971
Effizienz und Sicherheit paarungsbasierter Kryptographie
J. Blömer, P. Günther, Effizienz Und Sicherheit Paarungsbasierter Kryptographie, Tagungsband des 26. Fraunhofer SIT Smartcard-Workshops, 2016.
LibreCat
 

2010 | Conference Paper | LibreCat-ID: 2994
Engineering self-coordinating software intensive systems
W. Schäfer, A. Trächtler, M. Birattari, J. Blömer, M. Dorigo, G. Engels, R. O’Grady, M. Platzner, F. Rammig, W. Reif, in: Proceedings of the FSE/SDP Workshop on Future of Software Engineering Research - FoSER ’10, ACM Press, 2010.
LibreCat | DOI
 

2018 | Conference Paper | LibreCat-ID: 3873 | OA
Enhanced Security of Attribute-Based Signatures
J. Blömer, F. Eidens, J. Juhnke, in: The International Conference on Cryptology And Network Security (CANS), Springer, 2018, pp. 235–255.
LibreCat | Files available | DOI | Download (ext.)
 

2005 | Dissertation | LibreCat-ID: 2913
Fault Attacks and Countermeasures
M. Otto, Fault Attacks and Countermeasures, Universität Paderborn, 2005.
LibreCat | Download (ext.)
 

2006 | Book Chapter | LibreCat-ID: 3004
Fault Based Collision Attacks on AES
J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3018
Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)
J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 162–181.
LibreCat | DOI
 

2018 | Conference Paper | LibreCat-ID: 3265 | OA
Fully-Featured Anonymous Credentials with Reputation System
K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L. Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling, M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA, n.d.
LibreCat | Files available | DOI | Download (ext.)
 

2016 | Preprint | LibreCat-ID: 2969 | OA
Hard-Clustering with Gaussian Mixture Models
J. Blömer, S. Brauer, K. Bujna, (2016).
LibreCat | Download (ext.)
 

2011 | Conference Paper | LibreCat-ID: 2985
Hardness and Non-Approximability of Bregman Clustering Problems.
M.R. Ackermann, J. Blömer, C. Scholz, (2011).
LibreCat
 

1992 | Conference Paper | LibreCat-ID: 3047
How to denest Ramanujan's nested radicals
J. Blömer, in: Proceedings., 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992.
LibreCat | DOI
 

2011 | Book Chapter | LibreCat-ID: 2986
How to Share a Secret
J. Blömer, in: Algorithms Unplugged, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 159–168.
LibreCat | DOI
 

2020 | Journal Article | LibreCat-ID: 10790
How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models
J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and Classification 14 (2020) 147–173.
LibreCat | DOI
 

2016 | Book Chapter | LibreCat-ID: 2948
Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures
P. Günther, V. Krummel, in: Mathematical Aspects of Computer and Information Sciences, Springer International Publishing, Cham, 2016, pp. 151–165.
LibreCat | DOI
 

2013 | Book Chapter | LibreCat-ID: 2979
Improved Side Channel Attacks on Pairing Based Cryptography
J. Blömer, P. Günther, G. Liske, in: Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 154–168.
LibreCat | DOI
 

2021 | Conference Paper | LibreCat-ID: 29566
Issuer-Hiding Attribute-Based Credentials
J. Bobolz, F. Eidens, S. Krenn, S. Ramacher, K. Samelin, in: Cryptology and Network Security, Springer International Publishing, Cham, 2021.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3021
Key Revocation with Interval Cover Families
J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 325–341.
LibreCat | DOI
 

2007 | Book Chapter | LibreCat-ID: 3020
Low Secret Exponent RSA Revisited
J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.
LibreCat | DOI
 

2018 | Dissertation | LibreCat-ID: 6597
Models and Constructions for Secure Reputation Systems
J. Juhnke, Models and Constructions for Secure Reputation Systems, Universität Paderborn, 2018.
LibreCat | DOI
 

2003 | Book Chapter | LibreCat-ID: 3016
New Partial Key Exposure Attacks on RSA
J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43.
LibreCat | DOI
 

2003 | Dissertation | LibreCat-ID: 2914
New RSA Vulnerabilities Using Lattice Reduction Methods
A. May, New RSA Vulnerabilities Using Lattice Reduction Methods, Universität Paderborn, 2003.
LibreCat | Download (ext.)
 

1993 | Report | LibreCat-ID: 3045
On Kummer theory and the number of roots of unity in radical extensions of Q
J. Blömer, On Kummer Theory and the Number of Roots of Unity in Radical Extensions of Q, Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1993.
LibreCat
 

1999 | Conference Paper | LibreCat-ID: 3024
On the complexity of computing short linearly independent vectors and short bases in a lattice
J. Blömer, J.-P. Seifert, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99, ACM Press, 1999.
LibreCat | Files available | DOI
 

2023 | Conference Paper | LibreCat-ID: 35014 | OA LibreCat | Download (ext.)
 

2010 | Journal Article | LibreCat-ID: 2991
On the initialization of dynamic models for speech features
A. Krueger, V. Leutnant, R. Haeb-Umbach, M. Ackermann, J. Blömer, Proc. of ITG Fachtagung Sprachkommunikation. ITG, Bochum, Germany (2010).
LibreCat
 

2005 | Book Chapter | LibreCat-ID: 3010
Partial Key Exposure Attacks on RSA up to Full Size Exponents
M. Ernst, E. Jochemsz, A. May, B. de Weger, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 371–386.
LibreCat | DOI
 

2019 | Conference Paper | LibreCat-ID: 13554 | OA
Personal Cross-Platform Reputation
J. Blömer, N. Löken, in: Security and Trust Management, STM 2019, 2019.
LibreCat | Files available | DOI
 

2016 | Dissertation | LibreCat-ID: 167
Physical attacks on pairing-based cryptography
P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016.
LibreCat | Files available | Download (ext.)
 

2013 | Dissertation | LibreCat-ID: 2909
Practical algorithms for clustering and modeling large data sets - Analysis and improvements
D. Kuntze, Practical Algorithms for Clustering and Modeling Large Data Sets - Analysis and Improvements, Universität Paderborn, 2013.
LibreCat | Download (ext.)
 

2018 | Conference Paper | LibreCat-ID: 2862 | OA
Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems
J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing, Cham, 2018, pp. 470–490.
LibreCat | Files available | DOI | Download (ext.)
 

2002 | Journal Article | LibreCat-ID: 3034
Priority encoding transmission
A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, IEEE Transactions on Information Theory 42 (2002) 1737–1744.
LibreCat | Files available | DOI
 

2002 | Conference Paper | LibreCat-ID: 3040
Priority encoding transmission
A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, in: Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.
LibreCat | DOI
 

2022 | Dissertation | LibreCat-ID: 35188
Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials
F. Eidens, Privacy-Preserving Cryptography: Attribute-Based Signatures and Updatable Credentials, 2022.
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 16487 | OA
Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection
J. Bobolz, F. Eidens, S. Krenn, D. Slamanig, C. Striecks, in: Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20), ACM, New York, NY, USA, 2020.
LibreCat | Files available | DOI | Download (ext.)
 

2018 | Working Paper | LibreCat-ID: 5820
Provably Anonymous Communication Based on Trusted Execution Environments
J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication Based on Trusted Execution Environments, n.d.
LibreCat | Files available
 

2004 | Book Chapter | LibreCat-ID: 3011
Provably Secure Masking of AES
J. Blömer, J. Guajardo, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 69–83.
LibreCat | DOI
 

2006 | Journal Article | LibreCat-ID: 3003
Randomness and Secrecy - A Brief Introduction
J. Blömer, Journal of Universal Computer Science (J.UCS) (2006) 654--671.
LibreCat | DOI
 

2008 | Conference Paper | LibreCat-ID: 3001
Reliable Evidence of Data Integrity from an Untrusted Storage Service
C. Stern, P. Adelt, V. Krummel, M.R. Ackermann, in: Fourth International Conference on Networking and Services (Icns 2008), IEEE, 2008.
LibreCat | DOI
 

1992 | Book Chapter | LibreCat-ID: 3046
Resemblance and symmetries of geometric patterns
H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.
LibreCat | DOI
 

2009 | Journal Article | LibreCat-ID: 2999
Sampling methods for shortest vectors, closest vectors and successive minima
J. Blömer, S. Naewe, Theoretical Computer Science (2009) 1648–1665.
LibreCat | DOI
 

2017 | Conference Paper | LibreCat-ID: 2343 | OA
Searchable Encryption with Access Control
N. Löken, in: Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17, ACM Press, 2017.
LibreCat | Files available | DOI | Download (ext.)
 

2004 | Book Chapter | LibreCat-ID: 3014
Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^{r}q
A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 218–230.
LibreCat | DOI
 

2013 | Conference Paper | LibreCat-ID: 488
Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study
J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.
LibreCat | Files available
 

2015 | Conference Paper | LibreCat-ID: 253
Short Group Signatures with Distributed Traceability
J. Blömer, J. Juhnke, N. Löken, in: Proceedings of the Sixth International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.
LibreCat | Files available | DOI
 

2006 | Book Chapter | LibreCat-ID: 3007
Sign Change Fault Attacks on Elliptic Curve Cryptosystems
J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.
LibreCat | Files available | DOI
 

1992 | Dissertation | LibreCat-ID: 3043
Simplifying Expressions Involving Radicals
J. Blömer, Simplifying Expressions Involving Radicals, PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
LibreCat | Files available
 

2016 | Conference Paper | LibreCat-ID: 2947
Singular Curve Point Decompression Attack
J. Blömer, P. Günther, in: 2015 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), IEEE, 2016.
LibreCat | DOI
 

2017 | Dissertation | LibreCat-ID: 2908
Soft Clustering Algorithms - Theoretical and Practical Improvements
K. Bujna, Soft Clustering Algorithms - Theoretical and Practical Improvements, Universität Paderborn, 2017.
LibreCat | DOI | Download (ext.)
 

2011 | Preprint | LibreCat-ID: 2987
Solving the Closest Vector Problem with respect to Lp Norms
J. Blömer, S. Naewe, ArXiv:1104.3720 (2011).
LibreCat
 

2012 | Conference Paper | LibreCat-ID: 2982
StreamKM++: A clustering algorithm for data streams
M.R. Ackermann, M. Märtens, C. Raupach, K. Swierkot, C. Lammersen, C. Sohler, 17 (2012).
LibreCat | DOI
 

2017 | Conference Paper | LibreCat-ID: 2967 | OA
Subtleties in Security Definitions for Predicate Encryption with Public Index
J. Blömer, G. Liske, in: Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International Publishing, Cham, 2017, pp. 438–453.
LibreCat | Files available | DOI | Download (ext.)
 

2007 | Dissertation | LibreCat-ID: 2912
Tamper Resistance of AES -- Models, Attacks and Countermeasures
V. Krummel, Tamper Resistance of AES -- Models, Attacks and Countermeasures, Universität Paderborn, 2007.
LibreCat | Download (ext.)
 

Filters and Search Terms

(department=64) AND (type=book OR type=book_editor OR type=book_chapter OR type=publicationtype_review OR type=conference_abstract OR type=conference_editor OR type=conference OR type=dissertation OR type=encyclopedia_article OR type=journal_article OR type=journal_editor OR type=newspaper_article OR type=patent OR type=preprint OR type=report OR type=translation OR type=translation_chapter OR type=working_paper OR type=research_data)

status=public

Search

Filter Publications

Display / Sort

Sorted by: Title , First Author

Export / Embed