---
_id: '299'
author:
- first_name: Britta
  full_name: Gerken, Britta
  last_name: Gerken
citation:
  ama: Gerken B. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie</i>.
    Universität Paderborn; 2015.
  apa: Gerken, B. (2015). <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
    Kryptographie</i>. Universität Paderborn.
  bibtex: '@book{Gerken_2015, title={Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
    Kryptographie}, publisher={Universität Paderborn}, author={Gerken, Britta}, year={2015}
    }'
  chicago: Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
    Kryptographie</i>. Universität Paderborn, 2015.
  ieee: B. Gerken, <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
    Kryptographie</i>. Universität Paderborn, 2015.
  mla: Gerken, Britta. <i>Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
    Kryptographie</i>. Universität Paderborn, 2015.
  short: B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '301'
author:
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
citation:
  ama: Bobolz J. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>.
    Universität Paderborn; 2015.
  apa: Bobolz, J. (2015). <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>.
    Universität Paderborn.
  bibtex: '@book{Bobolz_2015, title={Efficient Verifier-Local Revocation for Anonymous
    Credentials}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2015}
    }'
  chicago: Bobolz, Jan. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>.
    Universität Paderborn, 2015.
  ieee: J. Bobolz, <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>.
    Universität Paderborn, 2015.
  mla: Bobolz, Jan. <i>Efficient Verifier-Local Revocation for Anonymous Credentials</i>.
    Universität Paderborn, 2015.
  short: J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:51Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:47:11Z
  date_updated: 2018-07-20T09:54:22Z
  file_id: '1443'
  file_name: 301-thesis_jbobolz_final_02.pdf
  file_size: 1214027
  relation: main_file
file_date_updated: 2018-07-20T09:54:22Z
has_accepted_license: '1'
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Efficient Verifier-Local Revocation for Anonymous Credentials
type: mastersthesis
urn: '3016'
user_id: '27207'
year: '2015'
...
---
_id: '302'
author:
- first_name: Christian
  full_name: Stroh, Christian
  last_name: Stroh
citation:
  ama: Stroh C. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>.
    Universität Paderborn; 2015.
  apa: Stroh, C. (2015). <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>.
    Universität Paderborn.
  bibtex: '@book{Stroh_2015, title={Efficient Attributes for Pairing-Based Anonymous
    Credentials}, publisher={Universität Paderborn}, author={Stroh, Christian}, year={2015}
    }'
  chicago: Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>.
    Universität Paderborn, 2015.
  ieee: C. Stroh, <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>.
    Universität Paderborn, 2015.
  mla: Stroh, Christian. <i>Efficient Attributes for Pairing-Based Anonymous Credentials</i>.
    Universität Paderborn, 2015.
  short: C. Stroh, Efficient Attributes for Pairing-Based Anonymous Credentials, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Efficient Attributes for Pairing-Based Anonymous Credentials
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '312'
author:
- first_name: Patrick
  full_name: Schleiter, Patrick
  last_name: Schleiter
citation:
  ama: Schleiter P. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>.
    Universität Paderborn; 2015.
  apa: Schleiter, P. (2015). <i>Constructions of Fully Secure Predicate Encryption
    Schemes</i>. Universität Paderborn.
  bibtex: '@book{Schleiter_2015, title={Constructions of Fully Secure Predicate Encryption
    Schemes}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2015}
    }'
  chicago: Schleiter, Patrick. <i>Constructions of Fully Secure Predicate Encryption
    Schemes</i>. Universität Paderborn, 2015.
  ieee: P. Schleiter, <i>Constructions of Fully Secure Predicate Encryption Schemes</i>.
    Universität Paderborn, 2015.
  mla: Schleiter, Patrick. <i>Constructions of Fully Secure Predicate Encryption Schemes</i>.
    Universität Paderborn, 2015.
  short: P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:52Z
