---
_id: '13128'
author:
- first_name: Henrik
  full_name: Bröcher, Henrik
  id: '41047'
  last_name: Bröcher
citation:
  ama: Bröcher H. <i>Rational Secure Multiparty Computation</i>. Universität Paderborn;
    2019.
  apa: Bröcher, H. (2019). <i>Rational Secure Multiparty Computation</i>. Universität
    Paderborn.
  bibtex: '@book{Bröcher_2019, title={Rational Secure Multiparty Computation}, publisher={Universität
    Paderborn}, author={Bröcher, Henrik}, year={2019} }'
  chicago: Bröcher, Henrik. <i>Rational Secure Multiparty Computation</i>. Universität
    Paderborn, 2019.
  ieee: H. Bröcher, <i>Rational Secure Multiparty Computation</i>. Universität Paderborn,
    2019.
  mla: Bröcher, Henrik. <i>Rational Secure Multiparty Computation</i>. Universität
    Paderborn, 2019.
  short: H. Bröcher, Rational Secure Multiparty Computation, Universität Paderborn,
    2019.
date_created: 2019-09-04T08:04:12Z
date_updated: 2022-01-06T06:51:28Z
ddc:
- '000'
department:
- _id: '64'
extern: '1'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2019-09-04T07:59:31Z
  date_updated: 2020-10-30T15:59:34Z
  file_id: '13129'
  file_name: thesis_broecher.pdf
  file_size: 746819
  relation: main_file
file_date_updated: 2020-10-30T15:59:34Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '1'
  name: SFB 901
- _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: Rational Secure Multiparty Computation
type: mastersthesis
user_id: '25078'
year: '2019'
...
---
_id: '10271'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves</i>. Universität Paderborn; 2019.
  apa: N., N. (2019). <i>Implementation and Evaluation of Authenticated Data Structures
    Using Intel SGX Enclaves</i>. Universität Paderborn.
  bibtex: '@book{N._2019, title={Implementation and Evaluation of Authenticated Data
    Structures Using Intel SGX Enclaves}, publisher={Universität Paderborn}, author={N.,
    N.}, year={2019} }'
  chicago: N., N. <i>Implementation and Evaluation of Authenticated Data Structures
    Using Intel SGX Enclaves</i>. Universität Paderborn, 2019.
  ieee: N. N., <i>Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves</i>. Universität Paderborn, 2019.
  mla: N., N. <i>Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves</i>. Universität Paderborn, 2019.
  short: N. N., Implementation and Evaluation of Authenticated Data Structures Using
    Intel SGX Enclaves, Universität Paderborn, 2019.
date_created: 2019-06-19T11:31:38Z
date_updated: 2022-01-06T06:50:33Z
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: Implementation and Evaluation of Authenticated Data Structures Using Intel
  SGX Enclaves
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '13592'
author:
- first_name: Matthias
  full_name: Pilot, Matthias
  last_name: Pilot
citation:
  ama: Pilot M. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
    in Java</i>. Universität Paderborn; 2019.
  apa: Pilot, M. (2019). <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
    in Java</i>. Universität Paderborn.
  bibtex: '@book{Pilot_2019, title={Efficient Finite-Field Arithmetic for Elliptic
    Curve Cryptography in Java}, publisher={Universität Paderborn}, author={Pilot,
    Matthias}, year={2019} }'
  chicago: Pilot, Matthias. <i>Efficient Finite-Field Arithmetic for Elliptic Curve
    Cryptography in Java</i>. Universität Paderborn, 2019.
  ieee: M. Pilot, <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
    in Java</i>. Universität Paderborn, 2019.
  mla: Pilot, Matthias. <i>Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
    in Java</i>. Universität Paderborn, 2019.
  short: M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
    in Java, Universität Paderborn, 2019.
date_created: 2019-10-03T12:30:24Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '7'
- _id: '64'
extern: '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: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '13648'
author:
- first_name: Swante
  full_name: Scholz, Swante
  last_name: Scholz
citation:
  ama: Scholz S. <i>Implementation and Comparison of Elliptic Curve Algorithms in
    Java</i>. Universität Paderborn; 2019.
  apa: Scholz, S. (2019). <i>Implementation and Comparison of Elliptic Curve Algorithms
    in Java</i>. Universität Paderborn.
  bibtex: '@book{Scholz_2019, title={Implementation and Comparison of Elliptic Curve
    Algorithms in Java}, publisher={Universität Paderborn}, author={Scholz, Swante},
    year={2019} }'
  chicago: Scholz, Swante. <i>Implementation and Comparison of Elliptic Curve Algorithms
    in Java</i>. Universität Paderborn, 2019.
  ieee: S. Scholz, <i>Implementation and Comparison of Elliptic Curve Algorithms in
    Java</i>. Universität Paderborn, 2019.
  mla: Scholz, Swante. <i>Implementation and Comparison of Elliptic Curve Algorithms
    in Java</i>. Universität Paderborn, 2019.
  short: S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in
    Java, Universität Paderborn, 2019.
date_created: 2019-10-07T09:56:58Z
date_updated: 2022-01-06T06:51:41Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
extern: '1'
file:
- access_level: open_access
  content_type: application/pdf
  creator: jbobolz
  date_created: 2020-04-27T10:32:00Z
  date_updated: 2020-04-27T10:33:59Z
  file_id: '16871'
  file_name: sscholz-MA-thesis-final.pdf
  file_size: 1714805
  relation: main_file
file_date_updated: 2020-04-27T10:33:59Z
has_accepted_license: '1'
language:
- iso: eng
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
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Implementation and Comparison of Elliptic Curve Algorithms in Java
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '13904'
abstract:
- lang: eng
  text: In this paper, we introduce updatable anonymous credential systems (UACS)
    and use them to construct a new privacy-preserving incentive system. In a UACS,
    a user holding a credential certifying some attributes can interact with the corresponding
    issuer to update his attributes. During this, the issuer knows which update function
    is run, but does not learn the user's previous attributes. Hence the update process
    preserves anonymity of the user. One example for a class of update functions are
    additive updates of integer attributes, where the issuer increments an unknown
    integer attribute value v by some known value k. This kind of update is motivated
    by an application of UACS to incentive systems. Users in an incentive system can
    anonymously accumulate points, e.g. in a shop at checkout, and spend them later,
    e.g. for a discount.
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
- first_name: Denis Pascal
  full_name: Diemert, Denis Pascal
  id: '44071'
  last_name: Diemert
- first_name: Fabian
  full_name: Eidens, Fabian
  id: '25078'
  last_name: Eidens
