---
_id: '2909'
author:
- first_name: Daniel
  full_name: Kuntze, Daniel
  last_name: Kuntze
citation:
  ama: Kuntze D. <i>Practical Algorithms for Clustering and Modeling Large Data Sets
    - Analysis and Improvements</i>. Universität Paderborn; 2013.
  apa: Kuntze, D. (2013). <i>Practical algorithms for clustering and modeling large
    data sets - Analysis and improvements</i>. Universität Paderborn.
  bibtex: '@book{Kuntze_2013, title={Practical algorithms for clustering and modeling
    large data sets - Analysis and improvements}, publisher={Universität Paderborn},
    author={Kuntze, Daniel}, year={2013} }'
  chicago: Kuntze, Daniel. <i>Practical Algorithms for Clustering and Modeling Large
    Data Sets - Analysis and Improvements</i>. Universität Paderborn, 2013.
  ieee: D. Kuntze, <i>Practical algorithms for clustering and modeling large data
    sets - Analysis and improvements</i>. Universität Paderborn, 2013.
  mla: Kuntze, Daniel. <i>Practical Algorithms for Clustering and Modeling Large Data
    Sets - Analysis and Improvements</i>. Universität Paderborn, 2013.
  short: D. Kuntze, Practical Algorithms for Clustering and Modeling Large Data Sets
    - Analysis and Improvements, Universität Paderborn, 2013.
date_created: 2018-05-25T10:07:42Z
date_updated: 2022-01-06T06:58:46Z
department:
- _id: '64'
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12721
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Practical algorithms for clustering and modeling large data sets - Analysis
  and improvements
type: dissertation
user_id: '25078'
year: '2013'
...
---
_id: '2917'
author:
- first_name: Jakob
  full_name: Juhnke, Jakob
  id: '48090'
  last_name: Juhnke
- first_name: Hanno
  full_name: Lefmann, Hanno
  last_name: Lefmann
- first_name: Volker
  full_name: Strehl, Volker
  last_name: Strehl
citation:
  ama: Juhnke J, Lefmann H, Strehl V. <i>An Approach for Determining Optimal Contrast
    in Visual Cryptography</i>. Fortschritt-Berichte VDI; 2013.
  apa: Juhnke, J., Lefmann, H., &#38; Strehl, V. (2013). <i>An Approach for Determining
    Optimal Contrast in Visual Cryptography</i>. Fortschritt-Berichte VDI.
  bibtex: '@book{Juhnke_Lefmann_Strehl_2013, title={An Approach for Determining Optimal
    Contrast in Visual Cryptography}, publisher={Fortschritt-Berichte VDI}, author={Juhnke,
    Jakob and Lefmann, Hanno and Strehl, Volker}, year={2013} }'
  chicago: Juhnke, Jakob, Hanno Lefmann, and Volker Strehl. <i>An Approach for Determining
    Optimal Contrast in Visual Cryptography</i>. Fortschritt-Berichte VDI, 2013.
  ieee: J. Juhnke, H. Lefmann, and V. Strehl, <i>An Approach for Determining Optimal
    Contrast in Visual Cryptography</i>. Fortschritt-Berichte VDI, 2013.
  mla: Juhnke, Jakob, et al. <i>An Approach for Determining Optimal Contrast in Visual
    Cryptography</i>. Fortschritt-Berichte VDI, 2013.
  short: J. Juhnke, H. Lefmann, V. Strehl, An Approach for Determining Optimal Contrast
    in Visual Cryptography, Fortschritt-Berichte VDI, 2013.