date_updated: 2022-01-06T06:58:57Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:44:55Z
  date_updated: 2018-03-20T07:44:55Z
  file_id: '1439'
  file_name: 312-MA_2015_Schleiter_Constructions_of_fully_secure_PE_schemes_01.pdf
  file_size: 721996
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:44:55Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Constructions of Fully Secure Predicate Encryption Schemes
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '273'
author:
- first_name: Kathlén
  full_name: Kohn, Kathlén
  last_name: Kohn
citation:
  ama: Kohn K. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary
    Norms</i>. Universität Paderborn; 2015.
  apa: Kohn, K. (2015). <i>Number of Voronoi-relevant vectors in lattices with respect
    to arbitrary norms</i>. Universität Paderborn.
  bibtex: '@book{Kohn_2015, title={Number of Voronoi-relevant vectors in lattices
    with respect to arbitrary norms}, publisher={Universität Paderborn}, author={Kohn,
    Kathlén}, year={2015} }'
  chicago: Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect
    to Arbitrary Norms</i>. Universität Paderborn, 2015.
  ieee: K. Kohn, <i>Number of Voronoi-relevant vectors in lattices with respect to
    arbitrary norms</i>. Universität Paderborn, 2015.
  mla: Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect
    to Arbitrary Norms</i>. Universität Paderborn, 2015.
  short: K. Kohn, Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary
    Norms, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:37Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '233'
abstract:
- lang: eng
  text: 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:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Kathlén
  full_name: Kohn, Kathlén
  last_name: Kohn
citation:
  ama: Blömer J, Kohn K. <i>Voronoi Cells of Lattices with Respect to Arbitrary Norms</i>.
    Universität Paderborn; 2015.
  apa: Blömer, J., &#38; Kohn, K. (2015). <i>Voronoi Cells of Lattices with Respect
    to Arbitrary Norms</i>. Universität Paderborn.
  bibtex: '@book{Blömer_Kohn_2015, title={Voronoi Cells of Lattices with Respect to
    Arbitrary Norms}, publisher={Universität Paderborn}, author={Blömer, Johannes
    and Kohn, Kathlén}, year={2015} }'
  chicago: Blömer, Johannes, and Kathlén Kohn. <i>Voronoi Cells of Lattices with Respect
    to Arbitrary Norms</i>. Universität Paderborn, 2015.
  ieee: J. Blömer and K. Kohn, <i>Voronoi Cells of Lattices with Respect to Arbitrary
    Norms</i>. Universität Paderborn, 2015.
  mla: Blömer, Johannes, and Kathlén Kohn. <i>Voronoi Cells of Lattices with Respect
    to Arbitrary Norms</i>. Universität Paderborn, 2015.
  short: J. Blömer, K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms,
    Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:37Z
date_updated: 2022-01-06T06:55:49Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:30:18Z
  date_updated: 2018-03-21T10:30:18Z
  file_id: '1501'
  file_name: 233-1512.00720v1.pdf
  file_size: 1231102
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:30:18Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/pdf/1512.00720v1.pdf
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Voronoi Cells of Lattices with Respect to Arbitrary Norms
type: report
user_id: '25078'
year: '2015'
...
---
_id: '2866'
author:
- first_name: Felix
  full_name: Biermeier, Felix
  last_name: Biermeier
citation:
  ama: Biermeier F. <i>Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen
    Bezüglich Den Komplexitätsklassen L Und SL</i>.; 2014.
  apa: Biermeier, F. (2014). <i>Untersuchung des Erreichbarkeitsproblems in ungerichteten
    Graphen bezüglich den Komplexitätsklassen L und SL</i>.
  bibtex: '@book{Biermeier_2014, title={Untersuchung des Erreichbarkeitsproblems in
    ungerichteten Graphen bezüglich den Komplexitätsklassen L und SL}, author={Biermeier,
    Felix}, year={2014} }'
  chicago: Biermeier, Felix. <i>Untersuchung Des Erreichbarkeitsproblems in Ungerichteten
    Graphen Bezüglich Den Komplexitätsklassen L Und SL</i>, 2014.
  ieee: F. Biermeier, <i>Untersuchung des Erreichbarkeitsproblems in ungerichteten
    Graphen bezüglich den Komplexitätsklassen L und SL</i>. 2014.
  mla: Biermeier, Felix. <i>Untersuchung Des Erreichbarkeitsproblems in Ungerichteten
    Graphen Bezüglich Den Komplexitätsklassen L Und SL</i>. 2014.
  short: F. Biermeier, Untersuchung Des Erreichbarkeitsproblems in Ungerichteten Graphen
    Bezüglich Den Komplexitätsklassen L Und SL, 2014.