citation:
  ama: 'Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials
    and Applications to Incentive Systems. In: <i>Proceedings of the 2019 ACM SIGSAC
    Conference on Computer and Communications Security - CCS ’19</i>. Proceedings
    of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS
    ’19. ; 2019. doi:<a href="https://doi.org/10.1145/3319535.3354223">10.1145/3319535.3354223</a>'
  apa: Blömer, J., Bobolz, J., Diemert, D. P., &#38; Eidens, F. (2019). Updatable
    Anonymous Credentials and Applications to Incentive Systems. <i>Proceedings of
    the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>.
    26th ACM Conference on Computer and Communications Security, London. <a href="https://doi.org/10.1145/3319535.3354223">https://doi.org/10.1145/3319535.3354223</a>
  bibtex: '@inproceedings{Blömer_Bobolz_Diemert_Eidens_2019, series={Proceedings of
    the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19},
    title={Updatable Anonymous Credentials and Applications to Incentive Systems},
    DOI={<a href="https://doi.org/10.1145/3319535.3354223">10.1145/3319535.3354223</a>},
    booktitle={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
    Security - CCS ’19}, author={Blömer, Johannes and Bobolz, Jan and Diemert, Denis
    Pascal and Eidens, Fabian}, year={2019}, collection={Proceedings of the 2019 ACM
    SIGSAC Conference on Computer and Communications Security - CCS ’19} }'
  chicago: Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens.
    “Updatable Anonymous Credentials and Applications to Incentive Systems.” In <i>Proceedings
    of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS
    ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
    Security - CCS ’19, 2019. <a href="https://doi.org/10.1145/3319535.3354223">https://doi.org/10.1145/3319535.3354223</a>.
  ieee: 'J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous
    Credentials and Applications to Incentive Systems,” presented at the 26th ACM
    Conference on Computer and Communications Security, London, 2019, doi: <a href="https://doi.org/10.1145/3319535.3354223">10.1145/3319535.3354223</a>.'
  mla: Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications
    to Incentive Systems.” <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer
    and Communications Security - CCS ’19</i>, 2019, doi:<a href="https://doi.org/10.1145/3319535.3354223">10.1145/3319535.3354223</a>.
  short: 'J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019
    ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.'
conference:
  end_date: 2019-11-15
  location: London
  name: 26th ACM Conference on Computer and Communications Security
  start_date: 2019-11-11
date_created: 2019-10-18T08:09:44Z
date_updated: 2023-01-10T10:25:27Z
ddc:
- '006'
department:
- _id: '7'
- _id: '64'
doi: 10.1145/3319535.3354223
file:
- access_level: closed
  content_type: application/pdf
  creator: jbobolz
  date_created: 2019-10-18T08:07:49Z
  date_updated: 2019-10-18T08:07:49Z
  file_id: '13907'
  file_name: full_eprinted_v2.pdf
  file_size: 838949
  relation: main_file
file_date_updated: 2019-10-18T08:07:49Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2019/169.pdf
oa: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
  Security - CCS '19
series_title: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
  Security - CCS '19
status: public
title: Updatable Anonymous Credentials and Applications to Incentive Systems
type: conference
user_id: '25078'
year: '2019'
...
---
_id: '2862'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Fabian
  full_name: Eidens, Fabian
  id: '25078'
  last_name: Eidens
- first_name: Jakob
  full_name: Juhnke, Jakob
  id: '48090'
  last_name: Juhnke
citation:
  ama: 'Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable
    Universally-Composable Reputation Systems. In: <i>Topics in Cryptology - {CT-RSA}
    2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>.
    Cham: Springer International Publishing; 2018:470-490. doi:<a href="https://doi.org/10.1007/978-3-319-76953-0_25">10.1007/978-3-319-76953-0_25</a>'
  apa: 'Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Practical, Anonymous, and
    Publicly Linkable Universally-Composable Reputation Systems. In <i>Topics in Cryptology
    - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>
    (pp. 470–490). Cham: Springer International Publishing. <a href="https://doi.org/10.1007/978-3-319-76953-0_25">https://doi.org/10.1007/978-3-319-76953-0_25</a>'
  bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical,
    Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={<a
    href="https://doi.org/10.1007/978-3-319-76953-0_25">10.1007/978-3-319-76953-0_25</a>},
    booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at
    the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing},
    author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490}
    }'
  chicago: 'Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous,
    and Publicly Linkable Universally-Composable Reputation Systems.” In <i>Topics
    in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference
    2018, Proceedings</i>, 470–90. Cham: Springer International Publishing, 2018.
    <a href="https://doi.org/10.1007/978-3-319-76953-0_25">https://doi.org/10.1007/978-3-319-76953-0_25</a>.'
  ieee: J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable
    Universally-Composable Reputation Systems,” in <i>Topics in Cryptology - {CT-RSA}
    2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings</i>,
    San Francisco, CA, USA, 2018, pp. 470–490.
  mla: Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable
    Reputation Systems.” <i>Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’
    Track at the {RSA} Conference 2018, Proceedings</i>, Springer International Publishing,
    2018, pp. 470–90, doi:<a href="https://doi.org/10.1007/978-3-319-76953-0_25">10.1007/978-3-319-76953-0_25</a>.
  short: 'J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018
    - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer
    International Publishing, Cham, 2018, pp. 470–490.'
conference:
  end_date: 2018-04-20
  location: San Francisco, CA, USA
  name: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA}
    Conference 2018
  start_date: 2018-04-16
date_created: 2018-05-24T11:14:02Z
date_updated: 2022-01-06T06:58:12Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-76953-0_25
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T13:45:40Z
  date_updated: 2018-11-02T13:45:40Z
  file_id: '5253'
  file_name: PracticalAnonymousAndPubliclyL.pdf
  file_size: 3371773
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T13:45:40Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2018/029
oa: '1'
page: 470-490
place: Cham
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the
  {RSA} Conference 2018, Proceedings
publication_identifier:
  isbn:
  - '9783319769523'
  - '9783319769530'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation
  Systems
type: conference
user_id: '477'
year: '2018'
...
---
_id: '2685'
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. Voronoi Cells of Lattices with Respect to Arbitrary Norms.
    <i>SIAM Journal on Applied Algebra and Geometry</i>. 2018;2(2):314-338. doi:<a
    href="https://doi.org/10.1137/17M1132045">10.1137/17M1132045</a>
  apa: Blömer, J., &#38; Kohn, K. (2018). Voronoi Cells of Lattices with Respect to
    Arbitrary Norms. <i>SIAM Journal on Applied Algebra and Geometry.</i>, <i>2</i>(2),
    314–338. <a href="https://doi.org/10.1137/17M1132045">https://doi.org/10.1137/17M1132045</a>
  bibtex: '@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect
    to Arbitrary Norms}, volume={2}, DOI={<a href="https://doi.org/10.1137/17M1132045">10.1137/17M1132045</a>},
    number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer,
    Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }'
  chicago: 'Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect
    to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i> 2, no.
    2 (2018): 314–38. <a href="https://doi.org/10.1137/17M1132045">https://doi.org/10.1137/17M1132045</a>.'
  ieee: J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary
    Norms,” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol. 2, no. 2, pp.
    314–338, 2018.
  mla: Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect
    to Arbitrary Norms.” <i>SIAM Journal on Applied Algebra and Geometry.</i>, vol.
    2, no. 2, 2018, pp. 314–38, doi:<a href="https://doi.org/10.1137/17M1132045">10.1137/17M1132045</a>.
  short: J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018)
    314–338.
date_created: 2018-05-08T09:18:54Z
date_updated: 2022-01-06T06:57:29Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
doi: 10.1137/17M1132045
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:22:55Z
  date_updated: 2018-11-02T15:22:55Z
  file_id: '5300'
  file_name: 17m1132045.pdf
  file_size: 1131048
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T15:22:55Z
has_accepted_license: '1'
intvolume: '         2'
issue: '2'
language:
- iso: eng
page: 314-338
project:
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
publication: SIAM Journal on Applied Algebra and Geometry.
publication_identifier:
  eissn:
  - 2470-6566
