---
_id: '26541'
author:
- first_name: Reinhard
  full_name: Keil, Reinhard
  last_name: Keil
- first_name: Christian
  full_name: Schild, Christian
  last_name: Schild
citation:
  ama: 'Keil R, Schild C. Hypothesengeleitete Gestaltung von Benutzungsoberfl{\"a}chen.
    In: De Gruyter Oldenbourg; 2014:265-274.'
  apa: Keil, R., &#38; Schild, C. (2014). <i>Hypothesengeleitete Gestaltung von Benutzungsoberfl{\"a}chen</i>.
    265–274.
  bibtex: '@inproceedings{Keil_Schild_2014, place={Berlin}, title={Hypothesengeleitete
    Gestaltung von Benutzungsoberfl{\"a}chen}, publisher={De Gruyter Oldenbourg},
    author={Keil, Reinhard and Schild, Christian}, year={2014}, pages={265–274} }'
  chicago: 'Keil, Reinhard, and Christian Schild. “Hypothesengeleitete Gestaltung
    von Benutzungsoberfl{\"a}chen,” 265–74. Berlin: De Gruyter Oldenbourg, 2014.'
  ieee: R. Keil and C. Schild, “Hypothesengeleitete Gestaltung von Benutzungsoberfl{\"a}chen,”
    2014, pp. 265–274.
  mla: Keil, Reinhard, and Christian Schild. <i>Hypothesengeleitete Gestaltung von
    Benutzungsoberfl{\"a}chen</i>. De Gruyter Oldenbourg, 2014, pp. 265–74.
  short: 'R. Keil, C. Schild, in: De Gruyter Oldenbourg, Berlin, 2014, pp. 265–274.'
date_created: 2021-10-19T15:08:02Z
date_updated: 2022-01-06T06:57:22Z
department:
- _id: '71'
language:
- iso: eng
page: 265-274
place: Berlin
publication_status: published
publisher: De Gruyter Oldenbourg
status: public
title: Hypothesengeleitete Gestaltung von Benutzungsoberfl{\"a}chen
type: conference
user_id: '71124'
year: '2014'
...
---
_id: '26542'
author:
- first_name: ' Reinhard'
  full_name: Keil,  Reinhard
  last_name: Keil
citation:
  ama: 'Keil  Reinhard. Knowledge integration processes and distributed knowledge
    organization. In: Keller SA, Schneider R, Volk B, eds. De Gruyter Saur; 2014:162–179.'
  apa: Keil,  Reinhard. (2014). <i>Knowledge integration processes and distributed
    knowledge organization</i> (S. A. Keller, R. Schneider, &#38; B. Volk, Eds.; pp.
    162–179). De Gruyter Saur.
  bibtex: '@inproceedings{Keil_2014, place={Berlin}, title={Knowledge integration
    processes and distributed knowledge organization}, publisher={De Gruyter Saur},
    author={Keil,  Reinhard}, editor={Keller, Stefan Andreas and Schneider, René and
    Volk, Benno}, year={2014}, pages={162–179} }'
  chicago: 'Keil,  Reinhard. “Knowledge Integration Processes and Distributed Knowledge
    Organization.” edited by Stefan Andreas Keller, René Schneider, and Benno Volk,
    162–179. Berlin: De Gruyter Saur, 2014.'
  ieee: Reinhard Keil, “Knowledge integration processes and distributed knowledge
    organization,” 2014, pp. 162–179.
  mla: Keil,  Reinhard. <i>Knowledge Integration Processes and Distributed Knowledge
    Organization</i>. Edited by Stefan Andreas Keller et al., De Gruyter Saur, 2014,
    pp. 162–179.
  short: 'Reinhard Keil, in: S.A. Keller, R. Schneider, B. Volk (Eds.), De Gruyter
    Saur, Berlin, 2014, pp. 162–179.'
date_created: 2021-10-19T15:14:12Z
date_updated: 2022-01-06T06:57:22Z
department:
- _id: '71'
editor:
- first_name: Stefan Andreas
  full_name: Keller, Stefan Andreas
  last_name: Keller
- first_name: René
  full_name: Schneider, René
  last_name: Schneider
- first_name: Benno
  full_name: Volk, Benno
  last_name: Volk
language:
- iso: eng
page: 162–179
place: Berlin
publication_status: published
publisher: De Gruyter Saur
status: public
title: Knowledge integration processes and distributed knowledge organization
type: conference
user_id: '71124'
year: '2014'
...
---
_id: '329'
abstract:
- lang: eng
  text: Network emulations are widely used for testing novel network protocols and
    routing algorithms in realistic scenarios. Up to now, there is no emulation tool
    that is able to emulate large software-defined data center networks that consist
    of several thousand nodes. Mininet is the most common tool to emulate Software-Defined
    Networks of several hundred nodes. We extend Mininet to span an emulated network
    over several physical machines, making it possible to emulate networks of several
    thousand nodes on just a handful of physical machines. This enables us to emulate,
    e.g., large data center networks. To test this approach, we additionally introduce
    a traffic generator for data center traffic. Since there are no data center traffic
    traces publicly available we use the results of two recent traffic studies to create
    synthetic traffic. We show the design and discuss some challenges we had in building
    our traffic generator. As a showcase for our work we emulated a data center consisting
    of 3200 hosts on a cluster of only 12 physical machines. We show the resulting
    workloads and the trade-offs involved.
author:
- first_name: Philip
  full_name: Wette, Philip
  last_name: Wette
- first_name: Martin
  full_name: Dräxler, Martin
  last_name: Dräxler
- first_name: Arne
  full_name: Schwabe, Arne
  last_name: Schwabe
- first_name: Felix
  full_name: Wallaschek, Felix
  last_name: Wallaschek
- first_name: Mohammad Hassan
  full_name: Zahraee, Mohammad Hassan
  last_name: Zahraee
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Wette P, Dräxler M, Schwabe A, Wallaschek F, Zahraee MH, Karl H. MaxiNet:
    Distributed Emulation of Software-Defined Networks. In: <i>Proceedings of the
    2014 IFIP Networking Conference (Networking 2014)</i>. ; 2014:1-9. doi:<a href="https://doi.org/10.1109/IFIPNetworking.2014.6857078">10.1109/IFIPNetworking.2014.6857078</a>'
  apa: 'Wette, P., Dräxler, M., Schwabe, A., Wallaschek, F., Zahraee, M. H., &#38;
    Karl, H. (2014). MaxiNet: Distributed Emulation of Software-Defined Networks.
    In <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>
    (pp. 1–9). <a href="https://doi.org/10.1109/IFIPNetworking.2014.6857078">https://doi.org/10.1109/IFIPNetworking.2014.6857078</a>'
  bibtex: '@inproceedings{Wette_Dräxler_Schwabe_Wallaschek_Zahraee_Karl_2014, title={MaxiNet:
    Distributed Emulation of Software-Defined Networks}, DOI={<a href="https://doi.org/10.1109/IFIPNetworking.2014.6857078">10.1109/IFIPNetworking.2014.6857078</a>},
    booktitle={Proceedings of the 2014 IFIP Networking Conference (Networking 2014)},
    author={Wette, Philip and Dräxler, Martin and Schwabe, Arne and Wallaschek, Felix
    and Zahraee, Mohammad Hassan and Karl, Holger}, year={2014}, pages={1–9} }'
  chicago: 'Wette, Philip, Martin Dräxler, Arne Schwabe, Felix Wallaschek, Mohammad
    Hassan Zahraee, and Holger Karl. “MaxiNet: Distributed Emulation of Software-Defined
    Networks.” In <i>Proceedings of the 2014 IFIP Networking Conference (Networking
    2014)</i>, 1–9, 2014. <a href="https://doi.org/10.1109/IFIPNetworking.2014.6857078">https://doi.org/10.1109/IFIPNetworking.2014.6857078</a>.'
  ieee: 'P. Wette, M. Dräxler, A. Schwabe, F. Wallaschek, M. H. Zahraee, and H. Karl,
    “MaxiNet: Distributed Emulation of Software-Defined Networks,” in <i>Proceedings
    of the 2014 IFIP Networking Conference (Networking 2014)</i>, 2014, pp. 1–9.'
  mla: 'Wette, Philip, et al. “MaxiNet: Distributed Emulation of Software-Defined
    Networks.” <i>Proceedings of the 2014 IFIP Networking Conference (Networking 2014)</i>,
    2014, pp. 1–9, doi:<a href="https://doi.org/10.1109/IFIPNetworking.2014.6857078">10.1109/IFIPNetworking.2014.6857078</a>.'
  short: 'P. Wette, M. Dräxler, A. Schwabe, F. Wallaschek, M.H. Zahraee, H. Karl,
    in: Proceedings of the 2014 IFIP Networking Conference (Networking 2014), 2014,
    pp. 1–9.'