date_created: 2018-05-24T13:08:41Z
date_updated: 2022-01-06T06:58:13Z
department:
- _id: '64'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Untersuchung des Erreichbarkeitsproblems in ungerichteten Graphen bezüglich
  den Komplexitätsklassen L und SL
type: bachelorsthesis
user_id: '25078'
year: '2014'
...
---
_id: '2867'
author:
- first_name: Malte
  full_name: Sauer, Malte
  last_name: Sauer
citation:
  ama: Sauer M. <i>Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen</i>.;
    2014.
  apa: Sauer, M. (2014). <i>Evaluierung von Initialisierungsmethoden für Fuzzy-k-means
    Algorithmen</i>.
  bibtex: '@book{Sauer_2014, title={Evaluierung von Initialisierungsmethoden für Fuzzy-k-means
    Algorithmen}, author={Sauer, Malte}, year={2014} }'
  chicago: Sauer, Malte. <i>Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means
    Algorithmen</i>, 2014.
  ieee: M. Sauer, <i>Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen</i>.
    2014.
  mla: Sauer, Malte. <i>Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means
    Algorithmen</i>. 2014.
  short: M. Sauer, Evaluierung von Initialisierungsmethoden Für Fuzzy-k-Means Algorithmen,
    2014.
date_created: 2018-05-24T13:15:51Z
date_updated: 2022-01-06T06:58:16Z
department:
- _id: '64'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen
type: bachelorsthesis
user_id: '25078'
year: '2014'
...
---
_id: '355'
abstract:
- lang: eng
  text: 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:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Peter
  full_name: Günther, Peter
  last_name: Günther
- first_name: Gennadij
  full_name: Liske, Gennadij
  last_name: Liske
citation:
  ama: 'Blömer J, Günther P, Liske G. Tampering attacks in pairing-based cryptography.
    In: <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>.
    ; 2014:1--7. doi:<a href="https://doi.org/10.1109/FDTC.2014.10">10.1109/FDTC.2014.10</a>'
  apa: Blömer, J., Günther, P., &#38; Liske, G. (2014). Tampering attacks in pairing-based
    cryptography. In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>
    (pp. 1--7). <a href="https://doi.org/10.1109/FDTC.2014.10">https://doi.org/10.1109/FDTC.2014.10</a>
  bibtex: '@inproceedings{Blömer_Günther_Liske_2014, title={Tampering attacks in pairing-based
    cryptography}, DOI={<a href="https://doi.org/10.1109/FDTC.2014.10">10.1109/FDTC.2014.10</a>},
    booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)},
    author={Blömer, Johannes and Günther, Peter and Liske, Gennadij}, year={2014},
    pages={1--7} }'
  chicago: Blömer, Johannes, Peter Günther, and Gennadij Liske. “Tampering Attacks
    in Pairing-Based Cryptography.” In <i>Proceedings of Fault Tolerance and Diagnosis
    in Cryptography(FDTC)</i>, 1--7, 2014. <a href="https://doi.org/10.1109/FDTC.2014.10">https://doi.org/10.1109/FDTC.2014.10</a>.
  ieee: J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,”
    in <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>,
    2014, pp. 1--7.
  mla: Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.”
    <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014,
    pp. 1--7, doi:<a href="https://doi.org/10.1109/FDTC.2014.10">10.1109/FDTC.2014.10</a>.
  short: 'J. Blömer, P. Günther, G. Liske, in: Proceedings of Fault Tolerance and
    Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.'
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:23Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1109/FDTC.2014.10
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:22:29Z
  date_updated: 2018-03-20T07:22:29Z
  file_id: '1412'
  file_name: 355-Bloemer2014.pdf
  file_size: 293394
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:22:29Z
has_accepted_license: '1'
page: 1--7
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publication: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)
status: public
title: Tampering attacks in pairing-based cryptography
type: conference
user_id: '25078'
year: '2014'
...
---
_id: '369'
abstract:
- lang: eng
  text: '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:
- first_name: Timo
  full_name: Rath, Timo
  last_name: Rath
citation:
  ama: Rath T. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn; 2014.
  apa: Rath, T. (2014). <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn.
  bibtex: '@book{Rath_2014, title={RSA-Full Domain Hash Revisited}, publisher={Universität
    Paderborn}, author={Rath, Timo}, year={2014} }'
  chicago: Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn,
    2014.
  ieee: T. Rath, <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.
  mla: Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.
  short: T. Rath, RSA-Full Domain Hash Revisited, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:30Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: RSA-Full Domain Hash Revisited
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '2900'
author:
- first_name: Sascha
  full_name: Brauer, Sascha
  id: '13291'
  last_name: Brauer
citation:
  ama: Brauer S. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate
    Laplacian Mixtures</i>.; 2014.
  apa: Brauer, S. (2014). <i>A Probabilistic Expectation Maximization Algorithm for
    Multivariate Laplacian Mixtures</i>.
  bibtex: '@book{Brauer_2014, title={A Probabilistic Expectation Maximization Algorithm
    for Multivariate Laplacian Mixtures}, author={Brauer, Sascha}, year={2014} }'
  chicago: Brauer, Sascha. <i>A Probabilistic Expectation Maximization Algorithm for
    Multivariate Laplacian Mixtures</i>, 2014.
  ieee: S. Brauer, <i>A Probabilistic Expectation Maximization Algorithm for Multivariate
    Laplacian Mixtures</i>. 2014.
  mla: Brauer, Sascha. <i>A Probabilistic Expectation Maximization Algorithm for Multivariate
    Laplacian Mixtures</i>. 2014.
  short: S. Brauer, A Probabilistic Expectation Maximization Algorithm for Multivariate
    Laplacian Mixtures, 2014.
date_created: 2018-05-25T09:45:38Z
date_updated: 2022-01-06T06:58:44Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-05-25T09:45:33Z
  date_updated: 2018-05-25T09:45:33Z
  file_id: '2901'
  file_name: 2014_Brauer_AProbabilisticExpectationMaximizationAlgorithmForMultivariateLaplacianMixtures.pdf
  file_size: 971935
  relation: main_file
  success: 1
file_date_updated: 2018-05-25T09:45:33Z
has_accepted_license: '1'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: A Probabilistic Expectation Maximization Algorithm for Multivariate Laplacian
  Mixtures
