---
_id: '18027'
author:
- first_name: Ngoc Chi
  full_name: Banh, Ngoc Chi
  last_name: Banh
citation:
  ama: Banh NC. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn; 2017.
  apa: Banh, N. C. (2017). <i>An Asynchronous Adaption of a Churn-resistant Overlay
    Network</i>. Universität Paderborn.
  bibtex: '@book{Banh_2017, title={An Asynchronous Adaption of a Churn-resistant Overlay
    Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017}
    }'
  chicago: Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  ieee: N. C. Banh, <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  mla: Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  short: N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network,
    Universität Paderborn, 2017.
date_created: 2020-08-18T08:40:19Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
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
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: An Asynchronous Adaption of a Churn-resistant Overlay Network
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '60'
author:
- first_name: David
  full_name: Niehus, David
  last_name: Niehus
citation:
  ama: Niehus D. <i>Semantically Secure Attribute-Based Searchable Encryption</i>.
    Universität Paderborn; 2017.
  apa: Niehus, D. (2017). <i>Semantically Secure Attribute-based Searchable Encryption</i>.
    Universität Paderborn.
  bibtex: '@book{Niehus_2017, title={Semantically Secure Attribute-based Searchable
    Encryption}, publisher={Universität Paderborn}, author={Niehus, David}, year={2017}
    }'
  chicago: Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>.
    Universität Paderborn, 2017.
  ieee: D. Niehus, <i>Semantically Secure Attribute-based Searchable Encryption</i>.
    Universität Paderborn, 2017.
  mla: Niehus, David. <i>Semantically Secure Attribute-Based Searchable Encryption</i>.
    Universität Paderborn, 2017.
  short: D. Niehus, Semantically Secure Attribute-Based Searchable Encryption, Universität
    Paderborn, 2017.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:02:49Z
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: Semantically Secure Attribute-based Searchable Encryption
type: mastersthesis
user_id: '477'
year: '2017'
...
---
_id: '62'
author:
- first_name: Eduard
  full_name: Weis, Eduard
  last_name: Weis
citation:
  ama: Weis E. <i>Searchable Encryption</i>. Universität Paderborn; 2017.
  apa: Weis, E. (2017). <i>Searchable Encryption</i>. Universität Paderborn.
  bibtex: '@book{Weis_2017, title={Searchable Encryption}, publisher={Universität
    Paderborn}, author={Weis, Eduard}, year={2017} }'
  chicago: Weis, Eduard. <i>Searchable Encryption</i>. Universität Paderborn, 2017.
  ieee: E. Weis, <i>Searchable Encryption</i>. Universität Paderborn, 2017.
  mla: Weis, Eduard. <i>Searchable Encryption</i>. Universität Paderborn, 2017.
  short: E. Weis, Searchable Encryption, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:03Z
date_updated: 2022-01-06T07:02:56Z
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: Searchable Encryption
type: mastersthesis
user_id: '15504'
year: '2017'
...
---
_id: '698'
author:
- first_name: Ngoc Chi
  full_name: Banh, Ngoc Chi
  last_name: Banh
citation:
  ama: Banh NC. <i>As Asynchronous Adaption of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn; 2017.
  apa: Banh, N. C. (2017). <i>As Asynchronous Adaption of a Churn-resistant Overlay
    Network</i>. Universität Paderborn.
  bibtex: '@book{Banh_2017, title={As Asynchronous Adaption of a Churn-resistant Overlay
    Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017}
    }'
  chicago: Banh, Ngoc Chi. <i>As Asynchronous Adaption of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  ieee: N. C. Banh, <i>As Asynchronous Adaption of a Churn-resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  mla: Banh, Ngoc Chi. <i>As Asynchronous Adaption of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  short: N.C. Banh, As Asynchronous Adaption of a Churn-Resistant Overlay Network,
    Universität Paderborn, 2017.