date_created: 2017-10-17T12:41:56Z
date_updated: 2022-01-06T06:59:09Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/IFIPNetworking.2014.6857078
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:30:29Z
  date_updated: 2018-03-20T07:30:29Z
  file_id: '1425'
  file_name: 329-maxinet_networking14_01.pdf
  file_size: 786320
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:30:29Z
has_accepted_license: '1'
page: 1-9
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 2014 IFIP Networking Conference (Networking 2014)
status: public
title: 'MaxiNet: Distributed Emulation of Software-Defined Networks'
type: conference
user_id: '15572'
year: '2014'
...
---
_id: '336'
abstract:
- lang: eng
  text: Today, service compositions often need to be assembled or changed on-the-fly,
    which leaves only little time for quality assurance. Moreover, quality assurance
    is complicated by service providers only giving information on their services
    in terms of domain specific concepts with only limited semantic meaning. In this
    paper, we propose a method to construct service compositions based on pre-verifiedtemplates.
    Templates, given as workflow descriptions, are typed over a (domain-independent)
    template ontology defining concepts and predicates. Templates are proven correct
    using an abstract semantics, leaving the specific meaning of ontology concepts
    open, however, only up to given ontology rules. Construction of service compositions
    amounts to instantiation of templates with domain-specific services.Correctness
    of an instantiation can then simply be checked by verifying that the domain ontology(a)
    adheres to the rules of the template ontology, and (b) fulfills the constraints
    of the employed template.
author:
- first_name: Sven
  full_name: Walther, Sven
  last_name: Walther
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Walther S, Wehrheim H. Verified Service Compositions by Template-Based Construction.
    In: Lanese I, Madelaine E, eds. <i>Proceedings of the 11th International Symposium
    on Formal Aspects of Component Software (FACS)</i>. LNCS. ; 2014:31-48. doi:<a
    href="https://doi.org/10.1007/978-3-319-15317-9_3">10.1007/978-3-319-15317-9_3</a>'
  apa: Walther, S., &#38; Wehrheim, H. (2014). Verified Service Compositions by Template-Based
    Construction. In I. Lanese &#38; E. Madelaine (Eds.), <i>Proceedings of the 11th
    International Symposium on Formal Aspects of Component Software (FACS)</i> (pp.
    31–48). <a href="https://doi.org/10.1007/978-3-319-15317-9_3">https://doi.org/10.1007/978-3-319-15317-9_3</a>
  bibtex: '@inproceedings{Walther_Wehrheim_2014, series={LNCS}, title={Verified Service
    Compositions by Template-Based Construction}, DOI={<a href="https://doi.org/10.1007/978-3-319-15317-9_3">10.1007/978-3-319-15317-9_3</a>},
    booktitle={Proceedings of the 11th International Symposium on Formal Aspects of
    Component Software (FACS)}, author={Walther, Sven and Wehrheim, Heike}, editor={Lanese,
    Ivan and Madelaine, EricEditors}, year={2014}, pages={31–48}, collection={LNCS}
    }'
  chicago: Walther, Sven, and Heike Wehrheim. “Verified Service Compositions by Template-Based
    Construction.” In <i>Proceedings of the 11th International Symposium on Formal
    Aspects of Component Software (FACS)</i>, edited by Ivan Lanese and Eric Madelaine,
    31–48. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-15317-9_3">https://doi.org/10.1007/978-3-319-15317-9_3</a>.
  ieee: S. Walther and H. Wehrheim, “Verified Service Compositions by Template-Based
    Construction,” in <i>Proceedings of the 11th International Symposium on Formal
    Aspects of Component Software (FACS)</i>, 2014, pp. 31–48.
  mla: Walther, Sven, and Heike Wehrheim. “Verified Service Compositions by Template-Based
    Construction.” <i>Proceedings of the 11th International Symposium on Formal Aspects
    of Component Software (FACS)</i>, edited by Ivan Lanese and Eric Madelaine, 2014,
    pp. 31–48, doi:<a href="https://doi.org/10.1007/978-3-319-15317-9_3">10.1007/978-3-319-15317-9_3</a>.
  short: 'S. Walther, H. Wehrheim, in: I. Lanese, E. Madelaine (Eds.), Proceedings
    of the 11th International Symposium on Formal Aspects of Component Software (FACS),
    2014, pp. 31–48.'
date_created: 2017-10-17T12:41:57Z
date_updated: 2022-01-06T06:59:13Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-319-15317-9_3
editor:
- first_name: Ivan
  full_name: Lanese, Ivan
  last_name: Lanese
- first_name: Eric
  full_name: Madelaine, Eric
  last_name: Madelaine
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:29:29Z
  date_updated: 2018-03-20T07:29:29Z
  file_id: '1423'
  file_name: 336-facs2014_walther.pdf
  file_size: 484422
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:29:29Z
has_accepted_license: '1'
language:
- iso: eng
page: 31-48
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 11th International Symposium on Formal Aspects of
  Component Software (FACS)
series_title: LNCS
status: public
title: Verified Service Compositions by Template-Based Construction
type: conference
user_id: '477'
year: '2014'
...
---
_id: '339'
abstract:
- lang: eng
  text: 'Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established
    lightpaths in case notenough resources are available to set up a new lightpath
    in aWavelength Division Multiplexing (WDM) network. The selectionof lightpaths
    to be preempted relies on internal decisions of theRWA algorithm. Thus, if dedicated
    properties of the networktopology are required by the applications running on
    the network,these requirements have to be known to the RWA algorithm.We present
    a family of preemptive RWA algorithms for WDMnetworks. These algorithms have two
    distinguishing features: a)they can handle dynamic traffic by on-the-fly reconfiguration,and
    b) users can give feedback for reconfiguration decisions andthus influence the
    preemption decision of the RWA algorithm,leading to networks which adapt directly
    to application needs.This is different from traffic engineering where the network
    is(slowly) adapted to observed traffic patterns.Our algorithms handle various
    WDM network configurationsincluding networks consisting of heterogeneous WDM hardware.To
    this end, we are using the layered graph approach togetherwith a newly developed
    graph model that is used to determineconflicting lightpaths.'
author:
- first_name: Philip
  full_name: Wette, Philip
  last_name: Wette
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Wette P, Karl H. Using Application Layer Knowledge in Routing and Wavelength
    Assignment Algorithms. In: <i>Proceedings of the IEEE International Conference
    on Communications 2014</i>. ; 2014:3270-3276. doi:<a href="https://doi.org/10.1109/ICC.2014.6883825">10.1109/ICC.2014.6883825</a>'
  apa: Wette, P., &#38; Karl, H. (2014). Using Application Layer Knowledge in Routing
    and Wavelength Assignment Algorithms. In <i>Proceedings of the IEEE International
    Conference on Communications 2014</i> (pp. 3270–3276). <a href="https://doi.org/10.1109/ICC.2014.6883825">https://doi.org/10.1109/ICC.2014.6883825</a>
  bibtex: '@inproceedings{Wette_Karl_2014, title={Using Application Layer Knowledge
    in Routing and Wavelength Assignment Algorithms}, DOI={<a href="https://doi.org/10.1109/ICC.2014.6883825">10.1109/ICC.2014.6883825</a>},
    booktitle={Proceedings of the IEEE International Conference on Communications
    2014}, author={Wette, Philip and Karl, Holger}, year={2014}, pages={3270–3276}
    }'
  chicago: Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing
    and Wavelength Assignment Algorithms.” In <i>Proceedings of the IEEE International
    Conference on Communications 2014</i>, 3270–76, 2014. <a href="https://doi.org/10.1109/ICC.2014.6883825">https://doi.org/10.1109/ICC.2014.6883825</a>.
  ieee: P. Wette and H. Karl, “Using Application Layer Knowledge in Routing and Wavelength
    Assignment Algorithms,” in <i>Proceedings of the IEEE International Conference
    on Communications 2014</i>, 2014, pp. 3270–3276.
  mla: Wette, Philip, and Holger Karl. “Using Application Layer Knowledge in Routing
    and Wavelength Assignment Algorithms.” <i>Proceedings of the IEEE International
    Conference on Communications 2014</i>, 2014, pp. 3270–76, doi:<a href="https://doi.org/10.1109/ICC.2014.6883825">10.1109/ICC.2014.6883825</a>.
  short: 'P. Wette, H. Karl, in: Proceedings of the IEEE International Conference
    on Communications 2014, 2014, pp. 3270–3276.'