type: mastersthesis
user_id: '25078'
year: '2014'
...
---
_id: '2976'
author:
- first_name: Marcel Rudolf
  full_name: Ackermann, Marcel Rudolf
  last_name: Ackermann
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Daniel
  full_name: Kuntze, Daniel
  last_name: Kuntze
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: Ackermann MR, Blömer J, Kuntze D, Sohler C. Analysis of Agglomerative Clustering.
    <i>Algorithmica</i>. 2014;69. doi:<a href="https://doi.org/10.1007/s00453-012-9717-4">10.1007/s00453-012-9717-4</a>
  apa: Ackermann, M. R., Blömer, J., Kuntze, D., &#38; Sohler, C. (2014). Analysis
    of Agglomerative Clustering. <i>Algorithmica</i>, <i>69</i>. <a href="https://doi.org/10.1007/s00453-012-9717-4">https://doi.org/10.1007/s00453-012-9717-4</a>
  bibtex: '@article{Ackermann_Blömer_Kuntze_Sohler_2014, title={Analysis of Agglomerative
    Clustering}, volume={69}, DOI={<a href="https://doi.org/10.1007/s00453-012-9717-4">10.1007/s00453-012-9717-4</a>},
    journal={Algorithmica}, publisher={Springer US}, author={Ackermann, Marcel Rudolf
    and Blömer, Johannes and Kuntze, Daniel and Sohler, Christian}, year={2014} }'
  chicago: Ackermann, Marcel Rudolf, Johannes Blömer, Daniel Kuntze, and Christian
    Sohler. “Analysis of Agglomerative Clustering.” <i>Algorithmica</i> 69 (2014).
    <a href="https://doi.org/10.1007/s00453-012-9717-4">https://doi.org/10.1007/s00453-012-9717-4</a>.
  ieee: M. R. Ackermann, J. Blömer, D. Kuntze, and C. Sohler, “Analysis of Agglomerative
    Clustering,” <i>Algorithmica</i>, vol. 69, 2014.
  mla: Ackermann, Marcel Rudolf, et al. “Analysis of Agglomerative Clustering.” <i>Algorithmica</i>,
    vol. 69, Springer US, 2014, doi:<a href="https://doi.org/10.1007/s00453-012-9717-4">10.1007/s00453-012-9717-4</a>.
  short: M.R. Ackermann, J. Blömer, D. Kuntze, C. Sohler, Algorithmica 69 (2014).
date_created: 2018-06-05T07:28:52Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1007/s00453-012-9717-4
intvolume: '        69'
publication: Algorithmica
publication_identifier:
  eissn:
  - 0178-4617
publication_status: published
publisher: Springer US
status: public
title: Analysis of Agglomerative Clustering
type: journal_article
user_id: '25078'
volume: 69
year: '2014'
...
---
_id: '2977'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Kathrin
  full_name: Bujna, Kathrin
  last_name: Bujna
- first_name: Daniel
  full_name: Kuntze, Daniel
  last_name: Kuntze
citation:
  ama: 'Blömer J, Bujna K, Kuntze D. A Theoretical and Experimental Comparison of
    the EM and SEM Algorithm. In: <i>2014 22nd International Conference on Pattern
    Recognition</i>. IEEE; 2014. doi:<a href="https://doi.org/10.1109/icpr.2014.253">10.1109/icpr.2014.253</a>'
  apa: Blömer, J., Bujna, K., &#38; Kuntze, D. (2014). A Theoretical and Experimental
    Comparison of the EM and SEM Algorithm. In <i>2014 22nd International Conference
    on Pattern Recognition</i>. IEEE. <a href="https://doi.org/10.1109/icpr.2014.253">https://doi.org/10.1109/icpr.2014.253</a>
  bibtex: '@inproceedings{Blömer_Bujna_Kuntze_2014, title={A Theoretical and Experimental
    Comparison of the EM and SEM Algorithm}, DOI={<a href="https://doi.org/10.1109/icpr.2014.253">10.1109/icpr.2014.253</a>},
    booktitle={2014 22nd International Conference on Pattern Recognition}, publisher={IEEE},
    author={Blömer, Johannes and Bujna, Kathrin and Kuntze, Daniel}, year={2014} }'
  chicago: Blömer, Johannes, Kathrin Bujna, and Daniel Kuntze. “A Theoretical and
    Experimental Comparison of the EM and SEM Algorithm.” In <i>2014 22nd International
    Conference on Pattern Recognition</i>. IEEE, 2014. <a href="https://doi.org/10.1109/icpr.2014.253">https://doi.org/10.1109/icpr.2014.253</a>.
  ieee: J. Blömer, K. Bujna, and D. Kuntze, “A Theoretical and Experimental Comparison
    of the EM and SEM Algorithm,” in <i>2014 22nd International Conference on Pattern
    Recognition</i>, 2014.
  mla: Blömer, Johannes, et al. “A Theoretical and Experimental Comparison of the
    EM and SEM Algorithm.” <i>2014 22nd International Conference on Pattern Recognition</i>,
    IEEE, 2014, doi:<a href="https://doi.org/10.1109/icpr.2014.253">10.1109/icpr.2014.253</a>.
  short: 'J. Blömer, K. Bujna, D. Kuntze, in: 2014 22nd International Conference on
    Pattern Recognition, IEEE, 2014.'
