---
_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. RSA-Full Domain Hash Revisited. Universität Paderborn; 2014.
apa: Rath, T. (2014). RSA-Full Domain Hash Revisited. 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. RSA-Full Domain Hash Revisited. Universität Paderborn,
2014.
ieee: T. Rath, RSA-Full Domain Hash Revisited. Universität Paderborn, 2014.
mla: Rath, Timo. RSA-Full Domain Hash Revisited. 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'
...
---
_id: '371'
abstract:
- lang: eng
text: In this work we present the first distributed storage system that is provably
robust against crash failures issued by an adaptive adversary, i.e., for each
batch of requests the adversary can decide based on the entire system state which
servers will be unavailable for that batch of requests. Despite up to \gamma n^{1/\log\log
n} crashed servers, with \gamma>0 constant and n denoting the number of servers,
our system can correctly process any batch of lookup and write requests (with
at most a polylogarithmic number of requests issued at each non-crashed server)
in at most a polylogarithmic number of communication rounds, with at most polylogarithmic
time and work at each server and only a logarithmic storage overhead. Our system
is based on previous work by Eikel and Scheideler (SPAA 2013), who presented IRIS,
a distributed information system that is provably robust against the same kind
of crash failures. However, IRIS is only able to serve lookup requests. Handling
both lookup and write requests has turned out to require major changes in the
design of IRIS.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
citation:
ama: 'Scheideler C, Setzer A, Eikel M. RoBuSt: A Crash-Failure-Resistant Distributed
Storage System. In: Proceedings of the 18th International Conference on Principles
of Distributed Systems (OPODIS). LNCS. ; 2014:107--122. doi:10.1007/978-3-319-14472-6_8'
apa: 'Scheideler, C., Setzer, A., & Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant
Distributed Storage System. In Proceedings of the 18th International Conference
on Principles of Distributed Systems (OPODIS) (pp. 107--122). https://doi.org/10.1007/978-3-319-14472-6_8'
bibtex: '@inproceedings{Scheideler_Setzer_Eikel_2014, series={LNCS}, title={RoBuSt:
A Crash-Failure-Resistant Distributed Storage System}, DOI={10.1007/978-3-319-14472-6_8},
booktitle={Proceedings of the 18th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Eikel,
Martina}, year={2014}, pages={107--122}, collection={LNCS} }'
chicago: 'Scheideler, Christian, Alexander Setzer, and Martina Eikel. “RoBuSt: A
Crash-Failure-Resistant Distributed Storage System.” In Proceedings of the
18th International Conference on Principles of Distributed Systems (OPODIS),
107--122. LNCS, 2014. https://doi.org/10.1007/978-3-319-14472-6_8.'
ieee: 'C. Scheideler, A. Setzer, and M. Eikel, “RoBuSt: A Crash-Failure-Resistant
Distributed Storage System,” in Proceedings of the 18th International Conference
on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.'
mla: 'Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed
Storage System.” Proceedings of the 18th International Conference on Principles
of Distributed Systems (OPODIS), 2014, pp. 107--122, doi:10.1007/978-3-319-14472-6_8.'
short: 'C. Scheideler, A. Setzer, M. Eikel, in: Proceedings of the 18th International
Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-14472-6_8
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:16:32Z
date_updated: 2018-03-20T07:16:32Z
file_id: '1401'
file_name: 371-RoBuSt-OPODIS.pdf
file_size: 269941
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:16:32Z
has_accepted_license: '1'
page: 107--122
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 18th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: LNCS
status: public
title: 'RoBuSt: A Crash-Failure-Resistant Distributed Storage System'
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '378'
abstract:
- lang: eng
text: The Chord peer-to-peer system is considered, together with CAN, Tapestry and
Pastry, as one of the pioneering works on peer-to-peer distributed hash tables
(DHT) that inspired a large volume of papers and projects on DHTs as well as peer-to-peer
systems in general. Chord, in particular, has been studied thoroughly, and many
variants of Chord have been presented that optimize various criteria. Also, several
implementations of Chord are available on various platforms. Though Chord is known
to be very efficient and scalable and it can handle churn quite well, no protocol
is known yet that guarantees that Chord is self-stabilizing, i.e., the Chord network
can be recovered from any initial state in which the network is still weakly connected.
This is not too surprising since it is known that the Chord network is not locally
checkable for its current topology. We present a slight extension of the Chord
network, called Re-Chord (reactive Chord), that turns out to be locally checkable,
and we present a self-stabilizing distributed protocol for it that can recover
the Re-Chord network from any initial state, in which the n peers are weakly connected,
in O(nlogn) communication rounds. We also show that our protocol allows a new
peer to join or an old peer to leave an already stable Re-Chord network so that
within O(logn)^2) communication rounds the Re-Chord network is stable again.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Andreas
full_name: Koutsopoulos, Andreas
last_name: Koutsopoulos
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: A Self-stabilizing
Chord Overlay Network. Theory of Computing Systems. 2014;(3):591-612. doi:10.1007/s00224-012-9431-2'
apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2014). Re-Chord:
A Self-stabilizing Chord Overlay Network. Theory of Computing Systems,
(3), 591–612. https://doi.org/10.1007/s00224-012-9431-2'
bibtex: '@article{Kniesburges_Koutsopoulos_Scheideler_2014, title={Re-Chord: A Self-stabilizing
Chord Overlay Network}, DOI={10.1007/s00224-012-9431-2},
number={3}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kniesburges,
Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2014}, pages={591–612}
}'
chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“Re-Chord: A Self-Stabilizing Chord Overlay Network.” Theory of Computing Systems,
no. 3 (2014): 591–612. https://doi.org/10.1007/s00224-012-9431-2.'
ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: A Self-stabilizing
Chord Overlay Network,” Theory of Computing Systems, no. 3, pp. 591–612,
2014.'
mla: 'Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay
Network.” Theory of Computing Systems, no. 3, Springer, 2014, pp. 591–612,
doi:10.1007/s00224-012-9431-2.'
short: S. Kniesburges, A. Koutsopoulos, C. Scheideler, Theory of Computing Systems
(2014) 591–612.
date_created: 2017-10-17T12:42:05Z
date_updated: 2022-01-06T06:59:35Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/s00224-012-9431-2
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:13:36Z
date_updated: 2018-03-20T07:13:36Z
file_id: '1396'
file_name: 378-re-chord_journal.pdf
file_size: 310961
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:13:36Z
has_accepted_license: '1'
issue: '3'
page: 591-612
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '2'
name: SFB 901 - Project Area A
publication: Theory of Computing Systems
publisher: Springer
status: public
title: 'Re-Chord: A Self-stabilizing Chord Overlay Network'
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '384'
abstract:
- lang: eng
text: 'Reputation systems provide reputation values of rated parties to users. These
reputation values, typically aggregations of individual user ratings, shall be
reliable, i.e. should enable a realistic assessment of the probability that the
rated party behaves as expected in a transaction. In order for the reputation
values to stay reliable and, thus, for the reputation system to provide a benefit,
the system needs to be resistant against manipulations by users, the rated parties
trying to improve their reputation values, and even against competitors trying
to worsen a reputation value. At the same time, a reputation system shall provide
privacy protection for users: rated parties shall not be able to learn who provided
a certain rating. Otherwise users might not take part in the system as they fear
bad feedback in revenge for bad ratings, or users do not want to be connected
to certain transactions based on their provided ratings. In this paper we come
up with a solution that provides both, reliability of reputation values on the
one hand, and privacy protection for users on the other hand. In contrast to related
work, our solution only makes use of a single reputation provider that needs to
be trusted (to a certain extent) and does not require any bulletin boards to be
present in the system. We make use of the Paillier cryptosystem to provide an
aggregation of individual user ratings in a way that no party can learn which
user provided a certain rating.'
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Sascha
full_name: Lutters, Sascha
last_name: Lutters
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: 'Petrlic R, Lutters S, Sorge C. Privacy-Preserving Reputation Management. In:
Proceedings of the 29th Symposium On Applied Computing (SAC). ; 2014:1712-1718.
doi:10.1145/2554850.2554881'
apa: Petrlic, R., Lutters, S., & Sorge, C. (2014). Privacy-Preserving Reputation
Management. In Proceedings of the 29th Symposium On Applied Computing (SAC)
(pp. 1712–1718). https://doi.org/10.1145/2554850.2554881
bibtex: '@inproceedings{Petrlic_Lutters_Sorge_2014, title={Privacy-Preserving Reputation
Management}, DOI={10.1145/2554850.2554881},
booktitle={Proceedings of the 29th Symposium On Applied Computing (SAC)}, author={Petrlic,
Ronald and Lutters, Sascha and Sorge, Christoph}, year={2014}, pages={1712–1718}
}'
chicago: Petrlic, Ronald, Sascha Lutters, and Christoph Sorge. “Privacy-Preserving
Reputation Management.” In Proceedings of the 29th Symposium On Applied Computing
(SAC), 1712–18, 2014. https://doi.org/10.1145/2554850.2554881.
ieee: R. Petrlic, S. Lutters, and C. Sorge, “Privacy-Preserving Reputation Management,”
in Proceedings of the 29th Symposium On Applied Computing (SAC), 2014,
pp. 1712–1718.
mla: Petrlic, Ronald, et al. “Privacy-Preserving Reputation Management.” Proceedings
of the 29th Symposium On Applied Computing (SAC), 2014, pp. 1712–18, doi:10.1145/2554850.2554881.
short: 'R. Petrlic, S. Lutters, C. Sorge, in: Proceedings of the 29th Symposium
On Applied Computing (SAC), 2014, pp. 1712–1718.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:42Z
ddc:
- '040'
doi: 10.1145/2554850.2554881
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:04:20Z
date_updated: 2018-03-20T07:04:20Z
file_id: '1391'
file_name: 384-reputationsystem_01.pdf
file_size: 505927
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:04:20Z
has_accepted_license: '1'
page: 1712-1718
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 29th Symposium On Applied Computing (SAC)
status: public
title: Privacy-Preserving Reputation Management
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '385'
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
citation:
ama: Petrlic R. Privacy-Preserving Multiparty Digital Rights Management.
Universität Paderborn; 2014.
apa: Petrlic, R. (2014). Privacy-Preserving Multiparty Digital Rights Management.
Universität Paderborn.
bibtex: '@book{Petrlic_2014, title={Privacy-Preserving Multiparty Digital Rights
Management}, publisher={Universität Paderborn}, author={Petrlic, Ronald}, year={2014}
}'
chicago: Petrlic, Ronald. Privacy-Preserving Multiparty Digital Rights Management.
Universität Paderborn, 2014.
ieee: R. Petrlic, Privacy-Preserving Multiparty Digital Rights Management.
Universität Paderborn, 2014.
mla: Petrlic, Ronald. Privacy-Preserving Multiparty Digital Rights Management.
Universität Paderborn, 2014.
short: R. Petrlic, Privacy-Preserving Multiparty Digital Rights Management, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:45Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:03:37Z
date_updated: 2018-03-20T07:03:37Z
file_id: '1390'
file_name: 385-arbeit1.pdf
file_size: 2962042
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:03:37Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Privacy-Preserving Multiparty Digital Rights Management
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '386'
abstract:
- lang: eng
text: We present a privacy-preserving multiparty DRM scheme that does not need a
trusted third party. Users anonymously buy content from content providers and
anonymously execute it at content execution centers. The executions are unlinkable
to each other. The license check is performed as part of the used ciphertext-policy
attribute-based encryption (CP-ABE) and, thus, access control is cryptographically
enforced. The problem of authorization proof towards the key center in an ABE
scheme is solved by a combination with anonymous payments.
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: 'Petrlic R, Sorge C. Privacy-Preserving Digital Rights Management based on
Attribute-based Encryption. In: Proceedings of the Sixth IFIP International
Conference on New Technologies, Mobility and Security (NTMS). ; 2014:1-5.
doi:10.1109/NTMS.2014.6814044'
apa: Petrlic, R., & Sorge, C. (2014). Privacy-Preserving Digital Rights Management
based on Attribute-based Encryption. In Proceedings of the Sixth IFIP International
Conference on New Technologies, Mobility and Security (NTMS) (pp. 1–5). https://doi.org/10.1109/NTMS.2014.6814044
bibtex: '@inproceedings{Petrlic_Sorge_2014, title={Privacy-Preserving Digital Rights
Management based on Attribute-based Encryption}, DOI={10.1109/NTMS.2014.6814044},
booktitle={Proceedings of the Sixth IFIP International Conference on New Technologies,
Mobility and Security (NTMS)}, author={Petrlic, Ronald and Sorge, Christoph},
year={2014}, pages={1–5} }'
chicago: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving Digital Rights
Management Based on Attribute-Based Encryption.” In Proceedings of the Sixth
IFIP International Conference on New Technologies, Mobility and Security (NTMS),
1–5, 2014. https://doi.org/10.1109/NTMS.2014.6814044.
ieee: R. Petrlic and C. Sorge, “Privacy-Preserving Digital Rights Management based
on Attribute-based Encryption,” in Proceedings of the Sixth IFIP International
Conference on New Technologies, Mobility and Security (NTMS), 2014, pp. 1–5.
mla: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving Digital Rights Management
Based on Attribute-Based Encryption.” Proceedings of the Sixth IFIP International
Conference on New Technologies, Mobility and Security (NTMS), 2014, pp. 1–5,
doi:10.1109/NTMS.2014.6814044.
short: 'R. Petrlic, C. Sorge, in: Proceedings of the Sixth IFIP International Conference
on New Technologies, Mobility and Security (NTMS), 2014, pp. 1–5.'
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:46Z
ddc:
- '040'
doi: 10.1109/NTMS.2014.6814044
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:03:02Z
date_updated: 2018-03-20T07:03:02Z
file_id: '1389'
file_name: 386-NTMS14.pdf
file_size: 216843
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:03:02Z
has_accepted_license: '1'
page: 1-5
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 Sixth IFIP International Conference on New Technologies,
Mobility and Security (NTMS)
status: public
title: Privacy-Preserving Digital Rights Management based on Attribute-based Encryption
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '387'
abstract:
- lang: eng
text: This article studies the design of medium access control (MAC) protocols for
wireless networks that are provably robust against arbitrary and unpredictable
disruptions (e.g., due to unintentional external interference from co-existing
networks or due to jamming). We consider a wireless network consisting of a set
of n honest and reliable nodes within transmission (and interference) range of
each other, and we model the external disruptions with a powerful adaptive adversary.
This adversary may know the protocol and its entire history and can use this knowledge
to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction
of the timesteps, for an arbitrary constant > 0 unknown to the nodes. The nodes
cannot distinguish between the adversarial jamming or a collision of two or more
messages that are sent at the same time. We demonstrate, for the first time, that
there is a local-control MAC protocol requiring only very limited knowledge about
the adversary and the network that achieves a constant (asymptotically optimal)
throughput for the nonjammed time periods under any of the aforementioned adversarial
strategies. The derived principles are also useful to build robust applications
on top of the MAC layer, and we present an exemplary study for leader election,
one of the most fundamental tasks in distributed computing.
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust
Medium Access and an Application to Leader Election. Transactions on Algorithms.
2014;(4). doi:10.1145/2635818
apa: Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014).
Principles of Robust Medium Access and an Application to Leader Election. Transactions
on Algorithms, (4). https://doi.org/10.1145/2635818
bibtex: '@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles
of Robust Medium Access and an Application to Leader Election}, DOI={10.1145/2635818},
number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch,
Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang,
Jin}, year={2014} }'
chicago: Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid,
and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader
Election.” Transactions on Algorithms, no. 4 (2014). https://doi.org/10.1145/2635818.
ieee: B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles
of Robust Medium Access and an Application to Leader Election,” Transactions
on Algorithms, no. 4, 2014.
mla: Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application
to Leader Election.” Transactions on Algorithms, no. 4, ACM, 2014, doi:10.1145/2635818.
short: B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions
on Algorithms (2014).
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:47Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2635818
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:02:33Z
date_updated: 2018-03-20T07:02:33Z
file_id: '1388'
file_name: 387-a24-awerbuch_2_.pdf
file_size: 521454
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:02:33Z
has_accepted_license: '1'
issue: '4'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Principles of Robust Medium Access and an Application to Leader Election
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '18001'
author:
- first_name: Linghui
full_name: Luo, Linghui
last_name: Luo
citation:
ama: Luo L. Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem
in Skip+ Graphen. Universität Paderborn; 2014.
apa: Luo, L. (2014). Ein selbst-stabilisierender Algorithmus für das Finite Sleep
Problem in Skip+ Graphen. Universität Paderborn.
bibtex: '@book{Luo_2014, title={Ein selbst-stabilisierender Algorithmus für das
Finite Sleep Problem in Skip+ Graphen}, publisher={Universität Paderborn}, author={Luo,
Linghui}, year={2014} }'
chicago: Luo, Linghui. Ein Selbst-Stabilisierender Algorithmus Für Das Finite
Sleep Problem in Skip+ Graphen. Universität Paderborn, 2014.
ieee: L. Luo, Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem
in Skip+ Graphen. Universität Paderborn, 2014.
mla: Luo, Linghui. Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep
Problem in Skip+ Graphen. Universität Paderborn, 2014.
short: L. Luo, Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem
in Skip+ Graphen, Universität Paderborn, 2014.
date_created: 2020-08-17T08:16:07Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+
Graphen
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '441'
abstract:
- lang: eng
text: Das Future Internet soll den Anforderungen heutiger und zuk{\"u}nftiger daten-intensiver
Internet-Anwendungen besser gerecht werden als dies heute der Fall ist. Seit einigen
Jahren wird an unterschiedlichen Verfahren geforscht, die das „Future Internet“
erm{\"o}glichen sollen – diese Ans{\"a}tze gehen weit {\"u}ber die Ziele von IPv6
hinaus. In diesem Beitrag stellen wir einige Kernpunkte der Future-Internet-Initiativen
vor und identifizieren Gemeinsamkeiten der unterschiedlichen Konzepte. Wir beleuchten
die Konsequenzen aus datenschutzrechtlicher Sicht und geben einen {\"U}berblick
{\"u}ber Ans{\"a}tze, die die identifizierten Datenschutz-Probleme durch technische
Maßnahmen bis zu einem gewissen Grad verhindern.
author:
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
citation:
ama: 'Sorge C, Petrlic R. Datenschutz im Future Internet: rechtliche Aspekte und
technische Maßnahmen. In: Tagungsband Des 17. Internationalen Rechtsinformatik
Symposions. ; 2014.'
apa: 'Sorge, C., & Petrlic, R. (2014). Datenschutz im Future Internet: rechtliche
Aspekte und technische Maßnahmen. In Tagungsband des 17. Internationalen Rechtsinformatik
Symposions.'
bibtex: '@inproceedings{Sorge_Petrlic_2014, title={Datenschutz im Future Internet:
rechtliche Aspekte und technische Maßnahmen}, booktitle={Tagungsband des 17. Internationalen
Rechtsinformatik Symposions}, author={Sorge, Christoph and Petrlic, Ronald}, year={2014}
}'
chicago: 'Sorge, Christoph, and Ronald Petrlic. “Datenschutz Im Future Internet:
Rechtliche Aspekte Und Technische Maßnahmen.” In Tagungsband Des 17. Internationalen
Rechtsinformatik Symposions, 2014.'
ieee: 'C. Sorge and R. Petrlic, “Datenschutz im Future Internet: rechtliche Aspekte
und technische Maßnahmen,” in Tagungsband des 17. Internationalen Rechtsinformatik
Symposions, 2014.'
mla: 'Sorge, Christoph, and Ronald Petrlic. “Datenschutz Im Future Internet: Rechtliche
Aspekte Und Technische Maßnahmen.” Tagungsband Des 17. Internationalen Rechtsinformatik
Symposions, 2014.'
short: 'C. Sorge, R. Petrlic, in: Tagungsband Des 17. Internationalen Rechtsinformatik
Symposions, 2014.'
date_created: 2017-10-17T12:42:17Z
date_updated: 2022-01-06T07:01:02Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:29:22Z
date_updated: 2018-03-16T11:29:22Z
file_id: '1352'
file_name: 441-sorge-petrlic-iris2014_01.pdf
file_size: 207583
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:29:22Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Tagungsband des 17. Internationalen Rechtsinformatik Symposions
status: public
title: 'Datenschutz im Future Internet: rechtliche Aspekte und technische Maßnahmen'
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '442'
abstract:
- lang: eng
text: We present a new transformation of chosen-plaintext secure predicate encryption
schemes with public index into chosen-ciphertext secure schemes. Our construction
requires only a universal one-way hash function and is selectively secure in the
standard model. The transformation is not generic but can be applied to various
existing schemes constructed from bilinear groups. Using common structural properties
of these schemes we provide an efficient and simple transformation without overhead
in form of one-time signatures or message authentication codes as required in
the known generic transformations.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: Blömer J, Liske G. Constructing CCA-secure predicate encapsulation schemes
from CPA-secure schemes and universal one-way hash functions. 2014.
apa: Blömer, J., & Liske, G. (2014). Constructing CCA-secure predicate encapsulation
schemes from CPA-secure schemes and universal one-way hash functions. Universität
Paderborn.
bibtex: '@article{Blömer_Liske_2014, title={Constructing CCA-secure predicate encapsulation
schemes from CPA-secure schemes and universal one-way hash functions}, publisher={Universität
Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2014} }'
chicago: Blömer, Johannes, and Gennadij Liske. “Constructing CCA-Secure Predicate
Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.”
Universität Paderborn, 2014.
ieee: J. Blömer and G. Liske, “Constructing CCA-secure predicate encapsulation schemes
from CPA-secure schemes and universal one-way hash functions.” Universität Paderborn,
2014.
mla: Blömer, Johannes, and Gennadij Liske. Constructing CCA-Secure Predicate
Encapsulation Schemes from CPA-Secure Schemes and Universal One-Way Hash Functions.
Universität Paderborn, 2014.
short: J. Blömer, G. Liske, (2014).
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:03Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:28:34Z
date_updated: 2018-03-16T11:28:34Z
file_id: '1351'
file_name: 442-P-KEM.pdf
file_size: 377945
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:28:34Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2014/511.pdf
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
title: Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes
and universal one-way hash functions
type: preprint
user_id: '25078'
year: '2014'
...
---
_id: '446'
abstract:
- lang: eng
text: 'This paper considers the problem of how to efficiently share a wireless medium
which is subject to harsh external interference or even jamming. While this problem
has already been studied intensively for simplistic single-hop or unit disk graph
models, we make a leap forward and study MAC protocols for the SINR interference
model (a.k.a. the physical model). We make two contributions. First, we introduce
a new adversarial SINR model which captures a wide range of interference phenomena.
Concretely, we consider a powerful, adaptive adversary which can jam nodes at
arbitrary times and which is only limited by some energy budget. The second contribution
of this paper is a distributed MAC protocol which provably achieves a constant
competitive throughput in this environment: we show that, with high probability,
the protocol ensures that a constant fraction of the non-blocked time periods
is used for successful transmissions.'
author:
- first_name: Adrian
full_name: Ogierman, Adrian
last_name: Ogierman
- first_name: Andrea W.
full_name: Richa, Andrea W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
- first_name: Jin
full_name: Zhang, Jin
last_name: Zhang
citation:
ama: 'Ogierman A, Richa AW, Scheideler C, Schmid S, Zhang J. Competitive MAC under
adversarial SINR. In: Proceedings of the 33rd Annual IEEE International Conference
on Computer Communications (INFOCOM). ; 2014:2751--2759. doi:10.1109/INFOCOM.2014.6848224'
apa: Ogierman, A., Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2014).
Competitive MAC under adversarial SINR. In Proceedings of the 33rd Annual IEEE
International Conference on Computer Communications (INFOCOM) (pp. 2751--2759).
https://doi.org/10.1109/INFOCOM.2014.6848224
bibtex: '@inproceedings{Ogierman_Richa_Scheideler_Schmid_Zhang_2014, title={Competitive
MAC under adversarial SINR}, DOI={10.1109/INFOCOM.2014.6848224},
booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM)}, author={Ogierman, Adrian and Richa, Andrea W. and Scheideler,
Christian and Schmid, Stefan and Zhang, Jin}, year={2014}, pages={2751--2759}
}'
chicago: Ogierman, Adrian, Andrea W. Richa, Christian Scheideler, Stefan Schmid,
and Jin Zhang. “Competitive MAC under Adversarial SINR.” In Proceedings of
the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2751--2759, 2014. https://doi.org/10.1109/INFOCOM.2014.6848224.
ieee: A. Ogierman, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive
MAC under adversarial SINR,” in Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759.
mla: Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.” Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2014, pp. 2751--2759, doi:10.1109/INFOCOM.2014.6848224.
short: 'A. Ogierman, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM),
2014, pp. 2751--2759.'
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:05Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1109/INFOCOM.2014.6848224
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:27:04Z
date_updated: 2018-03-16T11:27:04Z
file_id: '1348'
file_name: 446-infocom14_01.pdf
file_size: 378095
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:27:04Z
has_accepted_license: '1'
page: 2751--2759
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 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM)
status: public
title: Competitive MAC under adversarial SINR
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '460'
author:
- first_name: Robert
full_name: Mittendorf, Robert
last_name: Mittendorf
citation:
ama: Mittendorf R. Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading
and FPGAs. Universität Paderborn; 2014.
apa: Mittendorf, R. (2014). Advanced AES-key recovery from decayed RAM-dumps
using multi-threading and FPGAs. Universität Paderborn.
bibtex: '@book{Mittendorf_2014, title={Advanced AES-key recovery from decayed RAM-dumps
using multi-threading and FPGAs}, publisher={Universität Paderborn}, author={Mittendorf,
Robert}, year={2014} }'
chicago: Mittendorf, Robert. Advanced AES-Key Recovery from Decayed RAM-Dumps
Using Multi-Threading and FPGAs. Universität Paderborn, 2014.
ieee: R. Mittendorf, Advanced AES-key recovery from decayed RAM-dumps using multi-threading
and FPGAs. Universität Paderborn, 2014.
mla: Mittendorf, Robert. Advanced AES-Key Recovery from Decayed RAM-Dumps Using
Multi-Threading and FPGAs. Universität Paderborn, 2014.
short: R. Mittendorf, Advanced AES-Key Recovery from Decayed RAM-Dumps Using Multi-Threading
and FPGAs, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Advanced AES-key recovery from decayed RAM-dumps using multi-threading and
FPGAs
type: mastersthesis
user_id: '15504'
year: '2014'
...
---
_id: '463'
abstract:
- lang: eng
text: Several fault attacks against pairing-based cryptography have been described
theoretically in recent years. Interestingly, none of these have been practically
evaluated. We accomplished this task and prove that fault attacks against pairing-based
cryptography are indeed possible and are even practical — thus posing a serious
threat. Moreover, we successfully conducted a second-order fault attack against
an open source implementation of the eta pairing on an AVR XMEGA A1. We injected
the first fault into the computation of the Miller Algorithm and applied the second
fault to skip the final exponentiation completely. We introduce a low-cost setup
that allowed us to generate multiple independent faults in one computation. The
setup implements these faults by clock glitches which induce instruction skips.
With this setup we conducted the first practical fault attack against a complete
pairing computation.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Ricardo
full_name: Gomes da Silva, Ricardo
last_name: Gomes da Silva
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Juliane
full_name: Krämer, Juliane
last_name: Krämer
- first_name: Jean-Pierre
full_name: Seifert, Jean-Pierre
last_name: Seifert
citation:
ama: 'Blömer J, Gomes da Silva R, Günther P, Krämer J, Seifert J-P. A Practical
Second-Order Fault Attack against a Real-World Pairing Implementation. In: Proceedings
of Fault Tolerance and Diagnosis in Cryptography(FDTC). ; 2014:123--136. doi:10.1109/FDTC.2014.22'
apa: Blömer, J., Gomes da Silva, R., Günther, P., Krämer, J., & Seifert, J.-P.
(2014). A Practical Second-Order Fault Attack against a Real-World Pairing Implementation.
In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC) (pp.
123--136). https://doi.org/10.1109/FDTC.2014.22
bibtex: '@inproceedings{Blömer_Gomes da Silva_Günther_Krämer_Seifert_2014, title={A
Practical Second-Order Fault Attack against a Real-World Pairing Implementation},
DOI={10.1109/FDTC.2014.22},
booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)},
author={Blömer, Johannes and Gomes da Silva, Ricardo and Günther, Peter and Krämer,
Juliane and Seifert, Jean-Pierre}, year={2014}, pages={123--136} }'
chicago: Blömer, Johannes, Ricardo Gomes da Silva, Peter Günther, Juliane Krämer,
and Jean-Pierre Seifert. “A Practical Second-Order Fault Attack against a Real-World
Pairing Implementation.” In Proceedings of Fault Tolerance and Diagnosis in
Cryptography(FDTC), 123--136, 2014. https://doi.org/10.1109/FDTC.2014.22.
ieee: J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, and J.-P. Seifert, “A
Practical Second-Order Fault Attack against a Real-World Pairing Implementation,”
in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC),
2014, pp. 123--136.
mla: Blömer, Johannes, et al. “A Practical Second-Order Fault Attack against a Real-World
Pairing Implementation.” Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC),
2014, pp. 123--136, doi:10.1109/FDTC.2014.22.
short: 'J. Blömer, R. Gomes da Silva, P. Günther, J. Krämer, J.-P. Seifert, in:
Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014, pp.
123--136.'
date_created: 2017-10-17T12:42:22Z
date_updated: 2022-01-06T07:01:16Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1109/FDTC.2014.22
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:20:54Z
date_updated: 2018-03-16T11:20:54Z
file_id: '1336'
file_name: 463-FDTC14.pdf
file_size: 437518
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:20:54Z
has_accepted_license: '1'
page: 123--136
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: A Practical Second-Order Fault Attack against a Real-World Pairing Implementation
type: conference
user_id: '25078'
year: '2014'
...
---
_id: '479'
abstract:
- lang: eng
text: Identity-based cryptography has attracted attention in the cryptographic research
community in recent years. Despite the importance of cryptographic schemes for
applications in business and law, the legal implications of identity-based cryptography
have not yet been discussed. We investigate how identity-based signatures fit
into the legal framework. We focus on the European Signature Directive, but also
take the UNCITRAL Model Law on Electronic Signatures into account. In contrast
to previous assumptions, identity-based signature schemes can, in principle, be
used even for qualified electronic signatures, which can replace handwritten signatures
in the member states of the European Union. We derive requirements to be taken
into account in the development of future identity-based signature schemes.
author:
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: Sorge C. The Legal Classification of Identity-Based Signatures. Computer
Law & Security Review. 2014;30(2):126-136. doi:10.1016/j.clsr.2014.01.002
apa: Sorge, C. (2014). The Legal Classification of Identity-Based Signatures. Computer
Law & Security Review, 30(2), 126–136. https://doi.org/10.1016/j.clsr.2014.01.002
bibtex: '@article{Sorge_2014, title={The Legal Classification of Identity-Based
Signatures}, volume={30}, DOI={10.1016/j.clsr.2014.01.002},
number={2}, journal={Computer Law & Security Review}, publisher={Elsevier},
author={Sorge, Christoph}, year={2014}, pages={126–136} }'
chicago: 'Sorge, Christoph. “The Legal Classification of Identity-Based Signatures.”
Computer Law & Security Review 30, no. 2 (2014): 126–36. https://doi.org/10.1016/j.clsr.2014.01.002.'
ieee: C. Sorge, “The Legal Classification of Identity-Based Signatures,” Computer
Law & Security Review, vol. 30, no. 2, pp. 126–136, 2014.
mla: Sorge, Christoph. “The Legal Classification of Identity-Based Signatures.”
Computer Law & Security Review, vol. 30, no. 2, Elsevier, 2014, pp.
126–36, doi:10.1016/j.clsr.2014.01.002.
short: C. Sorge, Computer Law & Security Review 30 (2014) 126–136.
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:22Z
ddc:
- '040'
doi: 10.1016/j.clsr.2014.01.002
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:03:20Z
date_updated: 2018-03-15T14:03:20Z
file_id: '1323'
file_name: 479-Sorge-Legal-Classification2013.pdf
file_size: 194634
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:03:20Z
has_accepted_license: '1'
intvolume: ' 30'
issue: '2'
page: 126-136
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Computer Law & Security Review
publisher: Elsevier
status: public
title: The Legal Classification of Identity-Based Signatures
type: journal_article
user_id: '477'
volume: 30
year: '2014'
...
---
_id: '401'
abstract:
- lang: eng
text: Service matching approaches determine to what extent a provided service matches
a requester's requirements. This process is based on service specifications describing
functional (e.g., signatures) as well as non-functional properties (e.g., privacy
policies). However, we cannot expect service specifications to be complete as
providers do not want to share all details of their services' implementation.
Moreover, creating complete specifications requires much effort. In this paper,
we propose a novel service matching approach taking into account a service's signatures
and privacy policies. In particular, our approach applies fuzzy matching techniques
that are able to deal with incomplete service specifications. As a benefit, decision-making
based on matching results is improved and service matching becomes better applicable
in practice.
author:
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Svetlana
full_name: Arifulina, Svetlana
last_name: Arifulina
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
citation:
ama: 'Platenius MC, Arifulina S, Petrlic R, Schäfer W. Matching of Incomplete Service
Specifications Exemplified by Privacy Policy Matching. In: Proceedings of the
4th International Workshop on Adaptive Services for the Future Internet. Communications
in Computer and Information Science. ; 2014:6-17. doi:10.1007/978-3-319-14886-1_2'
apa: Platenius, M. C., Arifulina, S., Petrlic, R., & Schäfer, W. (2014). Matching
of Incomplete Service Specifications Exemplified by Privacy Policy Matching. In
Proceedings of the 4th International Workshop on Adaptive Services for the
Future Internet (pp. 6–17). https://doi.org/10.1007/978-3-319-14886-1_2
bibtex: '@inproceedings{Platenius_Arifulina_Petrlic_Schäfer_2014, series={Communications
in Computer and Information Science}, title={Matching of Incomplete Service Specifications
Exemplified by Privacy Policy Matching}, DOI={10.1007/978-3-319-14886-1_2},
booktitle={Proceedings of the 4th International Workshop on Adaptive Services
for the Future Internet}, author={Platenius, Marie Christin and Arifulina, Svetlana
and Petrlic, Ronald and Schäfer, Wilhelm}, year={2014}, pages={6–17}, collection={Communications
in Computer and Information Science} }'
chicago: Platenius, Marie Christin, Svetlana Arifulina, Ronald Petrlic, and Wilhelm
Schäfer. “Matching of Incomplete Service Specifications Exemplified by Privacy
Policy Matching.” In Proceedings of the 4th International Workshop on Adaptive
Services for the Future Internet, 6–17. Communications in Computer and Information
Science, 2014. https://doi.org/10.1007/978-3-319-14886-1_2.
ieee: M. C. Platenius, S. Arifulina, R. Petrlic, and W. Schäfer, “Matching of Incomplete
Service Specifications Exemplified by Privacy Policy Matching,” in Proceedings
of the 4th International Workshop on Adaptive Services for the Future Internet,
2014, pp. 6–17.
mla: Platenius, Marie Christin, et al. “Matching of Incomplete Service Specifications
Exemplified by Privacy Policy Matching.” Proceedings of the 4th International
Workshop on Adaptive Services for the Future Internet, 2014, pp. 6–17, doi:10.1007/978-3-319-14886-1_2.
short: 'M.C. Platenius, S. Arifulina, R. Petrlic, W. Schäfer, in: Proceedings of
the 4th International Workshop on Adaptive Services for the Future Internet, 2014,
pp. 6–17.'
date_created: 2017-10-17T12:42:10Z
date_updated: 2022-01-06T07:00:07Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
doi: 10.1007/978-3-319-14886-1_2
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:38:13Z
date_updated: 2018-03-16T11:38:13Z
file_id: '1367'
file_name: 401-WAS4FI2014.pdf
file_size: 396656
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:38:13Z
has_accepted_license: '1'
language:
- iso: eng
page: 6-17
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
publication: Proceedings of the 4th International Workshop on Adaptive Services for
the Future Internet
series_title: Communications in Computer and Information Science
status: public
title: Matching of Incomplete Service Specifications Exemplified by Privacy Policy
Matching
type: conference
user_id: '477'
year: '2014'
...
---
_id: '410'
abstract:
- lang: eng
text: One goal of service-oriented computing is to realize future markets of composed
services. In such markets, service providers offer services that can be flexibly
combined with each other. However, although crucial for decision-making, market
participants are usually not able to individually estimate the quality of traded
services in advance. To overcome this problem, we present a conceptual design
for a reputation system that collects and processes user feedback on transactions,
and provides this information as a signal for quality to participants in the market.
Based on our proposed concept, we describe the incorporation of reputation information
into distinct decision-making processes that are crucial in such service markets.
In this context, we present a fuzzy service matching approach that takes reputation
information into account. Furthermore, we introduce an adaptive service composition
approach, and investigate the impact of exchanging immediate user feedback by
reputation information. Last but not least, we describe the importance of reputation
information for economic decisions of different market participants. The overall
output of this paper is a comprehensive view on managing and exploiting reputation
information in markets of composed services using the example of On-The-Fly Computing.
author:
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
citation:
ama: Jungmann A, Brangewitz S, Petrlic R, Platenius MC. Incorporating Reputation
Information into Decision-Making Processes in Markets of Composed Services. International
Journal On Advances in Intelligent Systems (IntSys). 2014;7(3&4):572--594.
apa: Jungmann, A., Brangewitz, S., Petrlic, R., & Platenius, M. C. (2014). Incorporating
Reputation Information into Decision-Making Processes in Markets of Composed Services.
International Journal On Advances in Intelligent Systems (IntSys), 7(3&4),
572--594.
bibtex: '@article{Jungmann_Brangewitz_Petrlic_Platenius_2014, title={Incorporating
Reputation Information into Decision-Making Processes in Markets of Composed Services},
volume={7}, number={3&4}, journal={International Journal On Advances in Intelligent
Systems (IntSys)}, publisher={IARIA}, author={Jungmann, Alexander and Brangewitz,
Sonja and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={572--594}
}'
chicago: 'Jungmann, Alexander, Sonja Brangewitz, Ronald Petrlic, and Marie Christin
Platenius. “Incorporating Reputation Information into Decision-Making Processes
in Markets of Composed Services.” International Journal On Advances in Intelligent
Systems (IntSys) 7, no. 3&4 (2014): 572--594.'
ieee: A. Jungmann, S. Brangewitz, R. Petrlic, and M. C. Platenius, “Incorporating
Reputation Information into Decision-Making Processes in Markets of Composed Services,”
International Journal On Advances in Intelligent Systems (IntSys), vol.
7, no. 3&4, pp. 572--594, 2014.
mla: Jungmann, Alexander, et al. “Incorporating Reputation Information into Decision-Making
Processes in Markets of Composed Services.” International Journal On Advances
in Intelligent Systems (IntSys), vol. 7, no. 3&4, IARIA, 2014, pp. 572--594.
short: A. Jungmann, S. Brangewitz, R. Petrlic, M.C. Platenius, International Journal
On Advances in Intelligent Systems (IntSys) 7 (2014) 572--594.
date_created: 2017-10-17T12:42:11Z
date_updated: 2022-01-06T07:00:17Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:34:28Z
date_updated: 2018-03-16T11:34:28Z
file_id: '1362'
file_name: 410-intsys_v7_n34_2014_18.pdf
file_size: 2590608
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:34:28Z
has_accepted_license: '1'
intvolume: ' 7'
issue: 3&4
language:
- iso: eng
main_file_link:
- url: http://www.iariajournals.org/intelligent_systems/intsys_v7_n34_2014_paged.pdf
page: 572--594
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '10'
name: SFB 901 - Subprojekt B2
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '3'
name: SFB 901 - Project Area B
publication: International Journal On Advances in Intelligent Systems (IntSys)
publisher: IARIA
status: public
title: Incorporating Reputation Information into Decision-Making Processes in Markets
of Composed Services
type: journal_article
user_id: '65453'
volume: 7
year: '2014'
...
---
_id: '414'
author:
- first_name: Janek
full_name: Jochheim, Janek
last_name: Jochheim
citation:
ama: Jochheim J. Hiding Software Components Using Functional Encryption.
Universität Paderborn; 2014.
apa: Jochheim, J. (2014). Hiding software components using functional encryption.
Universität Paderborn.
bibtex: '@book{Jochheim_2014, title={Hiding software components using functional
encryption}, publisher={Universität Paderborn}, author={Jochheim, Janek}, year={2014}
}'
chicago: Jochheim, Janek. Hiding Software Components Using Functional Encryption.
Universität Paderborn, 2014.
ieee: J. Jochheim, Hiding software components using functional encryption.
Universität Paderborn, 2014.
mla: Jochheim, Janek. Hiding Software Components Using Functional Encryption.
Universität Paderborn, 2014.
short: J. Jochheim, Hiding Software Components Using Functional Encryption, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:12Z
date_updated: 2022-01-06T07:00:23Z
department:
- _id: '64'
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: Hiding software components using functional encryption
type: mastersthesis
user_id: '25078'
year: '2014'
...
---
_id: '416'
author:
- first_name: Pascal
full_name: Bemmann, Pascal
id: '32571'
last_name: Bemmann
citation:
ama: Bemmann P. Group Signature Schemes with Strong Exculpability. Universität
Paderborn; 2014.
apa: Bemmann, P. (2014). Group Signature Schemes with Strong Exculpability.
Universität Paderborn.
bibtex: '@book{Bemmann_2014, title={Group Signature Schemes with Strong Exculpability},
publisher={Universität Paderborn}, author={Bemmann, Pascal}, year={2014} }'
chicago: Bemmann, Pascal. Group Signature Schemes with Strong Exculpability.
Universität Paderborn, 2014.
ieee: P. Bemmann, Group Signature Schemes with Strong Exculpability. Universität
Paderborn, 2014.
mla: Bemmann, Pascal. Group Signature Schemes with Strong Exculpability.
Universität Paderborn, 2014.
short: P. Bemmann, Group Signature Schemes with Strong Exculpability, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:13Z
date_updated: 2022-01-06T07:00:26Z
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: Group Signature Schemes with Strong Exculpability
type: bachelorsthesis
user_id: '25078'
year: '2014'
...
---
_id: '421'
author:
- first_name: Jan
full_name: Lippert, Jan
last_name: Lippert
citation:
ama: Lippert J. Fujisaki-Okamoto Transformation. Universität Paderborn; 2014.
apa: Lippert, J. (2014). Fujisaki-Okamoto Transformation. Universität Paderborn.
bibtex: '@book{Lippert_2014, title={Fujisaki-Okamoto Transformation}, publisher={Universität
Paderborn}, author={Lippert, Jan}, year={2014} }'
chicago: Lippert, Jan. Fujisaki-Okamoto Transformation. Universität Paderborn,
2014.
ieee: J. Lippert, Fujisaki-Okamoto Transformation. Universität Paderborn,
2014.
mla: Lippert, Jan. Fujisaki-Okamoto Transformation. Universität Paderborn,
2014.
short: J. Lippert, Fujisaki-Okamoto Transformation, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:14Z
date_updated: 2022-01-06T07:00:36Z
department:
- _id: '64'
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: Fujisaki-Okamoto Transformation
type: bachelorsthesis
user_id: '25078'
year: '2014'
...
---
_id: '438'
author:
- first_name: Andreas
full_name: Kokoschka, Andreas
last_name: Kokoschka
citation:
ama: Kokoschka A. Designing an Anonymous and Secure Reputation System Using a
Group Signature Variant. Universität Paderborn; 2014.
apa: Kokoschka, A. (2014). Designing an Anonymous and Secure Reputation System
Using a Group Signature Variant. Universität Paderborn.
bibtex: '@book{Kokoschka_2014, title={Designing an Anonymous and Secure Reputation
System Using a Group Signature Variant}, publisher={Universität Paderborn}, author={Kokoschka,
Andreas}, year={2014} }'
chicago: Kokoschka, Andreas. Designing an Anonymous and Secure Reputation System
Using a Group Signature Variant. Universität Paderborn, 2014.
ieee: A. Kokoschka, Designing an Anonymous and Secure Reputation System Using
a Group Signature Variant. Universität Paderborn, 2014.
mla: Kokoschka, Andreas. Designing an Anonymous and Secure Reputation System
Using a Group Signature Variant. Universität Paderborn, 2014.
short: A. Kokoschka, Designing an Anonymous and Secure Reputation System Using a
Group Signature Variant, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:17Z
date_updated: 2022-01-06T07:01:00Z
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Designing an Anonymous and Secure Reputation System Using a Group Signature
Variant
type: bachelorsthesis
user_id: '15504'
year: '2014'
...