---
_id: '377'
abstract:
- lang: eng
text: In this paper, we study how AES key schedules can be reconstructed from decayed
memory. This operation is a crucial and time consuming operation when trying to
break encryption systems with cold-boot attacks. In software, the reconstruction
of the AES master key can be performed using a recursive, branch-and-bound tree-search
algorithm that exploits redundancies in the key schedule for constraining the
search space. In this work, we investigate how this branch-and-bound algorithm
can be accelerated with FPGAs. We translated the recursive search procedure to
a state machine with an explicit stack for each recursion level and create optimized
datapaths to accelerate in particular the processing of the most frequently accessed
tree levels. We support two different decay models, of which especially the more
realistic non-idealized asymmetric decay model causes very high runtimes in software.
Our implementation on a Maxeler dataflow computing system outperforms a software
implementation for this model by up to 27x, which makes cold-boot attacks against
AES practical even for high error rates.
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Christoph
full_name: Sorge, Christoph
last_name: Sorge
citation:
ama: 'Riebler H, Kenter T, Plessl C, Sorge C. Reconstructing AES Key Schedules from
Decayed Memory with FPGAs. In: Proceedings of Field-Programmable Custom Computing
Machines (FCCM). IEEE; 2014:222-229. doi:10.1109/FCCM.2014.67'
apa: Riebler, H., Kenter, T., Plessl, C., & Sorge, C. (2014). Reconstructing
AES Key Schedules from Decayed Memory with FPGAs. Proceedings of Field-Programmable
Custom Computing Machines (FCCM), 222–229. https://doi.org/10.1109/FCCM.2014.67
bibtex: '@inproceedings{Riebler_Kenter_Plessl_Sorge_2014, title={Reconstructing
AES Key Schedules from Decayed Memory with FPGAs}, DOI={10.1109/FCCM.2014.67},
booktitle={Proceedings of Field-Programmable Custom Computing Machines (FCCM)},
publisher={IEEE}, author={Riebler, Heinrich and Kenter, Tobias and Plessl, Christian
and Sorge, Christoph}, year={2014}, pages={222–229} }'
chicago: Riebler, Heinrich, Tobias Kenter, Christian Plessl, and Christoph Sorge.
“Reconstructing AES Key Schedules from Decayed Memory with FPGAs.” In Proceedings
of Field-Programmable Custom Computing Machines (FCCM), 222–29. IEEE, 2014.
https://doi.org/10.1109/FCCM.2014.67.
ieee: 'H. Riebler, T. Kenter, C. Plessl, and C. Sorge, “Reconstructing AES Key Schedules
from Decayed Memory with FPGAs,” in Proceedings of Field-Programmable Custom
Computing Machines (FCCM), 2014, pp. 222–229, doi: 10.1109/FCCM.2014.67.'
mla: Riebler, Heinrich, et al. “Reconstructing AES Key Schedules from Decayed Memory
with FPGAs.” Proceedings of Field-Programmable Custom Computing Machines (FCCM),
IEEE, 2014, pp. 222–29, doi:10.1109/FCCM.2014.67.
short: 'H. Riebler, T. Kenter, C. Plessl, C. Sorge, in: Proceedings of Field-Programmable
Custom Computing Machines (FCCM), IEEE, 2014, pp. 222–229.'
date_created: 2017-10-17T12:42:05Z
date_updated: 2023-09-26T13:33:50Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/FCCM.2014.67
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:14:20Z
date_updated: 2018-03-20T07:14:20Z
file_id: '1397'
file_name: 377-FCCM14.pdf
file_size: 1003907
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:14:20Z
has_accepted_license: '1'
keyword:
- coldboot
language:
- iso: eng
page: 222-229
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Proceedings of Field-Programmable Custom Computing Machines (FCCM)
publisher: IEEE
quality_controlled: '1'
status: public
title: Reconstructing AES Key Schedules from Decayed Memory with FPGAs
type: conference
user_id: '15278'
year: '2014'
...
---
_id: '365'
abstract:
- lang: eng
text: Self-aware computing is a paradigm for structuring and simplifying the design
and operation of computing systems that face unprecedented levels of system dynamics
and thus require novel forms of adaptivity. The generality of the paradigm makes
it applicable to many types of computing systems and, previously, researchers
started to introduce concepts of self-awareness to multicore architectures. In
our work we build on a recent reference architectural framework as a model for
self-aware computing and instantiate it for an FPGA-based heterogeneous multicore
running the ReconOS reconfigurable architecture and operating system. After presenting
the model for self-aware computing and ReconOS, we demonstrate with a case study
how a multicore application built on the principle of self-awareness, autonomously
adapts to changes in the workload and system state. Our work shows that the reference
architectural framework as a model for self-aware computing can be practically
applied and allows us to structure and simplify the design process, which is essential
for designing complex future computing systems.
article_number: '13'
author:
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Achim
full_name: Lösch, Achim
id: '43646'
last_name: Lösch
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: Agne A, Happe M, Lösch A, Plessl C, Platzner M. Self-awareness as a Model for
Designing and Operating Heterogeneous Multicores. ACM Transactions on Reconfigurable
Technology and Systems (TRETS). 2014;7(2). doi:10.1145/2617596
apa: Agne, A., Happe, M., Lösch, A., Plessl, C., & Platzner, M. (2014). Self-awareness
as a Model for Designing and Operating Heterogeneous Multicores. ACM Transactions
on Reconfigurable Technology and Systems (TRETS), 7(2), Article 13.
https://doi.org/10.1145/2617596
bibtex: '@article{Agne_Happe_Lösch_Plessl_Platzner_2014, title={Self-awareness as
a Model for Designing and Operating Heterogeneous Multicores}, volume={7}, DOI={10.1145/2617596}, number={213}, journal={ACM
Transactions on Reconfigurable Technology and Systems (TRETS)}, publisher={ACM},
author={Agne, Andreas and Happe, Markus and Lösch, Achim and Plessl, Christian
and Platzner, Marco}, year={2014} }'
chicago: Agne, Andreas, Markus Happe, Achim Lösch, Christian Plessl, and Marco Platzner.
“Self-Awareness as a Model for Designing and Operating Heterogeneous Multicores.”
ACM Transactions on Reconfigurable Technology and Systems (TRETS) 7, no.
2 (2014). https://doi.org/10.1145/2617596.
ieee: 'A. Agne, M. Happe, A. Lösch, C. Plessl, and M. Platzner, “Self-awareness
as a Model for Designing and Operating Heterogeneous Multicores,” ACM Transactions
on Reconfigurable Technology and Systems (TRETS), vol. 7, no. 2, Art. no.
13, 2014, doi: 10.1145/2617596.'
mla: Agne, Andreas, et al. “Self-Awareness as a Model for Designing and Operating
Heterogeneous Multicores.” ACM Transactions on Reconfigurable Technology and
Systems (TRETS), vol. 7, no. 2, 13, ACM, 2014, doi:10.1145/2617596.
short: A. Agne, M. Happe, A. Lösch, C. Plessl, M. Platzner, ACM Transactions on
Reconfigurable Technology and Systems (TRETS) 7 (2014).
date_created: 2017-10-17T12:42:03Z
date_updated: 2023-09-26T13:33:31Z
ddc:
- '040'
department:
- _id: '27'
- _id: '78'
- _id: '518'
doi: 10.1145/2617596
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:19:19Z
date_updated: 2018-03-20T07:19:19Z
file_id: '1406'
file_name: 365-plessl14_trets_01.pdf
file_size: 916052
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:19:19Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '2'
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: ACM Transactions on Reconfigurable Technology and Systems (TRETS)
publisher: ACM
quality_controlled: '1'
status: public
title: Self-awareness as a Model for Designing and Operating Heterogeneous Multicores
type: journal_article
user_id: '15278'
volume: 7
year: '2014'
...
---
_id: '328'
abstract:
- lang: eng
text: The ReconOS operating system for reconfigurable computing offers a unified
multi-threaded programming model and operating system services for threads executing
in software and threads mapped to reconfigurable hardware. The operating system
interface allows hardware threads to interact with software threads using well-known
mechanisms such as semaphores, mutexes, condition variables, and message queues.
By semantically integrating hardware accelerators into a standard operating system
environment, ReconOS allows for rapid design space exploration, supports a structured
application development process and improves the portability of applications
author:
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Ariane
full_name: Keller, Ariane
last_name: Keller
- first_name: Enno
full_name: Lübbers, Enno
last_name: Lübbers
- first_name: Bernhard
full_name: Plattner, Bernhard
last_name: Plattner
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: Agne A, Happe M, Keller A, et al. ReconOS - An Operating System Approach for
Reconfigurable Computing. IEEE Micro. 2014;34(1):60-71. doi:10.1109/MM.2013.110
apa: Agne, A., Happe, M., Keller, A., Lübbers, E., Plattner, B., Platzner, M., &
Plessl, C. (2014). ReconOS - An Operating System Approach for Reconfigurable Computing.
IEEE Micro, 34(1), 60–71. https://doi.org/10.1109/MM.2013.110
bibtex: '@article{Agne_Happe_Keller_Lübbers_Plattner_Platzner_Plessl_2014, title={ReconOS
- An Operating System Approach for Reconfigurable Computing}, volume={34}, DOI={10.1109/MM.2013.110}, number={1},
journal={IEEE Micro}, publisher={IEEE}, author={Agne, Andreas and Happe, Markus
and Keller, Ariane and Lübbers, Enno and Plattner, Bernhard and Platzner, Marco
and Plessl, Christian}, year={2014}, pages={60–71} }'
chicago: 'Agne, Andreas, Markus Happe, Ariane Keller, Enno Lübbers, Bernhard Plattner,
Marco Platzner, and Christian Plessl. “ReconOS - An Operating System Approach
for Reconfigurable Computing.” IEEE Micro 34, no. 1 (2014): 60–71. https://doi.org/10.1109/MM.2013.110.'
ieee: 'A. Agne et al., “ReconOS - An Operating System Approach for Reconfigurable
Computing,” IEEE Micro, vol. 34, no. 1, pp. 60–71, 2014, doi: 10.1109/MM.2013.110.'
mla: Agne, Andreas, et al. “ReconOS - An Operating System Approach for Reconfigurable
Computing.” IEEE Micro, vol. 34, no. 1, IEEE, 2014, pp. 60–71, doi:10.1109/MM.2013.110.
short: A. Agne, M. Happe, A. Keller, E. Lübbers, B. Plattner, M. Platzner, C. Plessl,
IEEE Micro 34 (2014) 60–71.
date_created: 2017-10-17T12:41:55Z
date_updated: 2023-09-26T13:32:31Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/MM.2013.110
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:31:40Z
date_updated: 2018-03-20T07:31:40Z
file_id: '1426'
file_name: 328-plessl14_micro_01.pdf
file_size: 1877185
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:31:40Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '1'
language:
- iso: eng
page: 60-71
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: IEEE Micro
publisher: IEEE
quality_controlled: '1'
status: public
title: ReconOS - An Operating System Approach for Reconfigurable Computing
type: journal_article
user_id: '15278'
volume: 34
year: '2014'
...
---
_id: '439'
abstract:
- lang: eng
text: Reconfigurable architectures provide an opportunityto accelerate a wide range
of applications, frequentlyby exploiting data-parallelism, where the same operations
arehomogeneously executed on a (large) set of data. However, whenthe sequential
code is executed on a host CPU and only dataparallelloops are executed on an FPGA
coprocessor, a sufficientlylarge number of loop iterations (trip counts) is required,
such thatthe control- and data-transfer overheads to the coprocessor canbe amortized.
However, the trip count of large data-parallel loopsis frequently not known at
compile time, but only at runtime justbefore entering a loop. Therefore, we propose
to generate codeboth for the CPU and the coprocessor, and to defer the decisionwhere
to execute the appropriate code to the runtime of theapplication when the trip
count of the loop can be determinedjust at runtime. We demonstrate how an LLVM
compiler basedtoolflow can automatically insert appropriate decision blocks intothe
application code. Analyzing popular benchmark suites, weshow that this kind of
runtime decisions is often applicable. Thepractical feasibility of our approach
is demonstrated by a toolflowthat automatically identifies loops suitable for
vectorization andgenerates code for the FPGA coprocessor of a Convey HC-1. Thetoolflow
adds decisions based on a comparison of the runtimecomputedtrip counts to thresholds
for specific loops and alsoincludes support to move just the required data to
the coprocessor.We evaluate the integrated toolflow with characteristic loopsexecuted
on different input data sizes.
author:
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Vaz GF, Riebler H, Kenter T, Plessl C. Deferring Accelerator Offloading Decisions
to Application Runtime. In: Proceedings of the International Conference on
ReConFigurable Computing and FPGAs (ReConFig). IEEE; 2014:1-8. doi:10.1109/ReConFig.2014.7032509'
apa: Vaz, G. F., Riebler, H., Kenter, T., & Plessl, C. (2014). Deferring Accelerator
Offloading Decisions to Application Runtime. Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 1–8. https://doi.org/10.1109/ReConFig.2014.7032509
bibtex: '@inproceedings{Vaz_Riebler_Kenter_Plessl_2014, title={Deferring Accelerator
Offloading Decisions to Application Runtime}, DOI={10.1109/ReConFig.2014.7032509},
booktitle={Proceedings of the International Conference on ReConFigurable Computing
and FPGAs (ReConFig)}, publisher={IEEE}, author={Vaz, Gavin Francis and Riebler,
Heinrich and Kenter, Tobias and Plessl, Christian}, year={2014}, pages={1–8} }'
chicago: Vaz, Gavin Francis, Heinrich Riebler, Tobias Kenter, and Christian Plessl.
“Deferring Accelerator Offloading Decisions to Application Runtime.” In Proceedings
of the International Conference on ReConFigurable Computing and FPGAs (ReConFig),
1–8. IEEE, 2014. https://doi.org/10.1109/ReConFig.2014.7032509.
ieee: 'G. F. Vaz, H. Riebler, T. Kenter, and C. Plessl, “Deferring Accelerator Offloading
Decisions to Application Runtime,” in Proceedings of the International Conference
on ReConFigurable Computing and FPGAs (ReConFig), 2014, pp. 1–8, doi: 10.1109/ReConFig.2014.7032509.'
mla: Vaz, Gavin Francis, et al. “Deferring Accelerator Offloading Decisions to Application
Runtime.” Proceedings of the International Conference on ReConFigurable Computing
and FPGAs (ReConFig), IEEE, 2014, pp. 1–8, doi:10.1109/ReConFig.2014.7032509.
short: 'G.F. Vaz, H. Riebler, T. Kenter, C. Plessl, in: Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2014, pp. 1–8.'
date_created: 2017-10-17T12:42:17Z
date_updated: 2023-09-26T13:37:02Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ReConFig.2014.7032509
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:29:52Z
date_updated: 2018-03-16T11:29:52Z
file_id: '1353'
file_name: 439-plessl14a_reconfig.pdf
file_size: 557362
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:29:52Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-8
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Proceedings of the International Conference on ReConFigurable Computing
and FPGAs (ReConFig)
publisher: IEEE
quality_controlled: '1'
status: public
title: Deferring Accelerator Offloading Decisions to Application Runtime
type: conference
user_id: '15278'
year: '2014'
...
---
_id: '406'
abstract:
- lang: eng
text: Stereo-matching algorithms recently received a lot of attention from the FPGA
acceleration community. Presented solutions range from simple, very resource efficient
systems with modest matching quality for small embedded systems to sophisticated
algorithms with several processing steps, implemented on big FPGAs. In order to
achieve high throughput, most implementations strongly focus on pipelining and
data reuse between different computation steps. This approach leads to high efficiency,
but limits the supported computation patterns and due the high integration of
the implementation, adaptions to the algorithm are difficult. In this work, we
present a stereo-matching implementation, that starts by offloading individual
kernels from the CPU to the FPGA. Between subsequent compute steps on the FPGA,
data is stored off-chip in on-board memory of the FPGA accelerator card. This
enables us to accelerate the AD-census algorithm with cross-based aggregation
and scanline optimization for the first time without algorithmic changes and for
up to full HD image dimensions. Analyzing throughput and bandwidth requirements,
we outline some trade-offs that are involved with this approach, compared to tighter
integration of more kernel loops into one design.
author:
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Henning
full_name: Schmitz, Henning
last_name: Schmitz
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Kenter T, Schmitz H, Plessl C. Kernel-Centric Acceleration of High Accuracy
Stereo-Matching. In: Proceedings of the International Conference on ReConFigurable
Computing and FPGAs (ReConFig). IEEE; 2014:1-8. doi:10.1109/ReConFig.2014.7032535'
apa: Kenter, T., Schmitz, H., & Plessl, C. (2014). Kernel-Centric Acceleration
of High Accuracy Stereo-Matching. Proceedings of the International Conference
on ReConFigurable Computing and FPGAs (ReConFig), 1–8. https://doi.org/10.1109/ReConFig.2014.7032535
bibtex: '@inproceedings{Kenter_Schmitz_Plessl_2014, title={Kernel-Centric Acceleration
of High Accuracy Stereo-Matching}, DOI={10.1109/ReConFig.2014.7032535},
booktitle={Proceedings of the International Conference on ReConFigurable Computing
and FPGAs (ReConFig)}, publisher={IEEE}, author={Kenter, Tobias and Schmitz, Henning
and Plessl, Christian}, year={2014}, pages={1–8} }'
chicago: Kenter, Tobias, Henning Schmitz, and Christian Plessl. “Kernel-Centric
Acceleration of High Accuracy Stereo-Matching.” In Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 1–8. IEEE, 2014.
https://doi.org/10.1109/ReConFig.2014.7032535.
ieee: 'T. Kenter, H. Schmitz, and C. Plessl, “Kernel-Centric Acceleration of High
Accuracy Stereo-Matching,” in Proceedings of the International Conference on
ReConFigurable Computing and FPGAs (ReConFig), 2014, pp. 1–8, doi: 10.1109/ReConFig.2014.7032535.'
mla: Kenter, Tobias, et al. “Kernel-Centric Acceleration of High Accuracy Stereo-Matching.”
Proceedings of the International Conference on ReConFigurable Computing and
FPGAs (ReConFig), IEEE, 2014, pp. 1–8, doi:10.1109/ReConFig.2014.7032535.
short: 'T. Kenter, H. Schmitz, C. Plessl, in: Proceedings of the International Conference
on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2014, pp. 1–8.'
date_created: 2017-10-17T12:42:11Z
date_updated: 2023-09-26T13:36:40Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ReConFig.2014.7032535
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:37:42Z
date_updated: 2018-03-16T11:37:42Z
file_id: '1366'
file_name: 406-ReConFig14.pdf
file_size: 932852
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:37:42Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-8
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Proceedings of the International Conference on ReConFigurable Computing
and FPGAs (ReConFig)
publisher: IEEE
quality_controlled: '1'
status: public
title: Kernel-Centric Acceleration of High Accuracy Stereo-Matching
type: conference
user_id: '15278'
year: '2014'
...
---
_id: '471'
author:
- first_name: Alina
full_name: Tezer, Alina
last_name: Tezer
citation:
ama: Tezer A. Verteilte Erstellung und Aktualisierung von Schlüsselservern in
identitätsbasierten Verschlüsselungssystemen. Universität Paderborn; 2013.
apa: Tezer, A. (2013). Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn.
bibtex: '@book{Tezer_2013, title={Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen}, publisher={Universität Paderborn},
author={Tezer, Alina}, year={2013} }'
chicago: Tezer, Alina. Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.
ieee: A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.
mla: Tezer, Alina. Verteilte Erstellung und Aktualisierung von Schlüsselservern
in identitätsbasierten Verschlüsselungssystemen. Universität Paderborn, 2013.
short: A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern in
identitätsbasierten Verschlüsselungssystemen, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:23Z
date_updated: 2022-01-06T07:01:19Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten
Verschlüsselungssystemen
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '473'
abstract:
- lang: eng
text: We present a solution to the problem of privacy invasion in a multiparty digital
rights management scheme. (Roaming) users buy content licenses from a content
provider and execute it at any nearby content distributor. Our approach, which
does not need any trusted third party - in contrast to most related work on privacy-preserving
DRM - is based on a re-encryption scheme that runs on any mobile Android device.
Only a minor security-critical part needs to be performed on the device's smartcard
which could, for instance, be a SIM card.
author:
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Stephan
full_name: Sekula, Stephan
last_name: Sekula
citation:
ama: 'Petrlic R, Sekula S. Unlinkable content playbacks in a multiparty DRM system.
In: Wang L, Shafiq B, eds. Data and Applications Security and Privacy XXVII.
Lecture Notes in Computer Science. ; 2013:289-296. doi:10.1007/978-3-642-39256-6_21'
apa: Petrlic, R., & Sekula, S. (2013). Unlinkable content playbacks in a multiparty
DRM system. In L. Wang & B. Shafiq (Eds.), Data and Applications Security
and Privacy XXVII (pp. 289–296). https://doi.org/10.1007/978-3-642-39256-6_21
bibtex: '@inproceedings{Petrlic_Sekula_2013, series={Lecture Notes in Computer Science},
title={Unlinkable content playbacks in a multiparty DRM system}, DOI={10.1007/978-3-642-39256-6_21},
booktitle={Data and Applications Security and Privacy XXVII}, author={Petrlic,
Ronald and Sekula, Stephan}, editor={Wang, Lingyu and Shafiq, BasitEditors}, year={2013},
pages={289–296}, collection={Lecture Notes in Computer Science} }'
chicago: Petrlic, Ronald, and Stephan Sekula. “Unlinkable Content Playbacks in a
Multiparty DRM System.” In Data and Applications Security and Privacy XXVII,
edited by Lingyu Wang and Basit Shafiq, 289–96. Lecture Notes in Computer Science,
2013. https://doi.org/10.1007/978-3-642-39256-6_21.
ieee: R. Petrlic and S. Sekula, “Unlinkable content playbacks in a multiparty DRM
system,” in Data and Applications Security and Privacy XXVII, 2013, pp.
289–296.
mla: Petrlic, Ronald, and Stephan Sekula. “Unlinkable Content Playbacks in a Multiparty
DRM System.” Data and Applications Security and Privacy XXVII, edited by
Lingyu Wang and Basit Shafiq, 2013, pp. 289–96, doi:10.1007/978-3-642-39256-6_21.
short: 'R. Petrlic, S. Sekula, in: L. Wang, B. Shafiq (Eds.), Data and Applications
Security and Privacy XXVII, 2013, pp. 289–296.'
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:19Z
ddc:
- '040'
doi: 10.1007/978-3-642-39256-6_21
editor:
- first_name: Lingyu
full_name: Wang, Lingyu
last_name: Wang
- first_name: Basit
full_name: Shafiq, Basit
last_name: Shafiq
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:17:30Z
date_updated: 2018-03-16T11:17:30Z
file_id: '1330'
file_name: 473-drm-general-1-camera-ready.pdf
file_size: 286049
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:17:30Z
has_accepted_license: '1'
page: 289-296
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Data and Applications Security and Privacy XXVII
series_title: Lecture Notes in Computer Science
status: public
title: Unlinkable content playbacks in a multiparty DRM system
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '475'
abstract:
- lang: eng
text: We propose a privacy-preserving digital rights management scheme for (future)
cloud computing. Users buy software from software providers and execute it at
computing centers. Our solution allows software providers to provide different
license models, like execute at most n-times models. Users’ anonymity and unlinkability
of actions are preserved and thus, profile building is not even possible under
(a) pseudonym. Privacy protection in the honest-but-curious model is achieved
by combining ring signatures with an anonymous recipient scheme.We employ secret
sharing in a unique manner that allows the software provider to expose the user’s
identity if the user commits fraud, e.g. by exceeding the execution limit n.
author:
- first_name: Nakul
full_name: Joshi, Nakul
last_name: Joshi
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
citation:
ama: 'Joshi N, Petrlic R. Towards practical privacy-preserving Digital Rights Management
for Cloud Computing. In: Proceedings of the 10th Annual IEEE Consumer Communications
& Networking Conference (CCNC). ; 2013:259-264. doi:10.1109/CCNC.2013.6488456'
apa: Joshi, N., & Petrlic, R. (2013). Towards practical privacy-preserving Digital
Rights Management for Cloud Computing. In Proceedings of the 10th Annual IEEE
Consumer Communications & Networking Conference (CCNC) (pp. 259–264).
https://doi.org/10.1109/CCNC.2013.6488456
bibtex: '@inproceedings{Joshi_Petrlic_2013, title={Towards practical privacy-preserving
Digital Rights Management for Cloud Computing}, DOI={10.1109/CCNC.2013.6488456},
booktitle={Proceedings of the 10th Annual IEEE Consumer Communications & Networking
Conference (CCNC)}, author={Joshi, Nakul and Petrlic, Ronald}, year={2013}, pages={259–264}
}'
chicago: Joshi, Nakul, and Ronald Petrlic. “Towards Practical Privacy-Preserving
Digital Rights Management for Cloud Computing.” In Proceedings of the 10th
Annual IEEE Consumer Communications & Networking Conference (CCNC), 259–64,
2013. https://doi.org/10.1109/CCNC.2013.6488456.
ieee: N. Joshi and R. Petrlic, “Towards practical privacy-preserving Digital Rights
Management for Cloud Computing,” in Proceedings of the 10th Annual IEEE Consumer
Communications & Networking Conference (CCNC), 2013, pp. 259–264.
mla: Joshi, Nakul, and Ronald Petrlic. “Towards Practical Privacy-Preserving Digital
Rights Management for Cloud Computing.” Proceedings of the 10th Annual IEEE
Consumer Communications & Networking Conference (CCNC), 2013, pp. 259–64,
doi:10.1109/CCNC.2013.6488456.
short: 'N. Joshi, R. Petrlic, in: Proceedings of the 10th Annual IEEE Consumer Communications
& Networking Conference (CCNC), 2013, pp. 259–264.'
date_created: 2017-10-17T12:42:24Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
doi: 10.1109/CCNC.2013.6488456
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:16:29Z
date_updated: 2018-03-16T11:16:29Z
file_id: '1328'
file_name: 475-privacy-drm-cloud-5.pdf
file_size: 370473
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:16:29Z
has_accepted_license: '1'
page: 259-264
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 10th Annual IEEE Consumer Communications & Networking
Conference (CCNC)
status: public
title: Towards practical privacy-preserving Digital Rights Management for Cloud Computing
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '486'
author:
- first_name: Oliver
full_name: Otte, Oliver
last_name: Otte
citation:
ama: Otte O. Seitenkanalresistenz paarungsbasierter Kryptographie. Universität
Paderborn; 2013.
apa: Otte, O. (2013). Seitenkanalresistenz paarungsbasierter Kryptographie.
Universität Paderborn.
bibtex: '@book{Otte_2013, title={Seitenkanalresistenz paarungsbasierter Kryptographie},
publisher={Universität Paderborn}, author={Otte, Oliver}, year={2013} }'
chicago: Otte, Oliver. Seitenkanalresistenz paarungsbasierter Kryptographie.
Universität Paderborn, 2013.
ieee: O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie. Universität
Paderborn, 2013.
mla: Otte, Oliver. Seitenkanalresistenz paarungsbasierter Kryptographie.
Universität Paderborn, 2013.
short: O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:27Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Seitenkanalresistenz paarungsbasierter Kryptographie
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '487'
author:
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
citation:
ama: Bobolz J. Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn; 2013.
apa: Bobolz, J. (2013). Security Proofs for Pairing-Based Cryptography in the
Generic Group Model. Universität Paderborn.
bibtex: '@book{Bobolz_2013, title={Security Proofs for Pairing-Based Cryptography
in the Generic Group Model}, publisher={Universität Paderborn}, author={Bobolz,
Jan}, year={2013} }'
chicago: Bobolz, Jan. Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn, 2013.
ieee: J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn, 2013.
mla: Bobolz, Jan. Security Proofs for Pairing-Based Cryptography in the Generic
Group Model. Universität Paderborn, 2013.
short: J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic
Group Model, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
content_type: application/pdf
creator: jbobolz
date_created: 2018-04-13T11:42:08Z
date_updated: 2018-06-29T09:56:54Z
file_id: '2346'
file_name: thesis_jbobolz_final.pdf
file_size: 874286
relation: main_file
file_date_updated: 2018-06-29T09:56:54Z
has_accepted_license: '1'
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
title: Security Proofs for Pairing-Based Cryptography in the Generic Group Model
type: bachelorsthesis
urn: '4875'
user_id: '27207'
year: '2013'
...
---
_id: '488'
abstract:
- lang: eng
text: Unattended systems are key ingredients of various critical infrastruc-tures
like networks of self service terminals or automated teller machines.For cost
and efficiency reasons they should mostly run autonomously.Unattended systems
are attractive and lucrative targets for various kindsof attacks, including attacks
on the integrity of their components and thecommunication between components.
In this paper, we propose a gen-eral cryptographic framework to protect unattended
systems. We alsodemonstrate that instantiating the framework with techniques from
iden-tity based cryptography is particularly well-suited to efficiently secureunattended
systems.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Peter
full_name: Günther, Peter
last_name: Günther
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
citation:
ama: 'Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with
Identity Based Cryptography - A Case Study. In: Proceedings of the 5th International
Conference on Mathematical Aspects of Computer and Information Sciences (MACIS).
; 2013:98-105.'
apa: Blömer, J., Günther, P., & Krummel, V. (2013). Securing Critical Unattended
Systems with Identity Based Cryptography - A Case Study. In Proceedings of
the 5th International Conference on Mathematical Aspects of Computer and Information
Sciences (MACIS) (pp. 98–105).
bibtex: '@inproceedings{Blömer_Günther_Krummel_2013, title={Securing Critical Unattended
Systems with Identity Based Cryptography - A Case Study}, booktitle={Proceedings
of the 5th International Conference on Mathematical Aspects of Computer and Information
Sciences (MACIS)}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker},
year={2013}, pages={98–105} }'
chicago: Blömer, Johannes, Peter Günther, and Volker Krummel. “Securing Critical
Unattended Systems with Identity Based Cryptography - A Case Study.” In Proceedings
of the 5th International Conference on Mathematical Aspects of Computer and Information
Sciences (MACIS), 98–105, 2013.
ieee: J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems
with Identity Based Cryptography - A Case Study,” in Proceedings of the 5th
International Conference on Mathematical Aspects of Computer and Information Sciences
(MACIS), 2013, pp. 98–105.
mla: Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity
Based Cryptography - A Case Study.” Proceedings of the 5th International Conference
on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013,
pp. 98–105.
short: 'J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International
Conference on Mathematical Aspects of Computer and Information Sciences (MACIS),
2013, pp. 98–105.'
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:46:52Z
date_updated: 2018-03-15T13:46:52Z
file_id: '1317'
file_name: 488-MACIS13.pdf
file_size: 301962
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:46:52Z
has_accepted_license: '1'
page: 98-105
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 5th International Conference on Mathematical Aspects
of Computer and Information Sciences (MACIS)
status: public
title: Securing Critical Unattended Systems with Identity Based Cryptography - A Case
Study
type: conference
user_id: '477'
year: '2013'
...
---
_id: '489'
author:
- first_name: Michael
full_name: Knopf, Michael
last_name: Knopf
citation:
ama: Knopf M. Scheduling Variants with Speed-Scaling via the Primal-Dual Approach.
Universität Paderborn; 2013.
apa: Knopf, M. (2013). Scheduling Variants with Speed-Scaling via the Primal-Dual
Approach. Universität Paderborn.
bibtex: '@book{Knopf_2013, title={Scheduling Variants with Speed-Scaling via the
Primal-Dual Approach}, publisher={Universität Paderborn}, author={Knopf, Michael},
year={2013} }'
chicago: Knopf, Michael. Scheduling Variants with Speed-Scaling via the Primal-Dual
Approach. Universität Paderborn, 2013.
ieee: M. Knopf, Scheduling Variants with Speed-Scaling via the Primal-Dual Approach.
Universität Paderborn, 2013.
mla: Knopf, Michael. Scheduling Variants with Speed-Scaling via the Primal-Dual
Approach. Universität Paderborn, 2013.
short: M. Knopf, Scheduling Variants with Speed-Scaling via the Primal-Dual Approach,
Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:27Z
date_updated: 2022-01-06T07:01:28Z
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
title: Scheduling Variants with Speed-Scaling via the Primal-Dual Approach
type: mastersthesis
user_id: '15504'
year: '2013'
...
---
_id: '499'
abstract:
- lang: eng
text: We present a new online algorithm for profit-oriented scheduling on multiple
speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's
competitiveness.Our results generalize and improve upon work by \citet{Chan:2010},
which considers a single speed-scalable processor.Using significantly different
techniques, we can not only extend their model to multiprocessors but also prove
an enhanced and tight competitive ratio for our algorithm.In our scheduling problem,
jobs arrive over time and are preemptable.They have different workloads, values,
and deadlines.The scheduler may decide not to finish a job but instead to suffer
a loss equaling the job's value.However, to process a job's workload until its
deadline the scheduler must invest a certain amount of energy.The cost of a schedule
is the sum of lost values and invested energy.In order to finish a job the scheduler
has to determine which processors to use and set their speeds accordingly.A processor's
energy consumption is power $\Power{s}$ integrated over time, where $\Power{s}=s^{\alpha}$
is the power consumption when running at speed $s$.Since we consider the online
variant of the problem, the scheduler has no knowledge about future jobs.This
problem was introduced by~\citet{Chan:2010} for the case of a single processor.They
presented an online algorithm which is $\alpha^{\alpha}+2e\alpha$-competitive.We
provide an online algorithm for the case of multiple processors with an improved
competitive ratio of $\alpha^{\alpha}$.
author:
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: 'Kling P, Pietrzyk P. Profitable Scheduling on Multiple Speed-Scalable Processors.
In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ; 2013:251-260. doi:10.1145/2486159.2486183'
apa: Kling, P., & Pietrzyk, P. (2013). Profitable Scheduling on Multiple Speed-Scalable
Processors. In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA) (pp. 251–260). https://doi.org/10.1145/2486159.2486183
bibtex: '@inproceedings{Kling_Pietrzyk_2013, title={Profitable Scheduling on Multiple
Speed-Scalable Processors}, DOI={10.1145/2486159.2486183},
booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Kling, Peter and Pietrzyk, Peter}, year={2013},
pages={251–260} }'
chicago: Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable
Processors.” In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 251–60, 2013. https://doi.org/10.1145/2486159.2486183.
ieee: P. Kling and P. Pietrzyk, “Profitable Scheduling on Multiple Speed-Scalable
Processors,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 251–260.
mla: Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable
Processors.” Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 251–60, doi:10.1145/2486159.2486183.
short: 'P. Kling, P. Pietrzyk, in: Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 251–260.'
date_created: 2017-10-17T12:42:29Z
date_updated: 2022-01-06T07:01:34Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2486159.2486183
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T13:40:02Z
date_updated: 2018-03-15T13:40:02Z
file_id: '1310'
file_name: 499-P._Kling__P._Pietryzk_-_Profitable_Scheduling_on_Multiple_Speed-scalable_Processors__2013_.pdf
file_size: 558661
relation: main_file
success: 1
file_date_updated: 2018-03-15T13:40:02Z
has_accepted_license: '1'
language:
- iso: eng
page: '251-260 '
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Profitable Scheduling on Multiple Speed-Scalable Processors
type: conference
user_id: '477'
year: '2013'
...
---
_id: '501'
abstract:
- lang: eng
text: 'Handling run-time dynamics on embedded system-on-chip architectures has become
more challenging over the years. On the one hand, the impact of workload and physical
dynamics on the system behavior has dramatically increased. On the other hand,
embedded architectures have become more complex as they have evolved from single-processor
systems over multi-processor systems to hybrid multi-core platforms.Static design-time
techniques no longer provide suitable solutions to deal with the run-time dynamics
of today''s embedded systems. Therefore, system designers have to apply run-time
solutions, which have hardly been investigated for hybrid multi-core platforms.In
this thesis, we present fundamental work in the new area of run-time management
on hybrid multi-core platforms. We propose a novel architecture, a self-adaptive
hybrid multi-core system, that combines heterogeneous processors, reconfigurable
hardware cores, and monitoring cores on a single chip. Using self-adaptation on
thread-level, our hybrid multi-core systems can effectively perform performance
and thermal management autonomously at run-time. '
author:
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
citation:
ama: 'Happe M. Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores.
Berlin: Logos Verlag Berlin GmbH; 2013.'
apa: 'Happe, M. (2013). Performance and thermal management on self-adaptive hybrid
multi-cores. Berlin: Logos Verlag Berlin GmbH.'
bibtex: '@book{Happe_2013, place={Berlin}, title={Performance and thermal management
on self-adaptive hybrid multi-cores}, publisher={Logos Verlag Berlin GmbH}, author={Happe,
Markus}, year={2013} }'
chicago: 'Happe, Markus. Performance and Thermal Management on Self-Adaptive
Hybrid Multi-Cores. Berlin: Logos Verlag Berlin GmbH, 2013.'
ieee: 'M. Happe, Performance and thermal management on self-adaptive hybrid multi-cores.
Berlin: Logos Verlag Berlin GmbH, 2013.'
mla: Happe, Markus. Performance and Thermal Management on Self-Adaptive Hybrid
Multi-Cores. Logos Verlag Berlin GmbH, 2013.
short: M. Happe, Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores,
Logos Verlag Berlin GmbH, Berlin, 2013.
date_created: 2017-10-17T12:42:30Z
date_updated: 2022-01-06T07:01:34Z
department:
- _id: '78'
language:
- iso: eng
page: '220'
place: Berlin
project:
- _id: '14'
name: SFB 901 - Subprojekt C2
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication_identifier:
isbn:
- 978-3-8325-3425-7
publication_status: published
publisher: Logos Verlag Berlin GmbH
related_material:
link:
- relation: confirmation
url: https://www.logos-verlag.de/cgi-bin/engbuchmid?isbn=3425&lng=deu&id=
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Performance and thermal management on self-adaptive hybrid multi-cores
type: dissertation
user_id: '477'
year: '2013'
...
---
_id: '519'
abstract:
- lang: eng
text: In this work we present the first scalable distributed information system,i.e.,
a system with low storage overhead, that is provably robust againstDenial-of-Service
(DoS) attacks by a current insider. We allow acurrent insider to have complete
knowledge about the information systemand to have the power to block any \epsilon-fraction
of its serversby a DoS-attack, where \epsilon can be chosen up to a constant.
The taskof the system is to serve any collection of lookup requests with at most
oneper non-blocked server in an efficient way despite this attack. Previously,scalable
solutions were only known for DoS-attacks of past insiders, where apast insider
only has complete knowledge about some past time pointt_0 of the information system.
Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible
to design an information system so that anyinformation that was inserted or last
updated after t_0 is safe against a DoS-attack. But their constructions would
not work at all for a current insider. The key idea behindour IRIS system is to
make extensive use of coding. More precisely, we presenttwo alternative distributed
coding strategies with an at most logarithmicstorage overhead that can handle
up to a constant fraction of blocked servers.
author:
- first_name: Martina
full_name: Eikel, Martina
last_name: Eikel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks.
In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA). ; 2013:119-129. doi:10.1145/2486159.2486186'
apa: 'Eikel, M., & Scheideler, C. (2013). IRIS: A Robust Information System
Against Insider DoS-Attacks. In Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA) (pp. 119–129). https://doi.org/10.1145/2486159.2486186'
bibtex: '@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information
System Against Insider DoS-Attacks}, DOI={10.1145/2486159.2486186},
booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian},
year={2013}, pages={119–129} }'
chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information
System Against Insider DoS-Attacks.” In Proceedings of the 25th ACM Symposium
on Parallelism in Algorithms and Architectures (SPAA), 119–29, 2013. https://doi.org/10.1145/2486159.2486186.'
ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider
DoS-Attacks,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2013, pp. 119–129.'
mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System
Against Insider DoS-Attacks.” Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 119–29, doi:10.1145/2486159.2486186.'
short: 'M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism
in Algorithms and Architectures (SPAA), 2013, pp. 119–129.'
date_created: 2017-10-17T12:42:33Z
date_updated: 2022-01-06T07:01:42Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2486159.2486186
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:38:34Z
date_updated: 2018-03-15T10:38:34Z
file_id: '1299'
file_name: 519-iris-spaa2013_01.pdf
file_size: 554618
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:38:34Z
has_accepted_license: '1'
page: 119-129
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 25th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: 'IRIS: A Robust Information System Against Insider DoS-Attacks'
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '521'
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
citation:
ama: Riebler H. Identifikation und Wiederherstellung von kryptographischen Schlüsseln
mit FPGAs. Universität Paderborn; 2013.
apa: Riebler, H. (2013). Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn.
bibtex: '@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich},
year={2013} }'
chicago: Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn, 2013.
ieee: H. Riebler, Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn, 2013.
mla: Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen
Schlüsseln mit FPGAs. Universität Paderborn, 2013.
short: H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln
mit FPGAs, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:46Z
department:
- _id: '27'
- _id: '518'
keyword:
- coldboot
language:
- iso: ger
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: Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs
type: mastersthesis
user_id: '477'
year: '2013'
...
---
_id: '531'
author:
- first_name: Sascha
full_name: Lutters, Sascha
last_name: Lutters
citation:
ama: Lutters S. Entwurf eines datenschutzgerechten Reputationssystems. Universität
Paderborn; 2013.
apa: Lutters, S. (2013). Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn.
bibtex: '@book{Lutters_2013, title={Entwurf eines datenschutzgerechten Reputationssystems},
publisher={Universität Paderborn}, author={Lutters, Sascha}, year={2013} }'
chicago: Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn, 2013.
ieee: S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn, 2013.
mla: Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems.
Universität Paderborn, 2013.
short: S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems, Universität
Paderborn, 2013.
date_created: 2017-10-17T12:42:35Z
date_updated: 2022-01-06T07:01:49Z
language:
- iso: ger
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: Entwurf eines datenschutzgerechten Reputationssystems
type: mastersthesis
user_id: '477'
year: '2013'
...
---
_id: '532'
author:
- first_name: Hendrik
full_name: Hilleckes, Hendrik
last_name: Hilleckes
citation:
ama: Hilleckes H. Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn; 2013.
apa: Hilleckes, H. (2013). Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn.
bibtex: '@book{Hilleckes_2013, title={Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme}, publisher={Universität Paderborn},
author={Hilleckes, Hendrik}, year={2013} }'
chicago: Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.
ieee: H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.
mla: Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme. Universität Paderborn, 2013.
short: H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung
für dynamische heterogene Speichersysteme, Universität Paderborn, 2013.
date_created: 2017-10-17T12:42:36Z
date_updated: 2022-01-06T07:01:49Z
language:
- iso: ger
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: Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische
heterogene Speichersysteme
type: bachelorsthesis
user_id: '477'
year: '2013'
...
---
_id: '538'
abstract:
- lang: eng
text: 'We present a new technique to realize attribute-based encryption (ABE) schemes
secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our
approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE
schemes to achieve more efficient constructions than the known generic constructions
of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based
key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes:
a key-policy attribute-based KEM that is based on Goyal''s key-policy ABE and
a ciphertext-policy attribute-based KEM that is based on Waters'' ciphertext-policy
ABE. To achieve our goals, we use an appropriate hash function and need to extend
the public parameters and the ciphertexts of the underlying CPA-secure encryption
schemes only by a single group element. Moreover, we use the same hardness assumptions
as the underlying CPA-secure encryption schemes.'
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. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations
without Random Oracles. 2013.
apa: Blömer, J., & Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based
Key Encapsulations without Random Oracles. Universität Paderborn.
bibtex: '@article{Blömer_Liske_2013, title={Direct Chosen-Ciphertext Secure Attribute-Based
Key Encapsulations without Random Oracles}, publisher={Universität Paderborn},
author={Blömer, Johannes and Liske, Gennadij}, year={2013} }'
chicago: Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure
Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn,
2013.
ieee: J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key
Encapsulations without Random Oracles.” Universität Paderborn, 2013.
mla: Blömer, Johannes, and Gennadij Liske. Direct Chosen-Ciphertext Secure Attribute-Based
Key Encapsulations without Random Oracles. Universität Paderborn, 2013.
short: J. Blömer, G. Liske, (2013).
date_created: 2017-10-17T12:42:37Z
date_updated: 2022-01-06T07:01:51Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:35:04Z
date_updated: 2018-03-15T10:35:04Z
file_id: '1292'
file_name: 538-AB-KEM_01.pdf
file_size: 389797
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:35:04Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2013/646
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: Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without
Random Oracles
type: preprint
user_id: '25078'
year: '2013'
...
---
_id: '542'
abstract:
- lang: eng
text: 'We consider the problem of managing a dynamic heterogeneous storagesystem
in a distributed way so that the amount of data assigned to a hostin that system
is related to its capacity. Two central problems have to be solvedfor this: (1)
organizing the hosts in an overlay network with low degree and diameterso that
one can efficiently check the correct distribution of the data androute between
any two hosts, and (2) distributing the data among the hosts so thatthe distribution
respects the capacities of the hosts and can easily be adapted asthe set of hosts
or their capacities change. We present distributed protocols forthese problems
that are self-stabilizing and that do not need any global knowledgeabout the system
such as the number of nodes or the overall capacity of thesystem. Prior to this
work no solution was known satisfying these properties.'
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. CONE-DHT: A distributed self-stabilizing
algorithm for a heterogeneous storage system. In: Proceedings of the 27th International
Symposium on Distributed Computing (DISC). LNCS. ; 2013:537-549. doi:10.1007/978-3-642-41527-2_37'
apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). CONE-DHT:
A distributed self-stabilizing algorithm for a heterogeneous storage system. In
Proceedings of the 27th International Symposium on Distributed Computing (DISC)
(pp. 537–549). https://doi.org/10.1007/978-3-642-41527-2_37'
bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS},
title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous
storage system}, DOI={10.1007/978-3-642-41527-2_37},
booktitle={Proceedings of the 27th International Symposium on Distributed Computing
(DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler,
Christian}, year={2013}, pages={537–549}, collection={LNCS} }'
chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
“CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage
System.” In Proceedings of the 27th International Symposium on Distributed
Computing (DISC), 537–49. LNCS, 2013. https://doi.org/10.1007/978-3-642-41527-2_37.'
ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed
self-stabilizing algorithm for a heterogeneous storage system,” in Proceedings
of the 27th International Symposium on Distributed Computing (DISC), 2013,
pp. 537–549.'
mla: 'Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm
for a Heterogeneous Storage System.” Proceedings of the 27th International
Symposium on Distributed Computing (DISC), 2013, pp. 537–49, doi:10.1007/978-3-642-41527-2_37.'
short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th
International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.'
date_created: 2017-10-17T12:42:38Z
date_updated: 2022-01-06T07:01:53Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-642-41527-2_37
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:32:48Z
date_updated: 2018-03-15T10:32:48Z
file_id: '1289'
file_name: 542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf
file_size: 262302
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:32:48Z
has_accepted_license: '1'
page: 537-549
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 27th International Symposium on Distributed Computing
(DISC)
series_title: LNCS
status: public
title: 'CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage
system'
type: conference
user_id: '15504'
year: '2013'
...