date_created: 2018-05-25T11:42:38Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '64'
extern: '1'
publisher: Fortschritt-Berichte VDI
status: public
title: An Approach for Determining Optimal Contrast in Visual Cryptography
type: report
user_id: '48090'
year: '2013'
...
---
_id: '2979'
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. Improved Side Channel Attacks on Pairing Based
    Cryptography. In: <i>Constructive Side-Channel Analysis and Secure Design</i>.
    Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:154-168. doi:<a href="https://doi.org/10.1007/978-3-642-40026-1_10">10.1007/978-3-642-40026-1_10</a>'
  apa: 'Blömer, J., Günther, P., &#38; Liske, G. (2013). Improved Side Channel Attacks
    on Pairing Based Cryptography. In <i>Constructive Side-Channel Analysis and Secure
    Design</i> (pp. 154–168). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-642-40026-1_10">https://doi.org/10.1007/978-3-642-40026-1_10</a>'
  bibtex: '@inbook{Blömer_Günther_Liske_2013, place={Berlin, Heidelberg}, title={Improved
    Side Channel Attacks on Pairing Based Cryptography}, DOI={<a href="https://doi.org/10.1007/978-3-642-40026-1_10">10.1007/978-3-642-40026-1_10</a>},
    booktitle={Constructive Side-Channel Analysis and Secure Design}, publisher={Springer
    Berlin Heidelberg}, author={Blömer, Johannes and Günther, Peter and Liske, Gennadij},
    year={2013}, pages={154–168} }'
  chicago: 'Blömer, Johannes, Peter Günther, and Gennadij Liske. “Improved Side Channel
    Attacks on Pairing Based Cryptography.” In <i>Constructive Side-Channel Analysis
    and Secure Design</i>, 154–68. Berlin, Heidelberg: Springer Berlin Heidelberg,
    2013. <a href="https://doi.org/10.1007/978-3-642-40026-1_10">https://doi.org/10.1007/978-3-642-40026-1_10</a>.'
  ieee: 'J. Blömer, P. Günther, and G. Liske, “Improved Side Channel Attacks on Pairing
    Based Cryptography,” in <i>Constructive Side-Channel Analysis and Secure Design</i>,
    Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 154–168.'
  mla: Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.”
    <i>Constructive Side-Channel Analysis and Secure Design</i>, Springer Berlin Heidelberg,
    2013, pp. 154–68, doi:<a href="https://doi.org/10.1007/978-3-642-40026-1_10">10.1007/978-3-642-40026-1_10</a>.
  short: '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.'
date_created: 2018-06-05T07:33:22Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
doi: 10.1007/978-3-642-40026-1_10
page: 154-168
place: Berlin, Heidelberg
publication: Constructive Side-Channel Analysis and Secure Design
publication_identifier:
  isbn:
  - '9783642400254'
  - '9783642400261'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Improved Side Channel Attacks on Pairing Based Cryptography
type: book_chapter
user_id: '25078'
year: '2013'
...
---
_id: '471'
author:
- first_name: Alina
  full_name: Tezer, Alina
  last_name: Tezer
citation:
  ama: Tezer A. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in
    identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn; 2013.
  apa: Tezer, A. (2013). <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern
    in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn.
  bibtex: '@book{Tezer_2013, title={Verteilte Erstellung und Aktualisierung von Schlüsselservern
    in identitätsbasierten Verschlüsselungssystemen}, publisher={Universität Paderborn},
    author={Tezer, Alina}, year={2013} }'
  chicago: Tezer, Alina. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern
    in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.
  ieee: A. Tezer, <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern
    in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.
  mla: Tezer, Alina. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern
    in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.
  short: A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern in
    identitätsbasierten Verschlüsselungssystemen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:19Z
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: Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten
  Verschlüsselungssystemen
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '486'
author:
- first_name: Oliver
  full_name: Otte, Oliver
  last_name: Otte
