---
_id: '472'
author:
- first_name: Marco
full_name: Engelbrecht, Marco
last_name: Engelbrecht
citation:
ama: Engelbrecht M. Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn; 2013.
apa: Engelbrecht, M. (2013). Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn.
bibtex: '@book{Engelbrecht_2013, title={Vergleichsstudie zur Ausdrucksstärke von
SMT-Solvern}, publisher={Universität Paderborn}, author={Engelbrecht, Marco},
year={2013} }'
chicago: Engelbrecht, Marco. Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn, 2013.
ieee: M. Engelbrecht, Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn, 2013.
mla: Engelbrecht, Marco. Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern.
Universität Paderborn, 2013.
short: M. Engelbrecht, Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:19Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '11'
name: SFB 901 - Subprojekt B3
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Vergleichsstudie zur Ausdrucksstärke von SMT-Solvern
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '473'
abstract:
- lang: eng
text: We present a solution to the problem of privacy invasion in a multiparty digital
rights management scheme. (Roaming) users buy content licenses from a content
provider and execute it at any nearby content distributor. Our approach, which
does not need any trusted third party - in contrast to most related work on privacy-preserving
DRM - is based on a re-encryption scheme that runs on any mobile Android device.
Only a minor security-critical part needs to be performed on the device's smartcard
which could, for instance, be a SIM card.
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Stephan
full_name: Sekula, Stephan
last_name: Sekula
citation:
ama: 'Petrlic R, Sekula S. Unlinkable content playbacks in a multiparty DRM system.
In: Wang L, Shafiq B, eds. Data and Applications Security and Privacy XXVII.
Lecture Notes in Computer Science. ; 2013:289-296. doi:10.1007/978-3-642-39256-6_21'
apa: Petrlic, R., & Sekula, S. (2013). Unlinkable content playbacks in a multiparty
DRM system. In L. Wang & B. Shafiq (Eds.), Data and Applications Security
and Privacy XXVII (pp. 289–296). https://doi.org/10.1007/978-3-642-39256-6_21
bibtex: '@inproceedings{Petrlic_Sekula_2013, series={Lecture Notes in Computer Science},
title={Unlinkable content playbacks in a multiparty DRM system}, DOI={10.1007/978-3-642-39256-6_21},
booktitle={Data and Applications Security and Privacy XXVII}, author={Petrlic,
Ronald and Sekula, Stephan}, editor={Wang, Lingyu and Shafiq, BasitEditors}, year={2013},
pages={289–296}, collection={Lecture Notes in Computer Science} }'
chicago: Petrlic, Ronald, and Stephan Sekula. “Unlinkable Content Playbacks in a
Multiparty DRM System.” In Data and Applications Security and Privacy XXVII,
edited by Lingyu Wang and Basit Shafiq, 289–96. Lecture Notes in Computer Science,
2013. https://doi.org/10.1007/978-3-642-39256-6_21.
ieee: R. Petrlic and S. Sekula, “Unlinkable content playbacks in a multiparty DRM
system,” in Data and Applications Security and Privacy XXVII, 2013, pp.
289–296.
mla: Petrlic, Ronald, and Stephan Sekula. “Unlinkable Content Playbacks in a Multiparty
DRM System.” Data and Applications Security and Privacy XXVII, edited by
Lingyu Wang and Basit Shafiq, 2013, pp. 289–96, doi:10.1007/978-3-642-39256-6_21.
short: 'R. Petrlic, S. Sekula, in: L. Wang, B. Shafiq (Eds.), Data and Applications
Security and Privacy XXVII, 2013, pp. 289–296.'
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:19Z
ddc:
- '040'
doi: 10.1007/978-3-642-39256-6_21
editor:
- first_name: Lingyu
full_name: Wang, Lingyu
last_name: Wang
- first_name: Basit
full_name: Shafiq, Basit
last_name: Shafiq
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:17:30Z
date_updated: 2018-03-16T11:17:30Z
file_id: '1330'
file_name: 473-drm-general-1-camera-ready.pdf
file_size: 286049
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:17:30Z
has_accepted_license: '1'
page: 289-296
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Data and Applications Security and Privacy XXVII
series_title: Lecture Notes in Computer Science
status: public
title: Unlinkable content playbacks in a multiparty DRM system
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '474'
abstract:
- lang: eng
text: Suppose some individuals are allowed to engage in different groups at the
same time and they generate a certain welfare by cooperation. Finding appropriate
ways for distributing this welfare is a non-trivial issue. The purpose of this
work is to analyze two-stage allocation procedures where first each group receives
a share of the welfare which is then, subsequently, distributed among the corresponding
members. To study these procedures in a structured way, cooperative games and
network games are combined in a general framework by using mathematical hypergraphs.
Moreover, several convincing requirements on allocation procedures are discussed
and formalized. Thereby it will be shown, for example, that the Position Value
and iteratively applying the Myerson Value can be characterized by similar axiomatizations.
author:
- first_name: Nils
full_name: Röhl, Nils
last_name: Röhl
citation:
ama: Röhl N. Two-Stage Allocation Procedures. Universität Paderborn; 2013.
apa: Röhl, N. (2013). Two-Stage Allocation Procedures. Universität Paderborn.
bibtex: '@book{Röhl_2013, title={Two-Stage Allocation Procedures}, publisher={Universität
Paderborn}, author={Röhl, Nils}, year={2013} }'
chicago: Röhl, Nils. Two-Stage Allocation Procedures. Universität Paderborn,
2013.
ieee: N. Röhl, Two-Stage Allocation Procedures. Universität Paderborn, 2013.
mla: Röhl, Nils. Two-Stage Allocation Procedures. Universität Paderborn,
2013.
short: N. Röhl, Two-Stage Allocation Procedures, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:20Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:16:59Z
date_updated: 2018-03-16T11:16:59Z
file_id: '1329'
file_name: 474-WP73.pdf
file_size: 424301
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:16:59Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Two-Stage Allocation Procedures
type: report
user_id: '477'
year: '2013'
...
---
_id: '475'
abstract:
- lang: eng
text: We propose a privacy-preserving digital rights management scheme for (future)
cloud computing. Users buy software from software providers and execute it at
computing centers. Our solution allows software providers to provide different
license models, like execute at most n-times models. Users’ anonymity and unlinkability
of actions are preserved and thus, profile building is not even possible under
(a) pseudonym. Privacy protection in the honest-but-curious model is achieved
by combining ring signatures with an anonymous recipient scheme.We employ secret
sharing in a unique manner that allows the software provider to expose the user’s
identity if the user commits fraud, e.g. by exceeding the execution limit n.
author:
- first_name: Nakul
full_name: Joshi, Nakul
last_name: Joshi
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
citation:
ama: 'Joshi N, Petrlic R. Towards practical privacy-preserving Digital Rights Management
for Cloud Computing. In: Proceedings of the 10th Annual IEEE Consumer Communications
& Networking Conference (CCNC). ; 2013:259-264. doi:10.1109/CCNC.2013.6488456'
apa: Joshi, N., & Petrlic, R. (2013). Towards practical privacy-preserving Digital
Rights Management for Cloud Computing. In Proceedings of the 10th Annual IEEE
Consumer Communications & Networking Conference (CCNC) (pp. 259–264).
https://doi.org/10.1109/CCNC.2013.6488456
bibtex: '@inproceedings{Joshi_Petrlic_2013, title={Towards practical privacy-preserving
Digital Rights Management for Cloud Computing}, DOI={10.1109/CCNC.2013.6488456},
booktitle={Proceedings of the 10th Annual IEEE Consumer Communications & Networking
Conference (CCNC)}, author={Joshi, Nakul and Petrlic, Ronald}, year={2013}, pages={259–264}
}'
chicago: Joshi, Nakul, and Ronald Petrlic. “Towards Practical Privacy-Preserving
Digital Rights Management for Cloud Computing.” In Proceedings of the 10th
Annual IEEE Consumer Communications & Networking Conference (CCNC), 259–64,
2013. https://doi.org/10.1109/CCNC.2013.6488456.
ieee: N. Joshi and R. Petrlic, “Towards practical privacy-preserving Digital Rights
Management for Cloud Computing,” in Proceedings of the 10th Annual IEEE Consumer
Communications & Networking Conference (CCNC), 2013, pp. 259–264.
mla: Joshi, Nakul, and Ronald Petrlic. “Towards Practical Privacy-Preserving Digital
Rights Management for Cloud Computing.” Proceedings of the 10th Annual IEEE
Consumer Communications & Networking Conference (CCNC), 2013, pp. 259–64,
doi:10.1109/CCNC.2013.6488456.
short: 'N. Joshi, R. Petrlic, in: Proceedings of the 10th Annual IEEE Consumer Communications
& Networking Conference (CCNC), 2013, pp. 259–264.'
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
doi: 10.1109/CCNC.2013.6488456
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:16:29Z
date_updated: 2018-03-16T11:16:29Z
file_id: '1328'
file_name: 475-privacy-drm-cloud-5.pdf
file_size: 370473
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:16:29Z
has_accepted_license: '1'
page: 259-264
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual IEEE Consumer Communications & Networking
Conference (CCNC)
status: public
title: Towards practical privacy-preserving Digital Rights Management for Cloud Computing
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '476'
abstract:
- lang: eng
text: 'An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint
paths between a source and a sink, each path carrying a unit of ow, and an h-route
ow is a non-negative linear combination of elementary h-routeows. An h-route cut
is a set of edges whose removal decreases the maximum h-route ow between a given
source-sink pair (or between every source-sink pair in the multicommodity setting)
to zero. The main result of this paper is an approximate duality theorem for multicommodity
h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h
and at most O(log4 k f) where f is the size of the maximum h-routeow and k is
the number of commodities. The main step towards the proof of this duality is
the design and analysis of a polynomial-time approximation algorithm for the minimum
h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously,
polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient
of our algorithm is a novel rounding technique that we call multilevel ball-growing.
Though the proof of the duality relies on this algorithm, it is not a straightforward
corollary of it as in the case of classical multicommodity ows and cuts. Similar
results are shown also for the sparsest multiroute cut problem.'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts
and Flows: Multilevel Ball-Growing. Theory of Computing Systems. 2013;(2):341-363.
doi:10.1007/s00224-013-9454-3'
apa: 'Kolman, P., & Scheideler, C. (2013). Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory of Computing Systems,
(2), 341–363. https://doi.org/10.1007/s00224-013-9454-3'
bibtex: '@article{Kolman_Scheideler_2013, title={Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={10.1007/s00224-013-9454-3},
number={2}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kolman,
Petr and Scheideler, Christian}, year={2013}, pages={341–363} }'
chicago: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems,
no. 2 (2013): 341–63. https://doi.org/10.1007/s00224-013-9454-3.'
ieee: 'P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute
Cuts and Flows: Multilevel Ball-Growing,” Theory of Computing Systems,
no. 2, pp. 341–363, 2013.'
mla: 'Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity
Multiroute Cuts and Flows: Multilevel Ball-Growing.” Theory of Computing Systems,
no. 2, Springer, 2013, pp. 341–63, doi:10.1007/s00224-013-9454-3.'
short: P. Kolman, C. Scheideler, Theory of Computing Systems (2013) 341–363.
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-013-9454-3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:07:18Z
date_updated: 2018-03-15T14:07:18Z
file_id: '1326'
file_name: 476-tocsrevised3b.pdf
file_size: 264308
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:07:18Z
has_accepted_license: '1'
issue: '2'
page: 341-363
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: 'Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing'
type: journal_article
user_id: '477'
year: '2013'
...
---
_id: '477'
abstract:
- lang: eng
text: We consider the k-token dissemination problem, where k initially arbitrarily
distributed tokens have to be disseminated to all nodes in a dynamic network (as
introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks,
our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean
plane and two nodes are connected if and only if their distance is at most R.
Our worst-case adversary is allowed to move the nodes on the plane, but the maximum
velocity v_max of each node is limited and the graph must be connected in each
round. For this model, we provide almost tight lower and upper bounds for k-token
dissemination if nodes are restricted to send only one token per round. It turns
out that the maximum velocity v_max is a meaningful parameter to characterize
dynamics in our model.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F.
Token Dissemination in Geometric Dynamic Networks. In: Algorithms for Sensor
Systems - 9th International Symposium on Algorithms and Experiments for Sensor
Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia
Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes
in Computer Science. ; 2013:22-34. doi:10.1007/978-3-642-45346-5_3'
apa: Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., & Meyer auf
der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
(pp. 22–34). https://doi.org/10.1007/978-3-642-45346-5_3
bibtex: '@inproceedings{Abshoff_Benter_Cord-Landwehr_Malatyali_Meyer auf der Heide_2013,
series={Lecture Notes in Computer Science}, title={Token Dissemination in Geometric
Dynamic Networks}, DOI={10.1007/978-3-642-45346-5_3},
booktitle={Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers}, author={Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={22–34},
collection={Lecture Notes in Computer Science} }'
chicago: Abshoff, Sebastian, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali,
and Friedhelm Meyer auf der Heide. “Token Dissemination in Geometric Dynamic Networks.”
In Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 22–34. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-45346-5_3.
ieee: S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der
Heide, “Token Dissemination in Geometric Dynamic Networks,” in Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013,
Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013,
pp. 22–34.
mla: Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.”
Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers,
2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.
short: 'S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, F. Meyer auf der
Heide, in: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 2013, pp. 22–34.'
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:38Z
date_updated: 2018-03-15T14:06:38Z
file_id: '1325'
file_name: 477-geometric-dynamic-networks_01.pdf
file_size: 193169
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:38Z
has_accepted_license: '1'
page: 22-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers
series_title: Lecture Notes in Computer Science
status: public
title: Token Dissemination in Geometric Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '478'
abstract:
- lang: eng
text: 'Software systems are playing an increasing role in our everyday life, and
as the amount of software applications grows, so does their complexity and the
relevance of their computations. Software components can be found in many systems
that are charged with safety-critical tasks, such as control systems for aviation
or power plants. Hence, software verification techniques that are capable of proving
the absence of critical errors are becoming more and more important in the field
software engineering. A well-established approach to software verification is
model checking. Applying this technique involves an exhaustive exploration of
a state space model corresponding to the system under consideration. The major
challenge in model checking is the so-called state explosion problem: The state
space of a software system grows exponentially with its size. Thus, the straightforward
modelling of real-life systems practically impossible. A common approach to this
problem is the application of abstraction techniques, which reduce the original
state space by mapping it on a significantly smaller abstract one. Abstraction
inherently involves a loss of information, and thus, the resulting abstract model
may be too imprecise for a definite result in verification. Therefore, abstraction
is typically combined with abstraction refinement: An initially very coarse abstract
model is iteratively refined, i.e. enriched with new details about the original
system, until a level of abstraction is reached that is precise enough for a definite
outcome. Abstraction refinement-based model checking is fully automatable and
it is considered as one of the most promising approaches to the state explosion
problem in verification. However, it is still faced with a number of challenges.
There exist several types of abstraction techniques and not every type is equally
well-suited for all kinds of systems and verification tasks. Moreover, the selection
of adequate refinement steps is nontrivial and typically the most crucial part
of the overall approach: Unfavourable refinement decisions can compromise the
state space-reducing effect of abstraction, and as a consequence, can easily lead
to the failure of verification. It is, however, hard to predict which refinement
steps will eventually be expedient for verification – and which not.'
author:
- first_name: Nils
full_name: Timm, Nils
last_name: Timm
citation:
ama: Timm N. Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems. Universität Paderborn; 2013.
apa: Timm, N. (2013). Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems. Universität Paderborn.
bibtex: '@book{Timm_2013, title={Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems}, publisher={Universität Paderborn}, author={Timm,
Nils}, year={2013} }'
chicago: Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement
for Verifying Concurrent Systems. Universität Paderborn, 2013.
ieee: N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems. Universität Paderborn, 2013.
mla: Timm, Nils. Three-Valued Abstraction and Heuristic-Guided Refinement for
Verifying Concurrent Systems. Universität Paderborn, 2013.
short: N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying
Concurrent Systems, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:22Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:05Z
date_updated: 2018-03-15T14:06:05Z
file_id: '1324'
file_name: 478-Dissertation-Timm.pdf
file_size: 931458
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:05Z
has_accepted_license: '1'
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
id: '573'
last_name: Wehrheim
title: Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent
Systems
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '480'
abstract:
- lang: eng
text: Although of considerable practical importance, the separate impact of individual
and collective reputation on firm performance (e.g. product prices) has not yet
been convincingly demonstrated. We use a sample of some 70 different wineries
offering more than 1,300 different Riesling wines from the Mosel valley to isolate
the returns to individual reputation (measured by expert ratings in a highly respected
wine guide) from the returns to collective reputation (measured by membership
in two different professional associations where members are assumed to monitor
each other very closely). We find that both effects are statistically significant
and economically relevant with the latter being more important in quantitative
terms than the former.
author:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
- first_name: Robert
full_name: Simmons, Robert
last_name: Simmons
citation:
ama: 'Frick B, Simmons R. The Impact of Individual and Collective Reputation on
Wine Prices: Empirical Evidence from the Mosel Valley. Journal of Business
Economics. 2013;83(2):101-119. doi:10.1007/s11573-013-0652-x'
apa: 'Frick, B., & Simmons, R. (2013). The Impact of Individual and Collective
Reputation on Wine Prices: Empirical Evidence from the Mosel Valley. Journal
of Business Economics, 83(2), 101–119. https://doi.org/10.1007/s11573-013-0652-x'
bibtex: '@article{Frick_Simmons_2013, title={The Impact of Individual and Collective
Reputation on Wine Prices: Empirical Evidence from the Mosel Valley}, volume={83},
DOI={10.1007/s11573-013-0652-x},
number={2}, journal={Journal of Business Economics}, publisher={Springer}, author={Frick,
Bernd and Simmons, Robert}, year={2013}, pages={101–119} }'
chicago: 'Frick, Bernd, and Robert Simmons. “The Impact of Individual and Collective
Reputation on Wine Prices: Empirical Evidence from the Mosel Valley.” Journal
of Business Economics 83, no. 2 (2013): 101–19. https://doi.org/10.1007/s11573-013-0652-x.'
ieee: 'B. Frick and R. Simmons, “The Impact of Individual and Collective Reputation
on Wine Prices: Empirical Evidence from the Mosel Valley,” Journal of Business
Economics, vol. 83, no. 2, pp. 101–119, 2013.'
mla: 'Frick, Bernd, and Robert Simmons. “The Impact of Individual and Collective
Reputation on Wine Prices: Empirical Evidence from the Mosel Valley.” Journal
of Business Economics, vol. 83, no. 2, Springer, 2013, pp. 101–19, doi:10.1007/s11573-013-0652-x.'
short: B. Frick, R. Simmons, Journal of Business Economics 83 (2013) 101–119.
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:24Z
ddc:
- '040'
department:
- _id: '183'
doi: 10.1007/s11573-013-0652-x
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:02:36Z
date_updated: 2018-03-15T14:02:36Z
file_id: '1322'
file_name: 480-Frick.pdf
file_size: 371437
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:02:36Z
has_accepted_license: '1'
intvolume: ' 83'
issue: '2'
language:
- iso: eng
page: 101-119
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '8'
name: SFB 901 - Subproject A4
- _id: '2'
name: SFB 901 - Project Area A
publication: Journal of Business Economics
publisher: Springer
status: public
title: 'The Impact of Individual and Collective Reputation on Wine Prices: Empirical
Evidence from the Mosel Valley'
type: journal_article
user_id: '477'
volume: 83
year: '2013'
...
---
_id: '481'
abstract:
- lang: eng
text: Cloud computing offers high availability, dynamic scalability, and elasticity
requiring only very little administration. However, this service comes with financial
costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot
match the quality of service of the cloud. This paper focuses on the case study
of Wikipedia and presents an approach to reduce the operational costs of hosting
similar websites in the cloud by using a practical peer-to-peer approach. The
visitors of the site are joining a Chord overlay, which acts as first cache for
article lookups. Simulation results show, that up to 72% of the article lookups
in Wikipedia could be answered by other visitors instead of using the cloud.
author:
- first_name: Kalman
full_name: Graffi, Kalman
last_name: Graffi
- first_name: Lars
full_name: Bremer, Lars
last_name: Bremer
citation:
ama: 'Graffi K, Bremer L. Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia
Case. In: Proceedings of the International Conference on Communications (ICC’13).
; 2013:3444-3449. doi:10.1109/ICC.2013.6655082'
apa: 'Graffi, K., & Bremer, L. (2013). Symbiotic Coupling of P2P and Cloud Systems:
The Wikipedia Case. In Proceedings of the International Conference on Communications
(ICC’13) (pp. 3444–3449). https://doi.org/10.1109/ICC.2013.6655082'
bibtex: '@inproceedings{Graffi_Bremer_2013, title={Symbiotic Coupling of P2P and
Cloud Systems: The Wikipedia Case}, DOI={10.1109/ICC.2013.6655082},
booktitle={Proceedings of the International Conference on Communications (ICC’13)},
author={Graffi, Kalman and Bremer, Lars}, year={2013}, pages={3444–3449} }'
chicago: 'Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud
Systems: The Wikipedia Case.” In Proceedings of the International Conference
on Communications (ICC’13), 3444–49, 2013. https://doi.org/10.1109/ICC.2013.6655082.'
ieee: 'K. Graffi and L. Bremer, “Symbiotic Coupling of P2P and Cloud Systems: The
Wikipedia Case,” in Proceedings of the International Conference on Communications
(ICC’13), 2013, pp. 3444–3449.'
mla: 'Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud Systems:
The Wikipedia Case.” Proceedings of the International Conference on Communications
(ICC’13), 2013, pp. 3444–49, doi:10.1109/ICC.2013.6655082.'
short: 'K. Graffi, L. Bremer, in: Proceedings of the International Conference on
Communications (ICC’13), 2013, pp. 3444–3449.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:25Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/ICC.2013.6655082
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:02:01Z
date_updated: 2018-03-15T14:02:01Z
file_id: '1321'
file_name: 481-Symbiotic.Coupling.of.P2P.and.Cloud.Systems.The.Wikipedia.Case2.pdf
file_size: 1405789
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:02:01Z
has_accepted_license: '1'
language:
- iso: eng
page: '3444 - 3449 '
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 Communications (ICC'13)
status: public
title: 'Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case'
type: conference
user_id: '477'
year: '2013'
...
---
_id: '482'
author:
- first_name: Maarten
full_name: Bieshaar, Maarten
last_name: Bieshaar
citation:
ama: Bieshaar M. Statistisches Planen von Aktionen für autonome mobile Roboter
in realen Umgebungen. Universität Paderborn; 2013.
apa: Bieshaar, M. (2013). Statistisches Planen von Aktionen für autonome mobile
Roboter in realen Umgebungen. Universität Paderborn.
bibtex: '@book{Bieshaar_2013, title={Statistisches Planen von Aktionen für autonome
mobile Roboter in realen Umgebungen}, publisher={Universität Paderborn}, author={Bieshaar,
Maarten}, year={2013} }'
chicago: Bieshaar, Maarten. Statistisches Planen von Aktionen für autonome mobile
Roboter in realen Umgebungen. Universität Paderborn, 2013.
ieee: M. Bieshaar, Statistisches Planen von Aktionen für autonome mobile Roboter
in realen Umgebungen. Universität Paderborn, 2013.
mla: Bieshaar, Maarten. Statistisches Planen von Aktionen für autonome mobile
Roboter in realen Umgebungen. Universität Paderborn, 2013.
short: M. Bieshaar, Statistisches Planen von Aktionen für autonome mobile Roboter
in realen Umgebungen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:25Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publisher: Universität Paderborn
status: public
title: Statistisches Planen von Aktionen für autonome mobile Roboter in realen Umgebungen
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '483'
abstract:
- lang: eng
text: Modern software systems adapt themselves to changing environments, to meet
quality-of-service requirements, such as response time limits. The engineering
of the system’s self-adaptation logic does not only require new modeling methods,
but also new analyzes of transient phases. Model-driven software performance engineering
methods already allow design-time analysis of steady states of non-adaptive system
models. In order to validate requirements for transient phases, new modeling and
analysis methods are needed. In this paper, we present SimuLizar, our initial
model-driven approach to model self-adaptive systems and analyze the performance
of their transient phases. Our evaluation of a load balancer toy example shows
the applicability of our modeling approach. Additionally, a comparison of our
performance analysis with a prototypical implementation of our example system
shows that the prediction accuracy is sufficient to identify unsatisfactory self-adaptations.
author:
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Joachim
full_name: Meyer, Joachim
last_name: Meyer
citation:
ama: 'Becker M, Becker S, Meyer J. SimuLizar: Design-Time modeling and Performance
Analysis of Self-Adaptive Systems. In: Proceedings of the Software Engineering
Conference (SE). Lecture Notes in Informatics (LNI). ; 2013:71-84.'
apa: 'Becker, M., Becker, S., & Meyer, J. (2013). SimuLizar: Design-Time modeling
and Performance Analysis of Self-Adaptive Systems. In Proceedings of the Software
Engineering Conference (SE) (pp. 71–84).'
bibtex: '@inproceedings{Becker_Becker_Meyer_2013, series={Lecture Notes in Informatics
(LNI)}, title={SimuLizar: Design-Time modeling and Performance Analysis of Self-Adaptive
Systems}, booktitle={Proceedings of the Software Engineering Conference (SE)},
author={Becker, Matthias and Becker, Steffen and Meyer, Joachim}, year={2013},
pages={71–84}, collection={Lecture Notes in Informatics (LNI)} }'
chicago: 'Becker, Matthias, Steffen Becker, and Joachim Meyer. “SimuLizar: Design-Time
Modeling and Performance Analysis of Self-Adaptive Systems.” In Proceedings
of the Software Engineering Conference (SE), 71–84. Lecture Notes in Informatics
(LNI), 2013.'
ieee: 'M. Becker, S. Becker, and J. Meyer, “SimuLizar: Design-Time modeling and
Performance Analysis of Self-Adaptive Systems,” in Proceedings of the Software
Engineering Conference (SE), 2013, pp. 71–84.'
mla: 'Becker, Matthias, et al. “SimuLizar: Design-Time Modeling and Performance
Analysis of Self-Adaptive Systems.” Proceedings of the Software Engineering
Conference (SE), 2013, pp. 71–84.'
short: 'M. Becker, S. Becker, J. Meyer, in: Proceedings of the Software Engineering
Conference (SE), 2013, pp. 71–84.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:25Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:58:42Z
date_updated: 2018-03-15T13:58:42Z
file_id: '1320'
file_name: 483-paper.pdf
file_size: 649508
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:58:42Z
has_accepted_license: '1'
main_file_link:
- url: http://subs.emis.de/LNI/Proceedings/Proceedings213/article35.html
page: 71-84
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 Software Engineering Conference (SE)
series_title: Lecture Notes in Informatics (LNI)
status: public
title: 'SimuLizar: Design-Time modeling and Performance Analysis of Self-Adaptive
Systems'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '484'
abstract:
- lang: eng
text: One of the main ideas of Service-Oriented Computing (SOC) is the delivery
of flexibly composable services provided on world-wide markets. For a successful
service discovery,service requests have to be matched with the available service
offers. However, in a situation in which no service that completely matches the
request can be discovered, the customer may tolerate slight discrepancies between
request and offer. Some existing fuzzy matching approaches are able to detectsuch
service variants, but they do not allow to explicitly specify which parts of a
request are not mandatory. In this paper, we improve an existing service matching
approach based onVisual Contracts leveraging our preliminary work of design pattern
detection. Thereby, we support explicit specifications of service variants and
realize gradual matching results that can be ranked in order to discover the service
offer that matches a customer’s request best.
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Markus
full_name: von Detten, Markus
last_name: von Detten
- first_name: Christian
full_name: Gerth, Christian
last_name: Gerth
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Platenius MC, von Detten M, Gerth C, Schäfer W, Engels G. Service Matching
under Consideration of Explicitly Specified Service Variants. In: IEEE 20th
International Conference on Web Services (ICWS 2013). ; 2013:613-614. doi:10.1109/ICWS.2013.98'
apa: Platenius, M. C., von Detten, M., Gerth, C., Schäfer, W., & Engels, G.
(2013). Service Matching under Consideration of Explicitly Specified Service Variants.
In IEEE 20th International Conference on Web Services (ICWS 2013) (pp.
613–614). https://doi.org/10.1109/ICWS.2013.98
bibtex: '@inproceedings{Platenius_von Detten_Gerth_Schäfer_Engels_2013, title={Service
Matching under Consideration of Explicitly Specified Service Variants}, DOI={10.1109/ICWS.2013.98}, booktitle={IEEE
20th International Conference on Web Services (ICWS 2013)}, author={Platenius,
Marie Christin and von Detten, Markus and Gerth, Christian and Schäfer, Wilhelm
and Engels, Gregor}, year={2013}, pages={613–614} }'
chicago: Platenius, Marie Christin, Markus von Detten, Christian Gerth, Wilhelm
Schäfer, and Gregor Engels. “Service Matching under Consideration of Explicitly
Specified Service Variants.” In IEEE 20th International Conference on Web Services
(ICWS 2013), 613–14, 2013. https://doi.org/10.1109/ICWS.2013.98.
ieee: M. C. Platenius, M. von Detten, C. Gerth, W. Schäfer, and G. Engels, “Service
Matching under Consideration of Explicitly Specified Service Variants,” in IEEE
20th International Conference on Web Services (ICWS 2013), 2013, pp. 613–614.
mla: Platenius, Marie Christin, et al. “Service Matching under Consideration of
Explicitly Specified Service Variants.” IEEE 20th International Conference
on Web Services (ICWS 2013), 2013, pp. 613–14, doi:10.1109/ICWS.2013.98.
short: 'M.C. Platenius, M. von Detten, C. Gerth, W. Schäfer, G. Engels, in: IEEE
20th International Conference on Web Services (ICWS 2013), 2013, pp. 613–614.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:27Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
doi: 10.1109/ICWS.2013.98
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:57:42Z
date_updated: 2018-03-15T13:57:42Z
file_id: '1319'
file_name: 484-Platenius_et_al_ICWS2013.pdf
file_size: 262082
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:57:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 613-614
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '3'
name: SFB 901 - Project Area B
publication: IEEE 20th International Conference on Web Services (ICWS 2013)
status: public
title: Service Matching under Consideration of Explicitly Specified Service Variants
type: conference
user_id: '477'
year: '2013'
...
---
_id: '485'
abstract:
- lang: eng
text: Software composition has been studied as a subject of state based planning
for decades. Existing composition approaches that are efficient enough to be used
in practice are limited to sequential arrangements of software components. This
restriction dramatically reduces the number of composition problems that can be
solved. However, there are many composition problems that could be solved by existing
approaches if they had a possibility to combine components in very simple non-sequential
ways. To this end, we present an approach that arranges not only basic components
but also composite components. Composite components enhance the structure of the
composition by conditional control flows. Through algorithms that are written
by experts, composite components are automatically generated before the composition
process starts. Therefore, our approach is not a substitute for existing composition
algorithms but complements them with a preprocessing step. We verified the validity
of our approach through implementation of the presented algorithms.
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Hans
full_name: Kleine Büning, Hans
last_name: Kleine Büning
citation:
ama: 'Mohr F, Kleine Büning H. Semi-Automated Software Composition Through Generated
Components. In: Proceedings of the 15th International Conference on Information
Integration and Web-Based Applications & Services (IiWAS). ; 2013:676-680.
doi:10.1145/2539150.2539235'
apa: Mohr, F., & Kleine Büning, H. (2013). Semi-Automated Software Composition
Through Generated Components. In Proceedings of the 15th International Conference
on Information Integration and Web-based Applications & Services (iiWAS)
(pp. 676–680). https://doi.org/10.1145/2539150.2539235
bibtex: '@inproceedings{Mohr_Kleine Büning_2013, title={Semi-Automated Software
Composition Through Generated Components}, DOI={10.1145/2539150.2539235},
booktitle={Proceedings of the 15th International Conference on Information Integration
and Web-based Applications & Services (iiWAS)}, author={Mohr, Felix and Kleine
Büning, Hans}, year={2013}, pages={676–680} }'
chicago: Mohr, Felix, and Hans Kleine Büning. “Semi-Automated Software Composition
Through Generated Components.” In Proceedings of the 15th International Conference
on Information Integration and Web-Based Applications & Services (IiWAS),
676–80, 2013. https://doi.org/10.1145/2539150.2539235.
ieee: F. Mohr and H. Kleine Büning, “Semi-Automated Software Composition Through
Generated Components,” in Proceedings of the 15th International Conference
on Information Integration and Web-based Applications & Services (iiWAS),
2013, pp. 676–680.
mla: Mohr, Felix, and Hans Kleine Büning. “Semi-Automated Software Composition Through
Generated Components.” Proceedings of the 15th International Conference on
Information Integration and Web-Based Applications & Services (IiWAS),
2013, pp. 676–80, doi:10.1145/2539150.2539235.
short: 'F. Mohr, H. Kleine Büning, in: Proceedings of the 15th International Conference
on Information Integration and Web-Based Applications & Services (IiWAS),
2013, pp. 676–680.'
date_created: 2017-10-17T12:42:26Z
date_updated: 2022-01-06T07:01:27Z
ddc:
- '040'
department:
- _id: '355'
doi: 10.1145/2539150.2539235
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:56:49Z
date_updated: 2018-03-15T13:56:49Z
file_id: '1318'
file_name: 485-paper86_mohr.pdf
file_size: 368152
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:56:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 676-680
project:
- _id: '1'
name: SFB 901
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '3'
name: SFB 901 - Project Area B
publication: Proceedings of the 15th International Conference on Information Integration
and Web-based Applications & Services (iiWAS)
status: public
title: Semi-Automated Software Composition Through Generated Components
type: conference
user_id: '477'
year: '2013'
...
---
_id: '486'
author:
- first_name: Oliver
full_name: Otte, Oliver
last_name: Otte
citation:
ama: Otte O. Seitenkanalresistenz paarungsbasierter Kryptographie. Universität
Paderborn; 2013.
apa: Otte, O. (2013). Seitenkanalresistenz paarungsbasierter Kryptographie.
Universität Paderborn.
bibtex: '@book{Otte_2013, title={Seitenkanalresistenz paarungsbasierter Kryptographie},
publisher={Universität Paderborn}, author={Otte, Oliver}, year={2013} }'
chicago: Otte, Oliver. Seitenkanalresistenz paarungsbasierter Kryptographie.
Universität Paderborn, 2013.
ieee: O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie. Universität
Paderborn, 2013.
mla: Otte, Oliver. Seitenkanalresistenz paarungsbasierter Kryptographie.
Universität Paderborn, 2013.
short: O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:27Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Seitenkanalresistenz paarungsbasierter Kryptographie
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '487'
author:
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
citation:
ama: Bobolz J. Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn; 2013.
apa: Bobolz, J. (2013). Security Proofs for Pairing-Based Cryptography in the
Generic Group Model. Universität Paderborn.
bibtex: '@book{Bobolz_2013, title={Security Proofs for Pairing-Based Cryptography
in the Generic Group Model}, publisher={Universität Paderborn}, author={Bobolz,
Jan}, year={2013} }'
chicago: Bobolz, Jan. Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn, 2013.
ieee: J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn, 2013.
mla: Bobolz, Jan. Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn, 2013.
short: J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic
Group Model, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
content_type: application/pdf
creator: jbobolz
date_created: 2018-04-13T11:42:08Z
date_updated: 2018-06-29T09:56:54Z
file_id: '2346'
file_name: thesis_jbobolz_final.pdf
file_size: 874286
relation: main_file
file_date_updated: 2018-06-29T09:56:54Z
has_accepted_license: '1'
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
title: Security Proofs for Pairing-Based Cryptography in the Generic Group Model
type: bachelorsthesis
urn: '4875'
user_id: '27207'
year: '2013'
...
---
_id: '488'
abstract:
- lang: eng
text: Unattended systems are key ingredients of various critical infrastruc-tures
like networks of self service terminals or automated teller machines.For cost
and efficiency reasons they should mostly run autonomously.Unattended systems
are attractive and lucrative targets for various kindsof attacks, including attacks
on the integrity of their components and thecommunication between components.
In this paper, we propose a gen-eral cryptographic framework to protect unattended
systems. We alsodemonstrate that instantiating the framework with techniques from
iden-tity based cryptography is particularly well-suited to efficiently secureunattended
systems.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
citation:
ama: 'Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with
Identity Based Cryptography - A Case Study. In: Proceedings of the 5th International
Conference on Mathematical Aspects of Computer and Information Sciences (MACIS).
; 2013:98-105.'
apa: Blömer, J., Günther, P., & Krummel, V. (2013). Securing Critical Unattended
Systems with Identity Based Cryptography - A Case Study. In Proceedings of
the 5th International Conference on Mathematical Aspects of Computer and Information
Sciences (MACIS) (pp. 98–105).
bibtex: '@inproceedings{Blömer_Günther_Krummel_2013, title={Securing Critical Unattended
Systems with Identity Based Cryptography - A Case Study}, booktitle={Proceedings
of the 5th International Conference on Mathematical Aspects of Computer and Information
Sciences (MACIS)}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker},
year={2013}, pages={98–105} }'
chicago: Blömer, Johannes, Peter Günther, and Volker Krummel. “Securing Critical
Unattended Systems with Identity Based Cryptography - A Case Study.” In Proceedings
of the 5th International Conference on Mathematical Aspects of Computer and Information
Sciences (MACIS), 98–105, 2013.
ieee: J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems
with Identity Based Cryptography - A Case Study,” in Proceedings of the 5th
International Conference on Mathematical Aspects of Computer and Information Sciences
(MACIS), 2013, pp. 98–105.
mla: Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity
Based Cryptography - A Case Study.” Proceedings of the 5th International Conference
on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013,
pp. 98–105.
short: 'J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International
Conference on Mathematical Aspects of Computer and Information Sciences (MACIS),
2013, pp. 98–105.'
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:46:52Z
date_updated: 2018-03-15T13:46:52Z
file_id: '1317'
file_name: 488-MACIS13.pdf
file_size: 301962
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:46:52Z
has_accepted_license: '1'
page: 98-105
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 5th International Conference on Mathematical Aspects
of Computer and Information Sciences (MACIS)
status: public
title: Securing Critical Unattended Systems with Identity Based Cryptography - A Case
Study
type: conference
user_id: '477'
year: '2013'
...
---
_id: '489'
author:
- first_name: Michael
full_name: Knopf, Michael
last_name: Knopf
citation:
ama: Knopf M. Scheduling Variants with Speed-Scaling via the Primal-Dual Approach.
Universität Paderborn; 2013.
apa: Knopf, M. (2013). Scheduling Variants with Speed-Scaling via the Primal-Dual
Approach. Universität Paderborn.
bibtex: '@book{Knopf_2013, title={Scheduling Variants with Speed-Scaling via the
Primal-Dual Approach}, publisher={Universität Paderborn}, author={Knopf, Michael},
year={2013} }'
chicago: Knopf, Michael. Scheduling Variants with Speed-Scaling via the Primal-Dual
Approach. Universität Paderborn, 2013.
ieee: M. Knopf, Scheduling Variants with Speed-Scaling via the Primal-Dual Approach.
Universität Paderborn, 2013.
mla: Knopf, Michael. Scheduling Variants with Speed-Scaling via the Primal-Dual
Approach. Universität Paderborn, 2013.
short: M. Knopf, Scheduling Variants with Speed-Scaling via the Primal-Dual Approach,
Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Scheduling Variants with Speed-Scaling via the Primal-Dual Approach
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '490'
author:
- first_name: Felix
full_name: Wallaschek, Felix
last_name: Wallaschek
citation:
ama: Wallaschek F. Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn; 2013.
apa: Wallaschek, F. (2013). Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn.
bibtex: '@book{Wallaschek_2013, title={Routing in heterogenen OpenFlow Netzwerken},
publisher={Universität Paderborn}, author={Wallaschek, Felix}, year={2013} }'
chicago: Wallaschek, Felix. Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn, 2013.
ieee: F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn, 2013.
mla: Wallaschek, Felix. Routing in heterogenen OpenFlow Netzwerken. Universität
Paderborn, 2013.
short: F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken, Universität Paderborn,
2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
department:
- _id: '75'
language:
- iso: ger
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: Routing in heterogenen OpenFlow Netzwerken
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '492'
author:
- first_name: Christoph
full_name: Robbert, Christoph
last_name: Robbert
citation:
ama: Robbert C. Ressource-Optimized Deployment of Multi-Tier Applications - The
Data Rate-Constrained Case. Universität Paderborn; 2013.
apa: Robbert, C. (2013). Ressource-Optimized Deployment of Multi-Tier Applications
- The Data Rate-Constrained Case. Universität Paderborn.
bibtex: '@book{Robbert_2013, title={Ressource-Optimized Deployment of Multi-Tier
Applications - The Data Rate-Constrained Case}, publisher={Universität Paderborn},
author={Robbert, Christoph}, year={2013} }'
chicago: Robbert, Christoph. Ressource-Optimized Deployment of Multi-Tier Applications
- The Data Rate-Constrained Case. Universität Paderborn, 2013.
ieee: C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications -
The Data Rate-Constrained Case. Universität Paderborn, 2013.
mla: Robbert, Christoph. Ressource-Optimized Deployment of Multi-Tier Applications
- The Data Rate-Constrained Case. Universität Paderborn, 2013.
short: C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications - The
Data Rate-Constrained Case, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:29Z
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: Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained
Case
type: bachelorsthesis
user_id: '15504'
year: '2013'
...
---
_id: '493'
author:
- first_name: Artjom
full_name: Terentjew, Artjom
last_name: Terentjew
citation:
ama: Terentjew A. Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung
von Qualitätsstandards in Transaktionen. Universität Paderborn; 2013.
apa: Terentjew, A. (2013). Reputationssysteme und Gerichtsverfahren als Wekzeuge
zur Sicherstellung von Qualitätsstandards in Transaktionen. Universität Paderborn.
bibtex: '@book{Terentjew_2013, title={Reputationssysteme und Gerichtsverfahren als
Wekzeuge zur Sicherstellung von Qualitätsstandards in Transaktionen}, publisher={Universität
Paderborn}, author={Terentjew, Artjom}, year={2013} }'
chicago: Terentjew, Artjom. Reputationssysteme und Gerichtsverfahren als Wekzeuge
zur Sicherstellung von Qualitätsstandards in Transaktionen. Universität Paderborn,
2013.
ieee: A. Terentjew, Reputationssysteme und Gerichtsverfahren als Wekzeuge zur
Sicherstellung von Qualitätsstandards in Transaktionen. Universität Paderborn,
2013.
mla: Terentjew, Artjom. Reputationssysteme und Gerichtsverfahren als Wekzeuge
zur Sicherstellung von Qualitätsstandards in Transaktionen. Universität Paderborn,
2013.
short: A. Terentjew, Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung
von Qualitätsstandards in Transaktionen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:28Z
date_updated: 2022-01-06T07:01:29Z
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Reputationssysteme und Gerichtsverfahren als Wekzeuge zur Sicherstellung von
Qualitätsstandards in Transaktionen
type: bachelorsthesis
user_id: '477'
year: '2013'
...