date_created: 2017-10-17T12:41:58Z
date_updated: 2022-01-06T06:59:14Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/ICC.2014.6883825
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:29:00Z
  date_updated: 2018-03-20T07:29:00Z
  file_id: '1422'
  file_name: 339-IEEE-WK-14.pdf
  file_size: 138062
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:29:00Z
has_accepted_license: '1'
page: 3270-3276
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subproject A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the IEEE International Conference on Communications 2014
status: public
title: Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '340'
author:
- first_name: Philipp
  full_name: Korth, Philipp
  last_name: Korth
citation:
  ama: Korth P. <i>Untersuchung transitiver Eigenschaften der Technik “Programs from
    Proofs.”</i> Universität Paderborn; 2014.
  apa: Korth, P. (2014). <i>Untersuchung transitiver Eigenschaften der Technik “Programs
    from Proofs.”</i> Universität Paderborn.
  bibtex: '@book{Korth_2014, title={Untersuchung transitiver Eigenschaften der Technik
    “Programs from Proofs”}, publisher={Universität Paderborn}, author={Korth, Philipp},
    year={2014} }'
  chicago: Korth, Philipp. <i>Untersuchung transitiver Eigenschaften der Technik “Programs
    from Proofs.”</i> Universität Paderborn, 2014.
  ieee: P. Korth, <i>Untersuchung transitiver Eigenschaften der Technik “Programs
    from Proofs.”</i> Universität Paderborn, 2014.
  mla: Korth, Philipp. <i>Untersuchung transitiver Eigenschaften der Technik “Programs
    from Proofs.”</i> Universität Paderborn, 2014.
  short: P. Korth, Untersuchung transitiver Eigenschaften der Technik “Programs from
    Proofs,” Universität Paderborn, 2014.
date_created: 2017-10-17T12:41:58Z
date_updated: 2022-01-06T06:59:14Z
department:
- _id: '77'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Heike
  full_name: Wehrheim, Heike
  last_name: Wehrheim
title: Untersuchung transitiver Eigenschaften der Technik "Programs from Proofs"
type: bachelorsthesis
user_id: '15504'
year: '2014'
...
---
_id: '343'
author:
- first_name: Jörn
  full_name: Künsemöller, Jörn
  last_name: Künsemöller
citation:
  ama: Künsemöller J. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
    Market</i>. Universität Paderborn; 2014.
  apa: Künsemöller, J. (2014). <i>Tragedy of the Common Cloud - Game Theory on the
    Infrastructure-as-a-Service Market</i>. Universität Paderborn.
  bibtex: '@book{Künsemöller_2014, title={Tragedy of the Common Cloud - Game Theory
    on the Infrastructure-as-a-Service Market}, publisher={Universität Paderborn},
    author={Künsemöller, Jörn}, year={2014} }'
  chicago: Künsemöller, Jörn. <i>Tragedy of the Common Cloud - Game Theory on the
    Infrastructure-as-a-Service Market</i>. Universität Paderborn, 2014.
  ieee: J. Künsemöller, <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
    Market</i>. Universität Paderborn, 2014.
  mla: Künsemöller, Jörn. <i>Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
    Market</i>. Universität Paderborn, 2014.
  short: J. Künsemöller, Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
    Market, Universität Paderborn, 2014.
date_created: 2017-10-17T12:41:58Z
date_updated: 2022-01-06T06:59:16Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:28:26Z
  date_updated: 2018-03-20T07:28:26Z
  file_id: '1421'
  file_name: 343-2014_Diss_Kuensemoeller.pdf
  file_size: 1378657
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:28:26Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
title: Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
  Market
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '344'
author:
- first_name: Matthias
  full_name: Becker, Matthias
  last_name: Becker
- first_name: Steffen
  full_name: Becker, Steffen
  last_name: Becker
- first_name: Galina
  full_name: Besova, Galina
  last_name: Besova
- first_name: Sven
  full_name: Walther, Sven
  last_name: Walther
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Becker M, Becker S, Besova G, Walther S, Wehrheim H. Towards Systematic Configuration
    for Architecture Validation. In: <i>Proceedings of the 40th Euromicro Conference
    on Software Engineering and Advanced Applications (Work in Progress Session)</i>.
    ; 2014.'
  apa: Becker, M., Becker, S., Besova, G., Walther, S., &#38; Wehrheim, H. (2014).
    Towards Systematic Configuration for Architecture Validation. In <i>Proceedings
    of the 40th Euromicro Conference on Software Engineering and Advanced Applications
    (Work in Progress Session)</i>.
  bibtex: '@inproceedings{Becker_Becker_Besova_Walther_Wehrheim_2014, title={Towards
    Systematic Configuration for Architecture Validation}, booktitle={Proceedings
    of the 40th Euromicro Conference on Software Engineering and Advanced Applications
    (Work in Progress Session)}, author={Becker, Matthias and Becker, Steffen and
    Besova, Galina and Walther, Sven and Wehrheim, Heike}, year={2014} }'
  chicago: Becker, Matthias, Steffen Becker, Galina Besova, Sven Walther, and Heike
    Wehrheim. “Towards Systematic Configuration for Architecture Validation.” In <i>Proceedings
    of the 40th Euromicro Conference on Software Engineering and Advanced Applications
    (Work in Progress Session)</i>, 2014.
  ieee: M. Becker, S. Becker, G. Besova, S. Walther, and H. Wehrheim, “Towards Systematic
    Configuration for Architecture Validation,” in <i>Proceedings of the 40th Euromicro
    Conference on Software Engineering and Advanced Applications (Work in Progress
    Session)</i>, 2014.
  mla: Becker, Matthias, et al. “Towards Systematic Configuration for Architecture
    Validation.” <i>Proceedings of the 40th Euromicro Conference on Software Engineering
    and Advanced Applications (Work in Progress Session)</i>, 2014.
  short: 'M. Becker, S. Becker, G. Besova, S. Walther, H. Wehrheim, in: Proceedings
    of the 40th Euromicro Conference on Software Engineering and Advanced Applications
    (Work in Progress Session), 2014.'
date_created: 2017-10-17T12:41:59Z
date_updated: 2022-01-06T06:59:17Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:27:54Z
  date_updated: 2018-03-20T07:27:54Z
  file_id: '1420'
  file_name: 344-paper_CAMERA_READY.pdf
  file_size: 80674
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:27:54Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 40th Euromicro Conference on Software Engineering
  and Advanced Applications (Work in Progress Session)
status: public
title: Towards Systematic Configuration for Architecture Validation
type: conference
user_id: '477'
year: '2014'
...
---
_id: '346'
abstract:
- lang: eng
  text: One future goal of service-oriented computing is to realize global markets
    of composed services. On such markets, service providers offer services that can
    be flexibly combined with each other. However, most often, market participants
    are not able to individually estimate the quality of traded services in advance.
    As a consequence, even potentially profitable transactions between customers and
    providers might not take place. In the worst case, this can induce a market failure.
    To overcome this problem, we propose the incorporation of reputation information
    as an indicator for expected service quality. We address On-The-Fly Computing
    as a representative environment of markets of composed services. In this environment,
    customers provide feedback on transactions. We present a conceptual design of
    a reputation system which collects and processes user feedback, and provides it
    to participants in the market. Our contribution includes the identification of
    requirements for such a reputation system from a technical and an economic perspective.
    Based on these requirements, we propose a flexible solution that facilitates the
    incorporation of reputation information into markets of composed services while
    simultaneously preserving privacy of customers who provide feedback. The requirements
    we formulate in this paper have just been partially met in literature. An integrated
    approach, however, has not been addressed yet.
author:
- first_name: Sonja
  full_name: Brangewitz, Sonja
  last_name: Brangewitz
- first_name: Alexander
  full_name: Jungmann, Alexander
  last_name: Jungmann