citation:
  ama: Otte O. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität
    Paderborn; 2013.
  apa: Otte, O. (2013). <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>.
    Universität Paderborn.
  bibtex: '@book{Otte_2013, title={Seitenkanalresistenz paarungsbasierter Kryptographie},
    publisher={Universität Paderborn}, author={Otte, Oliver}, year={2013} }'
  chicago: Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>.
    Universität Paderborn, 2013.
  ieee: O. Otte, <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität
    Paderborn, 2013.
  mla: Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>.
    Universität Paderborn, 2013.
  short: O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie, Universität
    Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:27Z
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: Seitenkanalresistenz paarungsbasierter Kryptographie
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '487'
author:
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
citation:
  ama: Bobolz J. <i>Security Proofs for Pairing-Based Cryptography in the Generic
    Group Model</i>. Universität Paderborn; 2013.
  apa: Bobolz, J. (2013). <i>Security Proofs for Pairing-Based Cryptography in the
    Generic Group Model</i>. Universität Paderborn.
  bibtex: '@book{Bobolz_2013, title={Security Proofs for Pairing-Based Cryptography
    in the Generic Group Model}, publisher={Universität Paderborn}, author={Bobolz,
    Jan}, year={2013} }'
  chicago: Bobolz, Jan. <i>Security Proofs for Pairing-Based Cryptography in the Generic
    Group Model</i>. Universität Paderborn, 2013.
  ieee: J. Bobolz, <i>Security Proofs for Pairing-Based Cryptography in the Generic
    Group Model</i>. Universität Paderborn, 2013.
  mla: Bobolz, Jan. <i>Security Proofs for Pairing-Based Cryptography in the Generic
    Group Model</i>. Universität Paderborn, 2013.
  short: J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic
    Group Model, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: jbobolz
  date_created: 2018-04-13T11:42:08Z
  date_updated: 2018-06-29T09:56:54Z
  file_id: '2346'
  file_name: thesis_jbobolz_final.pdf
  file_size: 874286
  relation: main_file
file_date_updated: 2018-06-29T09:56:54Z
has_accepted_license: '1'
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
title: Security Proofs for Pairing-Based Cryptography in the Generic Group Model
type: bachelorsthesis
urn: '4875'
user_id: '27207'
year: '2013'
...
---
_id: '488'
abstract:
- lang: eng
  text: Unattended systems are key ingredients of various critical infrastruc-tures
    like networks of self service terminals or automated teller machines.For cost
    and efficiency reasons they should mostly run autonomously.Unattended systems
    are attractive and lucrative targets for various kindsof attacks, including attacks
    on the integrity of their components and thecommunication between components.
    In this paper, we propose a gen-eral cryptographic framework to protect unattended
    systems. We alsodemonstrate that instantiating the framework with techniques from
    iden-tity based cryptography is particularly well-suited to efficiently secureunattended
    systems.
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: Volker
  full_name: Krummel, Volker
  last_name: Krummel
citation:
  ama: 'Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with
    Identity Based Cryptography - A Case Study. In: <i>Proceedings of the 5th International
    Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>.
    ; 2013:98-105.'
  apa: Blömer, J., Günther, P., &#38; Krummel, V. (2013). Securing Critical Unattended
    Systems with Identity Based Cryptography - A Case Study. In <i>Proceedings of
    the 5th International Conference on Mathematical Aspects of Computer and Information
    Sciences (MACIS)</i> (pp. 98–105).
  bibtex: '@inproceedings{Blömer_Günther_Krummel_2013, title={Securing Critical Unattended
    Systems with Identity Based Cryptography - A Case Study}, booktitle={Proceedings
    of the 5th International Conference on Mathematical Aspects of Computer and Information
    Sciences (MACIS)}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker},
    year={2013}, pages={98–105} }'
  chicago: Blömer, Johannes, Peter Günther, and Volker Krummel. “Securing Critical
    Unattended Systems with Identity Based Cryptography - A Case Study.” In <i>Proceedings
    of the 5th International Conference on Mathematical Aspects of Computer and Information
    Sciences (MACIS)</i>, 98–105, 2013.
  ieee: J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems
    with Identity Based Cryptography - A Case Study,” in <i>Proceedings of the 5th
    International Conference on Mathematical Aspects of Computer and Information Sciences
    (MACIS)</i>, 2013, pp. 98–105.
  mla: Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity
    Based Cryptography - A Case Study.” <i>Proceedings of the 5th International Conference
    on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2013,
    pp. 98–105.
  short: '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.'
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T13:46:52Z
  date_updated: 2018-03-15T13:46:52Z
  file_id: '1317'
  file_name: 488-MACIS13.pdf
  file_size: 301962
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T13:46:52Z
has_accepted_license: '1'
page: 98-105
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 5th International Conference on Mathematical Aspects
  of Computer and Information Sciences (MACIS)
status: public
title: Securing Critical Unattended Systems with Identity Based Cryptography - A Case
  Study