date_created: 2017-11-14T08:02:46Z
date_updated: 2022-01-06T07:03:25Z
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: As Asynchronous Adaption of a Churn-resistant Overlay Network
type: bachelorsthesis
user_id: '15504'
year: '2017'
...
---
_id: '88'
author:
- first_name: Advait
  full_name: Ganesh Athreya, Advait
  last_name: Ganesh Athreya
citation:
  ama: Ganesh Athreya A. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>.
    Universität Paderborn; 2017.
  apa: Ganesh Athreya, A. (2017). <i>Instantiating a Predicate Encryption Scheme via
    Pair Encodings</i>. Universität Paderborn.
  bibtex: '@book{Ganesh Athreya_2017, title={Instantiating a Predicate Encryption
    Scheme via Pair Encodings}, publisher={Universität Paderborn}, author={Ganesh
    Athreya, Advait}, year={2017} }'
  chicago: Ganesh Athreya, Advait. <i>Instantiating a Predicate Encryption Scheme
    via Pair Encodings</i>. Universität Paderborn, 2017.
  ieee: A. Ganesh Athreya, <i>Instantiating a Predicate Encryption Scheme via Pair
    Encodings</i>. Universität Paderborn, 2017.
  mla: Ganesh Athreya, Advait. <i>Instantiating a Predicate Encryption Scheme via
    Pair Encodings</i>. Universität Paderborn, 2017.
  short: A. Ganesh Athreya, Instantiating a Predicate Encryption Scheme via Pair Encodings,
    Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:08Z
date_updated: 2022-01-06T07:04:02Z
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: Instantiating a Predicate Encryption Scheme via Pair Encodings
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '67'
author:
- first_name: Mirko
  full_name: Jürgens, Mirko
  last_name: Jürgens
citation:
  ama: Jürgens M. <i>Provably Secure Key-Derivation-Functions for Certain Types of
    Applications</i>. Universität Paderborn; 2017.
  apa: Jürgens, M. (2017). <i>Provably Secure Key-Derivation-Functions for Certain
    Types of Applications</i>. Universität Paderborn.
  bibtex: '@book{Jürgens_2017, title={Provably Secure Key-Derivation-Functions for
    Certain Types of Applications}, publisher={Universität Paderborn}, author={Jürgens,
    Mirko}, year={2017} }'
  chicago: Jürgens, Mirko. <i>Provably Secure Key-Derivation-Functions for Certain
    Types of Applications</i>. Universität Paderborn, 2017.
  ieee: M. Jürgens, <i>Provably Secure Key-Derivation-Functions for Certain Types
    of Applications</i>. Universität Paderborn, 2017.
  mla: Jürgens, Mirko. <i>Provably Secure Key-Derivation-Functions for Certain Types
    of Applications</i>. Universität Paderborn, 2017.
  short: M. Jürgens, Provably Secure Key-Derivation-Functions for Certain Types of
    Applications, Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:04Z
date_updated: 2022-01-06T07:03:15Z
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: Provably Secure Key-Derivation-Functions for Certain Types of Applications
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '104'
author:
- first_name: Denis
  full_name: Diemert, Denis
  last_name: Diemert
citation:
  ama: Diemert D. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>.
    Universität Paderborn; 2017.
  apa: Diemert, D. (2017). <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>.
    Universität Paderborn.
  bibtex: '@book{Diemert_2017, title={EAX - An Authenticated Encryption Mode for Block
    Ciphers}, publisher={Universität Paderborn}, author={Diemert, Denis}, year={2017}
    }'
  chicago: Diemert, Denis. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>.
    Universität Paderborn, 2017.
  ieee: D. Diemert, <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>.
    Universität Paderborn, 2017.
  mla: Diemert, Denis. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>.
    Universität Paderborn, 2017.
  short: D. Diemert, EAX - An Authenticated Encryption Mode for Block Ciphers, Universität
    Paderborn, 2017.
date_created: 2017-10-17T12:41:11Z
date_updated: 2022-01-06T06:50:38Z
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: EAX - An Authenticated Encryption Mode for Block Ciphers
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '1049'
author:
- first_name: Björn
  full_name: Beckendorfer, Björn
  last_name: Beckendorfer