date_created: 2018-06-05T07:29:15Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1109/icpr.2014.253
publication: 2014 22nd International Conference on Pattern Recognition
publication_identifier:
  isbn:
  - '9781479952090'
publication_status: published
publisher: IEEE
status: public
title: A Theoretical and Experimental Comparison of the EM and SEM Algorithm
type: conference
user_id: '25078'
year: '2014'
...
---
_id: '442'
abstract:
- lang: eng
  text: 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:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Gennadij
  full_name: Liske, Gennadij
  last_name: Liske
citation:
  ama: Blömer J, Liske G. Constructing CCA-secure predicate encapsulation schemes
    from CPA-secure schemes and universal one-way hash functions. 2014.
  apa: Blömer, J., &#38; Liske, G. (2014). Constructing CCA-secure predicate encapsulation
    schemes from CPA-secure schemes and universal one-way hash functions. Universität
    Paderborn.
  bibtex: '@article{Blömer_Liske_2014, title={Constructing CCA-secure predicate encapsulation
    schemes from CPA-secure schemes and universal one-way hash functions}, publisher={Universität
    Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2014} }'
  chicago: Blömer, Johannes, and Gennadij Liske. “Constructing CCA-Secure Predicate
    Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.”
    Universität Paderborn, 2014.
  ieee: J. Blömer and G. Liske, “Constructing CCA-secure predicate encapsulation schemes
    from CPA-secure schemes and universal one-way hash functions.” Universität Paderborn,
    2014.
  mla: Blömer, Johannes, and Gennadij Liske. <i>Constructing CCA-Secure Predicate
    Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions</i>.
    Universität Paderborn, 2014.
  short: J. Blömer, G. Liske, (2014).
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:03Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:28:34Z
  date_updated: 2018-03-16T11:28:34Z
  file_id: '1351'
  file_name: 442-P-KEM.pdf
  file_size: 377945
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:28:34Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2014/511.pdf
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
title: Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes
  and universal one-way hash functions
type: preprint
user_id: '25078'
year: '2014'
...
---
_id: '463'
abstract:
- lang: eng
  text: 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:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Ricardo
  full_name: Gomes da Silva, Ricardo
  last_name: Gomes da Silva
- first_name: Peter
  full_name: Günther, Peter
  last_name: Günther
- first_name: Juliane
  full_name: Krämer, Juliane
  last_name: Krämer
- first_name: Jean-Pierre
  full_name: Seifert, Jean-Pierre
  last_name: Seifert