type: conference
user_id: '477'
year: '2013'
...
---
_id: '538'
abstract:
- lang: eng
  text: 'We present a new technique to realize attribute-based encryption (ABE) schemes
    secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our
    approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE
    schemes to achieve more efficient constructions than the known generic constructions
    of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based
    key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes:
    a key-policy attribute-based KEM that is based on Goyal''s key-policy ABE and
    a ciphertext-policy attribute-based KEM that is based on Waters'' ciphertext-policy
    ABE. To achieve our goals, we use an appropriate hash function and need to extend
    the public parameters and the ciphertexts of the underlying CPA-secure encryption
    schemes only by a single group element. Moreover, we use the same hardness assumptions
    as the underlying CPA-secure encryption schemes.'
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. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations
    without Random Oracles. 2013.
  apa: Blömer, J., &#38; Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based
    Key Encapsulations without Random Oracles. Universität Paderborn.
  bibtex: '@article{Blömer_Liske_2013, title={Direct Chosen-Ciphertext Secure Attribute-Based
    Key Encapsulations without Random Oracles}, publisher={Universität Paderborn},
    author={Blömer, Johannes and Liske, Gennadij}, year={2013} }'
  chicago: Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure
    Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn,
    2013.
  ieee: J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key
    Encapsulations without Random Oracles.” Universität Paderborn, 2013.
  mla: Blömer, Johannes, and Gennadij Liske. <i>Direct Chosen-Ciphertext Secure Attribute-Based
    Key Encapsulations without Random Oracles</i>. Universität Paderborn, 2013.
  short: J. Blömer, G. Liske, (2013).
date_created: 2017-10-17T12:42:37Z
date_updated: 2022-01-06T07:01:51Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:35:04Z
  date_updated: 2018-03-15T10:35:04Z
  file_id: '1292'
  file_name: 538-AB-KEM_01.pdf
  file_size: 389797
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:35:04Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2013/646
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: Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without
  Random Oracles
type: preprint
user_id: '25078'
year: '2013'
...
---
_id: '553'
author:
- first_name: Kathlén
  full_name: Kohn, Kathlén
  last_name: Kohn
citation:
  ama: Kohn K. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
    Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn; 2013.
  apa: Kohn, K. (2013). <i>Attributbasierte Verschlüsselung mittels Gittermethoden
    - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität
    Paderborn.
  bibtex: '@book{Kohn_2013, title={Attributbasierte Verschlüsselung mittels Gittermethoden
    - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}, publisher={Universität
    Paderborn}, author={Kohn, Kathlén}, year={2013} }'
  chicago: Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden
    - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität
    Paderborn, 2013.
  ieee: K. Kohn, <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
    Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.
  mla: Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden -
    Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn,
    2013.
  short: K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische
    Grundlagen, Verfahren und Sicherheitsbeweise, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:40Z
date_updated: 2022-01-06T07:01:57Z
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: Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen,
  Verfahren und Sicherheitsbeweise
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '2982'
author:
- first_name: Marcel Rudolf
  full_name: Ackermann, Marcel Rudolf
  last_name: Ackermann
- first_name: Marcus
  full_name: Märtens, Marcus
  last_name: Märtens
- first_name: Christoph
  full_name: Raupach, Christoph
  last_name: Raupach
- first_name: Kamil
  full_name: Swierkot, Kamil
  last_name: Swierkot