citation:
  ama: Beckendorfer B. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn; 2017.
  apa: Beckendorfer, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn.
  bibtex: '@book{Beckendorfer_2017, title={Visualisierung zu Algorithmen verteilter
    Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorfer, Björn},
    year={2017} }'
  chicago: Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  ieee: B. Beckendorfer, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  mla: Beckendorfer, Björn. <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>.
    Universität Paderborn, 2017.
  short: B. Beckendorfer, Visualisierung zu Algorithmen verteilter Netzwerksysteme,
    Universität Paderborn, 2017.
date_created: 2017-12-13T10:17:43Z
date_updated: 2022-01-06T06:50:42Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
title: Visualisierung zu Algorithmen verteilter Netzwerksysteme
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '117'
author:
- first_name: Pascal
  full_name: Bemmann, Pascal
  id: '32571'
  last_name: Bemmann
citation:
  ama: Bemmann P. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>.
    Universität Paderborn; 2017.
  apa: Bemmann, P. (2017). <i>Attribute-based Signatures using Structure Preserving
    Signatures</i>. Universität Paderborn.
  bibtex: '@book{Bemmann_2017, title={Attribute-based Signatures using Structure Preserving
    Signatures}, publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2017}
    }'
  chicago: Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving
    Signatures</i>. Universität Paderborn, 2017.
  ieee: P. Bemmann, <i>Attribute-based Signatures using Structure Preserving Signatures</i>.
    Universität Paderborn, 2017.
  mla: Bemmann, Pascal. <i>Attribute-Based Signatures Using Structure Preserving Signatures</i>.
    Universität Paderborn, 2017.
  short: P. Bemmann, Attribute-Based Signatures Using Structure Preserving Signatures,
    Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:06Z
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: Attribute-based Signatures using Structure Preserving Signatures
type: mastersthesis
user_id: '25078'
year: '2017'
...
---
_id: '118'
author:
- first_name: Ngoc
  full_name: Chi Banh, Ngoc
  last_name: Chi Banh
citation:
  ama: Chi Banh N. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay Network</i>.
    Universität Paderborn; 2017.
  apa: Chi Banh, N. (2017). <i>An Asynchronous Adaptation of a Churn-resistant Overlay
    Network</i>. Universität Paderborn.
  bibtex: '@book{Chi Banh_2017, title={An Asynchronous Adaptation of a Churn-resistant
    Overlay Network}, publisher={Universität Paderborn}, author={Chi Banh, Ngoc},
    year={2017} }'
  chicago: Chi Banh, Ngoc. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  ieee: N. Chi Banh, <i>An Asynchronous Adaptation of a Churn-resistant Overlay Network</i>.
    Universität Paderborn, 2017.
  mla: Chi Banh, Ngoc. <i>An Asynchronous Adaptation of a Churn-Resistant Overlay
    Network</i>. Universität Paderborn, 2017.
  short: N. Chi Banh, An Asynchronous Adaptation of a Churn-Resistant Overlay Network,
    Universität Paderborn, 2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:08Z
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: An Asynchronous Adaptation of a Churn-resistant Overlay Network
type: bachelorsthesis
user_id: '477'
year: '2017'
...
---
_id: '213'
author:
- first_name: Laurens
  full_name: Porzenheim, Laurens
  last_name: Porzenheim