publication_status: epub_ahead
status: public
title: Voronoi Cells of Lattices with Respect to Arbitrary Norms
type: journal_article
user_id: '477'
volume: 2
year: '2018'
...
---
_id: '3265'
abstract:
- lang: eng
  text: "We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials),
    an anonymous credentials system (ACS) combined with an anonymous reputation system.\r\n\r\nUsing
    CLARC, users can receive attribute-based credentials from issuers. They can efficiently
    prove that their credentials satisfy complex (access) policies in a privacy-preserving
    way. This implements anonymous access control with complex policies.\r\n\r\nFurthermore,
    CLARC is the first ACS that is combined with an anonymous reputation system where
    users can anonymously rate services. A user who gets access to a service via a
    credential, also anonymously receives a review token to rate the service. If a
    user creates more than a single rating, this can be detected by anyone, preventing
    users from spamming ratings to sway public opinion.\r\n\r\nTo evaluate feasibility
    of our construction, we present an open-source prototype implementation."
author:
- first_name: Kai
  full_name: Bemmann, Kai
  last_name: Bemmann
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
- first_name: Henrik
  full_name: Bröcher, Henrik
  id: '41047'
  last_name: Bröcher
- first_name: Denis Pascal
  full_name: Diemert, Denis Pascal
  id: '44071'
  last_name: Diemert
- first_name: Fabian
  full_name: Eidens, Fabian
  id: '25078'
  last_name: Eidens
- first_name: Lukas
  full_name: Eilers, Lukas
  last_name: Eilers
- first_name: Jan Frederik
  full_name: Haltermann, Jan Frederik
  id: '44413'
  last_name: Haltermann
- first_name: Jakob
  full_name: Juhnke, Jakob
  id: '48090'
  last_name: Juhnke
- first_name: Burhan
  full_name: Otour, Burhan
  last_name: Otour
- first_name: Laurens Alexander
  full_name: Porzenheim, Laurens Alexander
  id: '47434'
  last_name: Porzenheim
- first_name: Simon
  full_name: Pukrop, Simon
  last_name: Pukrop
- first_name: Erik
  full_name: Schilling, Erik
  last_name: Schilling
- first_name: Michael
  full_name: Schlichtig, Michael
  id: '32312'
  last_name: Schlichtig
- first_name: Marcel
  full_name: Stienemeier, Marcel
  last_name: Stienemeier
citation:
  ama: 'Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials
    with Reputation System. In: <i>Proceedings of the 13th International Conference
    on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM.
    doi:<a href="https://doi.org/10.1145/3230833.3234517">10.1145/3230833.3234517</a>'
  apa: 'Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens,
    F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation
    System. In <i>Proceedings of the 13th International Conference on Availability,
    Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM. <a href="https://doi.org/10.1145/3230833.3234517">https://doi.org/10.1145/3230833.3234517</a>'
  bibtex: '@inproceedings{Bemmann_Blömer_Bobolz_Bröcher_Diemert_Eidens_Eilers_Haltermann_Juhnke_Otour_et
    al., place={New York, NY, USA}, title={Fully-Featured Anonymous Credentials with
    Reputation System}, DOI={<a href="https://doi.org/10.1145/3230833.3234517">10.1145/3230833.3234517</a>},
    booktitle={Proceedings of the 13th International Conference on Availability, Reliability
    and Security - ARES ’18}, publisher={ACM}, author={Bemmann, Kai and Blömer, Johannes
    and Bobolz, Jan and Bröcher, Henrik and Diemert, Denis Pascal and Eidens, Fabian
    and Eilers, Lukas and Haltermann, Jan Frederik and Juhnke, Jakob and Otour, Burhan
    and et al.} }'
  chicago: 'Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal
    Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials
    with Reputation System.” In <i>Proceedings of the 13th International Conference
    on Availability, Reliability and Security - ARES ’18</i>. New York, NY, USA: ACM,
    n.d. <a href="https://doi.org/10.1145/3230833.3234517">https://doi.org/10.1145/3230833.3234517</a>.'
  ieee: K. Bemmann <i>et al.</i>, “Fully-Featured Anonymous Credentials with Reputation
    System,” in <i>Proceedings of the 13th International Conference on Availability,
    Reliability and Security - ARES ’18</i>, Hamburg, Germany.
  mla: Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation
    System.” <i>Proceedings of the 13th International Conference on Availability,
    Reliability and Security - ARES ’18</i>, ACM, doi:<a href="https://doi.org/10.1145/3230833.3234517">10.1145/3230833.3234517</a>.
  short: 'K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L.
    Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling,
    M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference
    on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA,
    n.d.'
conference:
  end_date: 2018-08-30
  location: Hamburg, Germany
  name: ARES 2018 - SECPID
  start_date: 2018-08-27
date_created: 2018-06-14T11:19:29Z
date_updated: 2022-01-06T06:59:07Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1145/3230833.3234517
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-11-08T10:17:39Z
  date_updated: 2018-11-08T10:17:39Z
  file_id: '5428'
  file_name: react_acs.pdf
  file_size: 920843
  relation: main_file
file_date_updated: 2018-11-08T10:17:39Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2018/835
oa: '1'
place: New York, NY, USA
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '44'
  name: KogniHome - die mitdenkende Wohnung
publication: Proceedings of the 13th International Conference on Availability, Reliability
  and Security - ARES '18
publication_identifier:
  isbn:
  - 978-1-4503-6448-5
publication_status: accepted
publisher: ACM
quality_controlled: '1'
related_material:
  link:
  - relation: software
    url: https://github.com/upbcuk