- first_name: Christiane
  full_name: Lammersen, Christiane
  last_name: Lammersen
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: 'Ackermann MR, Märtens M, Raupach C, Swierkot K, Lammersen C, Sohler C. StreamKM++:
    A clustering algorithm for data streams. 2012;17. doi:<a href="https://doi.org/10.1145/2133803.2184450">10.1145/2133803.2184450</a>'
  apa: 'Ackermann, M. R., Märtens, M., Raupach, C., Swierkot, K., Lammersen, C., &#38;
    Sohler, C. (2012). StreamKM++: A clustering algorithm for data streams. New York,
    NY, USA: ACM. <a href="https://doi.org/10.1145/2133803.2184450">https://doi.org/10.1145/2133803.2184450</a>'
  bibtex: '@article{Ackermann_Märtens_Raupach_Swierkot_Lammersen_Sohler_2012, place={New
    York, NY, USA}, series={ACM Journal of Experimental Algorithmics}, title={StreamKM++:
    A clustering algorithm for data streams}, volume={17}, DOI={<a href="https://doi.org/10.1145/2133803.2184450">10.1145/2133803.2184450</a>},
    publisher={ACM}, author={Ackermann, Marcel Rudolf and Märtens, Marcus and Raupach,
    Christoph and Swierkot, Kamil and Lammersen, Christiane and Sohler, Christian},
    year={2012}, collection={ACM Journal of Experimental Algorithmics} }'
  chicago: '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. <a href="https://doi.org/10.1145/2133803.2184450">https://doi.org/10.1145/2133803.2184450</a>.'
  ieee: '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.'
  mla: 'Ackermann, Marcel Rudolf, et al. <i>StreamKM++: A Clustering Algorithm for
    Data Streams</i>. Vol. 17, ACM, 2012, doi:<a href="https://doi.org/10.1145/2133803.2184450">10.1145/2133803.2184450</a>.'
  short: M.R. Ackermann, M. Märtens, C. Raupach, K. Swierkot, C. Lammersen, C. Sohler,
    17 (2012).
date_created: 2018-06-05T07:41:14Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1145/2133803.2184450
intvolume: '        17'
place: New York, NY, USA
publication_status: published
publisher: ACM
series_title: ACM Journal of Experimental Algorithmics
status: public
title: 'StreamKM++: A clustering algorithm for data streams'
type: conference
user_id: '25078'
volume: 17
year: '2012'
...
---
_id: '2984'
abstract:
- lang: eng
  text: 'Ich beschreibe die deutsche Enigma-Verschlüsselungsmaschine und skizziere,
    wie sie von den Codebrechern von Bletchely Park um Alan Turing gebrochen wurde.
    Besonderes Augenmerk lege ich auf die Beiträge Alan Turings und die Bedeutung
    seiner Leistung für die Entwicklung moderner Kryptografie. '
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: Blömer J. Turing und Kryptografie. <i>Informatik-Spektrum</i>. 2012;35(4).
    doi:<a href="https://doi.org/10.1007/s00287-012-0622-7">10.1007/s00287-012-0622-7</a>
  apa: Blömer, J. (2012). Turing und Kryptografie. <i>Informatik-Spektrum</i>, <i>35</i>(4).
    <a href="https://doi.org/10.1007/s00287-012-0622-7">https://doi.org/10.1007/s00287-012-0622-7</a>
  bibtex: '@article{Blömer_2012, title={Turing und Kryptografie}, volume={35}, DOI={<a
    href="https://doi.org/10.1007/s00287-012-0622-7">10.1007/s00287-012-0622-7</a>},
    number={4}, journal={Informatik-Spektrum}, author={Blömer, Johannes}, year={2012}
    }'
  chicago: Blömer, Johannes. “Turing Und Kryptografie.” <i>Informatik-Spektrum</i>
    35, no. 4 (2012). <a href="https://doi.org/10.1007/s00287-012-0622-7">https://doi.org/10.1007/s00287-012-0622-7</a>.
  ieee: J. Blömer, “Turing und Kryptografie,” <i>Informatik-Spektrum</i>, vol. 35,
    no. 4, 2012.
  mla: Blömer, Johannes. “Turing Und Kryptografie.” <i>Informatik-Spektrum</i>, vol.
    35, no. 4, 2012, doi:<a href="https://doi.org/10.1007/s00287-012-0622-7">10.1007/s00287-012-0622-7</a>.
  short: J. Blömer, Informatik-Spektrum 35 (2012).
date_created: 2018-06-05T07:42:38Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/s00287-012-0622-7
intvolume: '        35'
issue: '4'
language:
- iso: eng
publication: Informatik-Spektrum
publication_identifier:
  issn:
  - 1432-122X
publication_status: published
quality_controlled: '1'
status: public
title: Turing und Kryptografie
type: journal_article
user_id: '25078'
volume: 35
year: '2012'
...
---
_id: '606'
author:
- first_name: Nils
  full_name: Löken, Nils
  id: '13703'
  last_name: Löken