citation:
  ama: Porzenheim L. <i>Comparison of Different Definitions of Chosen-Ciphertext Security
    in Encryption Schemes</i>. Universität Paderborn; 2016.
  apa: Porzenheim, L. (2016). <i>Comparison of different Definitions of Chosen-Ciphertext
    Security in Encryption schemes</i>. Universität Paderborn.
  bibtex: '@book{Porzenheim_2016, title={Comparison of different Definitions of Chosen-Ciphertext
    Security in Encryption schemes}, publisher={Universität Paderborn}, author={Porzenheim,
    Laurens}, year={2016} }'
  chicago: Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext
    Security in Encryption Schemes</i>. Universität Paderborn, 2016.
  ieee: L. Porzenheim, <i>Comparison of different Definitions of Chosen-Ciphertext
    Security in Encryption schemes</i>. Universität Paderborn, 2016.
  mla: Porzenheim, Laurens. <i>Comparison of Different Definitions of Chosen-Ciphertext
    Security in Encryption Schemes</i>. Universität Paderborn, 2016.
  short: L. Porzenheim, Comparison of Different Definitions of Chosen-Ciphertext Security
    in Encryption Schemes, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:53Z
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: Comparison of different Definitions of Chosen-Ciphertext Security in Encryption
  schemes
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '214'
author:
- first_name: Kai Sören
  full_name: Bemmann, Kai Sören
  last_name: Bemmann
citation:
  ama: Bemmann KS. <i>Commitment Schemes - Definitions, Variants, and Security</i>.
    Universität Paderborn; 2016.
  apa: Bemmann, K. S. (2016). <i>Commitment Schemes - Definitions, Variants, and Security</i>.
    Universität Paderborn.
  bibtex: '@book{Bemmann_2016, title={Commitment Schemes - Definitions, Variants,
    and Security}, publisher={Universität Paderborn}, author={Bemmann, Kai Sören},
    year={2016} }'
  chicago: Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and
    Security</i>. Universität Paderborn, 2016.
  ieee: K. S. Bemmann, <i>Commitment Schemes - Definitions, Variants, and Security</i>.
    Universität Paderborn, 2016.
  mla: Bemmann, Kai Sören. <i>Commitment Schemes - Definitions, Variants, and Security</i>.
    Universität Paderborn, 2016.
  short: K.S. Bemmann, Commitment Schemes - Definitions, Variants, and Security, Universität
    Paderborn, 2016.
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:54:58Z
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: Commitment Schemes - Definitions, Variants, and Security
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '215'
abstract:
- lang: eng
  text: 'We present three robust overlay networks: First, we present a network that
    organizes the nodes into an expander and is resistant to even massive adversarial
    churn. Second, we develop a network based on the hypercube that maintains connectivity
    under adversarial DoS-attacks. For the DoS-attacks we use the notion of a Omega(log
    log n)-late adversary which only has access to topological information that is
    at least Omega(log log n) rounds old. Finally, we develop a network that combines
    both churn- and DoS-resistance. The networks gain their robustness through constant
    network reconfiguration, i.e., the topology of the networks changes constantly.
    Our reconguration algorithms are based on node sampling primitives for expanders
    and hypercubes that allow each node to sample a logarithmic number of nodes uniformly
    at random in O(log log n) communication rounds. These primitives are specific
    to overlay networks and their optimal runtime represents an exponential improvement
    over known techniques. Our results have a wide range of applications, for example
    in the area of scalable and robust peer-to-peer systems.'
author:
- first_name: Maximilian
  full_name: Drees, Maximilian
  last_name: Drees
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Drees M, Gmyr R, Scheideler C. Churn- and DoS-resistant Overlay Networks Based
    on Network Reconfiguration. In: <i>Proceedings of the 28th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>. ; 2016:417--427. doi:<a href="https://doi.org/10.1145/2935764.2935783">10.1145/2935764.2935783</a>'
  apa: Drees, M., Gmyr, R., &#38; Scheideler, C. (2016). Churn- and DoS-resistant
    Overlay Networks Based on Network Reconfiguration. In <i>Proceedings of the 28th
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 417--427).
    <a href="https://doi.org/10.1145/2935764.2935783">https://doi.org/10.1145/2935764.2935783</a>
  bibtex: '@inproceedings{Drees_Gmyr_Scheideler_2016, title={Churn- and DoS-resistant
    Overlay Networks Based on Network Reconfiguration}, DOI={<a href="https://doi.org/10.1145/2935764.2935783">10.1145/2935764.2935783</a>},
    booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, author={Drees, Maximilian and Gmyr, Robert and Scheideler,
    Christian}, year={2016}, pages={417--427} }'
  chicago: Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant
    Overlay Networks Based on Network Reconfiguration.” In <i>Proceedings of the 28th
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 417--427,
    2016. <a href="https://doi.org/10.1145/2935764.2935783">https://doi.org/10.1145/2935764.2935783</a>.
  ieee: M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks
    Based on Network Reconfiguration,” in <i>Proceedings of the 28th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427.
  mla: Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based
    on Network Reconfiguration.” <i>Proceedings of the 28th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, 2016, pp. 417--427, doi:<a href="https://doi.org/10.1145/2935764.2935783">10.1145/2935764.2935783</a>.
  short: 'M. Drees, R. Gmyr, C. Scheideler, in: Proceedings of the 28th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.'