status: public
title: Fully-Featured Anonymous Credentials with Reputation System
type: conference
user_id: '25078'
year: '2018'
...
---
_id: '3422'
abstract:
- lang: eng
  text: "We study the consensus problem in a synchronous distributed system of n nodes
    under an adaptive adversary that has a slightly outdated view of the system and
    can block all incoming and outgoing communication of a constant fraction of the
    nodes in each round. Motivated by a result of Ben-Or and Bar-Joseph (1998), showing
    that any consensus algorithm that is resilient against a linear number of crash
    faults requires $\\tilde \\Omega(\\sqrt n)$ rounds in an n-node network against
    an adaptive adversary, we consider a late adaptive adversary, who has full knowledge
    of the network state at the beginning of the previous round and unlimited computational
    power, but is oblivious to the current state of the nodes. \r\n\r\nOur main contributions
    are randomized distributed algorithms that achieve consensus with high probability
    among all except a small constant fraction of the nodes (i.e., \"almost-everywhere'')
    against a late adaptive adversary who can block up to ε n$ nodes in each round,
    for a small constant ε >0$. Our first protocol achieves binary almost-everywhere
    consensus and also guarantees a decision on the majority input value, thus ensuring
    plurality consensus. We also present an algorithm that achieves the same time
    complexity for multi-value consensus. Both of our algorithms succeed in $O(log
    n)$ rounds with high probability, thus showing an exponential gap to the $\\tilde\\Omega(\\sqrt
    n)$ lower bound of Ben-Or and Bar-Joseph for strongly adaptive crash-failure adversaries,
    which can be strengthened to $\\Omega(n)$ when allowing the adversary to block
    nodes instead of permanently crashing them. Our algorithms are scalable to large
    systems as each node contacts only an (amortized) constant number of peers in
    each communication round. We show that our algorithms are optimal up to constant
    (resp.\\ sub-logarithmic) factors by proving that every almost-everywhere consensus
    protocol takes $\\Omega(log_d n)$ rounds in the worst case, where d is an upper
    bound on the number of communication requests initiated per node in each round.
    We complement our theoretical results with an experimental evaluation of the binary
    almost-everywhere consensus protocol revealing a short convergence time even against
    an adversary blocking a large fraction of nodes."
author:
- first_name: Peter
  full_name: Robinson, Peter
  last_name: Robinson
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: 'Robinson P, Scheideler C, Setzer A. Breaking the $\tilde\Omega(\sqrt{n})$
    Barrier: Fast Consensus under a Late Adversary. In: <i>Proceedings of the 30th
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. doi:<a
    href="https://doi.org/10.1145/3210377.3210399">10.1145/3210377.3210399</a>'
  apa: 'Robinson, P., Scheideler, C., &#38; Setzer, A. (n.d.). Breaking the $\tilde\Omega(\sqrt{n})$
    Barrier: Fast Consensus under a Late Adversary. In <i>Proceedings of the 30th
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien.
    <a href="https://doi.org/10.1145/3210377.3210399">https://doi.org/10.1145/3210377.3210399</a>'
  bibtex: '@inproceedings{Robinson_Scheideler_Setzer, title={Breaking the $\tilde\Omega(\sqrt{n})$
    Barrier: Fast Consensus under a Late Adversary}, DOI={<a href="https://doi.org/10.1145/3210377.3210399">10.1145/3210377.3210399</a>},
    booktitle={Proceedings of the 30th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, author={Robinson, Peter and Scheideler, Christian and
    Setzer, Alexander} }'
  chicago: 'Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking
    the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late Adversary.”
    In <i>Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, n.d. <a href="https://doi.org/10.1145/3210377.3210399">https://doi.org/10.1145/3210377.3210399</a>.'
  ieee: 'P. Robinson, C. Scheideler, and A. Setzer, “Breaking the $\tilde\Omega(\sqrt{n})$
    Barrier: Fast Consensus under a Late Adversary,” in <i>Proceedings of the 30th
    ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien.'
  mla: 'Robinson, Peter, et al. “Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast
    Consensus under a Late Adversary.” <i>Proceedings of the 30th ACM Symposium on
    Parallelism in Algorithms and Architectures (SPAA)</i>, doi:<a href="https://doi.org/10.1145/3210377.3210399">10.1145/3210377.3210399</a>.'
  short: 'P. Robinson, C. Scheideler, A. Setzer, in: Proceedings of the 30th ACM Symposium
    on Parallelism in Algorithms and Architectures (SPAA), n.d.'
conference:
  end_date: 2018-07-18
  location: Wien
  name: 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
  start_date: 2018-07-16
date_created: 2018-07-04T08:55:45Z
date_updated: 2022-01-06T06:59:16Z
ddc:
- '040'
department:
- _id: '79'
- _id: '34'
- _id: '7'
doi: 10.1145/3210377.3210399
file:
- access_level: closed
  content_type: application/pdf
  creator: asetzer
  date_created: 2018-10-31T13:30:40Z
  date_updated: 2018-10-31T13:30:40Z
  file_id: '5215'
  file_name: p173-robinson.pdf
  file_size: 1675407
  relation: main_file
  success: 1
file_date_updated: 2018-10-31T13:30:40Z
has_accepted_license: '1'
keyword:
- distributed consensus
- randomized algorithm
- adaptive adversary
- complexity lower bound
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
publication_identifier:
  isbn:
  - 978-1-4503-5799-9/18/07
publication_status: accepted
status: public
title: 'Breaking the $\tilde\Omega(\sqrt{n})$ Barrier: Fast Consensus under a Late
  Adversary'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '2965'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Nils
  full_name: Löken, Nils
  id: '13703'
  last_name: Löken
citation:
  ama: 'Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: <i>Proceedings
    of the 13th International Conference on Availability, Reliability and Security,
    ARES 2018</i>. New York, NY, USA: ACM; :25:1--25:10. doi:<a href="https://doi.org/10.1145/3230833.3230853">10.1145/3230833.3230853</a>'
  apa: 'Blömer, J., &#38; Löken, N. (n.d.). Cloud Architectures for Searchable Encryption.
    In <i>Proceedings of the 13th International Conference on Availability, Reliability
    and Security, ARES 2018</i> (pp. 25:1--25:10). New York, NY, USA: ACM. <a href="https://doi.org/10.1145/3230833.3230853">https://doi.org/10.1145/3230833.3230853</a>'
  bibtex: '@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures
    for Searchable Encryption}, DOI={<a href="https://doi.org/10.1145/3230833.3230853">10.1145/3230833.3230853</a>},
    booktitle={Proceedings of the 13th International Conference on Availability, Reliability
    and Security, ARES 2018}, publisher={ACM}, author={Blömer, Johannes and Löken,
    Nils}, pages={25:1--25:10} }'
  chicago: 'Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable
    Encryption.” In <i>Proceedings of the 13th International Conference on Availability,
    Reliability and Security, ARES 2018</i>, 25:1--25:10. New York, NY, USA: ACM,
    n.d. <a href="https://doi.org/10.1145/3230833.3230853">https://doi.org/10.1145/3230833.3230853</a>.'
  ieee: J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in
    <i>Proceedings of the 13th International Conference on Availability, Reliability
    and Security, ARES 2018</i>, Hamburg, Germany, pp. 25:1--25:10.
  mla: Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.”
    <i>Proceedings of the 13th International Conference on Availability, Reliability
    and Security, ARES 2018</i>, ACM, pp. 25:1--25:10, doi:<a href="https://doi.org/10.1145/3230833.3230853">10.1145/3230833.3230853</a>.
  short: 'J. Blömer, N. Löken, in: Proceedings of the 13th International Conference
    on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA,
    n.d., pp. 25:1--25:10.'
conference:
  location: Hamburg, Germany
  name: ARES 2018
date_created: 2018-06-04T11:33:15Z
date_updated: 2022-01-06T06:58:49Z
ddc:
- '000'
department:
- _id: '64'
- _id: '568'
doi: 10.1145/3230833.3230853
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:39:46Z
  date_updated: 2018-11-02T14:39:46Z
  file_id: '5278'
  file_name: a25-Blomer.pdf
  file_size: 769807
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:39:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 25:1--25:10
place: New York, NY, USA
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Proceedings of the 13th International Conference on Availability, Reliability
  and Security, ARES 2018
publication_identifier:
  isbn:
  - 978-1-4503-6448-5
publication_status: accepted
publisher: ACM
quality_controlled: '1'
status: public
title: Cloud Architectures for Searchable Encryption
type: conference
user_id: '13703'
year: '2018'
...
---
_id: '1138'
author:
- first_name: Robert
  full_name: Gmyr, Robert
  last_name: Gmyr