- first_name: Ronald
  full_name: Petrlic, Ronald
  last_name: Petrlic
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
citation:
  ama: 'Brangewitz S, Jungmann A, Petrlic R, Platenius MC. Towards a Flexible and
    Privacy-Preserving Reputation System for Markets of Composed Services. In: <i>Proceedings
    of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>.
    ; 2014:49-57.'
  apa: Brangewitz, S., Jungmann, A., Petrlic, R., &#38; Platenius, M. C. (2014). Towards
    a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.
    In <i>Proceedings of the 6th International Conferences on Advanced Service Computing
    (SERVICE COMPUTATION)</i> (pp. 49–57).
  bibtex: '@inproceedings{Brangewitz_Jungmann_Petrlic_Platenius_2014, title={Towards
    a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services},
    booktitle={Proceedings of the 6th International Conferences on Advanced Service
    Computing (SERVICE COMPUTATION)}, author={Brangewitz, Sonja and Jungmann, Alexander
    and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={49–57}
    }'
  chicago: Brangewitz, Sonja, Alexander Jungmann, Ronald Petrlic, and Marie Christin
    Platenius. “Towards a Flexible and Privacy-Preserving Reputation System for Markets
    of Composed Services.” In <i>Proceedings of the 6th International Conferences
    on Advanced Service Computing (SERVICE COMPUTATION)</i>, 49–57, 2014.
  ieee: S. Brangewitz, A. Jungmann, R. Petrlic, and M. C. Platenius, “Towards a Flexible
    and Privacy-Preserving Reputation System for Markets of Composed Services,” in
    <i>Proceedings of the 6th International Conferences on Advanced Service Computing
    (SERVICE COMPUTATION)</i>, 2014, pp. 49–57.
  mla: Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation
    System for Markets of Composed Services.” <i>Proceedings of the 6th International
    Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2014, pp.
    49–57.
  short: 'S. Brangewitz, A. Jungmann, R. Petrlic, M.C. Platenius, in: Proceedings
    of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION),
    2014, pp. 49–57.'
date_created: 2017-10-17T12:41:59Z
date_updated: 2022-01-06T06:59:18Z
ddc:
- '040'
department:
- _id: '205'
- _id: '76'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:26:49Z
  date_updated: 2018-03-20T07:26:49Z
  file_id: '1418'
  file_name: 346-service_computation_2014_3_10_10005.pdf
  file_size: 334101
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:26:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 49-57
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '10'
  name: SFB 901 - Subproject B2
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 6th International Conferences on Advanced Service
  Computing (SERVICE COMPUTATION)
status: public
title: Towards a Flexible and Privacy-Preserving Reputation System for Markets of
  Composed Services
type: conference
user_id: '477'
year: '2014'
...
---
_id: '347'
abstract:
- lang: eng
  text: Dynamic thread duplication is a known redundancy technique for multi-cores.
    The approach duplicates a thread under observation for some time period and compares
    the signatures of the two threads to detect errors. Hybrid multi-cores, typically
    implemented on platform FPGAs, enable the unique option of running the thread
    under observation and its copy in different modalities, i.e., software and hardware.
    We denote our dynamic redundancy technique on hybrid multi-cores as thread shadowing.
    In this paper we present the concept of thread shadowing and an implementation
    on a multi-threaded hybrid multi-core architecture. We report on experiments with
    a block-processing application and demonstrate the overheads, detection latencies
    and coverage for a range of thread shadowing modes. The results show that trans-modal
    thread shadowing, although bearing long detection latencies, offers attractive
    coverage at a low overhead.
author:
- first_name: Sebastian
  full_name: Meisner, Sebastian
  last_name: Meisner
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Meisner S, Platzner M. Thread Shadowing: Using Dynamic Redundancy on Hybrid
    Multi-cores for Error Detection. In: Goehringer D, Santambrogio M, Cardoso JP,
    Bertels K, eds. <i>Proceedings of the 10th International Symposium on Applied
    Reconfigurable Computing (ARC)</i>. Lecture Notes in Computer Science. Springer;
    2014:283-290. doi:<a href="https://doi.org/10.1007/978-3-319-05960-0_30">10.1007/978-3-319-05960-0_30</a>'
  apa: 'Meisner, S., &#38; Platzner, M. (2014). Thread Shadowing: Using Dynamic Redundancy
    on Hybrid Multi-cores for Error Detection. In D. Goehringer, M. Santambrogio,
    J. P. Cardoso, &#38; K. Bertels (Eds.), <i>Proceedings of the 10th International
    Symposium on Applied Reconfigurable Computing (ARC)</i> (pp. 283–290). Springer.
    <a href="https://doi.org/10.1007/978-3-319-05960-0_30">https://doi.org/10.1007/978-3-319-05960-0_30</a>'
  bibtex: '@inproceedings{Meisner_Platzner_2014, series={Lecture Notes in Computer
    Science}, title={Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores
    for Error Detection}, DOI={<a href="https://doi.org/10.1007/978-3-319-05960-0_30">10.1007/978-3-319-05960-0_30</a>},
    booktitle={Proceedings of the 10th International Symposium on Applied Reconfigurable
    Computing (ARC)}, publisher={Springer}, author={Meisner, Sebastian and Platzner,
    Marco}, editor={Goehringer, Diana and Santambrogio, MarcoDomenico and Cardoso,
    JoãoM.P. and Bertels, KoenEditors}, year={2014}, pages={283–290}, collection={Lecture
    Notes in Computer Science} }'
  chicago: 'Meisner, Sebastian, and Marco Platzner. “Thread Shadowing: Using Dynamic
    Redundancy on Hybrid Multi-Cores for Error Detection.” In <i>Proceedings of the
    10th International Symposium on Applied Reconfigurable Computing (ARC)</i>, edited
    by Diana Goehringer, MarcoDomenico Santambrogio, JoãoM.P. Cardoso, and Koen Bertels,
    283–90. Lecture Notes in Computer Science. Springer, 2014. <a href="https://doi.org/10.1007/978-3-319-05960-0_30">https://doi.org/10.1007/978-3-319-05960-0_30</a>.'
  ieee: 'S. Meisner and M. Platzner, “Thread Shadowing: Using Dynamic Redundancy on
    Hybrid Multi-cores for Error Detection,” in <i>Proceedings of the 10th International
    Symposium on Applied Reconfigurable Computing (ARC)</i>, 2014, pp. 283–290.'
  mla: 'Meisner, Sebastian, and Marco Platzner. “Thread Shadowing: Using Dynamic Redundancy
    on Hybrid Multi-Cores for Error Detection.” <i>Proceedings of the 10th International
    Symposium on Applied Reconfigurable Computing (ARC)</i>, edited by Diana Goehringer
    et al., Springer, 2014, pp. 283–90, doi:<a href="https://doi.org/10.1007/978-3-319-05960-0_30">10.1007/978-3-319-05960-0_30</a>.'
  short: 'S. Meisner, M. Platzner, in: D. Goehringer, M. Santambrogio, J.P. Cardoso,
    K. Bertels (Eds.), Proceedings of the 10th International Symposium on Applied
    Reconfigurable Computing (ARC), Springer, 2014, pp. 283–290.'
date_created: 2017-10-17T12:41:59Z
date_updated: 2022-01-06T06:59:18Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1007/978-3-319-05960-0_30
editor:
- first_name: Diana
  full_name: Goehringer, Diana
  last_name: Goehringer
- first_name: MarcoDomenico
  full_name: Santambrogio, MarcoDomenico
  last_name: Santambrogio
- first_name: JoãoM.P.
  full_name: Cardoso, JoãoM.P.
  last_name: Cardoso
- first_name: Koen
  full_name: Bertels, Koen
  last_name: Bertels
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:26:16Z
  date_updated: 2018-03-20T07:26:16Z
  file_id: '1417'
  file_name: 347-meisner13_xx_SFB1__1_.pdf
  file_size: 1168877
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:26:16Z
has_accepted_license: '1'
language:
- iso: eng
page: 283-290
project:
- _id: '1'
  name: SFB 901
- _id: '14'
  name: SFB 901 - Subprojekt C2
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 10th International Symposium on Applied Reconfigurable
  Computing (ARC)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error
  Detection'
type: conference
user_id: '398'
year: '2014'
...
---
_id: '353'
abstract:
- lang: eng
  text: 'There are many technologies for the automation of processesthat deal with
    services; examples are service discovery and composition.Automation of these processes
    requires that the services are described semantically. However, semantically described
    services are currently not oronly rarely available, which limits the applicability
    of discovery and composition approaches. The systematic support for creating new
    semanticservices usable by automated technologies is an open problem.We tackle
    this problem with a template based approach: Domain independent templates are
    instantiated with domain specific services andboolean expressions. The obtained
    services have semantic descriptionswhose correctness directly follows from the
    correctness of the template.Besides the theory, we present experimental results
    for a service repository in which 85% of the services were generated automatically.'
author:
- first_name: Felix
  full_name: Mohr, Felix
  last_name: Mohr
- first_name: Sven
  full_name: Walther, Sven
  last_name: Walther