date_created: 2017-10-17T12:41:33Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2935764.2935783
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:41:40Z
  date_updated: 2018-03-21T10:41:40Z
  file_id: '1518'
  file_name: 215-SPAA16-Drees_Gmyr_Scheideler.pdf
  file_size: 352996
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:41:40Z
has_accepted_license: '1'
language:
- iso: eng
page: 417--427
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 28th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
status: public
title: Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration
type: conference
user_id: '14955'
year: '2016'
...
---
_id: '208'
abstract:
- lang: eng
  text: This paper presents a new framework for constructing fully CCA-secure predicate
    encryption schemes from pair encoding schemes. Our construction is the first in
    the context of predicate encryption which uses the technique of well-formedness
    proofs known from public key encryption. The resulting constructions are simpler
    and more efficient compared to the schemes achieved using known generic transformations
    from CPA-secure to CCA-secure schemes. The reduction costs of our framework are
    comparable to the reduction costs of the underlying CPA-secure framework. We achieve
    this last result by applying the dual system encryption methodology in a novel
    way.
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. Construction of Fully CCA-Secure Predicate Encryptions
    from Pair Encoding Schemes. In: <i>Proceedings of the CT-RSA 2016</i>. LNCS. ;
    2016:431-447. doi:<a href="https://doi.org/10.1007/978-3-319-29485-8_25">10.1007/978-3-319-29485-8_25</a>'
  apa: Blömer, J., &#38; Liske, G. (2016). Construction of Fully CCA-Secure Predicate
    Encryptions from Pair Encoding Schemes. In <i>Proceedings of the CT-RSA 2016</i>
    (pp. 431–447). <a href="https://doi.org/10.1007/978-3-319-29485-8_25">https://doi.org/10.1007/978-3-319-29485-8_25</a>
  bibtex: '@inproceedings{Blömer_Liske_2016, series={LNCS}, title={Construction of
    Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes}, DOI={<a href="https://doi.org/10.1007/978-3-319-29485-8_25">10.1007/978-3-319-29485-8_25</a>},
    booktitle={Proceedings of the CT-RSA 2016}, author={Blömer, Johannes and Liske,
    Gennadij}, year={2016}, pages={431–447}, collection={LNCS} }'
  chicago: Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure
    Predicate Encryptions from Pair Encoding Schemes.” In <i>Proceedings of the CT-RSA
    2016</i>, 431–47. LNCS, 2016. <a href="https://doi.org/10.1007/978-3-319-29485-8_25">https://doi.org/10.1007/978-3-319-29485-8_25</a>.
  ieee: J. Blömer and G. Liske, “Construction of Fully CCA-Secure Predicate Encryptions
    from Pair Encoding Schemes,” in <i>Proceedings of the CT-RSA 2016</i>, 2016, pp.
    431–447.
  mla: Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate
    Encryptions from Pair Encoding Schemes.” <i>Proceedings of the CT-RSA 2016</i>,
    2016, pp. 431–47, doi:<a href="https://doi.org/10.1007/978-3-319-29485-8_25">10.1007/978-3-319-29485-8_25</a>.
  short: 'J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.'
