---
_id: '334'
author:
- first_name: Peter
full_name: Wagener, Peter
last_name: Wagener
citation:
ama: Wagener P. Vertical Thread Migration in FPGA Based Sound Localization.
Universität Paderborn; 2014.
apa: Wagener, P. (2014). Vertical Thread Migration in FPGA based Sound Localization.
Universität Paderborn.
bibtex: '@book{Wagener_2014, title={Vertical Thread Migration in FPGA based Sound
Localization}, publisher={Universität Paderborn}, author={Wagener, Peter}, year={2014}
}'
chicago: Wagener, Peter. Vertical Thread Migration in FPGA Based Sound Localization.
Universität Paderborn, 2014.
ieee: P. Wagener, Vertical Thread Migration in FPGA based Sound Localization.
Universität Paderborn, 2014.
mla: Wagener, Peter. Vertical Thread Migration in FPGA Based Sound Localization.
Universität Paderborn, 2014.
short: P. Wagener, Vertical Thread Migration in FPGA Based Sound Localization, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:41:57Z
date_updated: 2022-01-06T06:59:10Z
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: Vertical Thread Migration in FPGA based Sound Localization
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '346'
abstract:
- lang: eng
text: One future goal of service-oriented computing is to realize global markets
of composed services. On such markets, service providers offer services that can
be flexibly combined with each other. However, most often, market participants
are not able to individually estimate the quality of traded services in advance.
As a consequence, even potentially profitable transactions between customers and
providers might not take place. In the worst case, this can induce a market failure.
To overcome this problem, we propose the incorporation of reputation information
as an indicator for expected service quality. We address On-The-Fly Computing
as a representative environment of markets of composed services. In this environment,
customers provide feedback on transactions. We present a conceptual design of
a reputation system which collects and processes user feedback, and provides it
to participants in the market. Our contribution includes the identification of
requirements for such a reputation system from a technical and an economic perspective.
Based on these requirements, we propose a flexible solution that facilitates the
incorporation of reputation information into markets of composed services while
simultaneously preserving privacy of customers who provide feedback. The requirements
we formulate in this paper have just been partially met in literature. An integrated
approach, however, has not been addressed yet.
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
citation:
ama: 'Brangewitz S, Jungmann A, Petrlic R, Platenius MC. Towards a Flexible and
Privacy-Preserving Reputation System for Markets of Composed Services. In: Proceedings
of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION).
; 2014:49-57.'
apa: Brangewitz, S., Jungmann, A., Petrlic, R., & Platenius, M. C. (2014). Towards
a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.
In Proceedings of the 6th International Conferences on Advanced Service Computing
(SERVICE COMPUTATION) (pp. 49–57).
bibtex: '@inproceedings{Brangewitz_Jungmann_Petrlic_Platenius_2014, title={Towards
a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services},
booktitle={Proceedings of the 6th International Conferences on Advanced Service
Computing (SERVICE COMPUTATION)}, author={Brangewitz, Sonja and Jungmann, Alexander
and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={49–57}
}'
chicago: Brangewitz, Sonja, Alexander Jungmann, Ronald Petrlic, and Marie Christin
Platenius. “Towards a Flexible and Privacy-Preserving Reputation System for Markets
of Composed Services.” In Proceedings of the 6th International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), 49–57, 2014.
ieee: S. Brangewitz, A. Jungmann, R. Petrlic, and M. C. Platenius, “Towards a Flexible
and Privacy-Preserving Reputation System for Markets of Composed Services,” in
Proceedings of the 6th International Conferences on Advanced Service Computing
(SERVICE COMPUTATION), 2014, pp. 49–57.
mla: Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation
System for Markets of Composed Services.” Proceedings of the 6th International
Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2014, pp.
49–57.
short: 'S. Brangewitz, A. Jungmann, R. Petrlic, M.C. Platenius, in: Proceedings
of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION),
2014, pp. 49–57.'
date_created: 2017-10-17T12:41:59Z
date_updated: 2022-01-06T06:59:18Z
ddc:
- '040'
department:
- _id: '205'
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:26:49Z
date_updated: 2018-03-20T07:26:49Z
file_id: '1418'
file_name: 346-service_computation_2014_3_10_10005.pdf
file_size: 334101
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:26:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 49-57
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '2'
name: SFB 901 - Project Area A
- _id: '3'
name: SFB 901 - Project Area B
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 6th International Conferences on Advanced Service
Computing (SERVICE COMPUTATION)
status: public
title: Towards a Flexible and Privacy-Preserving Reputation System for Markets of
Composed Services
type: conference
user_id: '477'
year: '2014'
...
---
_id: '347'
abstract:
- lang: eng
text: Dynamic thread duplication is a known redundancy technique for multi-cores.
The approach duplicates a thread under observation for some time period and compares
the signatures of the two threads to detect errors. Hybrid multi-cores, typically
implemented on platform FPGAs, enable the unique option of running the thread
under observation and its copy in different modalities, i.e., software and hardware.
We denote our dynamic redundancy technique on hybrid multi-cores as thread shadowing.
In this paper we present the concept of thread shadowing and an implementation
on a multi-threaded hybrid multi-core architecture. We report on experiments with
a block-processing application and demonstrate the overheads, detection latencies
and coverage for a range of thread shadowing modes. The results show that trans-modal
thread shadowing, although bearing long detection latencies, offers attractive
coverage at a low overhead.
author:
- first_name: Sebastian
full_name: Meisner, Sebastian
last_name: Meisner
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Meisner S, Platzner M. Thread Shadowing: Using Dynamic Redundancy on Hybrid
Multi-cores for Error Detection. In: Goehringer D, Santambrogio M, Cardoso JP,
Bertels K, eds. Proceedings of the 10th International Symposium on Applied
Reconfigurable Computing (ARC). Lecture Notes in Computer Science. Springer;
2014:283-290. doi:10.1007/978-3-319-05960-0_30'
apa: 'Meisner, S., & Platzner, M. (2014). Thread Shadowing: Using Dynamic Redundancy
on Hybrid Multi-cores for Error Detection. In D. Goehringer, M. Santambrogio,
J. P. Cardoso, & K. Bertels (Eds.), Proceedings of the 10th International
Symposium on Applied Reconfigurable Computing (ARC) (pp. 283–290). Springer.
https://doi.org/10.1007/978-3-319-05960-0_30'
bibtex: '@inproceedings{Meisner_Platzner_2014, series={Lecture Notes in Computer
Science}, title={Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores
for Error Detection}, DOI={10.1007/978-3-319-05960-0_30},
booktitle={Proceedings of the 10th International Symposium on Applied Reconfigurable
Computing (ARC)}, publisher={Springer}, author={Meisner, Sebastian and Platzner,
Marco}, editor={Goehringer, Diana and Santambrogio, MarcoDomenico and Cardoso,
JoãoM.P. and Bertels, KoenEditors}, year={2014}, pages={283–290}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Meisner, Sebastian, and Marco Platzner. “Thread Shadowing: Using Dynamic
Redundancy on Hybrid Multi-Cores for Error Detection.” In Proceedings of the
10th International Symposium on Applied Reconfigurable Computing (ARC), edited
by Diana Goehringer, MarcoDomenico Santambrogio, JoãoM.P. Cardoso, and Koen Bertels,
283–90. Lecture Notes in Computer Science. Springer, 2014. https://doi.org/10.1007/978-3-319-05960-0_30.'
ieee: 'S. Meisner and M. Platzner, “Thread Shadowing: Using Dynamic Redundancy on
Hybrid Multi-cores for Error Detection,” in Proceedings of the 10th International
Symposium on Applied Reconfigurable Computing (ARC), 2014, pp. 283–290.'
mla: 'Meisner, Sebastian, and Marco Platzner. “Thread Shadowing: Using Dynamic Redundancy
on Hybrid Multi-Cores for Error Detection.” Proceedings of the 10th International
Symposium on Applied Reconfigurable Computing (ARC), edited by Diana Goehringer
et al., Springer, 2014, pp. 283–90, doi:10.1007/978-3-319-05960-0_30.'
short: 'S. Meisner, M. Platzner, in: D. Goehringer, M. Santambrogio, J.P. Cardoso,
K. Bertels (Eds.), Proceedings of the 10th International Symposium on Applied
Reconfigurable Computing (ARC), Springer, 2014, pp. 283–290.'
date_created: 2017-10-17T12:41:59Z
date_updated: 2022-01-06T06:59:18Z
ddc:
- '040'
department:
- _id: '78'
doi: 10.1007/978-3-319-05960-0_30
editor:
- first_name: Diana
full_name: Goehringer, Diana
last_name: Goehringer
- first_name: MarcoDomenico
full_name: Santambrogio, MarcoDomenico
last_name: Santambrogio
- first_name: JoãoM.P.
full_name: Cardoso, JoãoM.P.
last_name: Cardoso
- first_name: Koen
full_name: Bertels, Koen
last_name: Bertels
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:26:16Z
date_updated: 2018-03-20T07:26:16Z
file_id: '1417'
file_name: 347-meisner13_xx_SFB1__1_.pdf
file_size: 1168877
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:26:16Z
has_accepted_license: '1'
language:
- iso: eng
page: 283-290
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th International Symposium on Applied Reconfigurable
Computing (ARC)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Thread Shadowing: Using Dynamic Redundancy on Hybrid Multi-cores for Error
Detection'
type: conference
user_id: '398'
year: '2014'
...
---
_id: '348'
author:
- first_name: Christoph
full_name: Rüthing, Christoph
last_name: Rüthing
citation:
ama: Rüthing C. The Xilinx Zynq Architecture as a Platform for Reconfigurable
Heterogeneous Multi-Cores. Universität Paderborn; 2014.
apa: Rüthing, C. (2014). The Xilinx Zynq Architecture as a Platform for Reconfigurable
Heterogeneous Multi-Cores. Universität Paderborn.
bibtex: '@book{Rüthing_2014, title={The Xilinx Zynq Architecture as a Platform for
Reconfigurable Heterogeneous Multi-Cores}, publisher={Universität Paderborn},
author={Rüthing, Christoph}, year={2014} }'
chicago: Rüthing, Christoph. The Xilinx Zynq Architecture as a Platform for Reconfigurable
Heterogeneous Multi-Cores. Universität Paderborn, 2014.
ieee: C. Rüthing, The Xilinx Zynq Architecture as a Platform for Reconfigurable
Heterogeneous Multi-Cores. Universität Paderborn, 2014.
mla: Rüthing, Christoph. The Xilinx Zynq Architecture as a Platform for Reconfigurable
Heterogeneous Multi-Cores. Universität Paderborn, 2014.
short: C. Rüthing, The Xilinx Zynq Architecture as a Platform for Reconfigurable
Heterogeneous Multi-Cores, Universität Paderborn, 2014.
date_created: 2017-10-17T12:41:59Z
date_updated: 2022-01-06T06:59:18Z
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: The Xilinx Zynq Architecture as a Platform for Reconfigurable Heterogeneous
Multi-Cores
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '349'
abstract:
- lang: eng
text: Identity-based cryptography has attracted attention in the cryptographic research
communityin recent years. Despite the importance of cryptographic schemes for
applicationsin business and law, the legal implications of identity-based cryptography
have not yetbeen 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 onElectronic Signatures into account. In contrast to previous
assumptions, identity-basedsignature 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 identitybasedsignature schemes.
author:
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: Sorge C. The Legal Classification of Identity-Based Signatures.; 2014.
apa: Sorge, C. (2014). The Legal Classification of Identity-Based Signatures.
bibtex: '@book{Sorge_2014, title={The Legal Classification of Identity-Based Signatures},
author={Sorge, Christoph}, year={2014} }'
chicago: Sorge, Christoph. The Legal Classification of Identity-Based Signatures,
2014.
ieee: C. Sorge, The Legal Classification of Identity-Based Signatures. 2014.
mla: Sorge, Christoph. The Legal Classification of Identity-Based Signatures.
2014.
short: C. Sorge, The Legal Classification of Identity-Based Signatures, 2014.
date_created: 2017-10-17T12:42:00Z
date_updated: 2022-01-06T06:59:19Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:08:36Z
date_updated: 2018-03-21T13:08:36Z
file_id: '1568'
file_name: 349-CompLawSorge14.pdf
file_size: 232052
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:08:36Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '4'
name: SFB 901 - Project Area C
related_material:
link:
- relation: confirmation
url: https://eprint.iacr.org/2013/271
status: public
title: The Legal Classification of Identity-Based Signatures
type: report
user_id: '15504'
year: '2014'
...
---
_id: '355'
abstract:
- lang: eng
text: In the last decade pairings have become an important, and often indispensable,
ingredient in the construction of identity-based and attribute-based cryptosystems,
as well as group signatures and credential systems. Consequently, the applicability
of timing, power, or fault attacks to implementations of pairings is an important
research topic. We will review some of the known results in this area.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: 'Blömer J, Günther P, Liske G. Tampering attacks in pairing-based cryptography.
In: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC).
; 2014:1--7. doi:10.1109/FDTC.2014.10'
apa: Blömer, J., Günther, P., & Liske, G. (2014). Tampering attacks in pairing-based
cryptography. In Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)
(pp. 1--7). https://doi.org/10.1109/FDTC.2014.10
bibtex: '@inproceedings{Blömer_Günther_Liske_2014, title={Tampering attacks in pairing-based
cryptography}, DOI={10.1109/FDTC.2014.10},
booktitle={Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)},
author={Blömer, Johannes and Günther, Peter and Liske, Gennadij}, year={2014},
pages={1--7} }'
chicago: Blömer, Johannes, Peter Günther, and Gennadij Liske. “Tampering Attacks
in Pairing-Based Cryptography.” In Proceedings of Fault Tolerance and Diagnosis
in Cryptography(FDTC), 1--7, 2014. https://doi.org/10.1109/FDTC.2014.10.
ieee: J. Blömer, P. Günther, and G. Liske, “Tampering attacks in pairing-based cryptography,”
in Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC),
2014, pp. 1--7.
mla: Blömer, Johannes, et al. “Tampering Attacks in Pairing-Based Cryptography.”
Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC), 2014,
pp. 1--7, doi:10.1109/FDTC.2014.10.
short: 'J. Blömer, P. Günther, G. Liske, in: Proceedings of Fault Tolerance and
Diagnosis in Cryptography(FDTC), 2014, pp. 1--7.'
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:23Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1109/FDTC.2014.10
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:22:29Z
date_updated: 2018-03-20T07:22:29Z
file_id: '1412'
file_name: 355-Bloemer2014.pdf
file_size: 293394
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:22:29Z
has_accepted_license: '1'
page: 1--7
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publication: Proceedings of Fault Tolerance and Diagnosis in Cryptography(FDTC)
status: public
title: Tampering attacks in pairing-based cryptography
type: conference
user_id: '25078'
year: '2014'
...
---
_id: '366'
abstract:
- lang: eng
text: On-The-Fly (OTF) Computing constitutes an approach towards highly dynamic
and individualized software markets. Based on service-oriented computing, OTF
Computing is about realizing global markets of services that can be flexibly combined.
We report on our current research activities, the security and privacy implications
thereof, and our approaches to tackle the challenges. Furthermore, we discuss
how the security and privacy challenges are addressed in research projects similar
to OTF Computing.
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: 'Petrlic R, Jungmann A, Platenius MC, Schäfer W, Sorge C. Security and Privacy
Challenges in On-The-Fly Computing. In: Tagungsband Der 4. Konferenz Software-Technologien
Und -Prozesse (STeP 2014). ; 2014:131-142.'
apa: Petrlic, R., Jungmann, A., Platenius, M. C., Schäfer, W., & Sorge, C. (2014).
Security and Privacy Challenges in On-The-Fly Computing. In Tagungsband der
4. Konferenz Software-Technologien und -Prozesse (STeP 2014) (pp. 131–142).
bibtex: '@inproceedings{Petrlic_Jungmann_Platenius_Schäfer_Sorge_2014, title={Security
and Privacy Challenges in On-The-Fly Computing}, booktitle={Tagungsband der 4.
Konferenz Software-Technologien und -Prozesse (STeP 2014)}, author={Petrlic, Ronald
and Jungmann, Alexander and Platenius, Marie Christin and Schäfer, Wilhelm and
Sorge, Christoph}, year={2014}, pages={131–142} }'
chicago: Petrlic, Ronald, Alexander Jungmann, Marie Christin Platenius, Wilhelm
Schäfer, and Christoph Sorge. “Security and Privacy Challenges in On-The-Fly Computing.”
In Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014),
131–42, 2014.
ieee: R. Petrlic, A. Jungmann, M. C. Platenius, W. Schäfer, and C. Sorge, “Security
and Privacy Challenges in On-The-Fly Computing,” in Tagungsband der 4. Konferenz
Software-Technologien und -Prozesse (STeP 2014), 2014, pp. 131–142.
mla: Petrlic, Ronald, et al. “Security and Privacy Challenges in On-The-Fly Computing.”
Tagungsband Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014),
2014, pp. 131–42.
short: 'R. Petrlic, A. Jungmann, M.C. Platenius, W. Schäfer, C. Sorge, in: Tagungsband
Der 4. Konferenz Software-Technologien Und -Prozesse (STeP 2014), 2014, pp. 131–142.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:29Z
ddc:
- '040'
department:
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:18:47Z
date_updated: 2018-03-20T07:18:47Z
file_id: '1405'
file_name: 366-otf-security-privacy-final.pdf
file_size: 74488
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:18:47Z
has_accepted_license: '1'
language:
- iso: eng
page: 131-142
project:
- _id: '1'
name: SFB 901
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '3'
name: SFB 901 - Project Area B
- _id: '4'
name: SFB 901 - Project Area C
- _id: '10'
name: SFB 901 - Subproject B2
publication: Tagungsband der 4. Konferenz Software-Technologien und -Prozesse (STeP
2014)
status: public
title: Security and Privacy Challenges in On-The-Fly Computing
type: conference
user_id: '477'
year: '2014'
...
---
_id: '368'
abstract:
- lang: eng
text: We consider the problem of scheduling a number of jobs on $m$ identical processors
sharing a continuously divisible resource. Each job j comes with a resource requirement
r_j \in {0,1}. The job can be processed at full speed if granted its full resource
requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction
of the full speed. Our goal is to find a resource assignment that minimizes the
makespan (i.e., the latest completion time). Variants of such problems, relating
the resource assignment of jobs to their \emph{processing speeds}, have been studied
under the term discrete-continuous scheduling. Known results are either very pessimistic
or heuristic in nature.In this paper, we suggest and analyze a slightly simplified
model. It focuses on the assignment of shared continuous resources to the processors.
The job assignment to processors and the ordering of the jobs have already been
fixed. It is shown that, even for unit size jobs, finding an optimal solution
is NP-hard if the number of processors is part of the input. Positive results
for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover,
we prove that balanced schedules yield a 2-1/m-approximation for a fixed number
of processors. Such schedules are computed by our GreedyBalance algorithm, for
which the bound is tight.
author:
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Lars
full_name: Nagel, Lars
last_name: Nagel
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: 'Tim '
full_name: 'Suess, Tim '
last_name: Suess
citation:
ama: 'Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Suess T.
Scheduling Shared Continuous Resources on Many-Cores. In: Proceedings of the
26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
; 2014:128-137. doi:10.1145/2612669.2612698'
apa: Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S.,
& Suess, T. (2014). Scheduling Shared Continuous Resources on Many-Cores.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 128–137. https://doi.org/10.1145/2612669.2612698
bibtex: '@inproceedings{Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Suess_2014,
title={Scheduling Shared Continuous Resources on Many-Cores}, DOI={10.1145/2612669.2612698},
booktitle={Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Brinkmann, Andre and Kling, Peter and Meyer
auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim },
year={2014}, pages={128–137} }'
chicago: Brinkmann, Andre, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel,
Sören Riechers, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.”
In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 128–37, 2014. https://doi.org/10.1145/2612669.2612698.
ieee: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, and
T. Suess, “Scheduling Shared Continuous Resources on Many-Cores,” in Proceedings
of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2014, pp. 128–137, doi: 10.1145/2612669.2612698.'
mla: Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2014, pp. 128–37, doi:10.1145/2612669.2612698.
short: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, T.
Suess, in: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2014, pp. 128–137.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2612669.2612698
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:17:38Z
date_updated: 2018-03-20T07:17:38Z
file_id: '1403'
file_name: 368-BKMNRS14.pdf
file_size: 485767
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:17:38Z
has_accepted_license: '1'
language:
- iso: eng
page: 128-137
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '369'
abstract:
- lang: eng
text: 'RSA Full Domain Hash ist im Zufallsorakelmodell ein EUF-CMA sicheres Signaturverfahren
(existentially unforgeable under chosen-message attacks). Der Sicherheitsbeweis
wird unter anderem in der Vorlesung Einf{\"u}hrung in die Kryptographie vorgestellt.
Auch bei einer genaueren Analyse verliert man bei der Reduktion einen Faktor \nicefrac{1}{q_{s}}(wobei
q_{s}die Anzahl der Anfragen an das Signaturorakel darstellt), was f{\"u}r die
Praxis in relativ großen Systemparametern (RSA-Modul) resultiert [1].Seit der
Ver{\"o}ffentlichung von [2] wurde geglaubt, dass der Faktor \nicefrac{1}{q_{s}}optimal
ist. Erst zehn Jahre sp{\"a}ter offenbarten die Autoren von [3] einen Fehler in
[2] und zeigten eine bessere Reduktion allerdings unter einer etwas st{\"a}rkeren
Sicherheitsannahme.Die Ergebnisse aus [3] lassen sich auf PSS-Verfahren (Probabilistic
Signature Scheme), das z.B. in PKCS #1 benutzt wird, {\"u}bertragen und sind somit
von großer Bedeutung f{\"u}r die Praxis. Weiterhin sind die in den Beweisen verwendete
Techniken n{\"u}tzlich auch bei anderen kryptographischen Verfahren.In Rahmen
dieser Arbeit sollen die entsprechenden Sicherheitsbeweise aufgearbeitet und dessen
Auswirkungen f{\"u}r die Praxis analysiert werden.[1] J.S. Coron, “On the Exact
Security of Full Domain Hash”, CRYPTO 2000. LNCS 1880, pp. 229-235, 2000.[2] J.S.
Coron, “Optimal security proofs for PPS and other signature schemes”, EUROCRYPT
2002. LNCS 2332, pp 272-287, 2002.[3] S.A. Kakvi and E. Kiltz, “Optimal Security
Proofs for Full Domain Hash, Revisited”, in EUROCRYPT 2012. LNCS 7237, pp 537-553,
2012.'
author:
- first_name: Timo
full_name: Rath, Timo
last_name: Rath
citation:
ama: Rath T. 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: '374'
abstract:
- lang: eng
text: Run-time reconfiguration provides an opportunity to increase performance,
reduce cost and improve energy efficiency in FPGA-based systems. However, run-time
reconfigurable systems are more complex to implement than static only systems.
This increases time to market, and introduces run-time overhead into the system.
Our research aims to raise the abstraction level to develop run-time reconfigurable
systems. We present operating system extensions which enable seamless integration
of run-time reconfigurable hardware threads into applications. To improve resource
utilization, the hardware threads are placed on a fine granularity tile grid.
We take advantage of a relocatable module placer targeting modern FPGA to manage
the reconfigurable area. The module placer accurately models the FPGA resources
to compute feasible placement locations for the hardware threads at run-time.
Finally, we evaluate our work by means of a case study that consists of a synthetic
application to validate the functionality and performance of the implementation.
The results show a reduction in reconfiguration time of up to 42% and more than
double resource utilization.
author:
- first_name: Alexander
full_name: Wold, Alexander
last_name: Wold
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Jim
full_name: Torresen, Jim
last_name: Torresen
citation:
ama: 'Wold A, Agne A, Torresen J. Relocatable Hardware Threads in Run-Time Reconfigurable
Systems. In: Goehringer D, Santambrogio M, Cardoso JP, Bertels K, eds. Proceedings
of the 10th International Symposium on Reconfigurable Computing: Architectures,
Tools, and Applications. LNCS. ; 2014:61-72. doi:10.1007/978-3-319-05960-0_6'
apa: 'Wold, A., Agne, A., & Torresen, J. (2014). Relocatable Hardware Threads
in Run-Time Reconfigurable Systems. In D. Goehringer, M. Santambrogio, J. P. Cardoso,
& K. Bertels (Eds.), Proceedings of the 10th International Symposium on
Reconfigurable Computing: Architectures, Tools, and Applications (pp. 61–72).
https://doi.org/10.1007/978-3-319-05960-0_6'
bibtex: '@inproceedings{Wold_Agne_Torresen_2014, series={LNCS}, title={Relocatable
Hardware Threads in Run-Time Reconfigurable Systems}, DOI={10.1007/978-3-319-05960-0_6},
booktitle={Proceedings of the 10th International Symposium on Reconfigurable Computing:
Architectures, Tools, and Applications}, author={Wold, Alexander and Agne, Andreas
and Torresen, Jim}, editor={Goehringer, Diana and Santambrogio, MarcoDomenico
and Cardoso, JoãoM.P. and Bertels, KoenEditors}, year={2014}, pages={61–72}, collection={LNCS}
}'
chicago: 'Wold, Alexander, Andreas Agne, and Jim Torresen. “Relocatable Hardware
Threads in Run-Time Reconfigurable Systems.” In Proceedings of the 10th International
Symposium on Reconfigurable Computing: Architectures, Tools, and Applications,
edited by Diana Goehringer, MarcoDomenico Santambrogio, JoãoM.P. Cardoso, and
Koen Bertels, 61–72. LNCS, 2014. https://doi.org/10.1007/978-3-319-05960-0_6.'
ieee: 'A. Wold, A. Agne, and J. Torresen, “Relocatable Hardware Threads in Run-Time
Reconfigurable Systems,” in Proceedings of the 10th International Symposium
on Reconfigurable Computing: Architectures, Tools, and Applications, 2014,
pp. 61–72.'
mla: 'Wold, Alexander, et al. “Relocatable Hardware Threads in Run-Time Reconfigurable
Systems.” Proceedings of the 10th International Symposium on Reconfigurable
Computing: Architectures, Tools, and Applications, edited by Diana Goehringer
et al., 2014, pp. 61–72, doi:10.1007/978-3-319-05960-0_6.'
short: 'A. Wold, A. Agne, J. Torresen, in: D. Goehringer, M. Santambrogio, J.P.
Cardoso, K. Bertels (Eds.), Proceedings of the 10th International Symposium on
Reconfigurable Computing: Architectures, Tools, and Applications, 2014, pp. 61–72.'
date_created: 2017-10-17T12:42:05Z
date_updated: 2022-01-06T06:59:32Z
ddc:
- '040'
doi: 10.1007/978-3-319-05960-0_6
editor:
- first_name: Diana
full_name: Goehringer, Diana
last_name: Goehringer
- first_name: MarcoDomenico
full_name: Santambrogio, MarcoDomenico
last_name: Santambrogio
- first_name: JoãoM.P.
full_name: Cardoso, JoãoM.P.
last_name: Cardoso
- first_name: Koen
full_name: Bertels, Koen
last_name: Bertels
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:15:59Z
date_updated: 2018-03-20T07:15:59Z
file_id: '1400'
file_name: 374-2014_wold_arc.pdf
file_size: 818625
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:15:59Z
has_accepted_license: '1'
page: 61-72
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publication: 'Proceedings of the 10th International Symposium on Reconfigurable Computing:
Architectures, Tools, and Applications'
series_title: LNCS
status: public
title: Relocatable Hardware Threads in Run-Time Reconfigurable Systems
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: '389'
abstract:
- lang: eng
text: This article presents a new approach for representing and processing abstract
optimization models. Confronted with model and data integration tasks for distributed
Decision Support Systems which are especially composed out of software services,
we describe model constituents such as constraints both structurally and semantically.
Within our approach, typed model constituents can be integrated into complete
models and the instantiation of model constituents itself with data and data models
can be wrapped into semantic software services. Besides others, this supports
the automated generation of adaptors and the search for and composition of services.
The basic idea of our approach is to represent the optimization models as instance
knowledge of different ontologies for both optimization and application domains.
By separating the model expression structure from the goal and constraint conceptualizations
predefined modeling constructs can be reused, where we do not only separate the
model structure from data, but can also abstract the structure from a specific
data model. We present an XML and ontology-query based approach for this separation
and demonstrate the resulting flexible model integration procedure out of reusable
goal and constraint types on a network flow problem.
author:
- first_name: Florian
full_name: Stapel, Florian
last_name: Stapel
- first_name: Lena
full_name: Suhl, Lena
last_name: Suhl
citation:
ama: Stapel F, Suhl L. Ontology-Based Representation of Optimization Models.
Universität Paderborn; 2014.
apa: Stapel, F., & Suhl, L. (2014). Ontology-based Representation of Optimization
Models. Universität Paderborn.
bibtex: '@book{Stapel_Suhl_2014, title={Ontology-based Representation of Optimization
Models}, publisher={Universität Paderborn}, author={Stapel, Florian and Suhl,
Lena}, year={2014} }'
chicago: Stapel, Florian, and Lena Suhl. Ontology-Based Representation of Optimization
Models. Universität Paderborn, 2014.
ieee: F. Stapel and L. Suhl, Ontology-based Representation of Optimization Models.
Universität Paderborn, 2014.
mla: Stapel, Florian, and Lena Suhl. Ontology-Based Representation of Optimization
Models. Universität Paderborn, 2014.
short: F. Stapel, L. Suhl, Ontology-Based Representation of Optimization Models,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:07Z
date_updated: 2022-01-06T06:59:49Z
ddc:
- '040'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:01:29Z
date_updated: 2018-03-20T07:01:29Z
file_id: '1386'
file_name: 389-201x_-_Stapel__Suhl_-_Ontology-based_Representation_of_Optimization_Models.pdf
file_size: 595852
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:01:29Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '15'
name: SFB 901 - Subprojekt C3
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Ontology-based Representation of Optimization Models
type: report
user_id: '15504'
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'
...