citation:
  ama: 'Mohr F, Walther S. Template-based Generation of Semantic Services. In: <i>Proceedings
    of the 14th International Conference on Software Reuse (ICSR)</i>. LNCS. ; 2014:188-203.
    doi:<a href="https://doi.org/10.1007/978-3-319-14130-5_14">10.1007/978-3-319-14130-5_14</a>'
  apa: Mohr, F., &#38; Walther, S. (2014). Template-based Generation of Semantic Services.
    In <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>
    (pp. 188–203). <a href="https://doi.org/10.1007/978-3-319-14130-5_14">https://doi.org/10.1007/978-3-319-14130-5_14</a>
  bibtex: '@inproceedings{Mohr_Walther_2014, series={LNCS}, title={Template-based
    Generation of Semantic Services}, DOI={<a href="https://doi.org/10.1007/978-3-319-14130-5_14">10.1007/978-3-319-14130-5_14</a>},
    booktitle={Proceedings of the 14th International Conference on Software Reuse
    (ICSR)}, author={Mohr, Felix and Walther, Sven}, year={2014}, pages={188–203},
    collection={LNCS} }'
  chicago: Mohr, Felix, and Sven Walther. “Template-Based Generation of Semantic Services.”
    In <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>,
    188–203. LNCS, 2014. <a href="https://doi.org/10.1007/978-3-319-14130-5_14">https://doi.org/10.1007/978-3-319-14130-5_14</a>.
  ieee: F. Mohr and S. Walther, “Template-based Generation of Semantic Services,”
    in <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>,
    2014, pp. 188–203.
  mla: Mohr, Felix, and Sven Walther. “Template-Based Generation of Semantic Services.”
    <i>Proceedings of the 14th International Conference on Software Reuse (ICSR)</i>,
    2014, pp. 188–203, doi:<a href="https://doi.org/10.1007/978-3-319-14130-5_14">10.1007/978-3-319-14130-5_14</a>.
  short: 'F. Mohr, S. Walther, in: Proceedings of the 14th International Conference
    on Software Reuse (ICSR), 2014, pp. 188–203.'
date_created: 2017-10-17T12:42:00Z
date_updated: 2022-01-06T06:59:22Z
ddc:
- '040'
department:
- _id: '77'
- _id: '355'
doi: 10.1007/978-3-319-14130-5_14
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:23:32Z
  date_updated: 2018-03-20T07:23:32Z
  file_id: '1414'
  file_name: 353-icsr2015_submission_17.pdf
  file_size: 431778
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:23:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 188-203
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '10'
  name: SFB 901 - Subproject B2
publication: Proceedings of the 14th International Conference on Software Reuse (ICSR)
series_title: LNCS
status: public
title: Template-based Generation of Semantic Services
type: conference
user_id: '477'
year: '2014'
...
---
_id: '354'
abstract:
- lang: eng
  text: 'In distributed cloud computing, application deployment across multiple sites
    can improve quality of service. Recent research developed algorithms to find optimal
    locations for virtual machines. However, those algorithms assume to have either
    single-tier applications or a fixed number of virtual machines – a strong simplification
    of reality. This paper investigates the placement and scaling of complex application
    architectures. An application is dynamically scaled to fit both the current demand
    situation and the currently available infrastructure resources. We compare two
    approaches: The first one is based on virtual network embedding. The second approach
    is a novel method called Template Embedding. It is based on a hierarchical 1-allocation
    hub flow problem and combines applica- tion scaling and embedding in one step.
    Extensive experiments on 43200 network configurations showed that Template Embedding
    outperforms virtual network embedding in all cases in three metrics: success rate,
    solution quality, and runtime. This positive result shows that template embedding
    is a promising approach for distributed cloud resource allocation.'
author:
- first_name: Matthias
  full_name: Keller, Matthias
  last_name: Keller
- first_name: Christoph
  full_name: Robbert, Christoph
  last_name: Robbert
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Keller M, Robbert C, Karl H. Template Embedding: Using Application Architecture
    to Allocate Resources in Distributed Clouds. In: <i>Proceedings of 7th International
    Conference on Utility and Cloud Computing (UCC)</i>. ; 2014:387--395. doi:<a href="https://doi.org/10.1109/UCC.2014.49">10.1109/UCC.2014.49</a>'
  apa: 'Keller, M., Robbert, C., &#38; Karl, H. (2014). Template Embedding: Using
    Application Architecture to Allocate Resources in Distributed Clouds. In <i>Proceedings
    of 7th International Conference on Utility and Cloud Computing (UCC)</i> (pp.
    387--395). <a href="https://doi.org/10.1109/UCC.2014.49">https://doi.org/10.1109/UCC.2014.49</a>'
  bibtex: '@inproceedings{Keller_Robbert_Karl_2014, title={Template Embedding: Using
    Application Architecture to Allocate Resources in Distributed Clouds}, DOI={<a
    href="https://doi.org/10.1109/UCC.2014.49">10.1109/UCC.2014.49</a>}, booktitle={Proceedings
    of 7th International Conference on Utility and Cloud Computing (UCC)}, author={Keller,
    Matthias and Robbert, Christoph and Karl, Holger}, year={2014}, pages={387--395}
    }'
  chicago: 'Keller, Matthias, Christoph Robbert, and Holger Karl. “Template Embedding:
    Using Application Architecture to Allocate Resources in Distributed Clouds.” In
    <i>Proceedings of 7th International Conference on Utility and Cloud Computing
    (UCC)</i>, 387--395, 2014. <a href="https://doi.org/10.1109/UCC.2014.49">https://doi.org/10.1109/UCC.2014.49</a>.'
  ieee: 'M. Keller, C. Robbert, and H. Karl, “Template Embedding: Using Application
    Architecture to Allocate Resources in Distributed Clouds,” in <i>Proceedings of
    7th International Conference on Utility and Cloud Computing (UCC)</i>, 2014, pp.
    387--395.'
  mla: 'Keller, Matthias, et al. “Template Embedding: Using Application Architecture
    to Allocate Resources in Distributed Clouds.” <i>Proceedings of 7th International
    Conference on Utility and Cloud Computing (UCC)</i>, 2014, pp. 387--395, doi:<a
    href="https://doi.org/10.1109/UCC.2014.49">10.1109/UCC.2014.49</a>.'
  short: 'M. Keller, C. Robbert, H. Karl, in: Proceedings of 7th International Conference
    on Utility and Cloud Computing (UCC), 2014, pp. 387--395.'
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:22Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/UCC.2014.49
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:23:02Z
  date_updated: 2018-03-20T07:23:02Z
  file_id: '1413'
  file_name: 354-keller_ucc14_preprint_01.pdf
  file_size: 737652
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:23:02Z
has_accepted_license: '1'
page: 387--395
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of 7th International Conference on Utility and Cloud Computing
  (UCC)
status: public
title: 'Template Embedding: Using Application Architecture to Allocate Resources in
  Distributed Clouds'
type: conference
user_id: '15572'
year: '2014'
...
---
_id: '355'
abstract:
- lang: eng
  text: In the last decade pairings have become an important, and often indispensable,
    ingredient in the construction of identity-based and attribute-based cryptosystems,
    as well as group signatures and credential systems. Consequently, the applicability
    of timing, power, or fault attacks to implementations of pairings is an important
    research topic. We will review some of the known results in this area.
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Peter
  full_name: Günther, Peter
  last_name: Günther
- first_name: Gennadij
  full_name: Liske, Gennadij
  last_name: Liske
citation:
  ama: 'Blömer J, Günther P, Liske G. Tampering attacks in pairing-based cryptography.
    In: <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>.
    ; 2014:1--7. doi:<a href="https://doi.org/10.1109/FDTC.2014.10">10.1109/FDTC.2014.10</a>'
  apa: Blömer, J., Günther, P., &#38; Liske, G. (2014). Tampering attacks in pairing-based
    cryptography. In <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>
    (pp. 1--7). <a href="https://doi.org/10.1109/FDTC.2014.10">https://doi.org/10.1109/FDTC.2014.10</a>
  bibtex: '@inproceedings{Blömer_Günther_Liske_2014, title={Tampering attacks in pairing-based
    cryptography}, DOI={<a href="https://doi.org/10.1109/FDTC.2014.10">10.1109/FDTC.2014.10</a>},
    booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)},
    author={Blömer, Johannes and Günther, Peter and Liske, Gennadij}, year={2014},
    pages={1--7} }'
  chicago: Blömer, Johannes, Peter Günther, and Gennadij Liske. “Tampering Attacks
    in Pairing-Based Cryptography.” In <i>Proceedings of Fault Tolerance and Diagnosis
    in Cryptography(FDTC)</i>, 1--7, 2014. <a href="https://doi.org/10.1109/FDTC.2014.10">https://doi.org/10.1109/FDTC.2014.10</a>.
  ieee: J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,”
    in <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>,
    2014, pp. 1--7.
  mla: Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.”
    <i>Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)</i>, 2014,
    pp. 1--7, doi:<a href="https://doi.org/10.1109/FDTC.2014.10">10.1109/FDTC.2014.10</a>.
  short: 'J. Blömer, P. Günther, G. Liske, in: Proceedings of Fault Tolerance and
    Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.'
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:23Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1109/FDTC.2014.10
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:22:29Z
  date_updated: 2018-03-20T07:22:29Z
  file_id: '1412'
  file_name: 355-Bloemer2014.pdf
  file_size: 293394
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:22:29Z
has_accepted_license: '1'
page: 1--7
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '43'
  name: Securing the Financial Cloud