citation:
  ama: Gmyr R. <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>.
    Universität Paderborn; 2018. doi:<a href="https://doi.org/10.17619/UNIPB/1-265">10.17619/UNIPB/1-265</a>
  apa: Gmyr, R. (2018). <i>Distributed Algorithms for Overlay Networks and Programmable
    Matter</i>. Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-265">https://doi.org/10.17619/UNIPB/1-265</a>
  bibtex: '@book{Gmyr_2018, title={Distributed Algorithms for Overlay Networks and
    Programmable Matter}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-265">10.17619/UNIPB/1-265</a>},
    publisher={Universität Paderborn}, author={Gmyr, Robert}, year={2018} }'
  chicago: Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable
    Matter</i>. Universität Paderborn, 2018. <a href="https://doi.org/10.17619/UNIPB/1-265">https://doi.org/10.17619/UNIPB/1-265</a>.
  ieee: R. Gmyr, <i>Distributed Algorithms for Overlay Networks and Programmable Matter</i>.
    Universität Paderborn, 2018.
  mla: Gmyr, Robert. <i>Distributed Algorithms for Overlay Networks and Programmable
    Matter</i>. Universität Paderborn, 2018, doi:<a href="https://doi.org/10.17619/UNIPB/1-265">10.17619/UNIPB/1-265</a>.
  short: R. Gmyr, Distributed Algorithms for Overlay Networks and Programmable Matter,
    Universität Paderborn, 2018.
date_created: 2018-01-31T06:04:03Z
date_updated: 2022-01-06T06:51:00Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-265
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '5'
  name: SFB 901 - Subproject A1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Distributed Algorithms for Overlay Networks and Programmable Matter
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '5820'
abstract:
- lang: eng
  text: "In this paper, we investigate the use of trusted execution environments (TEEs,
    such as Intel's SGX) for an anonymous communication infrastructure over untrusted
    networks.\r\nFor this, we present the general idea of exploiting trusted execution
    environments for the purpose of anonymous communication, including a continuous-time
    security framework that models strong anonymity guarantees in the presence of
    an adversary that observes all network traffic and can adaptively corrupt a constant
    fraction of participating nodes.\r\nIn our framework, a participating node can
    generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms,
    allowing both senders and receivers of messages to remain anonymous. We introduce
    a concrete construction, which shows viability of our TEE-based approach to anonymous
    communication. The construction draws from techniques from cryptography and overlay
    networks. \r\nOur techniques are very general and can be used as a basis for future
    constructions with similar goals."
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: Blömer J, Bobolz J, Scheideler C, Setzer A. <i>Provably Anonymous Communication
    Based on Trusted Execution Environments</i>.
  apa: Blömer, J., Bobolz, J., Scheideler, C., &#38; Setzer, A. (n.d.). <i>Provably
    Anonymous Communication Based on Trusted Execution Environments</i>.
  bibtex: '@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication
    Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz,
    Jan and Scheideler, Christian and Setzer, Alexander} }'
  chicago: Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer.
    <i>Provably Anonymous Communication Based on Trusted Execution Environments</i>,
    n.d.
  ieee: J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, <i>Provably Anonymous
    Communication Based on Trusted Execution Environments</i>. .
  mla: Blömer, Johannes, et al. <i>Provably Anonymous Communication Based on Trusted
    Execution Environments</i>.
  short: J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication
    Based on Trusted Execution Environments, n.d.
date_created: 2018-11-25T08:08:40Z
date_updated: 2022-01-06T07:02:43Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: jbobolz
  date_created: 2018-12-31T09:55:30Z
  date_updated: 2018-12-31T09:55:30Z
  file_id: '6435'
  file_name: draft-2018.pdf
  file_size: 470968
  relation: main_file
  success: 1
file_date_updated: 2018-12-31T09:55:30Z
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
publication_status: draft
status: public
title: Provably Anonymous Communication Based on Trusted Execution Environments
type: working_paper
user_id: '27207'
year: '2018'
...
---
_id: '5985'
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Scheideler C. Relays: Towards a Link Layer for Robust and Secure Fog Computing.
    In: <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated
    Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
    July 27, 2018</i>. ; 2018:1-2. doi:<a href="https://doi.org/10.1145/3229774.3229781">10.1145/3229774.3229781</a>'
  apa: 'Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure
    Fog Computing. In <i>Proceedings of the 2018 Workshop on Theory and Practice for
    Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
    Kingdom, July 27, 2018</i> (pp. 1–2). <a href="https://doi.org/10.1145/3229774.3229781">https://doi.org/10.1145/3229774.3229781</a>'
  bibtex: '@inproceedings{Scheideler_2018, title={Relays: Towards a Link Layer for
    Robust and Secure Fog Computing}, DOI={<a href="https://doi.org/10.1145/3229774.3229781">10.1145/3229774.3229781</a>},
    booktitle={Proceedings of the 2018 Workshop on Theory and Practice for Integrated
    Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
    July 27, 2018}, author={Scheideler, Christian}, year={2018}, pages={1–2} }'
  chicago: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
    Fog Computing.” In <i>Proceedings of the 2018 Workshop on Theory and Practice
    for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
    United Kingdom, July 27, 2018</i>, 1–2, 2018. <a href="https://doi.org/10.1145/3229774.3229781">https://doi.org/10.1145/3229774.3229781</a>.'
  ieee: 'C. Scheideler, “Relays: Towards a Link Layer for Robust and Secure Fog Computing,”
    in <i>Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud,
    Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July
    27, 2018</i>, 2018, pp. 1–2.'
  mla: 'Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure
    Fog Computing.” <i>Proceedings of the 2018 Workshop on Theory and Practice for
    Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United
    Kingdom, July 27, 2018</i>, 2018, pp. 1–2, doi:<a href="https://doi.org/10.1145/3229774.3229781">10.1145/3229774.3229781</a>.'
  short: 'C. Scheideler, in: Proceedings of the 2018 Workshop on Theory and Practice
    for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham,
    United Kingdom, July 27, 2018, 2018, pp. 1–2.'
date_created: 2018-11-30T08:11:27Z
date_updated: 2022-01-06T07:02:49Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.1145/3229774.3229781
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-12-12T15:12:02Z
  date_updated: 2018-12-12T15:12:02Z
  file_id: '6194'
  file_name: p1-scheideler.pdf
  file_size: 1420210
  relation: main_file
file_date_updated: 2018-12-12T15:12:02Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-2
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Proceedings of the 2018 Workshop on Theory and Practice for Integrated
  Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom,
  July 27, 2018