citation:
  ama: Löken N. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
    auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>.
    Universität Paderborn; 2012.
  apa: Löken, N. (2012). <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis
    für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>.
    Universität Paderborn.
  bibtex: '@book{Löken_2012, title={Identitätsbasierte Signaturen - Ein Sicherheitsbeweis
    für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas},
    publisher={Universität Paderborn}, author={Löken, Nils}, year={2012} }'
  chicago: Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für
    Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>.
    Universität Paderborn, 2012.
  ieee: N. Löken, <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
    auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>.
    Universität Paderborn, 2012.
  mla: Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen
    auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>.
    Universität Paderborn, 2012.
  short: 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.
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:51Z
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
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage
  von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas
type: bachelorsthesis
user_id: '13703'
year: '2012'
...
---
_id: '607'
author:
- first_name: Thomas
  full_name: Haarhoff, Thomas
  last_name: Haarhoff
citation:
  ama: Haarhoff T. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen
    für Körper der Charakteristik 2</i>. Universität Paderborn; 2012.
  apa: Haarhoff, T. (2012). <i>Identitätsbasierte Kryptographie - Implementierung
    von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn.
  bibtex: '@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung
    von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn},
    author={Haarhoff, Thomas}, year={2012} }'
  chicago: Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung
    von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.
  ieee: T. Haarhoff, <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen
    für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.
  mla: Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von
    Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.
  short: T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen
    für Körper der Charakteristik 2, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:50Z
date_updated: 2022-01-06T07:02:51Z
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
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper
  der Charakteristik 2
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '629'
author:
- first_name: Patrick
  full_name: Schleiter, Patrick
  last_name: Schleiter
citation:
  ama: Schleiter P. <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn;
    2012.
  apa: Schleiter, P. (2012). <i>Attribute-basierte Verschlüsselung</i>. Universität
    Paderborn.
  bibtex: '@book{Schleiter_2012, title={Attribute-basierte Verschlüsselung}, publisher={Universität
    Paderborn}, author={Schleiter, Patrick}, year={2012} }'
  chicago: Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität
    Paderborn, 2012.
  ieee: P. Schleiter, <i>Attribute-basierte Verschlüsselung</i>. Universität Paderborn,
    2012.
  mla: Schleiter, Patrick. <i>Attribute-basierte Verschlüsselung</i>. Universität
    Paderborn, 2012.
  short: P. Schleiter, Attribute-basierte Verschlüsselung, Universität Paderborn,
    2012.
date_created: 2017-10-17T12:42:54Z
date_updated: 2022-01-06T07:03:00Z
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: Attribute-basierte Verschlüsselung
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '2872'
author:
- first_name: Timm
  full_name: Böttger, Timm
  last_name: Böttger
citation:
  ama: Böttger T. <i>Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen</i>.;
    2011.
  apa: Böttger, T. (2011). <i>Bicriteria-Approximation für das k-Median-Clustering
    mit Bregman-Divergenzen</i>.
  bibtex: '@book{Böttger_2011, title={Bicriteria-Approximation für das k-Median-Clustering
    mit Bregman-Divergenzen}, author={Böttger, Timm}, year={2011} }'
  chicago: Böttger, Timm. <i>Bicriteria-Approximation Für Das k-Median-Clustering
    Mit Bregman-Divergenzen</i>, 2011.
  ieee: T. Böttger, <i>Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen</i>.
    2011.
  mla: Böttger, Timm. <i>Bicriteria-Approximation Für Das k-Median-Clustering Mit
    Bregman-Divergenzen</i>. 2011.
  short: T. Böttger, Bicriteria-Approximation Für Das k-Median-Clustering Mit Bregman-Divergenzen,
    2011.
date_created: 2018-05-24T13:24:41Z
date_updated: 2022-01-06T06:58:18Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-05-24T13:23:12Z
  date_updated: 2018-05-24T13:23:12Z
  file_id: '2873'
  file_name: 2011_Boettger_BicriteriaApproximationFuerDasKMediansClusteringMitBregmanDivergenzen.pdf
  file_size: 569819
  relation: main_file
  success: 1
file_date_updated: 2018-05-24T13:23:12Z
has_accepted_license: '1'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  last_name: Blömer
title: Bicriteria-Approximation für das k-Median-Clustering mit Bregman-Divergenzen
type: bachelorsthesis
user_id: '25078'
year: '2011'
...
---
_id: '2902'
author:
- first_name: Marcus
  full_name: Märtens, Marcus
  last_name: Märtens