publication: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)
status: public
title: Tampering attacks in pairing-based cryptography
type: conference
user_id: '25078'
year: '2014'
...
---
_id: '360'
abstract:
- lang: eng
  text: 'Network appliances perform different functions on network flows and constitute
    an important part of an operator’s network. Normally, a set of chained network
    functions process network flows. Following the trend of virtualization of networks,
    virtualization of the network functions has also become a topic of interest. We
    define a model for formalizing the chaining of network functions using a context-free
    language. We process deployment requests and construct virtual network function
    graphs that can be mapped to the network. We describe the mapping as a Mixed Integer
    Quadratically Constrained Program (MIQCP) for finding the placement of the network
    functions and chaining them together considering the limited network resources
    and requirements of the functions. We have performed a Pareto set analysis to
    investigate the possible trade-offs between different optimization objectives. '
author:
- first_name: Sevil
  full_name: Dräxler, Sevil
  id: '31764'
  last_name: Dräxler
- first_name: Matthias
  full_name: Keller, Matthias
  last_name: Keller
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Dräxler S, Keller M, Karl H. Specifying and Placing Chains of Virtual Network
    Functions. In: <i>Proceedings of the 3rd International Conference on Cloud Networking
    (CloudNet)</i>. ; 2014:7-13. doi:<a href="https://doi.org/10.1109/CloudNet.2014.6968961">10.1109/CloudNet.2014.6968961</a>'
  apa: Dräxler, S., Keller, M., &#38; Karl, H. (2014). Specifying and Placing Chains
    of Virtual Network Functions. In <i>Proceedings of the 3rd International Conference
    on Cloud Networking (CloudNet)</i> (pp. 7–13). <a href="https://doi.org/10.1109/CloudNet.2014.6968961">https://doi.org/10.1109/CloudNet.2014.6968961</a>
  bibtex: '@inproceedings{Dräxler_Keller_Karl_2014, title={Specifying and Placing
    Chains of Virtual Network Functions}, DOI={<a href="https://doi.org/10.1109/CloudNet.2014.6968961">10.1109/CloudNet.2014.6968961</a>},
    booktitle={Proceedings of the 3rd International Conference on Cloud Networking
    (CloudNet)}, author={Dräxler, Sevil and Keller, Matthias and Karl, Holger}, year={2014},
    pages={7–13} }'
  chicago: Dräxler, Sevil, Matthias Keller, and Holger Karl. “Specifying and Placing
    Chains of Virtual Network Functions.” In <i>Proceedings of the 3rd International
    Conference on Cloud Networking (CloudNet)</i>, 7–13, 2014. <a href="https://doi.org/10.1109/CloudNet.2014.6968961">https://doi.org/10.1109/CloudNet.2014.6968961</a>.
  ieee: S. Dräxler, M. Keller, and H. Karl, “Specifying and Placing Chains of Virtual
    Network Functions,” in <i>Proceedings of the 3rd International Conference on Cloud
    Networking (CloudNet)</i>, 2014, pp. 7–13.
  mla: Dräxler, Sevil, et al. “Specifying and Placing Chains of Virtual Network Functions.”
    <i>Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)</i>,
    2014, pp. 7–13, doi:<a href="https://doi.org/10.1109/CloudNet.2014.6968961">10.1109/CloudNet.2014.6968961</a>.
  short: 'S. Dräxler, M. Keller, H. Karl, in: Proceedings of the 3rd International
    Conference on Cloud Networking (CloudNet), 2014, pp. 7–13.'
date_created: 2017-10-17T12:42:02Z
date_updated: 2022-01-06T06:59:27Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/CloudNet.2014.6968961
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:21:01Z
  date_updated: 2018-06-25T08:08:44Z
  file_id: '1409'
  file_name: 360-Mehr1410_Specifying_preprint_01.pdf
  file_size: 422019
  relation: main_file
file_date_updated: 2018-06-25T08:08:44Z
has_accepted_license: '1'
oa: '1'
page: 7-13
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 3rd International Conference on Cloud Networking (CloudNet)
status: public
title: Specifying and Placing Chains of Virtual Network Functions
type: conference
urn: '3601'
user_id: '31764'
year: '2014'
...
---
_id: '361'
author:
- first_name: Daniel
  full_name: Roeske, Daniel
  last_name: Roeske
citation:
  ama: Roeske D. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität
    Paderborn; 2014.
  apa: Roeske, D. (2014). <i>Simulating load-dependent operation of picocells</i>.
    Universität Paderborn.
  bibtex: '@book{Roeske_2014, title={Simulating load-dependent operation of picocells},
    publisher={Universität Paderborn}, author={Roeske, Daniel}, year={2014} }'
  chicago: Roeske, Daniel. <i>Simulating Load-Dependent Operation of Picocells</i>.
    Universität Paderborn, 2014.
  ieee: D. Roeske, <i>Simulating load-dependent operation of picocells</i>. Universität
    Paderborn, 2014.
  mla: Roeske, Daniel. <i>Simulating Load-Dependent Operation of Picocells</i>. Universität
    Paderborn, 2014.
  short: D. Roeske, Simulating Load-Dependent Operation of Picocells, Universität
    Paderborn, 2014.
date_created: 2017-10-17T12:42:02Z
date_updated: 2022-01-06T06:59:27Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Simulating load-dependent operation of picocells
type: bachelorsthesis
user_id: '15504'
year: '2014'
...
---
_id: '364'
abstract:
- lang: eng
  text: 'Today, software components are traded on markets in form of services. These
    services can also be service compositions consisting of several services. If a
    software architect wants to provide such a service composition in the market for
    trade, she needs to perform several tasks: she needs to model the composition,
    to discover existing services to be part of that composition, and to analyze the
    composition''s functional correctness as well as its quality, e.g., performance.
    Up to now, the architect needed to find and use different tools for these tasks.
    Typically, these tools are not interoperable with each other. We provide the tool
    SeSAME that supports a software architect in all of these tasks. SeSAME is an
    integrated Eclipse-based tool-suite providing a comprehensive service specification
    language to model service compositions and existing services. Furthermore, it
    includes modules for service matching, functional analysis, and non-functional
    analysis. SeSAME is the first tool that integrates all these tasks into one tool-suite
    and, thereby, provides holistic support for trading software services. Thus, it
    contributes to a software provider''s market success.'
author:
- first_name: Svetlana
  full_name: Arifulina, Svetlana
  last_name: Arifulina
- first_name: Matthias
  full_name: Becker, Matthias
  last_name: Becker
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
- first_name: Sven
  full_name: Walther, Sven
  last_name: Walther