date_created: 2017-10-17T12:41:32Z
date_updated: 2022-01-06T06:54:39Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1007/978-3-319-29485-8_25
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:43:36Z
  date_updated: 2018-03-21T10:43:36Z
  file_id: '1521'
  file_name: 208-aCCA_P-KEM_final.pdf
  file_size: 462666
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:43:36Z
has_accepted_license: '1'
page: 431-447
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 CT-RSA 2016
series_title: LNCS
status: public
title: Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
type: conference
user_id: '477'
year: '2016'
...
---
_id: '223'
abstract:
- lang: eng
  text: We consider the problem of aggregation in overlay networks. We use a synchronous
    time model in which each node has polylogarithmic memory and can send at most
    a polylogarithmic number of messages per round. We investigate how to quickly
    compute the result of an aggregate functionf over elements that are distributed
    among the nodes of the network such that the result is eventually known by a selected
    root node. We show how to compute distributive aggregate functions such as SUM,
    MAX, and OR in time $O(\log n / \log\log n)$ using a tree that is created in a
    pre-processing phase. If only a polylogarithmic number of data items need to be
    aggregated, we show how to compute the result in time $O(\sqrt{\log n / \log\log
    n})$. Furthermore, we show how to compute holistic aggregate functions such as
    DISTINCT, SMALLEST(k) and MODE(k) in time $O(\log n / \log\log n)$. Finally, we
    show a lower bound of $\Omega(\sqrt{\log n / \log\log n})$ for deterministic algorithms
    that compute any of the aggregate functions in the scope of the thesis.
author:
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
citation:
  ama: Hinnenthal K. <i>Aggregation in Overlay Networks</i>. Universität Paderborn;
    2016.
  apa: Hinnenthal, K. (2016). <i>Aggregation in Overlay Networks</i>. Universität
    Paderborn.
  bibtex: '@book{Hinnenthal_2016, title={Aggregation in Overlay Networks}, publisher={Universität
    Paderborn}, author={Hinnenthal, Kristian}, year={2016} }'
  chicago: Hinnenthal, Kristian. <i>Aggregation in Overlay Networks</i>. Universität
    Paderborn, 2016.
  ieee: K. Hinnenthal, <i>Aggregation in Overlay Networks</i>. Universität Paderborn,
    2016.
  mla: Hinnenthal, Kristian. <i>Aggregation in Overlay Networks</i>. Universität Paderborn,
    2016.
  short: K. Hinnenthal, Aggregation in Overlay Networks, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:35Z
date_updated: 2022-01-06T06:55:30Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:35:39Z
  date_updated: 2018-03-21T10:35:39Z
  file_id: '1510'
  file_name: 223-MasterarbeitHinnenthal.pdf
  file_size: 1127144
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:35:39Z
has_accepted_license: '1'
language:
- iso: eng
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: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Aggregation in Overlay Networks
type: mastersthesis
user_id: '15504'
year: '2016'
...
---
_id: '167'
author:
- first_name: Peter
  full_name: Günther, Peter
  last_name: Günther
citation:
  ama: Günther P. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität
    Paderborn; 2016.
  apa: Günther, P. (2016). <i>Physical attacks on pairing-based cryptography</i>.
    Universität Paderborn.
  bibtex: '@book{Günther_2016, title={Physical attacks on pairing-based cryptography},
    publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }'
  chicago: Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>.
    Universität Paderborn, 2016.
  ieee: P. Günther, <i>Physical attacks on pairing-based cryptography</i>. Universität
    Paderborn, 2016.
  mla: Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität
    Paderborn, 2016.
  short: P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn,
    2016.