status: public
title: 'Relays: Towards a Link Layer for Robust and Secure Fog Computing'
type: conference
user_id: '477'
year: '2018'
...
---
_id: '5216'
abstract:
- lang: eng
  text: A fundamental problem for overlay networks is to safely exclude leaving nodes,
    i.e., the nodes requesting to leave the overlay network are excluded from it without
    affecting its connectivity. To rigorously study self-stabilizing solutions to
    this problem, the Finite Departure Problem (FDP) has been proposed [9]. In the
    FDP we are given a network of processes in an arbitrary state, and the goal is
    to eventually arrive at (and stay in) a state in which all leaving processes irrevocably
    decided to leave the system while for all weakly-connected components in the initial
    overlay network, all staying processes in that component will still form a weakly
    connected component. In the standard interconnection model, the FDP is known to
    be unsolvable by local control protocols, so oracles have been investigated that
    allow the problem to be solved [9]. To avoid the use of oracles, we introduce
    a new interconnection model based on relays. Despite the relay model appearing
    to be rather restrictive, we show that it is universal, i.e., it is possible to
    transform any weakly-connected topology into any other weakly-connected topology,
    which is important for being a useful interconnection model for overlay networks.
    Apart from this, our model allows processes to grant and revoke access rights,
    which is why we believe it to be of interest beyond the scope of this paper. We
    show how to implement the relay layer in a self-stabilizing way and identify properties
    protocols need to satisfy so that the relay layer can recover while serving protocol
    requests.
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: 'Scheideler C, Setzer A. Relays: A New Approach for the Finite Departure Problem
    in Overlay Networks. In: <i>Proceedings of the 20th International Symposium on
    Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>. ; 2018.
    doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_16">10.1007/978-3-030-03232-6_16</a>'
  apa: 'Scheideler, C., &#38; Setzer, A. (2018). Relays: A New Approach for the Finite
    Departure Problem in Overlay Networks. In <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>.
    Tokyo, Japan. <a href="https://doi.org/10.1007/978-3-030-03232-6_16">https://doi.org/10.1007/978-3-030-03232-6_16</a>'
  bibtex: '@inproceedings{Scheideler_Setzer_2018, title={Relays: A New Approach for
    the Finite Departure Problem in Overlay Networks}, DOI={<a href="https://doi.org/10.1007/978-3-030-03232-6_16">10.1007/978-3-030-03232-6_16</a>},
    booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS 2018)}, author={Scheideler, Christian
    and Setzer, Alexander}, year={2018} }'
  chicago: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for
    the Finite Departure Problem in Overlay Networks.” In <i>Proceedings of the 20th
    International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS 2018)</i>, 2018. <a href="https://doi.org/10.1007/978-3-030-03232-6_16">https://doi.org/10.1007/978-3-030-03232-6_16</a>.'
  ieee: 'C. Scheideler and A. Setzer, “Relays: A New Approach for the Finite Departure
    Problem in Overlay Networks,” in <i>Proceedings of the 20th International Symposium
    on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>,
    Tokyo, Japan, 2018.'
  mla: 'Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the
    Finite Departure Problem in Overlay Networks.” <i>Proceedings of the 20th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018)</i>,
    2018, doi:<a href="https://doi.org/10.1007/978-3-030-03232-6_16">10.1007/978-3-030-03232-6_16</a>.'
  short: 'C. Scheideler, A. Setzer, in: Proceedings of the 20th International Symposium
    on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.'
conference:
  location: Tokyo, Japan
  name: 20th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS 2018)
date_created: 2018-10-31T13:33:05Z
date_updated: 2022-01-06T07:01:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-030-03232-6_16
file:
- access_level: closed
  content_type: application/pdf
  creator: asetzer
  date_created: 2018-10-31T15:51:45Z
  date_updated: 2018-10-31T16:09:48Z
  file_id: '5223'
  file_name: Scheideler-Setzer2018_Chapter_RelaysANewApproachForTheFinite.pdf
  file_size: 369818
  relation: main_file
file_date_updated: 2018-10-31T16:09:48Z
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
publication: Proceedings of the 20th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS 2018)
publication_status: published
status: public
title: 'Relays: A New Approach for the Finite Departure Problem in Overlay Networks'
type: conference
user_id: '11108'
year: '2018'
...
---
_id: '6597'
author:
- first_name: Jakob
  full_name: Juhnke, Jakob
  id: '48090'
  last_name: Juhnke
citation:
  ama: Juhnke J. <i>Models and Constructions for Secure Reputation Systems</i>. Universität
    Paderborn; 2018. doi:<a href="https://doi.org/10.17619/UNIPB/1-570">10.17619/UNIPB/1-570</a>
  apa: Juhnke, J. (2018). <i>Models and Constructions for Secure Reputation Systems</i>.
    Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-570">https://doi.org/10.17619/UNIPB/1-570</a>
  bibtex: '@book{Juhnke_2018, title={Models and Constructions for Secure Reputation
    Systems}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-570">10.17619/UNIPB/1-570</a>},
    publisher={Universität Paderborn}, author={Juhnke, Jakob}, year={2018} }'
  chicago: Juhnke, Jakob. <i>Models and Constructions for Secure Reputation Systems</i>.
    Universität Paderborn, 2018. <a href="https://doi.org/10.17619/UNIPB/1-570">https://doi.org/10.17619/UNIPB/1-570</a>.
  ieee: J. Juhnke, <i>Models and Constructions for Secure Reputation Systems</i>.
    Universität Paderborn, 2018.
  mla: Juhnke, Jakob. <i>Models and Constructions for Secure Reputation Systems</i>.
    Universität Paderborn, 2018, doi:<a href="https://doi.org/10.17619/UNIPB/1-570">10.17619/UNIPB/1-570</a>.
  short: J. Juhnke, Models and Constructions for Secure Reputation Systems, Universität
    Paderborn, 2018.
date_created: 2019-01-10T07:51:07Z
date_updated: 2022-01-06T07:03:13Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-570
language:
- iso: eng
project:
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '1'
  name: SFB 901
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Models and Constructions for Secure Reputation Systems
type: dissertation
user_id: '477'
year: '2018'
...
---
_id: '3873'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Fabian
  full_name: Eidens, Fabian
  id: '25078'
  last_name: Eidens
- first_name: Jakob
  full_name: Juhnke, Jakob
  id: '48090'
  last_name: Juhnke
citation:
  ama: 'Blömer J, Eidens F, Juhnke J. Enhanced Security of Attribute-Based Signatures.
    In: <i>The International Conference on Cryptology And Network Security (CANS)</i>.
    Vol 11124. Lecture Notes in Computer Science. Springer; 2018:235-255. doi:<a href="https://doi.org/10.1007/978-3-030-00434-7_12">10.1007/978-3-030-00434-7_12</a>'
  apa: Blömer, J., Eidens, F., &#38; Juhnke, J. (2018). Enhanced Security of Attribute-Based
    Signatures. <i>The International Conference on Cryptology And Network Security
    (CANS)</i>, <i>11124</i>, 235–255. <a href="https://doi.org/10.1007/978-3-030-00434-7_12">https://doi.org/10.1007/978-3-030-00434-7_12</a>
  bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, series={Lecture Notes in Computer
    Science}, title={Enhanced Security of Attribute-Based Signatures}, volume={11124},
    DOI={<a href="https://doi.org/10.1007/978-3-030-00434-7_12">10.1007/978-3-030-00434-7_12</a>},
    booktitle={The International Conference on Cryptology And Network Security (CANS)},
    publisher={Springer}, author={Blömer, Johannes and Eidens, Fabian and Juhnke,
    Jakob}, year={2018}, pages={235–255}, collection={Lecture Notes in Computer Science}
    }'
  chicago: Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Enhanced Security of
    Attribute-Based Signatures.” In <i>The International Conference on Cryptology
    And Network Security (CANS)</i>, 11124:235–55. Lecture Notes in Computer Science.
    Springer, 2018. <a href="https://doi.org/10.1007/978-3-030-00434-7_12">https://doi.org/10.1007/978-3-030-00434-7_12</a>.
  ieee: 'J. Blömer, F. Eidens, and J. Juhnke, “Enhanced Security of Attribute-Based
    Signatures,” in <i>The International Conference on Cryptology And Network Security
    (CANS)</i>, Naples, Italy, 2018, vol. 11124, pp. 235–255, doi: <a href="https://doi.org/10.1007/978-3-030-00434-7_12">10.1007/978-3-030-00434-7_12</a>.'
  mla: Blömer, Johannes, et al. “Enhanced Security of Attribute-Based Signatures.”
    <i>The International Conference on Cryptology And Network Security (CANS)</i>,
    vol. 11124, Springer, 2018, pp. 235–55, doi:<a href="https://doi.org/10.1007/978-3-030-00434-7_12">10.1007/978-3-030-00434-7_12</a>.
  short: 'J. Blömer, F. Eidens, J. Juhnke, in: The International Conference on Cryptology
    And Network Security (CANS), Springer, 2018, pp. 235–255.'