citation:
  ama: 'Arifulina S, Becker M, Platenius MC, Walther S. SeSAME: Modeling and Analyzing
    High-Quality Service Compositions. In: <i>Proceedings of the 29th IEEE/ACM International
    Conference on Automated Software Engineering (ASE 2014)</i>. ; 2014:839-842. doi:<a
    href="https://doi.org/10.1145/2642937.2648621">10.1145/2642937.2648621</a>'
  apa: 'Arifulina, S., Becker, M., Platenius, M. C., &#38; Walther, S. (2014). SeSAME:
    Modeling and Analyzing High-Quality Service Compositions. In <i>Proceedings of
    the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE
    2014)</i> (pp. 839–842). <a href="https://doi.org/10.1145/2642937.2648621">https://doi.org/10.1145/2642937.2648621</a>'
  bibtex: '@inproceedings{Arifulina_Becker_Platenius_Walther_2014, title={SeSAME:
    Modeling and Analyzing High-Quality Service Compositions}, DOI={<a href="https://doi.org/10.1145/2642937.2648621">10.1145/2642937.2648621</a>},
    booktitle={Proceedings of the 29th IEEE/ACM International Conference on Automated
    Software Engineering (ASE 2014)}, author={Arifulina, Svetlana and Becker, Matthias
    and Platenius, Marie Christin and Walther, Sven}, year={2014}, pages={839–842}
    }'
  chicago: 'Arifulina, Svetlana, Matthias Becker, Marie Christin Platenius, and Sven
    Walther. “SeSAME: Modeling and Analyzing High-Quality Service Compositions.” In
    <i>Proceedings of the 29th IEEE/ACM International Conference on Automated Software
    Engineering (ASE 2014)</i>, 839–42, 2014. <a href="https://doi.org/10.1145/2642937.2648621">https://doi.org/10.1145/2642937.2648621</a>.'
  ieee: 'S. Arifulina, M. Becker, M. C. Platenius, and S. Walther, “SeSAME: Modeling
    and Analyzing High-Quality Service Compositions,” in <i>Proceedings of the 29th
    IEEE/ACM International Conference on Automated Software Engineering (ASE 2014)</i>,
    2014, pp. 839–842.'
  mla: 'Arifulina, Svetlana, et al. “SeSAME: Modeling and Analyzing High-Quality Service
    Compositions.” <i>Proceedings of the 29th IEEE/ACM International Conference on
    Automated Software Engineering (ASE 2014)</i>, 2014, pp. 839–42, doi:<a href="https://doi.org/10.1145/2642937.2648621">10.1145/2642937.2648621</a>.'
  short: 'S. Arifulina, M. Becker, M.C. Platenius, S. Walther, in: Proceedings of
    the 29th IEEE/ACM International Conference on Automated Software Engineering (ASE
    2014), 2014, pp. 839–842.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:28Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
doi: 10.1145/2642937.2648621
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:19:59Z
  date_updated: 2018-03-20T07:19:59Z
  file_id: '1407'
  file_name: 364-ASE2014.pdf
  file_size: 473308
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:19:59Z
has_accepted_license: '1'
language:
- iso: eng
page: 839-842
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '11'
  name: SFB 901 - Subproject B3
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 29th IEEE/ACM International Conference on Automated
  Software Engineering (ASE 2014)
status: public
title: 'SeSAME: Modeling and Analyzing High-Quality Service Compositions'
type: conference
user_id: '477'
year: '2014'
...
---
_id: '366'
abstract:
- lang: eng
  text: On-The-Fly (OTF) Computing constitutes an approach towards highly dynamic
    and individualized software markets. Based on service-oriented computing, OTF
    Computing is about realizing global markets of services that can be flexibly combined.
    We report on our current research activities, the security and privacy implications
    thereof, and our approaches to tackle the challenges. Furthermore, we discuss
    how the security and privacy challenges are addressed in research projects similar
    to OTF Computing.
author:
- first_name: Ronald
  full_name: Petrlic, Ronald
  last_name: Petrlic
- first_name: Alexander
  full_name: Jungmann, Alexander
  last_name: Jungmann
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
- first_name: Christoph
  full_name: Sorge, Christoph
  last_name: Sorge
citation:
  ama: 'Petrlic R, Jungmann A, Platenius MC, Schäfer W, Sorge C. Security and Privacy
    Challenges in On-The-Fly Computing. In: <i>Tagungsband Der 4. Konferenz Software-Technologien
    Und -Prozesse (STeP 2014)</i>. ; 2014:131-142.'
  apa: Petrlic, R., Jungmann, A., Platenius, M. C., Schäfer, W., &#38; Sorge, C. (2014).
    Security and Privacy Challenges in On-The-Fly Computing. In <i>Tagungsband der
    4. Konferenz Software-Technologien und -Prozesse (STeP 2014)</i> (pp. 131–142).
  bibtex: '@inproceedings{Petrlic_Jungmann_Platenius_Schäfer_Sorge_2014, title={Security
    and Privacy Challenges in On-The-Fly Computing}, booktitle={Tagungsband der 4.
    Konferenz Software-Technologien und -Prozesse (STeP 2014)}, author={Petrlic, Ronald
    and Jungmann, Alexander and Platenius, Marie Christin and Schäfer, Wilhelm and
    Sorge, Christoph}, year={2014}, pages={131–142} }'
  chicago: Petrlic, Ronald, Alexander Jungmann, Marie Christin Platenius, Wilhelm
    Schäfer, and Christoph Sorge. “Security and Privacy Challenges in On-The-Fly Computing.”
    In <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>,
    131–42, 2014.
  ieee: R. Petrlic, A. Jungmann, M. C. Platenius, W. Schäfer, and C. Sorge, “Security
    and Privacy Challenges in On-The-Fly Computing,” in <i>Tagungsband der 4. Konferenz
    Software-Technologien und -Prozesse (STeP 2014)</i>, 2014, pp. 131–142.
  mla: Petrlic, Ronald, et al. “Security and Privacy Challenges in On-The-Fly Computing.”
    <i>Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014)</i>,
    2014, pp. 131–42.
  short: 'R. Petrlic, A. Jungmann, M.C. Platenius, W. Schäfer, C. Sorge, in: Tagungsband
    Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014), 2014, pp. 131–142.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:29Z
ddc:
- '040'
department:
- _id: '76'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:18:47Z
  date_updated: 2018-03-20T07:18:47Z
  file_id: '1405'
  file_name: 366-otf-security-privacy-final.pdf
  file_size: 74488
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:18:47Z
has_accepted_license: '1'
language:
- iso: eng
page: 131-142
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '3'
  name: SFB 901 - Project Area B
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '10'
  name: SFB 901 - Subproject B2
publication: Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP
  2014)
status: public
title: Security and Privacy Challenges in On-The-Fly Computing
type: conference
user_id: '477'
year: '2014'
...
---
_id: '367'
abstract:
- lang: eng
  text: Online social networks are attracting billions of nowadays, both on a global
    scale as well as in social enterprise networks. Using distributed hash tables
    and peer-to-peer technology allows online social networks to be operated securely
    and efficiently only by using the resources of the user devices, thus alleviating
    censorship or data misuse by a single network operator. In this paper, we address
    the challenges that arise in implementing reliably and conveniently to use distributed
    data structures, such as lists or sets, in such a distributed hash-tablebased
    online social network. We present a secure, distributed list data structure that
    manages the list entries in several buckets in the distributed hash table. The
    list entries are authenticated, integrity is maintained and access control for
    single users and also groups is integrated. The approach for secure distributed
    lists is also applied for prefix trees and sets, and implemented and evaluated
    in a peer-to-peer framework for social networks. Evaluation shows that the distributed
    data structure is convenient and efficient to use and that the requirements on
    security hold.
author:
- first_name: Jens
  full_name: Janiuk, Jens
  last_name: Janiuk
- first_name: Alexander
  full_name: Mäcker, Alexander
  id: '13536'
  last_name: Mäcker
- first_name: Kalman
  full_name: Graffi, Kalman
  last_name: Graffi
citation:
  ama: 'Janiuk J, Mäcker A, Graffi K. Secure Distributed Data Structures for Peer-to-Peer-based
    Social Networks. In: <i>Proceedings of the International Conference on Collaboration
    Technologies and Systems (CTS)</i>. ; 2014:396-405. doi:<a href="https://doi.org/10.1109/CTS.2014.6867595">10.1109/CTS.2014.6867595</a>'
  apa: Janiuk, J., Mäcker, A., &#38; Graffi, K. (2014). Secure Distributed Data Structures
    for Peer-to-Peer-based Social Networks. In <i>Proceedings of the International
    Conference on Collaboration Technologies and Systems (CTS)</i> (pp. 396–405).
    <a href="https://doi.org/10.1109/CTS.2014.6867595">https://doi.org/10.1109/CTS.2014.6867595</a>
  bibtex: '@inproceedings{Janiuk_Mäcker_Graffi_2014, title={Secure Distributed Data
    Structures for Peer-to-Peer-based Social Networks}, DOI={<a href="https://doi.org/10.1109/CTS.2014.6867595">10.1109/CTS.2014.6867595</a>},
    booktitle={Proceedings of the International Conference on Collaboration Technologies
    and Systems (CTS)}, author={Janiuk, Jens and Mäcker, Alexander and Graffi, Kalman},
    year={2014}, pages={396–405} }'
  chicago: Janiuk, Jens, Alexander Mäcker, and Kalman Graffi. “Secure Distributed
    Data Structures for Peer-to-Peer-Based Social Networks.” In <i>Proceedings of
    the International Conference on Collaboration Technologies and Systems (CTS)</i>,
    396–405, 2014. <a href="https://doi.org/10.1109/CTS.2014.6867595">https://doi.org/10.1109/CTS.2014.6867595</a>.
  ieee: J. Janiuk, A. Mäcker, and K. Graffi, “Secure Distributed Data Structures for
    Peer-to-Peer-based Social Networks,” in <i>Proceedings of the International Conference
    on Collaboration Technologies and Systems (CTS)</i>, 2014, pp. 396–405.
  mla: Janiuk, Jens, et al. “Secure Distributed Data Structures for Peer-to-Peer-Based
    Social Networks.” <i>Proceedings of the International Conference on Collaboration
    Technologies and Systems (CTS)</i>, 2014, pp. 396–405, doi:<a href="https://doi.org/10.1109/CTS.2014.6867595">10.1109/CTS.2014.6867595</a>.
  short: 'J. Janiuk, A. Mäcker, K. Graffi, in: Proceedings of the International Conference
    on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:29Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/CTS.2014.6867595
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:18:12Z
  date_updated: 2018-03-20T07:18:12Z
  file_id: '1404'
  file_name: 367-cts_conf.pdf
  file_size: 647997
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:18:12Z
has_accepted_license: '1'
language:
- iso: eng
page: 396-405
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the International Conference on Collaboration Technologies
  and Systems (CTS)