date_created: 2017-10-17T12:41:24Z
date_updated: 2022-01-06T06:52:54Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:43:21Z
  date_updated: 2018-03-21T12:43:21Z
  file_id: '1542'
  file_name: 167-thesis_peter_guenther.pdf
  file_size: 9456552
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:43:21Z
has_accepted_license: '1'
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853
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: Physical attacks on pairing-based cryptography
type: dissertation
user_id: '25078'
year: '2016'
...
---
_id: '155'
abstract:
- lang: eng
  text: We present a self-stabilizing algorithm for overlay networks that, for an
    arbitrary metric given by a distance oracle, constructs the graph representing
    that metric. The graph representing a metric is the unique minimal undirected
    graph such that for any pair of nodes the length of a shortest path between the
    nodes corresponds to the distance between the nodes according to the metric. The
    algorithm works under both an asynchronous and a synchronous daemon. In the synchronous
    case, the algorithm stablizes in time O(n) and it is almost silent in that after
    stabilization a node sends and receives a constant number of messages per round.
author:
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
- first_name: Jonas
  full_name: Lefèvre, Jonas
  last_name: Lefèvre
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Gmyr R, Lefèvre J, Scheideler C. Self-stabilizing Metric Graphs. In: <i>Proceedings
    of the 18th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i>. LNCS. ; 2016:248--262. doi:<a href="https://doi.org/10.1007/978-3-319-49259-9_20">10.1007/978-3-319-49259-9_20</a>'
  apa: Gmyr, R., Lefèvre, J., &#38; Scheideler, C. (2016). Self-stabilizing Metric
    Graphs. In <i>Proceedings of the 18th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i> (pp. 248--262). <a href="https://doi.org/10.1007/978-3-319-49259-9_20">https://doi.org/10.1007/978-3-319-49259-9_20</a>
  bibtex: '@inproceedings{Gmyr_Lefèvre_Scheideler_2016, series={LNCS}, title={Self-stabilizing
    Metric Graphs}, DOI={<a href="https://doi.org/10.1007/978-3-319-49259-9_20">10.1007/978-3-319-49259-9_20</a>},
    booktitle={Proceedings of the 18th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, author={Gmyr, Robert and Lefèvre,
    Jonas and Scheideler, Christian}, year={2016}, pages={248--262}, collection={LNCS}
    }'
  chicago: Gmyr, Robert, Jonas Lefèvre, and Christian Scheideler. “Self-Stabilizing
    Metric Graphs.” In <i>Proceedings of the 18th International Symposium on Stabilization,
    Safety, and Security of Distributed Systems (SSS)</i>, 248--262. LNCS, 2016. <a
    href="https://doi.org/10.1007/978-3-319-49259-9_20">https://doi.org/10.1007/978-3-319-49259-9_20</a>.
  ieee: R. Gmyr, J. Lefèvre, and C. Scheideler, “Self-stabilizing Metric Graphs,”
    in <i>Proceedings of the 18th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, 2016, pp. 248--262.
  mla: Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.” <i>Proceedings of the
    18th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)</i>, 2016, pp. 248--262, doi:<a href="https://doi.org/10.1007/978-3-319-49259-9_20">10.1007/978-3-319-49259-9_20</a>.
  short: 'R. Gmyr, J. Lefèvre, C. Scheideler, in: Proceedings of the 18th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS),
    2016, pp. 248--262.'
date_created: 2017-10-17T12:41:22Z
date_updated: 2022-01-06T06:52:28Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-49259-9_20
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T12:51:24Z
  date_updated: 2018-03-21T12:51:24Z
  file_id: '1550'
  file_name: 155-SSS16-GLS.pdf
  file_size: 389136
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T12:51:24Z
has_accepted_license: '1'
page: 248--262
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 18th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
series_title: LNCS
status: public
title: Self-stabilizing Metric Graphs
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '146'
author:
- first_name: Julian
  full_name: Hamm, Julian
  last_name: Hamm