citation:
  ama: Märtens M. <i>The Monotone Complexity of Computing K-Clique on Random Graphs</i>.;
    2011.
  apa: Märtens, M. (2011). <i>The Monotone Complexity of Computing k-Clique on Random
    Graphs</i>.
  bibtex: '@book{Märtens_2011, title={The Monotone Complexity of Computing k-Clique
    on Random Graphs}, author={Märtens, Marcus}, year={2011} }'
  chicago: Märtens, Marcus. <i>The Monotone Complexity of Computing K-Clique on Random
    Graphs</i>, 2011.
  ieee: M. Märtens, <i>The Monotone Complexity of Computing k-Clique on Random Graphs</i>.
    2011.
  mla: Märtens, Marcus. <i>The Monotone Complexity of Computing K-Clique on Random
    Graphs</i>. 2011.
  short: M. Märtens, The Monotone Complexity of Computing K-Clique on Random Graphs,
    2011.
date_created: 2018-05-25T09:46:27Z
date_updated: 2022-01-06T06:58:44Z
department:
- _id: '64'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: The Monotone Complexity of Computing k-Clique on Random Graphs
type: mastersthesis
user_id: '25078'
year: '2011'
...
---
_id: '2985'
author:
- first_name: Marcel R
  full_name: Ackermann, Marcel R
  last_name: Ackermann
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Christoph
  full_name: Scholz, Christoph
  last_name: Scholz
citation:
  ama: Ackermann MR, Blömer J, Scholz C. Hardness and Non-Approximability of Bregman
    Clustering Problems. 2011.
  apa: Ackermann, M. R., Blömer, J., &#38; Scholz, C. (2011). Hardness and Non-Approximability
    of Bregman Clustering Problems.
  bibtex: '@article{Ackermann_Blömer_Scholz_2011, series={Electronic Colloquium on
    Computational Complexity (ECCC)}, title={Hardness and Non-Approximability of Bregman
    Clustering Problems.}, author={Ackermann, Marcel R and Blömer, Johannes and Scholz,
    Christoph}, year={2011}, collection={Electronic Colloquium on Computational Complexity
    (ECCC)} }'
  chicago: Ackermann, Marcel R, Johannes Blömer, and Christoph Scholz. “Hardness and
    Non-Approximability of Bregman Clustering Problems.” Electronic Colloquium on
    Computational Complexity (ECCC), 2011.
  ieee: M. R. Ackermann, J. Blömer, and C. Scholz, “Hardness and Non-Approximability
    of Bregman Clustering Problems.” 2011.
  mla: Ackermann, Marcel R., et al. <i>Hardness and Non-Approximability of Bregman
    Clustering Problems.</i> 2011.
  short: M.R. Ackermann, J. Blömer, C. Scholz, (2011).
date_created: 2018-06-05T07:47:21Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
publication_status: published
series_title: Electronic Colloquium on Computational Complexity (ECCC)
status: public
title: Hardness and Non-Approximability of Bregman Clustering Problems.
type: conference
user_id: '25078'
year: '2011'
...
---
_id: '2986'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: 'Blömer J. How to Share a Secret. In: <i>Algorithms Unplugged</i>. Berlin,
    Heidelberg: Springer Berlin Heidelberg; 2011:159-168. doi:<a href="https://doi.org/10.1007/978-3-642-15328-0_17">10.1007/978-3-642-15328-0_17</a>'
  apa: 'Blömer, J. (2011). How to Share a Secret. In <i>Algorithms Unplugged</i> (pp.
    159–168). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-642-15328-0_17">https://doi.org/10.1007/978-3-642-15328-0_17</a>'
  bibtex: '@inbook{Blömer_2011, place={Berlin, Heidelberg}, title={How to Share a
    Secret}, DOI={<a href="https://doi.org/10.1007/978-3-642-15328-0_17">10.1007/978-3-642-15328-0_17</a>},
    booktitle={Algorithms Unplugged}, publisher={Springer Berlin Heidelberg}, author={Blömer,
    Johannes}, year={2011}, pages={159–168} }'
  chicago: 'Blömer, Johannes. “How to Share a Secret.” In <i>Algorithms Unplugged</i>,
    159–68. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. <a href="https://doi.org/10.1007/978-3-642-15328-0_17">https://doi.org/10.1007/978-3-642-15328-0_17</a>.'
  ieee: 'J. Blömer, “How to Share a Secret,” in <i>Algorithms Unplugged</i>, Berlin,
    Heidelberg: Springer Berlin Heidelberg, 2011, pp. 159–168.'
  mla: Blömer, Johannes. “How to Share a Secret.” <i>Algorithms Unplugged</i>, Springer
    Berlin Heidelberg, 2011, pp. 159–68, doi:<a href="https://doi.org/10.1007/978-3-642-15328-0_17">10.1007/978-3-642-15328-0_17</a>.
  short: 'J. Blömer, in: Algorithms Unplugged, Springer Berlin Heidelberg, Berlin,
    Heidelberg, 2011, pp. 159–168.'