status: public
title: Secure Distributed Data Structures for Peer-to-Peer-based Social Networks
type: conference
user_id: '477'
year: '2014'
...
---
_id: '368'
abstract:
- lang: eng
  text: We consider the problem of scheduling a number of jobs on $m$ identical processors
    sharing a continuously divisible resource. Each job j comes with a resource requirement
    r_j \in {0,1}. The job can be processed at full speed if granted its full resource
    requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction
    of the full speed. Our goal is to find a resource assignment that minimizes the
    makespan (i.e., the latest completion time). Variants of such problems, relating
    the resource assignment of jobs to their \emph{processing speeds}, have been studied
    under the term discrete-continuous scheduling. Known results are either very pessimistic
    or heuristic in nature.In this paper, we suggest and analyze a slightly simplified
    model. It focuses on the assignment of shared continuous resources to the processors.
    The job assignment to processors and the ordering of the jobs have already been
    fixed. It is shown that, even for unit size jobs, finding an optimal solution
    is NP-hard if the number of processors is part of the input. Positive results
    for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover,
    we prove that balanced schedules yield a 2-1/m-approximation for a fixed number
    of processors. Such schedules are computed by our GreedyBalance algorithm, for
    which the bound is tight.
author:
- first_name: Andre
  full_name: Brinkmann, Andre
  last_name: Brinkmann
- first_name: Peter
  full_name: Kling, Peter
  last_name: Kling
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Lars
  full_name: Nagel, Lars
  last_name: Nagel
- first_name: Sören
  full_name: Riechers, Sören
  last_name: Riechers
- first_name: 'Tim '
  full_name: 'Suess, Tim '
  last_name: Suess
citation:
  ama: 'Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Suess T.
    Scheduling Shared Continuous Resources on Many-Cores. In: <i>Proceedings of the
    26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>.
    ; 2014:128-137. doi:<a href="https://doi.org/10.1145/2612669.2612698">10.1145/2612669.2612698</a>'
  apa: Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S.,
    &#38; Suess, T. (2014). Scheduling Shared Continuous Resources on Many-Cores.
    <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, 128–137. <a href="https://doi.org/10.1145/2612669.2612698">https://doi.org/10.1145/2612669.2612698</a>
  bibtex: '@inproceedings{Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Suess_2014,
    title={Scheduling Shared Continuous Resources on Many-Cores}, DOI={<a href="https://doi.org/10.1145/2612669.2612698">10.1145/2612669.2612698</a>},
    booktitle={Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA)}, author={Brinkmann, Andre and Kling, Peter and Meyer
    auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim },
    year={2014}, pages={128–137} }'
  chicago: Brinkmann, Andre, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel,
    Sören Riechers, and Tim  Suess. “Scheduling Shared Continuous Resources on Many-Cores.”
    In <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, 128–37, 2014. <a href="https://doi.org/10.1145/2612669.2612698">https://doi.org/10.1145/2612669.2612698</a>.
  ieee: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, and
    T. Suess, “Scheduling Shared Continuous Resources on Many-Cores,” in <i>Proceedings
    of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>,
    2014, pp. 128–137, doi: <a href="https://doi.org/10.1145/2612669.2612698">10.1145/2612669.2612698</a>.'
  mla: Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
    <i>Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, 2014, pp. 128–37, doi:<a href="https://doi.org/10.1145/2612669.2612698">10.1145/2612669.2612698</a>.
  short: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, T.
    Suess, in: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
    and Architectures (SPAA), 2014, pp. 128–137.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2612669.2612698
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-20T07:17:38Z
  date_updated: 2018-03-20T07:17:38Z
  file_id: '1403'
  file_name: 368-BKMNRS14.pdf
  file_size: 485767
  relation: main_file
  success: 1
file_date_updated: 2018-03-20T07:17:38Z
has_accepted_license: '1'
language:
- iso: eng
page: 128-137
project:
- _id: '1'
  name: SFB 901
- _id: '16'
  name: SFB 901 - Subprojekt C4
- _id: '14'
  name: SFB 901 - Subproject C2
- _id: '4'
  name: SFB 901 - Project Area C
publication: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and
  Architectures (SPAA)
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '369'
abstract:
- lang: eng
  text: 'RSA Full Domain Hash ist im Zufallsorakelmodell ein EUF-CMA sicheres Signaturverfahren
    (existentially unforgeable under chosen-message attacks). Der Sicherheitsbeweis
    wird unter anderem in der Vorlesung Einf{\"u}hrung in die Kryptographie vorgestellt.
    Auch bei einer genaueren Analyse verliert man bei der Reduktion einen Faktor \nicefrac{1}{q_{s}}(wobei
    q_{s}die Anzahl der Anfragen an das Signaturorakel darstellt), was f{\"u}r die
    Praxis in relativ großen Systemparametern (RSA-Modul) resultiert [1].Seit der
    Ver{\"o}ffentlichung von [2] wurde geglaubt, dass der Faktor \nicefrac{1}{q_{s}}optimal
    ist. Erst zehn Jahre sp{\"a}ter offenbarten die Autoren von [3] einen Fehler in
    [2] und zeigten eine bessere Reduktion allerdings unter einer etwas st{\"a}rkeren
    Sicherheitsannahme.Die Ergebnisse aus [3] lassen sich auf PSS-Verfahren (Probabilistic
    Signature Scheme), das z.B. in PKCS #1 benutzt wird, {\"u}bertragen und sind somit
    von großer Bedeutung f{\"u}r die Praxis. Weiterhin sind die in den Beweisen verwendete
    Techniken n{\"u}tzlich auch bei anderen kryptographischen Verfahren.In Rahmen
    dieser Arbeit sollen die entsprechenden Sicherheitsbeweise aufgearbeitet und dessen
    Auswirkungen f{\"u}r die Praxis analysiert werden.[1] J.S. Coron, “On the Exact
    Security of Full Domain Hash”, CRYPTO 2000. LNCS 1880, pp. 229-235, 2000.[2] J.S.
    Coron, “Optimal security proofs for PPS and other signature schemes”, EUROCRYPT
    2002. LNCS 2332, pp 272-287, 2002.[3] S.A. Kakvi and E. Kiltz, “Optimal Security
    Proofs for Full Domain Hash, Revisited”, in EUROCRYPT 2012. LNCS 7237, pp 537-553,
    2012.'
author:
- first_name: Timo
  full_name: Rath, Timo
  last_name: Rath
citation:
  ama: Rath T. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn; 2014.
  apa: Rath, T. (2014). <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn.
  bibtex: '@book{Rath_2014, title={RSA-Full Domain Hash Revisited}, publisher={Universität
    Paderborn}, author={Rath, Timo}, year={2014} }'
  chicago: Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn,
    2014.
  ieee: T. Rath, <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.
  mla: Rath, Timo. <i>RSA-Full Domain Hash Revisited</i>. Universität Paderborn, 2014.
  short: T. Rath, RSA-Full Domain Hash Revisited, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:30Z
department:
- _id: '64'
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: RSA-Full Domain Hash Revisited
type: bachelorsthesis
user_id: '477'
year: '2014'
...