citation:
  ama: 'Blömer J, Gomes da Silva R, Günther P, Krämer J, Seifert J-P. A Practical
    Second-Order Fault Attack against a Real-World Pairing Implementation. In: <i>Proceedings
    of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>. ; 2014:123--136. doi:<a
    href="https://doi.org/10.1109/FDTC.2014.22">10.1109/FDTC.2014.22</a>'
  apa: Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., &#38; Seifert, J.-P.
    (2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.
    In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i> (pp.
    123--136). <a href="https://doi.org/10.1109/FDTC.2014.22">https://doi.org/10.1109/FDTC.2014.22</a>
  bibtex: '@inproceedings{Blömer_Gomes da Silva_Günther_Krämer_Seifert_2014, title={A
    Practical Second-Order Fault Attack against a Real-World Pairing Implementation},
    DOI={<a href="https://doi.org/10.1109/FDTC.2014.22">10.1109/FDTC.2014.22</a>},
    booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)},
    author={Blömer, Johannes and Gomes da Silva, Ricardo and Günther, Peter and Krämer,
    Juliane and Seifert, Jean-Pierre}, year={2014}, pages={123--136} }'
  chicago: Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer,
    and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World
    Pairing Implementation.” In <i>Proceedings of Fault Tolerance and Diagnosis in
    Cryptography(FDTC)</i>, 123--136, 2014. <a href="https://doi.org/10.1109/FDTC.2014.22">https://doi.org/10.1109/FDTC.2014.22</a>.
  ieee: J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A
    Practical Second-Order Fault Attack against a Real-World Pairing Implementation,”
    in <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>,
    2014, pp. 123--136.
  mla: Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World
    Pairing Implementation.” <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>,
    2014, pp. 123--136, doi:<a href="https://doi.org/10.1109/FDTC.2014.22">10.1109/FDTC.2014.22</a>.
  short: '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.'
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1109/FDTC.2014.22
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-16T11:20:54Z
  date_updated: 2018-03-16T11:20:54Z
  file_id: '1336'
  file_name: 463-FDTC14.pdf
  file_size: 437518
  relation: main_file
  success: 1
file_date_updated: 2018-03-16T11:20:54Z
has_accepted_license: '1'
page: 123--136
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publication: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)
status: public
title: A Practical Second-Order Fault Attack against a Real-World Pairing Implementation
type: conference
user_id: '25078'
year: '2014'
...
---
_id: '414'
author:
- first_name: Janek
  full_name: Jochheim, Janek
  last_name: Jochheim
citation:
  ama: Jochheim J. <i>Hiding Software Components Using Functional Encryption</i>.
    Universität Paderborn; 2014.
  apa: Jochheim, J. (2014). <i>Hiding software components using functional encryption</i>.
    Universität Paderborn.
  bibtex: '@book{Jochheim_2014, title={Hiding software components using functional
    encryption}, publisher={Universität Paderborn}, author={Jochheim, Janek}, year={2014}
    }'
  chicago: Jochheim, Janek. <i>Hiding Software Components Using Functional Encryption</i>.
    Universität Paderborn, 2014.
  ieee: J. Jochheim, <i>Hiding software components using functional encryption</i>.
    Universität Paderborn, 2014.
  mla: Jochheim, Janek. <i>Hiding Software Components Using Functional Encryption</i>.
    Universität Paderborn, 2014.
  short: J. Jochheim, Hiding Software Components Using Functional Encryption, Universität
    Paderborn, 2014.
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:23Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Hiding software components using functional encryption
type: mastersthesis
user_id: '25078'
year: '2014'
...
---
_id: '416'
author:
- first_name: Pascal
  full_name: Bemmann, Pascal
  id: '32571'
  last_name: Bemmann
citation:
  ama: Bemmann P. <i>Group Signature Schemes with Strong Exculpability</i>. Universität
    Paderborn; 2014.
  apa: Bemmann, P. (2014). <i>Group Signature Schemes with Strong Exculpability</i>.
    Universität Paderborn.
  bibtex: '@book{Bemmann_2014, title={Group Signature Schemes with Strong Exculpability},
    publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2014} }'
  chicago: Bemmann, Pascal. <i>Group Signature Schemes with Strong Exculpability</i>.
    Universität Paderborn, 2014.
  ieee: P. Bemmann, <i>Group Signature Schemes with Strong Exculpability</i>. Universität
    Paderborn, 2014.
  mla: Bemmann, Pascal. <i>Group Signature Schemes with Strong Exculpability</i>.
    Universität Paderborn, 2014.
  short: P. Bemmann, Group Signature Schemes with Strong Exculpability, Universität
    Paderborn, 2014.
date_created: 2017-10-17T12:42:13Z
date_updated: 2022-01-06T07:00:26Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Group Signature Schemes with Strong Exculpability
type: bachelorsthesis
user_id: '25078'
year: '2014'
...
---
_id: '421'
author:
- first_name: Jan
  full_name: Lippert, Jan
  last_name: Lippert