date_created: 2018-06-05T07:48:25Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-642-15328-0_17
page: 159-168
place: Berlin, Heidelberg
publication: Algorithms Unplugged
publication_identifier:
  isbn:
  - '9783642153273'
  - '9783642153280'
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: How to Share a Secret
type: book_chapter
user_id: '25078'
year: '2011'
...
---
_id: '659'
author:
- first_name: Gennadij
  full_name: Liske, Gennadij
  last_name: Liske
citation:
  ama: Liske G. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität Paderborn;
    2011.
  apa: Liske, G. (2011). <i>Fault attacks in pairing-based cryptography</i>. Universität
    Paderborn.
  bibtex: '@book{Liske_2011, title={Fault attacks in pairing-based cryptography},
    publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2011} }'
  chicago: Liske, Gennadij. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität
    Paderborn, 2011.
  ieee: G. Liske, <i>Fault attacks in pairing-based cryptography</i>. Universität
    Paderborn, 2011.
  mla: Liske, Gennadij. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität
    Paderborn, 2011.
  short: G. Liske, Fault Attacks in Pairing-Based Cryptography, Universität Paderborn,
    2011.
date_created: 2017-10-17T12:43:00Z
date_updated: 2022-01-06T07:03:13Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-14T13:47:44Z
  date_updated: 2018-03-14T13:47:44Z
  file_id: '1218'
  file_name: 659-MA_Fault_attacks_in_pairing-based_cryptography_01.pdf
  file_size: 1795920
  relation: main_file
  success: 1
file_date_updated: 2018-03-14T13:47:44Z
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
- _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: Fault attacks in pairing-based cryptography
type: mastersthesis
user_id: '25078'
year: '2011'
...
---
_id: '2910'
author:
- first_name: Stefanie
  full_name: ' Naewe, Stefanie'
  id: '1971'
  last_name: ' Naewe'
citation:
  ama: Naewe S. <i>Algorithms for Lattice Problems with Respect to General Norms</i>.
    Universität Paderborn; 2011.
  apa: Naewe, S. (2011). <i>Algorithms for lattice problems with respect to general
    norms</i>. Universität Paderborn.
  bibtex: '@book{ Naewe_2011, title={Algorithms for lattice problems with respect
    to general norms}, publisher={Universität Paderborn}, author={ Naewe, Stefanie},
    year={2011} }'
  chicago: Naewe, Stefanie. <i>Algorithms for Lattice Problems with Respect to General
    Norms</i>. Universität Paderborn, 2011.
  ieee: S.  Naewe, <i>Algorithms for lattice problems with respect to general norms</i>.
    Universität Paderborn, 2011.
  mla: Naewe, Stefanie. <i>Algorithms for Lattice Problems with Respect to General
    Norms</i>. Universität Paderborn, 2011.
  short: S.  Naewe, Algorithms for Lattice Problems with Respect to General Norms,
    Universität Paderborn, 2011.
date_created: 2018-05-25T10:08:44Z
date_updated: 2024-08-08T12:17:02Z
department:
- _id: '64'
language:
- iso: eng
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-8047
publication_status: published
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Algorithms for lattice problems with respect to general norms
type: dissertation
user_id: '49063'
year: '2011'
...