conference:
  location: Naples, Italy
  name: The International Conference on Cryptology And Network Security (CANS)
date_created: 2018-08-10T09:44:09Z
date_updated: 2023-01-10T10:26:13Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-030-00434-7_12
file:
- access_level: closed
  content_type: application/pdf
  creator: feidens
  date_created: 2018-11-08T10:15:00Z
  date_updated: 2018-11-08T10:15:00Z
  file_id: '5427'
  file_name: uc_abs.pdf
  file_size: 574228
  relation: main_file
file_date_updated: 2018-11-08T10:15:00Z
has_accepted_license: '1'
intvolume: '     11124'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2018/874
oa: '1'
page: 235-255
project:
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '1'
  name: SFB 901
publication: The International Conference on Cryptology And Network Security (CANS)
publication_identifier:
  isbn:
  - 978-3-030-00434-7
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Enhanced Security of Attribute-Based Signatures
type: conference
user_id: '25078'
volume: 11124
year: '2018'
...
---
_id: '2379'
abstract:
- lang: eng
  text: 'In this paper, we introduce the notion of delegatable attribute-based anonymous
    credentials (DAAC). Such systems offer fine-grained anonymous access control and
    they give the credential holder the ability to issue more restricted credentials
    to other users. In our model, credentials are parameterized with attributes that
    (1) express what the credential holder himself has been certified and (2) define
    which attributes he may issue to others. Furthermore, we present a practical construction
    of DAAC. For this construction, we deviate from the usual approach of embedding
    a certificate chain in the credential. Instead, we introduce a novel approach
    for which we identify a new primitive we call dynamically malleable signatures
    (DMS) as the main ingredient. This primitive may be of independent interest. We
    also give a first instantiation of DMS with efficient protocols. '
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Jan
  full_name: Bobolz, Jan
  id: '27207'
  last_name: Bobolz
citation:
  ama: 'Blömer J, Bobolz J. Delegatable Attribute-based Anonymous Credentials from
    Dynamically Malleable Signatures. In: <i>ACNS 2018 Applied Cryptography &#38;
    Network Security</i>. LNCS. doi:<a href="https://doi.org/10.1007/978-3-319-93387-0_12">10.1007/978-3-319-93387-0_12</a>'
  apa: Blömer, J., &#38; Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous
    Credentials from Dynamically Malleable Signatures. <i>ACNS 2018 Applied Cryptography
    &#38; Network Security</i>. The 16th International Conference on Applied Cryptography
    and Network Security, Leuven, Belgium. <a href="https://doi.org/10.1007/978-3-319-93387-0_12">https://doi.org/10.1007/978-3-319-93387-0_12</a>
  bibtex: '@inproceedings{Blömer_Bobolz, series={LNCS}, title={Delegatable Attribute-based
    Anonymous Credentials from Dynamically Malleable Signatures}, DOI={<a href="https://doi.org/10.1007/978-3-319-93387-0_12">10.1007/978-3-319-93387-0_12</a>},
    booktitle={ACNS 2018 Applied Cryptography &#38; Network security}, author={Blömer,
    Johannes and Bobolz, Jan}, collection={LNCS} }'
  chicago: Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous
    Credentials from Dynamically Malleable Signatures.” In <i>ACNS 2018 Applied Cryptography
    &#38; Network Security</i>. LNCS, n.d. <a href="https://doi.org/10.1007/978-3-319-93387-0_12">https://doi.org/10.1007/978-3-319-93387-0_12</a>.
  ieee: 'J. Blömer and J. Bobolz, “Delegatable Attribute-based Anonymous Credentials
    from Dynamically Malleable Signatures,” presented at the The 16th International
    Conference on Applied Cryptography and Network Security, Leuven, Belgium, doi:
    <a href="https://doi.org/10.1007/978-3-319-93387-0_12">10.1007/978-3-319-93387-0_12</a>.'
  mla: Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials
    from Dynamically Malleable Signatures.” <i>ACNS 2018 Applied Cryptography &#38;
    Network Security</i>, doi:<a href="https://doi.org/10.1007/978-3-319-93387-0_12">10.1007/978-3-319-93387-0_12</a>.
  short: 'J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography &#38; Network Security,
    n.d.'
conference:
  location: Leuven, Belgium
  name: The 16th International Conference on Applied Cryptography and Network Security
date_created: 2018-04-17T12:28:25Z
date_updated: 2023-01-10T10:28:43Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-93387-0_12
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T13:41:16Z
  date_updated: 2018-11-02T13:41:16Z
  file_id: '5252'
  file_name: 2018-340.pdf
  file_size: 542171
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T13:41:16Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2018/340
oa: '1'
project:
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subproject C1
publication: ACNS 2018 Applied Cryptography & Network security
publication_status: accepted
series_title: LNCS
status: public
title: Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable
  Signatures