citation:
  ama: Lippert J. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn; 2014.
  apa: Lippert, J. (2014). <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn.
  bibtex: '@book{Lippert_2014, title={Fujisaki-Okamoto Transformation}, publisher={Universität
    Paderborn}, author={Lippert, Jan}, year={2014} }'
  chicago: Lippert, Jan. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn,
    2014.
  ieee: J. Lippert, <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn,
    2014.
  mla: Lippert, Jan. <i>Fujisaki-Okamoto Transformation</i>. Universität Paderborn,
    2014.
  short: J. Lippert, Fujisaki-Okamoto Transformation, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:36Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Fujisaki-Okamoto Transformation
type: bachelorsthesis
user_id: '25078'
year: '2014'
...
---
_id: '2868'
author:
- first_name: Stefan
  full_name: Laudemann, Stefan
  last_name: Laudemann
citation:
  ama: Laudemann S. <i>Themenmodellierung Zur Identifikation Und Gruppierung von Spam-Webseiten</i>.;
    2013.
  apa: Laudemann, S. (2013). <i>Themenmodellierung zur Identifikation und Gruppierung
    von Spam-Webseiten</i>.
  bibtex: '@book{Laudemann_2013, title={Themenmodellierung zur Identifikation und
    Gruppierung von Spam-Webseiten}, author={Laudemann, Stefan}, year={2013} }'
  chicago: Laudemann, Stefan. <i>Themenmodellierung Zur Identifikation Und Gruppierung
    von Spam-Webseiten</i>, 2013.
  ieee: S. Laudemann, <i>Themenmodellierung zur Identifikation und Gruppierung von
    Spam-Webseiten</i>. 2013.
  mla: Laudemann, Stefan. <i>Themenmodellierung Zur Identifikation Und Gruppierung
    von Spam-Webseiten</i>. 2013.
  short: S. Laudemann, Themenmodellierung Zur Identifikation Und Gruppierung von Spam-Webseiten,
    2013.
date_created: 2018-05-24T13:16:41Z
date_updated: 2022-01-06T06:58:17Z
department:
- _id: '64'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Themenmodellierung zur Identifikation und Gruppierung von Spam-Webseiten
type: bachelorsthesis
user_id: '25078'
year: '2013'
...
---
_id: '2869'
author:
- first_name: Lennart
  full_name: Leder, Lennart
  last_name: Leder
citation:
  ama: Leder L. <i>Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering
    Unter Verwendung von L_p-Metriken</i>.; 2013.
  apa: Leder, L. (2013). <i>Nichtapproximierbarkeitsresultate zu Radius- und Durchmesserclustering
    unter Verwendung von L_p-Metriken</i>.
  bibtex: '@book{Leder_2013, title={Nichtapproximierbarkeitsresultate zu Radius- und
    Durchmesserclustering unter Verwendung von L_p-Metriken}, author={Leder, Lennart},
    year={2013} }'
  chicago: Leder, Lennart. <i>Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering
    Unter Verwendung von L_p-Metriken</i>, 2013.
  ieee: L. Leder, <i>Nichtapproximierbarkeitsresultate zu Radius- und Durchmesserclustering
    unter Verwendung von L_p-Metriken</i>. 2013.
  mla: Leder, Lennart. <i>Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering
    Unter Verwendung von L_p-Metriken</i>. 2013.
  short: L. Leder, Nichtapproximierbarkeitsresultate Zu Radius- Und Durchmesserclustering
    Unter Verwendung von L_p-Metriken, 2013.
date_created: 2018-05-24T13:17:53Z
date_updated: 2022-01-06T06:58:17Z
department:
- _id: '64'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Nichtapproximierbarkeitsresultate zu Radius- und Durchmesserclustering unter
  Verwendung von L_p-Metriken
type: bachelorsthesis
user_id: '25078'
year: '2013'
...