---
_id: '10790'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
- first_name: Daniel
full_name: Kuntze, Daniel
last_name: Kuntze
citation:
ama: Blömer J, Brauer S, Bujna K, Kuntze D. How well do SEM algorithms imitate EM
algorithms? A non-asymptotic analysis for mixture models. Advances in Data
Analysis and Classification. 2020;14:147–173. doi:10.1007/s11634-019-00366-7
apa: Blömer, J., Brauer, S., Bujna, K., & Kuntze, D. (2020). How well do SEM
algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models.
Advances in Data Analysis and Classification, 14, 147–173. https://doi.org/10.1007/s11634-019-00366-7
bibtex: '@article{Blömer_Brauer_Bujna_Kuntze_2020, title={How well do SEM algorithms
imitate EM algorithms? A non-asymptotic analysis for mixture models}, volume={14},
DOI={10.1007/s11634-019-00366-7},
journal={Advances in Data Analysis and Classification}, author={Blömer, Johannes
and Brauer, Sascha and Bujna, Kathrin and Kuntze, Daniel}, year={2020}, pages={147–173}
}'
chicago: 'Blömer, Johannes, Sascha Brauer, Kathrin Bujna, and Daniel Kuntze. “How
Well Do SEM Algorithms Imitate EM Algorithms? A Non-Asymptotic Analysis for Mixture
Models.” Advances in Data Analysis and Classification 14 (2020): 147–173.
https://doi.org/10.1007/s11634-019-00366-7.'
ieee: J. Blömer, S. Brauer, K. Bujna, and D. Kuntze, “How well do SEM algorithms
imitate EM algorithms? A non-asymptotic analysis for mixture models,” Advances
in Data Analysis and Classification, vol. 14, pp. 147–173, 2020.
mla: Blömer, Johannes, et al. “How Well Do SEM Algorithms Imitate EM Algorithms?
A Non-Asymptotic Analysis for Mixture Models.” Advances in Data Analysis and
Classification, vol. 14, 2020, pp. 147–173, doi:10.1007/s11634-019-00366-7.
short: J. Blömer, S. Brauer, K. Bujna, D. Kuntze, Advances in Data Analysis and
Classification 14 (2020) 147–173.
date_created: 2019-07-11T08:08:25Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '64'
doi: 10.1007/s11634-019-00366-7
intvolume: ' 14'
language:
- iso: eng
page: 147–173
project:
- _id: '45'
name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: Advances in Data Analysis and Classification
publication_identifier:
issn:
- 1862-5347
- 1862-5355
publication_status: published
status: public
title: How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis
for mixture models
type: journal_article
user_id: '13291'
volume: 14
year: '2020'
...
---
_id: '15482'
author:
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: Löken N. Cryptography for the Crowd — A Study of Cryptographic Schemes with
Applications to Crowd Work.; 2020. doi:10.17619/UNIPB/1-854
apa: Löken, N. (2020). Cryptography for the Crowd — A Study of Cryptographic
Schemes with Applications to Crowd Work. https://doi.org/10.17619/UNIPB/1-854
bibtex: '@book{Löken_2020, title={Cryptography for the Crowd — A Study of Cryptographic
Schemes with Applications to Crowd Work}, DOI={10.17619/UNIPB/1-854},
author={Löken, Nils}, year={2020} }'
chicago: Löken, Nils. Cryptography for the Crowd — A Study of Cryptographic Schemes
with Applications to Crowd Work, 2020. https://doi.org/10.17619/UNIPB/1-854.
ieee: N. Löken, Cryptography for the Crowd — A Study of Cryptographic Schemes
with Applications to Crowd Work. 2020.
mla: Löken, Nils. Cryptography for the Crowd — A Study of Cryptographic Schemes
with Applications to Crowd Work. 2020, doi:10.17619/UNIPB/1-854.
short: N. Löken, Cryptography for the Crowd — A Study of Cryptographic Schemes with
Applications to Crowd Work, 2020.
date_created: 2020-01-10T08:23:30Z
date_updated: 2022-01-06T06:52:27Z
department:
- _id: '64'
- _id: '568'
doi: 10.17619/UNIPB/1-854
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications
to Crowd Work
type: dissertation
user_id: '13703'
year: '2020'
...
---
_id: '18638'
author:
- first_name: Paul
full_name: Kramer, Paul
id: '64594'
last_name: Kramer
citation:
ama: Kramer P. Comparison of Zero-Knowledge Range Proofs. Universität Paderborn;
2020.
apa: Kramer, P. (2020). Comparison of Zero-Knowledge Range Proofs. Universität
Paderborn.
bibtex: '@book{Kramer_2020, title={Comparison of Zero-Knowledge Range Proofs}, publisher={Universität
Paderborn}, author={Kramer, Paul}, year={2020} }'
chicago: Kramer, Paul. Comparison of Zero-Knowledge Range Proofs. Universität
Paderborn, 2020.
ieee: P. Kramer, Comparison of Zero-Knowledge Range Proofs. Universität Paderborn,
2020.
mla: Kramer, Paul. Comparison of Zero-Knowledge Range Proofs. Universität
Paderborn, 2020.
short: P. Kramer, Comparison of Zero-Knowledge Range Proofs, Universität Paderborn,
2020.
date_created: 2020-08-29T13:27:11Z
date_updated: 2022-10-17T10:56:59Z
department:
- _id: '7'
- _id: '64'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Comparison of Zero-Knowledge Range Proofs
type: bachelorsthesis
user_id: '25078'
year: '2020'
...
---
_id: '2916'
author:
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
citation:
ama: Brauer S. Complexity of single-swap heuristics for metric facility location
and related problems. Theoretical Computer Science. 2019;754:88-106. doi:10.1016/j.tcs.2018.04.048
apa: Brauer, S. (2019). Complexity of single-swap heuristics for metric facility
location and related problems. Theoretical Computer Science, 754,
88–106. https://doi.org/10.1016/j.tcs.2018.04.048
bibtex: '@article{Brauer_2019, title={Complexity of single-swap heuristics for metric
facility location and related problems}, volume={754}, DOI={10.1016/j.tcs.2018.04.048},
journal={Theoretical Computer Science}, publisher={Elsevier}, author={Brauer,
Sascha}, year={2019}, pages={88–106} }'
chicago: 'Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility
Location and Related Problems.” Theoretical Computer Science 754 (2019):
88–106. https://doi.org/10.1016/j.tcs.2018.04.048.'
ieee: S. Brauer, “Complexity of single-swap heuristics for metric facility location
and related problems,” Theoretical Computer Science, vol. 754, pp. 88–106,
2019.
mla: Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location
and Related Problems.” Theoretical Computer Science, vol. 754, Elsevier,
2019, pp. 88–106, doi:10.1016/j.tcs.2018.04.048.
short: S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
date_created: 2018-05-25T11:10:36Z
date_updated: 2022-01-06T06:58:46Z
department:
- _id: '64'
doi: 10.1016/j.tcs.2018.04.048
intvolume: ' 754'
language:
- iso: eng
page: 88-106
project:
- _id: '45'
name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
status: public
title: Complexity of single-swap heuristics for metric facility location and related
problems
type: journal_article
user_id: '13291'
volume: 754
year: '2019'
...
---
_id: '15746'
author:
- first_name: Oliver
full_name: Otte, Oliver
last_name: Otte
citation:
ama: Otte O. Outsourced Decryption of Attribute-Based Ciphertexts.; 2019.
apa: Otte, O. (2019). Outsourced Decryption of Attribute-based Ciphertexts.
bibtex: '@book{Otte_2019, title={Outsourced Decryption of Attribute-based Ciphertexts},
author={Otte, Oliver}, year={2019} }'
chicago: Otte, Oliver. Outsourced Decryption of Attribute-Based Ciphertexts,
2019.
ieee: O. Otte, Outsourced Decryption of Attribute-based Ciphertexts. 2019.
mla: Otte, Oliver. Outsourced Decryption of Attribute-Based Ciphertexts.
2019.
short: O. Otte, Outsourced Decryption of Attribute-Based Ciphertexts, 2019.
date_created: 2020-02-03T09:43:19Z
date_updated: 2022-01-06T06:52:32Z
department:
- _id: '64'
language:
- iso: eng
status: public
title: Outsourced Decryption of Attribute-based Ciphertexts
type: mastersthesis
user_id: '13703'
year: '2019'
...
---
_id: '15747'
author:
- first_name: Nico Christof
full_name: Wördenweber, Nico Christof
last_name: Wördenweber
citation:
ama: Wördenweber NC. On the Security of the Rouselakis-Waters Ciphertext-Policy
Attribute-Based Encryption Scheme in the Random Oracle Model.; 2019.
apa: Wördenweber, N. C. (2019). On the Security of the Rouselakis-Waters Ciphertext-Policy
Attribute-Based Encryption Scheme in the Random Oracle Model.
bibtex: '@book{Wördenweber_2019, title={On the Security of the Rouselakis-Waters
Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model},
author={Wördenweber, Nico Christof}, year={2019} }'
chicago: Wördenweber, Nico Christof. On the Security of the Rouselakis-Waters
Ciphertext-Policy Attribute-Based Encryption Scheme in the Random Oracle Model,
2019.
ieee: N. C. Wördenweber, On the Security of the Rouselakis-Waters Ciphertext-Policy
Attribute-Based Encryption Scheme in the Random Oracle Model. 2019.
mla: Wördenweber, Nico Christof. On the Security of the Rouselakis-Waters Ciphertext-Policy
Attribute-Based Encryption Scheme in the Random Oracle Model. 2019.
short: N.C. Wördenweber, On the Security of the Rouselakis-Waters Ciphertext-Policy
Attribute-Based Encryption Scheme in the Random Oracle Model, 2019.
date_created: 2020-02-03T09:45:01Z
date_updated: 2022-01-06T06:52:32Z
department:
- _id: '64'
language:
- iso: eng
status: public
title: On the Security of the Rouselakis-Waters Ciphertext-Policy Attribute-Based
Encryption Scheme in the Random Oracle Model
type: bachelorsthesis
user_id: '13703'
year: '2019'
...
---
_id: '15819'
author:
- first_name: Matthias
full_name: Leutnant, Matthias
last_name: Leutnant
citation:
ama: Leutnant M. Experimentelle Untersuchung Des SEM-Algorithmus.; 2019.
apa: Leutnant, M. (2019). Experimentelle Untersuchung des SEM-Algorithmus.
bibtex: '@book{Leutnant_2019, title={Experimentelle Untersuchung des SEM-Algorithmus},
author={Leutnant, Matthias}, year={2019} }'
chicago: Leutnant, Matthias. Experimentelle Untersuchung Des SEM-Algorithmus,
2019.
ieee: M. Leutnant, Experimentelle Untersuchung des SEM-Algorithmus. 2019.
mla: Leutnant, Matthias. Experimentelle Untersuchung Des SEM-Algorithmus.
2019.
short: M. Leutnant, Experimentelle Untersuchung Des SEM-Algorithmus, 2019.
date_created: 2020-02-06T08:51:51Z
date_updated: 2022-01-06T06:52:37Z
department:
- _id: '64'
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Experimentelle Untersuchung des SEM-Algorithmus
type: bachelorsthesis
user_id: '13291'
year: '2019'
...
---
_id: '13128'
author:
- first_name: Henrik
full_name: Bröcher, Henrik
id: '41047'
last_name: Bröcher
citation:
ama: Bröcher H. Rational Secure Multiparty Computation. Universität Paderborn;
2019.
apa: Bröcher, H. (2019). Rational Secure Multiparty Computation. Universität
Paderborn.
bibtex: '@book{Bröcher_2019, title={Rational Secure Multiparty Computation}, publisher={Universität
Paderborn}, author={Bröcher, Henrik}, year={2019} }'
chicago: Bröcher, Henrik. Rational Secure Multiparty Computation. Universität
Paderborn, 2019.
ieee: H. Bröcher, Rational Secure Multiparty Computation. Universität Paderborn,
2019.
mla: Bröcher, Henrik. Rational Secure Multiparty Computation. Universität
Paderborn, 2019.
short: H. Bröcher, Rational Secure Multiparty Computation, Universität Paderborn,
2019.
date_created: 2019-09-04T08:04:12Z
date_updated: 2022-01-06T06:51:28Z
ddc:
- '000'
department:
- _id: '64'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: bhenrik
date_created: 2019-09-04T07:59:31Z
date_updated: 2020-10-30T15:59:34Z
file_id: '13129'
file_name: thesis_broecher.pdf
file_size: 746819
relation: main_file
file_date_updated: 2020-10-30T15:59:34Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '1'
name: SFB 901
- _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: Rational Secure Multiparty Computation
type: mastersthesis
user_id: '25078'
year: '2019'
...
---
_id: '10306'
author:
- first_name: Laurens Alexander
full_name: Porzenheim, Laurens Alexander
id: '47434'
last_name: Porzenheim
citation:
ama: Porzenheim LA. Post-Quantum Secure Group Signatures.; 2019.
apa: Porzenheim, L. A. (2019). Post-Quantum Secure Group Signatures.
bibtex: '@book{Porzenheim_2019, title={Post-Quantum Secure Group Signatures}, author={Porzenheim,
Laurens Alexander}, year={2019} }'
chicago: Porzenheim, Laurens Alexander. Post-Quantum Secure Group Signatures,
2019.
ieee: L. A. Porzenheim, Post-Quantum Secure Group Signatures. 2019.
mla: Porzenheim, Laurens Alexander. Post-Quantum Secure Group Signatures.
2019.
short: L.A. Porzenheim, Post-Quantum Secure Group Signatures, 2019.
date_created: 2019-06-26T09:12:47Z
date_updated: 2022-01-06T06:50:36Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
content_type: application/pdf
creator: laurensp
date_created: 2019-06-26T09:08:23Z
date_updated: 2019-06-26T09:19:15Z
file_id: '10307'
file_name: thesis_final.pdf
file_size: 899233
relation: main_file
file_date_updated: 2019-06-26T09:19:15Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Post-Quantum Secure Group Signatures
type: mastersthesis
user_id: '47434'
year: '2019'
...
---
_id: '13554'
abstract:
- lang: eng
text: We propose a novel personal reputation system for cross-platform reputation.
We observe that, in certain usage scenarios, e.g. crowd work, the rater anonymity
property typically imposed on reputation systems is not necessary. Instead, we
propose a relaxed notion of rater anonymity that is more applicable in the crowd
work scenario. This allows us to construct a secure personal reputation system
from simple cryptographic primitives.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Löken N. Personal Cross-Platform Reputation. In: Security and
Trust Management, STM 2019. Vol 11738. LNCS. ; 2019. doi:10.1007/978-3-030-31511-5_9'
apa: Blömer, J., & Löken, N. (2019). Personal Cross-Platform Reputation. In
Security and Trust Management, STM 2019 (Vol. 11738). https://doi.org/10.1007/978-3-030-31511-5_9
bibtex: '@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Personal Cross-Platform
Reputation}, volume={11738}, DOI={10.1007/978-3-030-31511-5_9},
booktitle={Security and Trust Management, STM 2019}, author={Blömer, Johannes
and Löken, Nils}, year={2019}, collection={LNCS} }'
chicago: Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.”
In Security and Trust Management, STM 2019, Vol. 11738. LNCS, 2019. https://doi.org/10.1007/978-3-030-31511-5_9.
ieee: J. Blömer and N. Löken, “Personal Cross-Platform Reputation,” in Security
and Trust Management, STM 2019, 2019, vol. 11738.
mla: Blömer, Johannes, and Nils Löken. “Personal Cross-Platform Reputation.” Security
and Trust Management, STM 2019, vol. 11738, 2019, doi:10.1007/978-3-030-31511-5_9.
short: 'J. Blömer, N. Löken, in: Security and Trust Management, STM 2019, 2019.'
conference:
name: Security and Trust Management, STM 2019
date_created: 2019-10-01T07:50:03Z
date_updated: 2022-01-06T06:51:38Z
ddc:
- '000'
department:
- _id: '568'
- _id: '64'
doi: 10.1007/978-3-030-31511-5_9
file:
- access_level: open_access
content_type: application/pdf
creator: nilo
date_created: 2019-10-01T07:45:17Z
date_updated: 2019-10-01T07:45:17Z
description: This is an author's version of the paper presented at STM 2019.
file_id: '13555'
file_name: informal.pdf
file_size: 507736
relation: main_file
title: Personal cross-platform reputation, author's version
file_date_updated: 2019-10-01T07:45:17Z
has_accepted_license: '1'
intvolume: ' 11738'
language:
- iso: eng
oa: '1'
publication: Security and Trust Management, STM 2019
series_title: LNCS
status: public
title: Personal Cross-Platform Reputation
type: conference
user_id: '13703'
volume: 11738
year: '2019'
...
---
_id: '13557'
abstract:
- lang: eng
text: We present a searchable encryption scheme for dynamic document collections
in a multi-user scenario. Our scheme features fine-grained access control to search
results, as well as access control to operations such as adding documents to the
document collection, or changing individual documents. The scheme features verifiability
of search results. Our scheme also satisfies the forward privacy notion crucial
for the security of dynamic searchable encryption schemes.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Löken N. Dynamic Searchable Encryption with Access Control. In:
12th International Symposium on Foundations and Practice of Security, FPS 2019.
Vol 12056. LNCS. Springer; 2019.'
apa: Blömer, J., & Löken, N. (2019). Dynamic Searchable Encryption with Access
Control. In 12th International Symposium on Foundations and Practice of Security,
FPS 2019 (Vol. 12056). Springer.
bibtex: '@inproceedings{Blömer_Löken_2019, series={LNCS}, title={Dynamic Searchable
Encryption with Access Control}, volume={12056}, booktitle={12th International
Symposium on Foundations and Practice of Security, FPS 2019}, publisher={Springer},
author={Blömer, Johannes and Löken, Nils}, year={2019}, collection={LNCS} }'
chicago: Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access
Control.” In 12th International Symposium on Foundations and Practice of Security,
FPS 2019, Vol. 12056. LNCS. Springer, 2019.
ieee: J. Blömer and N. Löken, “Dynamic Searchable Encryption with Access Control,”
in 12th International Symposium on Foundations and Practice of Security, FPS
2019, 2019, vol. 12056.
mla: Blömer, Johannes, and Nils Löken. “Dynamic Searchable Encryption with Access
Control.” 12th International Symposium on Foundations and Practice of Security,
FPS 2019, vol. 12056, Springer, 2019.
short: 'J. Blömer, N. Löken, in: 12th International Symposium on Foundations and
Practice of Security, FPS 2019, Springer, 2019.'
date_created: 2019-10-01T08:05:31Z
date_updated: 2022-01-06T06:51:38Z
department:
- _id: '64'
- _id: '568'
intvolume: ' 12056'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2019/1038
oa: '1'
publication: 12th International Symposium on Foundations and Practice of Security,
FPS 2019
publisher: Springer
series_title: LNCS
status: public
title: Dynamic Searchable Encryption with Access Control
type: conference
user_id: '13703'
volume: 12056
year: '2019'
...
---
_id: '13592'
author:
- first_name: Matthias
full_name: Pilot, Matthias
last_name: Pilot
citation:
ama: Pilot M. Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
in Java. Universität Paderborn; 2019.
apa: Pilot, M. (2019). Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
in Java. Universität Paderborn.
bibtex: '@book{Pilot_2019, title={Efficient Finite-Field Arithmetic for Elliptic
Curve Cryptography in Java}, publisher={Universität Paderborn}, author={Pilot,
Matthias}, year={2019} }'
chicago: Pilot, Matthias. Efficient Finite-Field Arithmetic for Elliptic Curve
Cryptography in Java. Universität Paderborn, 2019.
ieee: M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
in Java. Universität Paderborn, 2019.
mla: Pilot, Matthias. Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
in Java. Universität Paderborn, 2019.
short: M. Pilot, Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography
in Java, Universität Paderborn, 2019.
date_created: 2019-10-03T12:30:24Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '7'
- _id: '64'
extern: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Efficient Finite-Field Arithmetic for Elliptic Curve Cryptography in Java
type: bachelorsthesis
user_id: '477'
year: '2019'
...
---
_id: '13648'
author:
- first_name: Swante
full_name: Scholz, Swante
last_name: Scholz
citation:
ama: Scholz S. Implementation and Comparison of Elliptic Curve Algorithms in
Java. Universität Paderborn; 2019.
apa: Scholz, S. (2019). Implementation and Comparison of Elliptic Curve Algorithms
in Java. Universität Paderborn.
bibtex: '@book{Scholz_2019, title={Implementation and Comparison of Elliptic Curve
Algorithms in Java}, publisher={Universität Paderborn}, author={Scholz, Swante},
year={2019} }'
chicago: Scholz, Swante. Implementation and Comparison of Elliptic Curve Algorithms
in Java. Universität Paderborn, 2019.
ieee: S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in
Java. Universität Paderborn, 2019.
mla: Scholz, Swante. Implementation and Comparison of Elliptic Curve Algorithms
in Java. Universität Paderborn, 2019.
short: S. Scholz, Implementation and Comparison of Elliptic Curve Algorithms in
Java, Universität Paderborn, 2019.
date_created: 2019-10-07T09:56:58Z
date_updated: 2022-01-06T06:51:41Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: jbobolz
date_created: 2020-04-27T10:32:00Z
date_updated: 2020-04-27T10:33:59Z
file_id: '16871'
file_name: sscholz-MA-thesis-final.pdf
file_size: 1714805
relation: main_file
file_date_updated: 2020-04-27T10:33:59Z
has_accepted_license: '1'
language:
- iso: eng
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
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Implementation and Comparison of Elliptic Curve Algorithms in Java
type: mastersthesis
user_id: '477'
year: '2019'
...
---
_id: '13679'
author:
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
citation:
ama: Brauer S. Classification and Approximation of Geometric Location Problems.
Paderborn; 2019. doi:10.17619/UNIPB/1-816
apa: Brauer, S. (2019). Classification and Approximation of Geometric Location
Problems. Paderborn. https://doi.org/10.17619/UNIPB/1-816
bibtex: '@book{Brauer_2019, place={Paderborn}, title={Classification and Approximation
of Geometric Location Problems}, DOI={10.17619/UNIPB/1-816},
author={Brauer, Sascha}, year={2019} }'
chicago: Brauer, Sascha. Classification and Approximation of Geometric Location
Problems. Paderborn, 2019. https://doi.org/10.17619/UNIPB/1-816.
ieee: S. Brauer, Classification and Approximation of Geometric Location Problems.
Paderborn, 2019.
mla: Brauer, Sascha. Classification and Approximation of Geometric Location Problems.
2019, doi:10.17619/UNIPB/1-816.
short: S. Brauer, Classification and Approximation of Geometric Location Problems,
Paderborn, 2019.
date_created: 2019-10-09T10:00:53Z
date_updated: 2022-01-06T06:51:41Z
department:
- _id: '64'
doi: 10.17619/UNIPB/1-816
language:
- iso: eng
place: Paderborn
project:
- _id: '45'
name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Classification and Approximation of Geometric Location Problems
type: dissertation
user_id: '13291'
year: '2019'
...
---
_id: '13904'
abstract:
- lang: eng
text: In this paper, we introduce updatable anonymous credential systems (UACS)
and use them to construct a new privacy-preserving incentive system. In a UACS,
a user holding a credential certifying some attributes can interact with the corresponding
issuer to update his attributes. During this, the issuer knows which update function
is run, but does not learn the user's previous attributes. Hence the update process
preserves anonymity of the user. One example for a class of update functions are
additive updates of integer attributes, where the issuer increments an unknown
integer attribute value v by some known value k. This kind of update is motivated
by an application of UACS to incentive systems. Users in an incentive system can
anonymously accumulate points, e.g. in a shop at checkout, and spend them later,
e.g. for a discount.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Denis Pascal
full_name: Diemert, Denis Pascal
id: '44071'
last_name: Diemert
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
citation:
ama: 'Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials
and Applications to Incentive Systems. In: Proceedings of the 2019 ACM SIGSAC
Conference on Computer and Communications Security - CCS ’19. Proceedings
of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS
’19. ; 2019. doi:10.1145/3319535.3354223'
apa: Blömer, J., Bobolz, J., Diemert, D. P., & Eidens, F. (2019). Updatable
Anonymous Credentials and Applications to Incentive Systems. Proceedings of
the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19.
26th ACM Conference on Computer and Communications Security, London. https://doi.org/10.1145/3319535.3354223
bibtex: '@inproceedings{Blömer_Bobolz_Diemert_Eidens_2019, series={Proceedings of
the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19},
title={Updatable Anonymous Credentials and Applications to Incentive Systems},
DOI={10.1145/3319535.3354223},
booktitle={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS ’19}, author={Blömer, Johannes and Bobolz, Jan and Diemert, Denis
Pascal and Eidens, Fabian}, year={2019}, collection={Proceedings of the 2019 ACM
SIGSAC Conference on Computer and Communications Security - CCS ’19} }'
chicago: Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens.
“Updatable Anonymous Credentials and Applications to Incentive Systems.” In Proceedings
of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS
’19. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS ’19, 2019. https://doi.org/10.1145/3319535.3354223.
ieee: 'J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous
Credentials and Applications to Incentive Systems,” presented at the 26th ACM
Conference on Computer and Communications Security, London, 2019, doi: 10.1145/3319535.3354223.'
mla: Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications
to Incentive Systems.” Proceedings of the 2019 ACM SIGSAC Conference on Computer
and Communications Security - CCS ’19, 2019, doi:10.1145/3319535.3354223.
short: 'J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019
ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.'
conference:
end_date: 2019-11-15
location: London
name: 26th ACM Conference on Computer and Communications Security
start_date: 2019-11-11
date_created: 2019-10-18T08:09:44Z
date_updated: 2023-01-10T10:25:27Z
ddc:
- '006'
department:
- _id: '7'
- _id: '64'
doi: 10.1145/3319535.3354223
file:
- access_level: closed
content_type: application/pdf
creator: jbobolz
date_created: 2019-10-18T08:07:49Z
date_updated: 2019-10-18T08:07:49Z
file_id: '13907'
file_name: full_eprinted_v2.pdf
file_size: 838949
relation: main_file
file_date_updated: 2019-10-18T08:07:49Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2019/169.pdf
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS '19
series_title: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications
Security - CCS '19
status: public
title: Updatable Anonymous Credentials and Applications to Incentive Systems
type: conference
user_id: '25078'
year: '2019'
...
---
_id: '2862'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
citation:
ama: 'Blömer J, Eidens F, Juhnke J. Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems. In: Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings.
Cham: Springer International Publishing; 2018:470-490. doi:10.1007/978-3-319-76953-0_25'
apa: 'Blömer, J., Eidens, F., & Juhnke, J. (2018). Practical, Anonymous, and
Publicly Linkable Universally-Composable Reputation Systems. In Topics in Cryptology
- {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings
(pp. 470–490). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-76953-0_25'
bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, place={Cham}, title={Practical,
Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}, DOI={10.1007/978-3-319-76953-0_25},
booktitle={Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at
the {RSA} Conference 2018, Proceedings}, publisher={Springer International Publishing},
author={Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}, year={2018}, pages={470–490}
}'
chicago: 'Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Practical, Anonymous,
and Publicly Linkable Universally-Composable Reputation Systems.” In Topics
in Cryptology - {CT-RSA} 2018 - The Cryptographers’ Track at the {RSA} Conference
2018, Proceedings, 470–90. Cham: Springer International Publishing, 2018.
https://doi.org/10.1007/978-3-319-76953-0_25.'
ieee: J. Blömer, F. Eidens, and J. Juhnke, “Practical, Anonymous, and Publicly Linkable
Universally-Composable Reputation Systems,” in Topics in Cryptology - {CT-RSA}
2018 - The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings,
San Francisco, CA, USA, 2018, pp. 470–490.
mla: Blömer, Johannes, et al. “Practical, Anonymous, and Publicly Linkable Universally-Composable
Reputation Systems.” Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers’
Track at the {RSA} Conference 2018, Proceedings, Springer International Publishing,
2018, pp. 470–90, doi:10.1007/978-3-319-76953-0_25.
short: 'J. Blömer, F. Eidens, J. Juhnke, in: Topics in Cryptology - {CT-RSA} 2018
- The Cryptographers’ Track at the {RSA} Conference 2018, Proceedings, Springer
International Publishing, Cham, 2018, pp. 470–490.'
conference:
end_date: 2018-04-20
location: San Francisco, CA, USA
name: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA}
Conference 2018
start_date: 2018-04-16
date_created: 2018-05-24T11:14:02Z
date_updated: 2022-01-06T06:58:12Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-76953-0_25
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:45:40Z
date_updated: 2018-11-02T13:45:40Z
file_id: '5253'
file_name: PracticalAnonymousAndPubliclyL.pdf
file_size: 3371773
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:45:40Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/029
oa: '1'
page: 470-490
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the
{RSA} Conference 2018, Proceedings
publication_identifier:
isbn:
- '9783319769523'
- '9783319769530'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
status: public
title: Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation
Systems
type: conference
user_id: '477'
year: '2018'
...
---
_id: '2685'
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.
SIAM Journal on Applied Algebra and Geometry. 2018;2(2):314-338. doi:10.1137/17M1132045
apa: Blömer, J., & Kohn, K. (2018). Voronoi Cells of Lattices with Respect to
Arbitrary Norms. SIAM Journal on Applied Algebra and Geometry., 2(2),
314–338. https://doi.org/10.1137/17M1132045
bibtex: '@article{Blömer_Kohn_2018, title={Voronoi Cells of Lattices with Respect
to Arbitrary Norms}, volume={2}, DOI={10.1137/17M1132045},
number={2}, journal={SIAM Journal on Applied Algebra and Geometry.}, author={Blömer,
Johannes and Kohn, Kathlén}, year={2018}, pages={314–338} }'
chicago: 'Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect
to Arbitrary Norms.” SIAM Journal on Applied Algebra and Geometry. 2, no.
2 (2018): 314–38. https://doi.org/10.1137/17M1132045.'
ieee: J. Blömer and K. Kohn, “Voronoi Cells of Lattices with Respect to Arbitrary
Norms,” SIAM Journal on Applied Algebra and Geometry., vol. 2, no. 2, pp.
314–338, 2018.
mla: Blömer, Johannes, and Kathlén Kohn. “Voronoi Cells of Lattices with Respect
to Arbitrary Norms.” SIAM Journal on Applied Algebra and Geometry., vol.
2, no. 2, 2018, pp. 314–38, doi:10.1137/17M1132045.
short: J. Blömer, K. Kohn, SIAM Journal on Applied Algebra and Geometry. 2 (2018)
314–338.
date_created: 2018-05-08T09:18:54Z
date_updated: 2022-01-06T06:57:29Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
doi: 10.1137/17M1132045
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T15:22:55Z
date_updated: 2018-11-02T15:22:55Z
file_id: '5300'
file_name: 17m1132045.pdf
file_size: 1131048
relation: main_file
success: 1
file_date_updated: 2018-11-02T15:22:55Z
has_accepted_license: '1'
intvolume: ' 2'
issue: '2'
language:
- iso: eng
page: 314-338
project:
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
publication: SIAM Journal on Applied Algebra and Geometry.
publication_identifier:
eissn:
- 2470-6566
publication_status: epub_ahead
status: public
title: Voronoi Cells of Lattices with Respect to Arbitrary Norms
type: journal_article
user_id: '477'
volume: 2
year: '2018'
...
---
_id: '3265'
abstract:
- lang: eng
text: "We present CLARC (Cryptographic Library for Anonymous Reputation and Credentials),
an anonymous credentials system (ACS) combined with an anonymous reputation system.\r\n\r\nUsing
CLARC, users can receive attribute-based credentials from issuers. They can efficiently
prove that their credentials satisfy complex (access) policies in a privacy-preserving
way. This implements anonymous access control with complex policies.\r\n\r\nFurthermore,
CLARC is the first ACS that is combined with an anonymous reputation system where
users can anonymously rate services. A user who gets access to a service via a
credential, also anonymously receives a review token to rate the service. If a
user creates more than a single rating, this can be detected by anyone, preventing
users from spamming ratings to sway public opinion.\r\n\r\nTo evaluate feasibility
of our construction, we present an open-source prototype implementation."
author:
- first_name: Kai
full_name: Bemmann, Kai
last_name: Bemmann
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Henrik
full_name: Bröcher, Henrik
id: '41047'
last_name: Bröcher
- first_name: Denis Pascal
full_name: Diemert, Denis Pascal
id: '44071'
last_name: Diemert
- first_name: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Lukas
full_name: Eilers, Lukas
last_name: Eilers
- first_name: Jan Frederik
full_name: Haltermann, Jan Frederik
id: '44413'
last_name: Haltermann
- first_name: Jakob
full_name: Juhnke, Jakob
id: '48090'
last_name: Juhnke
- first_name: Burhan
full_name: Otour, Burhan
last_name: Otour
- first_name: Laurens Alexander
full_name: Porzenheim, Laurens Alexander
id: '47434'
last_name: Porzenheim
- first_name: Simon
full_name: Pukrop, Simon
last_name: Pukrop
- first_name: Erik
full_name: Schilling, Erik
last_name: Schilling
- first_name: Michael
full_name: Schlichtig, Michael
id: '32312'
last_name: Schlichtig
- first_name: Marcel
full_name: Stienemeier, Marcel
last_name: Stienemeier
citation:
ama: 'Bemmann K, Blömer J, Bobolz J, et al. Fully-Featured Anonymous Credentials
with Reputation System. In: Proceedings of the 13th International Conference
on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM.
doi:10.1145/3230833.3234517'
apa: 'Bemmann, K., Blömer, J., Bobolz, J., Bröcher, H., Diemert, D. P., Eidens,
F., … Stienemeier, M. (n.d.). Fully-Featured Anonymous Credentials with Reputation
System. In Proceedings of the 13th International Conference on Availability,
Reliability and Security - ARES ’18. New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3234517'
bibtex: '@inproceedings{Bemmann_Blömer_Bobolz_Bröcher_Diemert_Eidens_Eilers_Haltermann_Juhnke_Otour_et
al., place={New York, NY, USA}, title={Fully-Featured Anonymous Credentials with
Reputation System}, DOI={10.1145/3230833.3234517},
booktitle={Proceedings of the 13th International Conference on Availability, Reliability
and Security - ARES ’18}, publisher={ACM}, author={Bemmann, Kai and Blömer, Johannes
and Bobolz, Jan and Bröcher, Henrik and Diemert, Denis Pascal and Eidens, Fabian
and Eilers, Lukas and Haltermann, Jan Frederik and Juhnke, Jakob and Otour, Burhan
and et al.} }'
chicago: 'Bemmann, Kai, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Pascal
Diemert, Fabian Eidens, Lukas Eilers, et al. “Fully-Featured Anonymous Credentials
with Reputation System.” In Proceedings of the 13th International Conference
on Availability, Reliability and Security - ARES ’18. New York, NY, USA: ACM,
n.d. https://doi.org/10.1145/3230833.3234517.'
ieee: K. Bemmann et al., “Fully-Featured Anonymous Credentials with Reputation
System,” in Proceedings of the 13th International Conference on Availability,
Reliability and Security - ARES ’18, Hamburg, Germany.
mla: Bemmann, Kai, et al. “Fully-Featured Anonymous Credentials with Reputation
System.” Proceedings of the 13th International Conference on Availability,
Reliability and Security - ARES ’18, ACM, doi:10.1145/3230833.3234517.
short: 'K. Bemmann, J. Blömer, J. Bobolz, H. Bröcher, D.P. Diemert, F. Eidens, L.
Eilers, J.F. Haltermann, J. Juhnke, B. Otour, L.A. Porzenheim, S. Pukrop, E. Schilling,
M. Schlichtig, M. Stienemeier, in: Proceedings of the 13th International Conference
on Availability, Reliability and Security - ARES ’18, ACM, New York, NY, USA,
n.d.'
conference:
end_date: 2018-08-30
location: Hamburg, Germany
name: ARES 2018 - SECPID
start_date: 2018-08-27
date_created: 2018-06-14T11:19:29Z
date_updated: 2022-01-06T06:59:07Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1145/3230833.3234517
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-11-08T10:17:39Z
date_updated: 2018-11-08T10:17:39Z
file_id: '5428'
file_name: react_acs.pdf
file_size: 920843
relation: main_file
file_date_updated: 2018-11-08T10:17:39Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/835
oa: '1'
place: New York, NY, USA
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '44'
name: KogniHome - die mitdenkende Wohnung
publication: Proceedings of the 13th International Conference on Availability, Reliability
and Security - ARES '18
publication_identifier:
isbn:
- 978-1-4503-6448-5
publication_status: accepted
publisher: ACM
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/upbcuk
status: public
title: Fully-Featured Anonymous Credentials with Reputation System
type: conference
user_id: '25078'
year: '2018'
...
---
_id: '2965'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Nils
full_name: Löken, Nils
id: '13703'
last_name: Löken
citation:
ama: 'Blömer J, Löken N. Cloud Architectures for Searchable Encryption. In: Proceedings
of the 13th International Conference on Availability, Reliability and Security,
ARES 2018. New York, NY, USA: ACM; :25:1--25:10. doi:10.1145/3230833.3230853'
apa: 'Blömer, J., & Löken, N. (n.d.). Cloud Architectures for Searchable Encryption.
In Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018 (pp. 25:1--25:10). New York, NY, USA: ACM. https://doi.org/10.1145/3230833.3230853'
bibtex: '@inproceedings{Blömer_Löken, place={New York, NY, USA}, title={Cloud Architectures
for Searchable Encryption}, DOI={10.1145/3230833.3230853},
booktitle={Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018}, publisher={ACM}, author={Blömer, Johannes and Löken,
Nils}, pages={25:1--25:10} }'
chicago: 'Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable
Encryption.” In Proceedings of the 13th International Conference on Availability,
Reliability and Security, ARES 2018, 25:1--25:10. New York, NY, USA: ACM,
n.d. https://doi.org/10.1145/3230833.3230853.'
ieee: J. Blömer and N. Löken, “Cloud Architectures for Searchable Encryption,” in
Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018, Hamburg, Germany, pp. 25:1--25:10.
mla: Blömer, Johannes, and Nils Löken. “Cloud Architectures for Searchable Encryption.”
Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018, ACM, pp. 25:1--25:10, doi:10.1145/3230833.3230853.
short: 'J. Blömer, N. Löken, in: Proceedings of the 13th International Conference
on Availability, Reliability and Security, ARES 2018, ACM, New York, NY, USA,
n.d., pp. 25:1--25:10.'
conference:
location: Hamburg, Germany
name: ARES 2018
date_created: 2018-06-04T11:33:15Z
date_updated: 2022-01-06T06:58:49Z
ddc:
- '000'
department:
- _id: '64'
- _id: '568'
doi: 10.1145/3230833.3230853
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:39:46Z
date_updated: 2018-11-02T14:39:46Z
file_id: '5278'
file_name: a25-Blomer.pdf
file_size: 769807
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:39:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 25:1--25:10
place: New York, NY, USA
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Proceedings of the 13th International Conference on Availability, Reliability
and Security, ARES 2018
publication_identifier:
isbn:
- 978-1-4503-6448-5
publication_status: accepted
publisher: ACM
quality_controlled: '1'
status: public
title: Cloud Architectures for Searchable Encryption
type: conference
user_id: '13703'
year: '2018'
...
---
_id: '5820'
abstract:
- lang: eng
text: "In this paper, we investigate the use of trusted execution environments (TEEs,
such as Intel's SGX) for an anonymous communication infrastructure over untrusted
networks.\r\nFor this, we present the general idea of exploiting trusted execution
environments for the purpose of anonymous communication, including a continuous-time
security framework that models strong anonymity guarantees in the presence of
an adversary that observes all network traffic and can adaptively corrupt a constant
fraction of participating nodes.\r\nIn our framework, a participating node can
generate a number of unlinkable pseudonyms. Messages are sent from and to pseudonyms,
allowing both senders and receivers of messages to remain anonymous. We introduce
a concrete construction, which shows viability of our TEE-based approach to anonymous
communication. The construction draws from techniques from cryptography and overlay
networks. \r\nOur techniques are very general and can be used as a basis for future
constructions with similar goals."
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: Blömer J, Bobolz J, Scheideler C, Setzer A. Provably Anonymous Communication
Based on Trusted Execution Environments.
apa: Blömer, J., Bobolz, J., Scheideler, C., & Setzer, A. (n.d.). Provably
Anonymous Communication Based on Trusted Execution Environments.
bibtex: '@book{Blömer_Bobolz_Scheideler_Setzer, title={Provably Anonymous Communication
Based on Trusted Execution Environments}, author={Blömer, Johannes and Bobolz,
Jan and Scheideler, Christian and Setzer, Alexander} }'
chicago: Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer.
Provably Anonymous Communication Based on Trusted Execution Environments,
n.d.
ieee: J. Blömer, J. Bobolz, C. Scheideler, and A. Setzer, Provably Anonymous
Communication Based on Trusted Execution Environments. .
mla: Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted
Execution Environments.
short: J. Blömer, J. Bobolz, C. Scheideler, A. Setzer, Provably Anonymous Communication
Based on Trusted Execution Environments, n.d.
date_created: 2018-11-25T08:08:40Z
date_updated: 2022-01-06T07:02:43Z
ddc:
- '000'
department:
- _id: '7'
- _id: '64'
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: jbobolz
date_created: 2018-12-31T09:55:30Z
date_updated: 2018-12-31T09:55:30Z
file_id: '6435'
file_name: draft-2018.pdf
file_size: 470968
relation: main_file
success: 1
file_date_updated: 2018-12-31T09:55:30Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication_status: draft
status: public
title: Provably Anonymous Communication Based on Trusted Execution Environments
type: working_paper
user_id: '27207'
year: '2018'
...