type: conference
user_id: '25078'
year: '2018'
...
---
_id: '2967'
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. Subtleties in Security Definitions for Predicate Encryption
    with Public Index. In: <i>Proceedings of the International Conference of Mathematical
    Aspects of Computer and Information Sciences (MACIS)</i>. Vol 10693. Lecture Notes
    in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:<a
    href="https://doi.org/10.1007/978-3-319-72453-9_35">10.1007/978-3-319-72453-9_35</a>'
  apa: 'Blömer, J., &#38; Liske, G. (2017). Subtleties in Security Definitions for
    Predicate Encryption with Public Index. In <i>Proceedings of the International
    Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>
    (Vol. 10693, pp. 438–453). Cham: Springer International Publishing. <a href="https://doi.org/10.1007/978-3-319-72453-9_35">https://doi.org/10.1007/978-3-319-72453-9_35</a>'
  bibtex: '@inproceedings{Blömer_Liske_2017, place={Cham}, series={Lecture Notes in
    Computer Science}, title={Subtleties in Security Definitions for Predicate Encryption
    with Public Index}, volume={10693}, DOI={<a href="https://doi.org/10.1007/978-3-319-72453-9_35">10.1007/978-3-319-72453-9_35</a>},
    booktitle={Proceedings of the International Conference of Mathematical Aspects
    of Computer and Information Sciences (MACIS)}, publisher={Springer International
    Publishing}, author={Blömer, Johannes and Liske, Gennadij}, year={2017}, pages={438–453},
    collection={Lecture Notes in Computer Science} }'
  chicago: 'Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions
    for Predicate Encryption with Public Index.” In <i>Proceedings of the International
    Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>,
    10693:438–53. Lecture Notes in Computer Science. Cham: Springer International
    Publishing, 2017. <a href="https://doi.org/10.1007/978-3-319-72453-9_35">https://doi.org/10.1007/978-3-319-72453-9_35</a>.'
  ieee: J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate
    Encryption with Public Index,” in <i>Proceedings of the International Conference
    of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2017,
    vol. 10693, pp. 438–453.
  mla: Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for
    Predicate Encryption with Public Index.” <i>Proceedings of the International Conference
    of Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, vol.
    10693, Springer International Publishing, 2017, pp. 438–53, doi:<a href="https://doi.org/10.1007/978-3-319-72453-9_35">10.1007/978-3-319-72453-9_35</a>.
  short: 'J. Blömer, G. Liske, in: Proceedings of the International Conference of
    Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International
    Publishing, Cham, 2017, pp. 438–453.'
date_created: 2018-06-04T12:17:48Z
date_updated: 2022-01-06T06:58:49Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-72453-9_35
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T14:52:10Z
  date_updated: 2018-11-02T14:52:10Z
  file_id: '5286'
  file_name: SubtletiesInSecurityDefinition.pdf
  file_size: 463904
  relation: main_file
  success: 1
file_date_updated: 2018-11-02T14:52:10Z
has_accepted_license: '1'
intvolume: '     10693'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2017/453.pdf
oa: '1'
page: 438-453
place: Cham
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publication: Proceedings of the International Conference of Mathematical Aspects of
  Computer and Information Sciences (MACIS)
publication_identifier:
  isbn:
  - '9783319724522'
  - '9783319724539'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Subtleties in Security Definitions for Predicate Encryption with Public Index
type: conference
user_id: '477'
volume: 10693
year: '2017'
...
---
_id: '116'
author:
- first_name: Gennadij
  full_name: Liske, Gennadij
  last_name: Liske
citation:
  ama: Liske G. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität
    Paderborn; 2017. doi:<a href="https://doi.org/10.17619/UNIPB/1-220">10.17619/UNIPB/1-220</a>
  apa: Liske, G. (2017). <i>CCA-Security for Predicate Encryption Schemes</i>. Universität
    Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-220">https://doi.org/10.17619/UNIPB/1-220</a>
  bibtex: '@book{Liske_2017, title={CCA-Security for Predicate Encryption Schemes},
    DOI={<a href="https://doi.org/10.17619/UNIPB/1-220">10.17619/UNIPB/1-220</a>},
    publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2017} }'
  chicago: Liske, Gennadij. <i>CCA-Security for Predicate Encryption Schemes</i>.
    Universität Paderborn, 2017. <a href="https://doi.org/10.17619/UNIPB/1-220">https://doi.org/10.17619/UNIPB/1-220</a>.
  ieee: G. Liske, <i>CCA-Security for Predicate Encryption Schemes</i>. Universität
    Paderborn, 2017.
  mla: Liske, Gennadij. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität
    Paderborn, 2017, doi:<a href="https://doi.org/10.17619/UNIPB/1-220">10.17619/UNIPB/1-220</a>.
  short: G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn,
    2017.
date_created: 2017-10-17T12:41:14Z
date_updated: 2022-01-06T06:51:04Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-220
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466:2-29690
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: CCA-Security for Predicate Encryption Schemes
type: dissertation
user_id: '25078'
year: '2017'
...
---
_id: '2344'
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
- first_name: Nils
  full_name: Löken, Nils
  id: '13703'
  last_name: Löken
citation:
  ama: 'Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service
    for Access Control in Large-Scale Organizations. In: <i>Foundations and Practice
    of Security</i>. Cham: Springer International Publishing; 2017:3-17. doi:<a href="https://doi.org/10.1007/978-3-319-75650-9_1">10.1007/978-3-319-75650-9_1</a>'
  apa: 'Blömer, J., Günther, P., Krummel, V., &#38; Löken, N. (2017). Attribute-Based
    Encryption as a Service for Access Control in Large-Scale Organizations. In <i>Foundations
    and Practice of Security</i> (pp. 3–17). Cham: Springer International Publishing.
    <a href="https://doi.org/10.1007/978-3-319-75650-9_1">https://doi.org/10.1007/978-3-319-75650-9_1</a>'
  bibtex: '@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based
    Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={<a
    href="https://doi.org/10.1007/978-3-319-75650-9_1">10.1007/978-3-319-75650-9_1</a>},
    booktitle={Foundations and Practice of Security}, publisher={Springer International
    Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and
    Löken, Nils}, year={2017}, pages={3–17} }'
  chicago: 'Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based
    Encryption as a Service for Access Control in Large-Scale Organizations.” In <i>Foundations
    and Practice of Security</i>, 3–17. Cham: Springer International Publishing, 2017.
    <a href="https://doi.org/10.1007/978-3-319-75650-9_1">https://doi.org/10.1007/978-3-319-75650-9_1</a>.'
  ieee: J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption
    as a Service for Access Control in Large-Scale Organizations,” in <i>Foundations
    and Practice of Security</i>, 2017, pp. 3–17.
  mla: Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access
    Control in Large-Scale Organizations.” <i>Foundations and Practice of Security</i>,
    Springer International Publishing, 2017, pp. 3–17, doi:<a href="https://doi.org/10.1007/978-3-319-75650-9_1">10.1007/978-3-319-75650-9_1</a>.
  short: 'J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice
    of Security, Springer International Publishing, Cham, 2017, pp. 3–17.'
date_created: 2018-04-13T11:40:48Z
date_updated: 2022-01-06T06:55:55Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-75650-9_1
file:
- access_level: closed
  content_type: application/pdf
  creator: ups
  date_created: 2018-11-02T15:04:13Z
  date_updated: 2018-11-02T15:04:13Z
  file_id: '5292'
  file_name: Attribute-BasedEncryptionAsASe.pdf
  file_size: 634736
  relation: main_file
  success: 1
- access_level: open_access
  content_type: application/pdf
  creator: nilo
  date_created: 2018-11-08T09:53:34Z
  date_updated: 2018-11-08T09:53:34Z
  file_id: '5425'
  file_name: abe_aas.pdf
  file_size: 522516
  relation: main_file
file_date_updated: 2018-11-08T09:53:34Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 3-17
place: Cham
project:
- _id: '13'
  name: SFB 901 - Subproject C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '1'
  name: SFB 901
- _id: '43'
  name: Securing the Financial Cloud
publication: Foundations and Practice of Security
publication_identifier:
  isbn:
  - '9783319756493'
  - '9783319756509'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations
type: conference
user_id: '13703'
year: '2017'
...