citation:
  ama: Hamm J. <i>Symmetric Anonymous Credentials with Protocols for Relations on
    Attributes</i>. Universität Paderborn; 2016.
  apa: Hamm, J. (2016). <i>Symmetric Anonymous Credentials with Protocols for Relations
    on Attributes</i>. Universität Paderborn.
  bibtex: '@book{Hamm_2016, title={Symmetric Anonymous Credentials with Protocols
    for Relations on Attributes}, publisher={Universität Paderborn}, author={Hamm,
    Julian}, year={2016} }'
  chicago: Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations
    on Attributes</i>. Universität Paderborn, 2016.
  ieee: J. Hamm, <i>Symmetric Anonymous Credentials with Protocols for Relations on
    Attributes</i>. Universität Paderborn, 2016.
  mla: Hamm, Julian. <i>Symmetric Anonymous Credentials with Protocols for Relations
    on Attributes</i>. Universität Paderborn, 2016.
  short: J. Hamm, Symmetric Anonymous Credentials with Protocols for Relations on
    Attributes, Universität Paderborn, 2016.
date_created: 2017-10-17T12:41:20Z
date_updated: 2022-01-06T06:52:03Z
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: Symmetric Anonymous Credentials with Protocols for Relations on Attributes
type: mastersthesis
user_id: '477'
year: '2016'
...
---
_id: '152'
author:
- first_name: Fynn
  full_name: Dallmeier, Fynn
  last_name: Dallmeier
citation:
  ama: 'Dallmeier F. <i>Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis</i>. Universität Paderborn; 2016.'
  apa: 'Dallmeier, F. (2016). <i>Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis</i>. Universität Paderborn.'
  bibtex: '@book{Dallmeier_2016, title={Short Randomizable Aggregatable Signatures:
    Constructions and Security Analysis}, publisher={Universität Paderborn}, author={Dallmeier,
    Fynn}, year={2016} }'
  chicago: 'Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis</i>. Universität Paderborn, 2016.'
  ieee: 'F. Dallmeier, <i>Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis</i>. Universität Paderborn, 2016.'
  mla: 'Dallmeier, Fynn. <i>Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis</i>. Universität Paderborn, 2016.'
  short: 'F. Dallmeier, Short Randomizable Aggregatable Signatures: Constructions
    and Security Analysis, Universität Paderborn, 2016.'
date_created: 2017-10-17T12:41:21Z
date_updated: 2022-01-06T06:52:16Z
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: 'Short Randomizable Aggregatable Signatures: Constructions and Security Analysis'
type: bachelorsthesis
user_id: '477'
year: '2016'
...
---
_id: '10136'
author:
- first_name: Martina
  full_name: Eikel, Martina
  last_name: Eikel
citation:
  ama: Eikel M. <i>Insider-Resistent Distributed Storage Systems</i>. Universität
    Paderborn; 2016.
  apa: Eikel, M. (2016). <i>Insider-resistent Distributed Storage Systems</i>. Universität
    Paderborn.
  bibtex: '@book{Eikel_2016, title={Insider-resistent Distributed Storage Systems},
    publisher={Universität Paderborn}, author={Eikel, Martina}, year={2016} }'
  chicago: Eikel, Martina. <i>Insider-Resistent Distributed Storage Systems</i>. Universität
    Paderborn, 2016.
  ieee: M. Eikel, <i>Insider-resistent Distributed Storage Systems</i>. Universität
    Paderborn, 2016.
  mla: Eikel, Martina. <i>Insider-Resistent Distributed Storage Systems</i>. Universität
    Paderborn, 2016.
  short: M. Eikel, Insider-Resistent Distributed Storage Systems, Universität Paderborn,
    2016.
date_created: 2019-06-07T06:37:37Z
date_updated: 2022-01-06T06:50:30Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2019-06-07T06:39:13Z
  date_updated: 2019-06-07T06:39:13Z
  file_id: '10137'
  file_name: DissertationEikel.pdf
  file_size: 1605187
  relation: main_file
  success: 1
file_date_updated: 2019-06-07T06:39:13Z
has_accepted_license: '1'
language:
- iso: eng
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
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Insider-resistent Distributed Storage Systems
type: dissertation
user_id: '477'
year: '2016'
...