---
_id: '253'
abstract:
- lang: eng
text: Group signatures, introduced by Chaum and van Heyst [15], are an important
primitive in cryptography. In group signature schemes every group member can anonymously
sign messages on behalf of the group. In case of disputes a dedicated opening
manager is able to trace signatures - he can extract the identity of the producer
of a given signature. A formal model for static group signatures schemes and their
security is defined by Bellare, Micciancio, and Warinschi [4], the case of dynamic
groups is considered by Bellare, Shi, and Zhang [5]. Both models define group
signature schemes with a single opening manager. The main difference between these
models is that the number of group members in static schemes is fixed, while in
dynamic schemes group members can join the group over time.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Juhnke J, Löken N. Short Group Signatures with Distributed Traceability.
In: Proceedings of the Sixth International Conference on Mathematical Aspects
of Computer and Information Sciences (MACIS). LNCS. ; 2015:166-180. doi:10.1007/978-3-319-32859-1_14'
apa: Blömer, J., Juhnke, J., & Löken, N. (2015). Short Group Signatures with
Distributed Traceability. In Proceedings of the Sixth International Conference
on Mathematical Aspects of Computer and Information Sciences (MACIS) (pp.
166–180). https://doi.org/10.1007/978-3-319-32859-1_14
bibtex: '@inproceedings{Blömer_Juhnke_Löken_2015, series={LNCS}, title={Short Group
Signatures with Distributed Traceability}, DOI={10.1007/978-3-319-32859-1_14},
booktitle={Proceedings of the Sixth International Conference on Mathematical Aspects
of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Juhnke,
Jakob and Löken, Nils}, year={2015}, pages={166–180}, collection={LNCS} }'
chicago: Blömer, Johannes, Jakob Juhnke, and Nils Löken. “Short Group Signatures
with Distributed Traceability.” In Proceedings of the Sixth International Conference
on Mathematical Aspects of Computer and Information Sciences (MACIS), 166–80.
LNCS, 2015. https://doi.org/10.1007/978-3-319-32859-1_14.
ieee: J. Blömer, J. Juhnke, and N. Löken, “Short Group Signatures with Distributed
Traceability,” in Proceedings of the Sixth International Conference on Mathematical
Aspects of Computer and Information Sciences (MACIS), 2015, pp. 166–180.
mla: Blömer, Johannes, et al. “Short Group Signatures with Distributed Traceability.”
Proceedings of the Sixth International Conference on Mathematical Aspects of
Computer and Information Sciences (MACIS), 2015, pp. 166–80, doi:10.1007/978-3-319-32859-1_14.
short: 'J. Blömer, J. Juhnke, N. Löken, in: Proceedings of the Sixth International
Conference on Mathematical Aspects of Computer and Information Sciences (MACIS),
2015, pp. 166–180.'
date_created: 2017-10-17T12:41:41Z
date_updated: 2022-01-06T06:59:07Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-32859-1_14
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:08:23Z
date_updated: 2018-11-02T14:08:23Z
file_id: '5262'
file_name: ShortGroupSignaturesWithDistri.pdf
file_size: 262436
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:08:23Z
has_accepted_license: '1'
language:
- iso: eng
page: 166-180
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '44'
name: KogniHome - die mitdenkende Wohnung
publication: Proceedings of the Sixth International Conference on Mathematical Aspects
of Computer and Information Sciences (MACIS)
related_material:
record:
- id: '325'
relation: other
status: public
series_title: LNCS
status: public
title: Short Group Signatures with Distributed Traceability
type: conference
user_id: '13703'
year: '2015'
...
---
_id: '284'
abstract:
- lang: eng
text: In this work, we present the first scalable distributed information system,
that is, a system with low storage overhead, that is provably robust against denial-of-service
(DoS) attacks by a current insider. We allow a current insider to have complete
knowledge about the information system and to have the power to block any ϵ-fraction
of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task
of the system is to serve any collection of lookup requests with at most one per
nonblocked server in an efficient way despite this attack. Previously, scalable
solutions were only known for DoS attacks of past insiders, where a past insider
only has complete knowledge about some past time point t0 of the information system.
Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed
that in this case, it is possible to design an information system so that any
information that was inserted or last updated after t0 is safe against a DoS attack.
But their constructions would not work at all for a current insider. The key idea
behind our IRIS system is to make extensive use of coding. More precisely, we
present two alternative distributed coding strategies with an at most logarithmic
storage 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. Transactions on Parallel Computing. 2015;(3):18:1--18:33. doi:10.1145/2809806'
apa: 'Eikel, M., & Scheideler, C. (2015). IRIS: A Robust Information System
Against Insider DoS Attacks. Transactions on Parallel Computing, (3), 18:1--18:33.
https://doi.org/10.1145/2809806'
bibtex: '@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System
Against Insider DoS Attacks}, DOI={10.1145/2809806},
number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel,
Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }'
chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information
System Against Insider DoS Attacks.” Transactions on Parallel Computing,
no. 3 (2015): 18:1--18:33. https://doi.org/10.1145/2809806.'
ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider
DoS Attacks,” Transactions on Parallel Computing, no. 3, pp. 18:1--18:33,
2015.'
mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System
Against Insider DoS Attacks.” Transactions on Parallel Computing, no. 3,
ACM, 2015, pp. 18:1--18:33, doi:10.1145/2809806.'
short: M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:03Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2809806
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T09:25:04Z
date_updated: 2018-03-21T09:25:04Z
file_id: '1468'
file_name: 284-Eikel-Scheideler-ACM2015.pdf
file_size: 651726
relation: main_file
success: 1
file_date_updated: 2018-03-21T09:25:04Z
has_accepted_license: '1'
issue: '3'
page: 18:1--18:33
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
publication: Transactions on Parallel Computing
publisher: ACM
status: public
title: 'IRIS: A Robust Information System Against Insider DoS Attacks'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '286'
author:
- first_name: Benedikt
full_name: Kalde, Benedikt
last_name: Kalde
citation:
ama: Kalde B. Implementierung eines hybriden Verschlüsselungsverfahrens nach
Cramer und Shoup. Universität Paderborn; 2015.
apa: Kalde, B. (2015). Implementierung eines hybriden Verschlüsselungsverfahrens
nach Cramer und Shoup. Universität Paderborn.
bibtex: '@book{Kalde_2015, title={Implementierung eines hybriden Verschlüsselungsverfahrens
nach Cramer und Shoup}, publisher={Universität Paderborn}, author={Kalde, Benedikt},
year={2015} }'
chicago: Kalde, Benedikt. Implementierung eines hybriden Verschlüsselungsverfahrens
nach Cramer und Shoup. Universität Paderborn, 2015.
ieee: B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach
Cramer und Shoup. Universität Paderborn, 2015.
mla: Kalde, Benedikt. Implementierung eines hybriden Verschlüsselungsverfahrens
nach Cramer und Shoup. Universität Paderborn, 2015.
short: B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach
Cramer und Shoup, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:10Z
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
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '261'
author:
- first_name: Thorsten
full_name: Eisenhofer, Thorsten
last_name: Eisenhofer
citation:
ama: Eisenhofer T. Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn; 2015.
apa: Eisenhofer, T. (2015). Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn.
bibtex: '@book{Eisenhofer_2015, title={Protokolle zur authentifizierten Schüsselvereinbarung},
publisher={Universität Paderborn}, author={Eisenhofer, Thorsten}, year={2015}
}'
chicago: Eisenhofer, Thorsten. Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn, 2015.
ieee: T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn, 2015.
mla: Eisenhofer, Thorsten. Protokolle zur authentifizierten Schüsselvereinbarung.
Universität Paderborn, 2015.
short: T. Eisenhofer, Protokolle zur authentifizierten Schüsselvereinbarung, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:43Z
date_updated: 2022-01-06T06:57:16Z
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
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Protokolle zur authentifizierten Schüsselvereinbarung
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '321'
author:
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
citation:
ama: Eidens F. Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption.
Universität Paderborn; 2015.
apa: Eidens, F. (2015). Anonymous credential system based on q-Strong Diffie-Hellman
Assumption. Universität Paderborn.
bibtex: '@book{Eidens_2015, title={Anonymous credential system based on q-Strong
Diffie-Hellman Assumption}, publisher={Universität Paderborn}, author={Eidens,
Fabian}, year={2015} }'
chicago: Eidens, Fabian. Anonymous Credential System Based on Q-Strong Diffie-Hellman
Assumption. Universität Paderborn, 2015.
ieee: F. Eidens, Anonymous credential system based on q-Strong Diffie-Hellman
Assumption. Universität Paderborn, 2015.
mla: Eidens, Fabian. Anonymous Credential System Based on Q-Strong Diffie-Hellman
Assumption. Universität Paderborn, 2015.
short: F. Eidens, Anonymous Credential System Based on Q-Strong Diffie-Hellman Assumption,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:05Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:40:22Z
date_updated: 2018-03-20T07:40:22Z
file_id: '1432'
file_name: 321-eidens_masterthesis_01.pdf
file_size: 879285
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:40: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
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Anonymous credential system based on q-Strong Diffie-Hellman Assumption
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '322'
abstract:
- lang: eng
text: Reputation systems are used to compute and publish reputation scores for services
or products. We consider reputation systems where users are allowed to rate products
that they purchased previously. To obtain trustworthy reputations, they are allowed
to rate these products only once. As long as users rate products once, they stay
anonymous. Everybody is able to detect users deviating from the rate-products-only-once
policy and the anonymity of such dishonest users can be revoked by a system manager.
In this paper we present formal models for such reputation systems and their security.
Based on group signatures presented by Boneh, Boyen, and Shacham we design an
efficient reputation system that meets all our requirements.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
- first_name: Christina
full_name: Kolb, Christina
id: '43647'
last_name: Kolb
citation:
ama: 'Blömer J, Juhnke J, Kolb C. Anonymous and Publicly Linkable Reputation Systems.
In: Proceedings of the 18th International Conference on Financial Cryptography
and Data Security (FC). LNCS. ; 2015:478--488. doi:10.1007/978-3-662-47854-7_29'
apa: Blömer, J., Juhnke, J., & Kolb, C. (2015). Anonymous and Publicly Linkable
Reputation Systems. In Proceedings of the 18th International Conference on
Financial Cryptography and Data Security (FC) (pp. 478--488). https://doi.org/10.1007/978-3-662-47854-7_29
bibtex: '@inproceedings{Blömer_Juhnke_Kolb_2015, series={LNCS}, title={Anonymous
and Publicly Linkable Reputation Systems}, DOI={10.1007/978-3-662-47854-7_29},
booktitle={Proceedings of the 18th International Conference on Financial Cryptography
and Data Security (FC)}, author={Blömer, Johannes and Juhnke, Jakob and Kolb,
Christina}, year={2015}, pages={478--488}, collection={LNCS} }'
chicago: Blömer, Johannes, Jakob Juhnke, and Christina Kolb. “Anonymous and Publicly
Linkable Reputation Systems.” In Proceedings of the 18th International Conference
on Financial Cryptography and Data Security (FC), 478--488. LNCS, 2015. https://doi.org/10.1007/978-3-662-47854-7_29.
ieee: J. Blömer, J. Juhnke, and C. Kolb, “Anonymous and Publicly Linkable Reputation
Systems,” in Proceedings of the 18th International Conference on Financial
Cryptography and Data Security (FC), 2015, pp. 478--488.
mla: Blömer, Johannes, et al. “Anonymous and Publicly Linkable Reputation Systems.”
Proceedings of the 18th International Conference on Financial Cryptography
and Data Security (FC), 2015, pp. 478--488, doi:10.1007/978-3-662-47854-7_29.
short: 'J. Blömer, J. Juhnke, C. Kolb, in: Proceedings of the 18th International
Conference on Financial Cryptography and Data Security (FC), 2015, pp. 478--488.'
date_created: 2017-10-17T12:41:54Z
date_updated: 2022-01-06T06:59:05Z
ddc:
- '040'
department:
- _id: '64'
doi: 10.1007/978-3-662-47854-7_29
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:39:54Z
date_updated: 2018-03-20T07:39:54Z
file_id: '1431'
file_name: 322-546_01.pdf
file_size: 499568
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:39:54Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2014/546
oa: '1'
page: 478--488
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 Financial Cryptography
and Data Security (FC)
series_title: LNCS
status: public
title: Anonymous and Publicly Linkable Reputation Systems
type: conference
user_id: '48090'
year: '2015'
...
---
_id: '325'
author:
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: Löken N. A Group Signature Scheme with Distributed Group Management - An
Application of Threshold Encryption. Universität Paderborn; 2015.
apa: Löken, N. (2015). A Group Signature Scheme with Distributed Group Management
- An Application of Threshold Encryption. Universität Paderborn.
bibtex: '@book{Löken_2015, title={A Group Signature Scheme with Distributed Group
Management - An Application of Threshold Encryption}, publisher={Universität Paderborn},
author={Löken, Nils}, year={2015} }'
chicago: Löken, Nils. A Group Signature Scheme with Distributed Group Management
- An Application of Threshold Encryption. Universität Paderborn, 2015.
ieee: N. Löken, A Group Signature Scheme with Distributed Group Management -
An Application of Threshold Encryption. Universität Paderborn, 2015.
mla: Löken, Nils. A Group Signature Scheme with Distributed Group Management
- An Application of Threshold Encryption. Universität Paderborn, 2015.
short: N. Löken, A Group Signature Scheme with Distributed Group Management - An
Application of Threshold Encryption, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:07Z
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
related_material:
record:
- id: '253'
relation: other
status: public
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: A Group Signature Scheme with Distributed Group Management - An Application
of Threshold Encryption
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '326'
author:
- first_name: Frederic
full_name: Heihoff, Frederic
last_name: Heihoff
citation:
ama: Heihoff F. A Group Signature Scheme Based on the LSRW Assumption. Universität
Paderborn; 2015.
apa: Heihoff, F. (2015). A group signature scheme based on the LSRW assumption.
Universität Paderborn.
bibtex: '@book{Heihoff_2015, title={A group signature scheme based on the LSRW assumption},
publisher={Universität Paderborn}, author={Heihoff, Frederic}, year={2015} }'
chicago: Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption.
Universität Paderborn, 2015.
ieee: F. Heihoff, A group signature scheme based on the LSRW assumption.
Universität Paderborn, 2015.
mla: Heihoff, Frederic. A Group Signature Scheme Based on the LSRW Assumption.
Universität Paderborn, 2015.
short: F. Heihoff, A Group Signature Scheme Based on the LSRW Assumption, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:55Z
date_updated: 2022-01-06T06:59:07Z
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: A group signature scheme based on the LSRW assumption
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '297'
author:
- first_name: Martin
full_name: Sosniak, Martin
last_name: Sosniak
citation:
ama: Sosniak M. Evaluation of Pairing Optimization for Embedded Platforms.
Universität Paderborn; 2015.
apa: Sosniak, M. (2015). Evaluation of Pairing Optimization for Embedded Platforms.
Universität Paderborn.
bibtex: '@book{Sosniak_2015, title={Evaluation of Pairing Optimization for Embedded
Platforms}, publisher={Universität Paderborn}, author={Sosniak, Martin}, year={2015}
}'
chicago: Sosniak, Martin. Evaluation of Pairing Optimization for Embedded Platforms.
Universität Paderborn, 2015.
ieee: M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms.
Universität Paderborn, 2015.
mla: Sosniak, Martin. Evaluation of Pairing Optimization for Embedded Platforms.
Universität Paderborn, 2015.
short: M. Sosniak, Evaluation of Pairing Optimization for Embedded Platforms, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:49Z
department:
- _id: '64'
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '4'
name: SFB 901 - Project Area C
- _id: '43'
name: Securing the Financial Cloud
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Evaluation of Pairing Optimization for Embedded Platforms
type: mastersthesis
user_id: '25078'
year: '2015'
...
---
_id: '299'
author:
- first_name: Britta
full_name: Gerken, Britta
last_name: Gerken
citation:
ama: Gerken B. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie.
Universität Paderborn; 2015.
apa: Gerken, B. (2015). Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
Kryptographie. Universität Paderborn.
bibtex: '@book{Gerken_2015, title={Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
Kryptographie}, publisher={Universität Paderborn}, author={Gerken, Britta}, year={2015}
}'
chicago: Gerken, Britta. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
Kryptographie. Universität Paderborn, 2015.
ieee: B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
Kryptographie. Universität Paderborn, 2015.
mla: Gerken, Britta. Elektromagnetische Seitenkanalangriffe auf paarungsbasierte
Kryptographie. Universität Paderborn, 2015.
short: B. Gerken, Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:50Z
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: Elektromagnetische Seitenkanalangriffe auf paarungsbasierte Kryptographie
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '301'
author:
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
citation:
ama: Bobolz J. Efficient Verifier-Local Revocation for Anonymous Credentials.
Universität Paderborn; 2015.
apa: Bobolz, J. (2015). Efficient Verifier-Local Revocation for Anonymous Credentials.
Universität Paderborn.
bibtex: '@book{Bobolz_2015, title={Efficient Verifier-Local Revocation for Anonymous
Credentials}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2015}
}'
chicago: Bobolz, Jan. Efficient Verifier-Local Revocation for Anonymous Credentials.
Universität Paderborn, 2015.
ieee: J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials.
Universität Paderborn, 2015.
mla: Bobolz, Jan. Efficient Verifier-Local Revocation for Anonymous Credentials.
Universität Paderborn, 2015.
short: J. Bobolz, Efficient Verifier-Local Revocation for Anonymous Credentials,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:51Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:47:11Z
date_updated: 2018-07-20T09:54:22Z
file_id: '1443'
file_name: 301-thesis_jbobolz_final_02.pdf
file_size: 1214027
relation: main_file
file_date_updated: 2018-07-20T09:54:22Z
has_accepted_license: '1'
oa: '1'
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: Efficient Verifier-Local Revocation for Anonymous Credentials
type: mastersthesis
urn: '3016'
user_id: '27207'
year: '2015'
...
---
_id: '302'
author:
- first_name: Christian
full_name: Stroh, Christian
last_name: Stroh
citation:
ama: Stroh C. Efficient Attributes for Pairing-Based Anonymous Credentials.
Universität Paderborn; 2015.
apa: Stroh, C. (2015). Efficient Attributes for Pairing-Based Anonymous Credentials.
Universität Paderborn.
bibtex: '@book{Stroh_2015, title={Efficient Attributes for Pairing-Based Anonymous
Credentials}, publisher={Universität Paderborn}, author={Stroh, Christian}, year={2015}
}'
chicago: Stroh, Christian. Efficient Attributes for Pairing-Based Anonymous Credentials.
Universität Paderborn, 2015.
ieee: C. Stroh, Efficient Attributes for Pairing-Based Anonymous Credentials.
Universität Paderborn, 2015.
mla: Stroh, Christian. Efficient Attributes for Pairing-Based Anonymous Credentials.
Universität Paderborn, 2015.
short: C. Stroh, Efficient Attributes for Pairing-Based Anonymous Credentials, Universität
Paderborn, 2015.
date_created: 2017-10-17T12:41:50Z
date_updated: 2022-01-06T06:58:51Z
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: Efficient Attributes for Pairing-Based Anonymous Credentials
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '305'
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
citation:
ama: Kniesburges S. Distributed Data Structures and the Power of Topological
Self-Stabilization. Universität Paderborn; 2015.
apa: Kniesburges, S. (2015). Distributed Data Structures and the Power of topological
Self-Stabilization. Universität Paderborn.
bibtex: '@book{Kniesburges_2015, title={Distributed Data Structures and the Power
of topological Self-Stabilization}, publisher={Universität Paderborn}, author={Kniesburges,
Sebastian}, year={2015} }'
chicago: Kniesburges, Sebastian. Distributed Data Structures and the Power of
Topological Self-Stabilization. Universität Paderborn, 2015.
ieee: S. Kniesburges, Distributed Data Structures and the Power of topological
Self-Stabilization. Universität Paderborn, 2015.
mla: Kniesburges, Sebastian. Distributed Data Structures and the Power of Topological
Self-Stabilization. Universität Paderborn, 2015.
short: S. Kniesburges, Distributed Data Structures and the Power of Topological
Self-Stabilization, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:51Z
date_updated: 2022-01-06T06:58:54Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-13T09:14:43Z
date_updated: 2018-03-13T09:14:43Z
file_id: '1206'
file_name: 305-Dissertation_-_Kniesburges.pdf
file_size: 1709094
relation: main_file
success: 1
file_date_updated: 2018-03-13T09:14:43Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
- _id: '5'
name: SFB 901 - Subproject A1
- _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: Distributed Data Structures and the Power of topological Self-Stabilization
type: dissertation
user_id: '15504'
year: '2015'
...
---
_id: '312'
author:
- first_name: Patrick
full_name: Schleiter, Patrick
last_name: Schleiter
citation:
ama: Schleiter P. Constructions of Fully Secure Predicate Encryption Schemes.
Universität Paderborn; 2015.
apa: Schleiter, P. (2015). Constructions of Fully Secure Predicate Encryption
Schemes. Universität Paderborn.
bibtex: '@book{Schleiter_2015, title={Constructions of Fully Secure Predicate Encryption
Schemes}, publisher={Universität Paderborn}, author={Schleiter, Patrick}, year={2015}
}'
chicago: Schleiter, Patrick. Constructions of Fully Secure Predicate Encryption
Schemes. Universität Paderborn, 2015.
ieee: P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes.
Universität Paderborn, 2015.
mla: Schleiter, Patrick. Constructions of Fully Secure Predicate Encryption Schemes.
Universität Paderborn, 2015.
short: P. Schleiter, Constructions of Fully Secure Predicate Encryption Schemes,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:52Z
date_updated: 2022-01-06T06:58:57Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:44:55Z
date_updated: 2018-03-20T07:44:55Z
file_id: '1439'
file_name: 312-MA_2015_Schleiter_Constructions_of_fully_secure_PE_schemes_01.pdf
file_size: 721996
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:44:55Z
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
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Constructions of Fully Secure Predicate Encryption Schemes
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '273'
author:
- first_name: Kathlén
full_name: Kohn, Kathlén
last_name: Kohn
citation:
ama: Kohn K. Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary
Norms. Universität Paderborn; 2015.
apa: Kohn, K. (2015). Number of Voronoi-relevant vectors in lattices with respect
to arbitrary norms. Universität Paderborn.
bibtex: '@book{Kohn_2015, title={Number of Voronoi-relevant vectors in lattices
with respect to arbitrary norms}, publisher={Universität Paderborn}, author={Kohn,
Kathlén}, year={2015} }'
chicago: Kohn, Kathlén. Number of Voronoi-Relevant Vectors in Lattices with Respect
to Arbitrary Norms. Universität Paderborn, 2015.
ieee: K. Kohn, Number of Voronoi-relevant vectors in lattices with respect to
arbitrary norms. Universität Paderborn, 2015.
mla: Kohn, Kathlén. Number of Voronoi-Relevant Vectors in Lattices with Respect
to Arbitrary Norms. Universität Paderborn, 2015.
short: K. Kohn, Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary
Norms, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:45Z
date_updated: 2022-01-06T06:57:37Z
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: Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms
type: mastersthesis
user_id: '477'
year: '2015'
...
---
_id: '233'
abstract:
- lang: eng
text: Motivated by the deterministic single exponential time algorithm of Micciancio
and Voulgaris for solving the shortest and closest vector problem for the Euclidean
norm, we study the geometry and complexity of Voronoi cells of lattices with respect
to arbitrary norms.On the positive side, we show that for strictly convex and
smooth norms the geometry of Voronoi cells of lattices in any dimension is similar
to the Euclidean case, i.e., the Voronoi cells are defined by the so-called Voronoi-relevant
vectors and the facets of a Voronoi cell are in one-to-one correspondence with
these vectors. On the negative side, we show that combinatorially Voronoi cells
for arbitrary strictly convex and smooth norms are much more complicated than
in the Euclidean case.In particular, we construct a family of three-dimensional
lattices whose number of Voronoi-relevant vectors with respect to the l_3-norm
is unbounded.Since the algorithm of Micciancio and Voulgaris and its run time
analysis crucially dependonthefactthatfortheEuclidean normthenumber of Voronoi-relevant
vectors is single exponential in the lattice dimension, this indicates that the
techniques of Micciancio and Voulgaris cannot be extended to achieve deterministic
single exponential time algorithms for lattice problems with respect to arbitrary
l_p-norms.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Kathlén
full_name: Kohn, Kathlén
last_name: Kohn
citation:
ama: Blömer J, Kohn K. Voronoi Cells of Lattices with Respect to Arbitrary Norms.
Universität Paderborn; 2015.
apa: Blömer, J., & Kohn, K. (2015). Voronoi Cells of Lattices with Respect
to Arbitrary Norms. Universität Paderborn.
bibtex: '@book{Blömer_Kohn_2015, title={Voronoi Cells of Lattices with Respect to
Arbitrary Norms}, publisher={Universität Paderborn}, author={Blömer, Johannes
and Kohn, Kathlén}, year={2015} }'
chicago: Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect
to Arbitrary Norms. Universität Paderborn, 2015.
ieee: J. Blömer and K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary
Norms. Universität Paderborn, 2015.
mla: Blömer, Johannes, and Kathlén Kohn. Voronoi Cells of Lattices with Respect
to Arbitrary Norms. Universität Paderborn, 2015.
short: J. Blömer, K. Kohn, Voronoi Cells of Lattices with Respect to Arbitrary Norms,
Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:37Z
date_updated: 2022-01-06T06:55:49Z
ddc:
- '040'
department:
- _id: '64'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T10:30:18Z
date_updated: 2018-03-21T10:30:18Z
file_id: '1501'
file_name: 233-1512.00720v1.pdf
file_size: 1231102
relation: main_file
success: 1
file_date_updated: 2018-03-21T10:30:18Z
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: http://arxiv.org/pdf/1512.00720v1.pdf
oa: '1'
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: Voronoi Cells of Lattices with Respect to Arbitrary Norms
type: report
user_id: '25078'
year: '2015'
...
---
_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: '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'
...