---
_id: '63403'
abstract:
- lang: eng
text: "Stateful signatures like the NIST standardized signature schemes LMS and
XMSS provide an efficient and mature realization of post-quantum secure signature
schemes. They are recommended for long-term use cases like e.g. firmware signing.
However, stateful signature schemes require to properly manage a so-called state.
In stateful signature schemes like LMS and XMSS, signing keys consist of a set
of keys of a one-time signature scheme and it has to be guaranteed that each one-time
key is used only once. This is done by updating a state in each signature computation,
basically recording which one-time keys have already been used. While this is
straightforward in centralized systems, in distributed systems like secure enclaves
consisting of e.g. multiple hardware security modules (HSMs) with limited communication
keeping a distributed state that at any point in time is consistent among all
parties involved presents a challenge. This challenge is not addressed by the
current standardization processes. \r\nIn this paper we present a security model
for the distributed key management of post-quantum secure stateful signatures
like XMSS and LMS. We also present a simple, efficient, and easy to implement
protocol proven secure in this security model, i.e. the protocol guarantees at
any point in time a consistent state among the parties in a distributed system,
like a distributed security enclave. The security model is defined in the universal
composabilty (UC) framework by Ran Canetti by providing an ideal functionality
for the distributed key management for stateful signatures. Hence our protocol
remains secure even if arbitrarily composed with other instances of the same or
other protocols, a necessity for the security of distributed key management protocols.
Our main application are security enclaves consisting of HSMs, but the model and
the protocol can easily be adapted to other scenarios of distributed key management
of stateful signature schemes."
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Henrik
full_name: Bröcher, Henrik
id: '41047'
last_name: Bröcher
orcid: 0009-0008-3938-5485
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
- first_name: Laurens Alexander
full_name: Porzenheim, Laurens Alexander
id: '47434'
last_name: Porzenheim
citation:
ama: Blömer J, Bröcher H, Krummel V, Porzenheim LA. Secure Distributed State Management
for Stateful Signatures with a Practical and Universally Composable Protocol.
apa: Blömer, J., Bröcher, H., Krummel, V., & Porzenheim, L. A. (n.d.). Secure
Distributed State Management for Stateful Signatures with a Practical and Universally
Composable Protocol.
bibtex: '@article{Blömer_Bröcher_Krummel_Porzenheim, title={Secure Distributed State
Management for Stateful Signatures with a Practical and Universally Composable
Protocol}, author={Blömer, Johannes and Bröcher, Henrik and Krummel, Volker and
Porzenheim, Laurens Alexander} }'
chicago: Blömer, Johannes, Henrik Bröcher, Volker Krummel, and Laurens Alexander
Porzenheim. “Secure Distributed State Management for Stateful Signatures with
a Practical and Universally Composable Protocol,” n.d.
ieee: J. Blömer, H. Bröcher, V. Krummel, and L. A. Porzenheim, “Secure Distributed
State Management for Stateful Signatures with a Practical and Universally Composable
Protocol.” .
mla: Blömer, Johannes, et al. Secure Distributed State Management for Stateful
Signatures with a Practical and Universally Composable Protocol.
short: J. Blömer, H. Bröcher, V. Krummel, L.A. Porzenheim, (n.d.).
date_created: 2025-12-22T21:23:22Z
date_updated: 2025-12-23T11:30:38Z
department:
- _id: '34'
- _id: '64'
keyword:
- distributed state
- hash-based signature
- stateful hash-based signature
- universal composability
- secure enclave
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2025/2278.pdf
oa: '1'
page: '22'
project:
- _id: '191'
name: 'PhoQuant: Photonische Quantencomputer - Quantencomputing Testplattform'
publication_status: submitted
status: public
title: Secure Distributed State Management for Stateful Signatures with a Practical
and Universally Composable Protocol
type: preprint
user_id: '41047'
year: '2025'
...
---
_id: '44855'
abstract:
- lang: eng
text: Market transactions are subject to information asymmetry about the delivered
value proposition, causing transaction costs and adverse market effects among
buyers and sellers. Information systems research has investigated how review systems
can reduce information asymmetry in business-to-consumer markets. However, these
systems cannot be readily applied to business-to-business markets, are vulnerable
to manipulation, and suffer from conceptual weak spots since they use textual
data or star ratings. Building on design science research, we conceptualize a
new class of reputation systems based on monetary-based payments as quantitative
ratings for each transaction stored on a blockchain. Using cryptography, we show
that our system assures content confidentiality so that buyers can share and sell
their ratings selectively, establishing a reputation ecosystem. Our prescriptive
insights advance the design of reputation systems and offer new paths to understanding
the antecedents, dynamics, and consequences to reduce information asymmetry in
B2B transactions.
author:
- first_name: Simon
full_name: Hemmrich, Simon
id: '83557'
last_name: Hemmrich
- first_name: Jan
full_name: Bobolz, Jan
id: '27207'
last_name: Bobolz
- first_name: Daniel
full_name: Beverungen, Daniel
id: '59677'
last_name: Beverungen
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: 'Hemmrich S, Bobolz J, Beverungen D, Blömer J. Designing Business Reputation
Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain.
In: ECIS 2023 Research Papers. ; 2023.'
apa: Hemmrich, S., Bobolz, J., Beverungen, D., & Blömer, J. (2023). Designing
Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings
on a Blockchain. ECIS 2023 Research Papers. ECIS 2023.
bibtex: '@inproceedings{Hemmrich_Bobolz_Beverungen_Blömer_2023, title={Designing
Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings
on a Blockchain}, booktitle={ECIS 2023 Research Papers}, author={Hemmrich, Simon
and Bobolz, Jan and Beverungen, Daniel and Blömer, Johannes}, year={2023} }'
chicago: Hemmrich, Simon, Jan Bobolz, Daniel Beverungen, and Johannes Blömer. “Designing
Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings
on a Blockchain.” In ECIS 2023 Research Papers, 2023.
ieee: S. Hemmrich, J. Bobolz, D. Beverungen, and J. Blömer, “Designing Business
Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a
Blockchain,” presented at the ECIS 2023, 2023.
mla: Hemmrich, Simon, et al. “Designing Business Reputation Ecosystems — A Method
for Issuing and Trading Monetary Ratings on a Blockchain.” ECIS 2023 Research
Papers, 2023.
short: 'S. Hemmrich, J. Bobolz, D. Beverungen, J. Blömer, in: ECIS 2023 Research
Papers, 2023.'
conference:
name: ECIS 2023
date_created: 2023-05-16T08:31:27Z
date_updated: 2023-05-23T10:12:32Z
ddc:
- '330'
department:
- _id: '7'
- _id: '64'
- _id: '19'
- _id: '526'
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: jbobolz
date_created: 2023-05-23T10:11:03Z
date_updated: 2023-05-23T10:11:03Z
file_id: '45209'
file_name: A_Blockchain_Based_Reputation_Ecosystem_for_Business___Payments_as_Ratings.pdf
file_size: 958740
relation: main_file
success: 1
file_date_updated: 2023-05-23T10:11:03Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- url: https://aisel.aisnet.org/ecis2023_rp/344
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: ECIS 2023 Research Papers
status: public
title: Designing Business Reputation Ecosystems — A Method for Issuing and Trading
Monetary Ratings on a Blockchain
type: conference
user_id: '27207'
year: '2023'
...
---
_id: '45901'
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: Fabian
full_name: Eidens, Fabian
id: '25078'
last_name: Eidens
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Paul
full_name: Kramer, Paul
id: '64594'
last_name: Kramer
citation:
ama: 'Blömer J, Bobolz J, Eidens F, Jager T, Kramer P. Practical Cryptograhic Techniques
for Secure and Privacy-Preserving Customer Loyalty Systems. In: Haake C-J, Meyer
auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing
-- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe
des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:237-246.
doi:10.5281/zenodo.8068755'
apa: Blömer, J., Bobolz, J., Eidens, F., Jager, T., & Kramer, P. (2023). Practical
Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems.
In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim
(Eds.), On-The-Fly Computing -- Individualized IT-services in dynamic markets
(Vol. 412, pp. 237–246). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068755
bibtex: '@inbook{Blömer_Bobolz_Eidens_Jager_Kramer_2023, place={Paderborn}, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, title={Practical Cryptograhic Techniques for Secure
and Privacy-Preserving Customer Loyalty Systems}, volume={412}, DOI={10.5281/zenodo.8068755},
booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets},
publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Blömer, Johannes
and Bobolz, Jan and Eidens, Fabian and Jager, Tibor and Kramer, Paul}, editor={Haake,
Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth,
Henning and Wehrheim, Heike}, year={2023}, pages={237–246}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts} }'
chicago: 'Blömer, Johannes, Jan Bobolz, Fabian Eidens, Tibor Jager, and Paul Kramer.
“Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer
Loyalty Systems.” In On-The-Fly Computing -- Individualized IT-Services in
Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide,
Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:237–46. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn,
2023. https://doi.org/10.5281/zenodo.8068755.'
ieee: 'J. Blömer, J. Bobolz, F. Eidens, T. Jager, and P. Kramer, “Practical Cryptograhic
Techniques for Secure and Privacy-Preserving Customer Loyalty Systems,” in On-The-Fly
Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J.
Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds.
Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–246.'
mla: Blömer, Johannes, et al. “Practical Cryptograhic Techniques for Secure and
Privacy-Preserving Customer Loyalty Systems.” On-The-Fly Computing -- Individualized
IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol.
412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 237–46, doi:10.5281/zenodo.8068755.
short: 'J. Blömer, J. Bobolz, F. Eidens, T. Jager, P. Kramer, in: C.-J. Haake, F.
Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly
Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut,
Universität Paderborn, Paderborn, 2023, pp. 237–246.'
date_created: 2023-07-07T08:41:44Z
date_updated: 2023-07-07T11:13:37Z
ddc:
- '004'
department:
- _id: '7'
doi: 10.5281/zenodo.8068755
editor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2023-07-07T08:41:35Z
date_updated: 2023-07-07T11:13:37Z
file_id: '45902'
file_name: T2-Chapter-SFB-Buch-Final.pdf
file_size: 5944790
relation: main_file
file_date_updated: 2023-07-07T11:13:37Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: 237-246
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '82'
name: 'SFB 901 - T: SFB 901 - Project Area T'
- _id: '84'
name: 'SFB 901 - T2: SFB 901 -Subproject T2'
publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer
Loyalty Systems
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '45891'
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: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Blömer J, Eidens F, Jager T, Niehues D, Scheideler C. Robustness and Security.
In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds.
On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets.
Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut,
Universität Paderborn; 2023:145-164. doi:10.5281/zenodo.8068629'
apa: Blömer, J., Eidens, F., Jager, T., Niehues, D., & Scheideler, C. (2023).
Robustness and Security. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner,
H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized
IT-services in dynamic markets (Vol. 412, pp. 145–164). Heinz Nixdorf Institut,
Universität Paderborn. https://doi.org/10.5281/zenodo.8068629
bibtex: '@inbook{Blömer_Eidens_Jager_Niehues_Scheideler_2023, place={Paderborn},
series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Robustness
and Security}, volume={412}, DOI={10.5281/zenodo.8068629},
booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets},
publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Blömer, Johannes
and Eidens, Fabian and Jager, Tibor and Niehues, David and Scheideler, Christian},
editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco
and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={145–164}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts} }'
chicago: 'Blömer, Johannes, Fabian Eidens, Tibor Jager, David Niehues, and Christian
Scheideler. “Robustness and Security.” In On-The-Fly Computing -- Individualized
IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer
auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:145–64.
Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut,
Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068629.'
ieee: 'J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness
and Security,” in On-The-Fly Computing -- Individualized IT-services in dynamic
markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth,
and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn,
2023, pp. 145–164.'
mla: Blömer, Johannes, et al. “Robustness and Security.” On-The-Fly Computing
-- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake
et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64,
doi:10.5281/zenodo.8068629.
short: 'J. Blömer, F. Eidens, T. Jager, D. Niehues, C. Scheideler, in: C.-J. Haake,
F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly
Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut,
Universität Paderborn, Paderborn, 2023, pp. 145–164.'
date_created: 2023-07-07T08:08:47Z
date_updated: 2023-07-07T11:18:21Z
ddc:
- '004'
department:
- _id: '7'
doi: 10.5281/zenodo.8068629
editor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2023-07-07T08:08:37Z
date_updated: 2023-07-07T11:18:21Z
file_id: '45892'
file_name: C1-Chapter-SFB-Buch-Final.pdf
file_size: 320980
relation: main_file
file_date_updated: 2023-07-07T11:18:21Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: 145-164
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Robustness and Security
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '35014'
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: Henrik
full_name: Bröcher, Henrik
id: '41047'
last_name: Bröcher
citation:
ama: 'Blömer J, Bobolz J, Bröcher H. On the impossibility of surviving (iterated)
deletion of weakly dominated strategies in rational MPC. In: ; 2023.'
apa: Blömer, J., Bobolz, J., & Bröcher, H. (2023). On the impossibility of
surviving (iterated) deletion of weakly dominated strategies in rational MPC.
TCC 2023, Taipeh, Taiwan.
bibtex: '@inproceedings{Blömer_Bobolz_Bröcher_2023, title={On the impossibility
of surviving (iterated) deletion of weakly dominated strategies in rational MPC},
author={Blömer, Johannes and Bobolz, Jan and Bröcher, Henrik}, year={2023} }'
chicago: Blömer, Johannes, Jan Bobolz, and Henrik Bröcher. “On the Impossibility
of Surviving (Iterated) Deletion of Weakly Dominated Strategies in Rational MPC,”
2023.
ieee: J. Blömer, J. Bobolz, and H. Bröcher, “On the impossibility of surviving (iterated)
deletion of weakly dominated strategies in rational MPC,” presented at the TCC
2023, Taipeh, Taiwan, 2023.
mla: Blömer, Johannes, et al. On the Impossibility of Surviving (Iterated) Deletion
of Weakly Dominated Strategies in Rational MPC. 2023.
short: 'J. Blömer, J. Bobolz, H. Bröcher, in: 2023.'
conference:
end_date: 2023-12-02
location: Taipeh, Taiwan
name: TCC 2023
start_date: 2023-11-29
date_created: 2022-12-28T16:02:11Z
date_updated: 2023-09-07T10:01:00Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2022/1762
oa: '1'
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
status: public
title: On the impossibility of surviving (iterated) deletion of weakly dominated strategies
in rational MPC
type: conference
user_id: '41047'
year: '2023'
...
---
_id: '43458'
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: Laurens Alexander
full_name: Porzenheim, Laurens Alexander
id: '47434'
last_name: Porzenheim
citation:
ama: 'Blömer J, Bobolz J, Porzenheim LA. A Generic Construction of an Anonymous
Reputation System and Instantiations from Lattices. In: ; 2023.'
apa: Blömer, J., Bobolz, J., & Porzenheim, L. A. (2023). A Generic Construction
of an Anonymous Reputation System and Instantiations from Lattices. Asiacrypt
2023, Guangzhou, China.
bibtex: '@inproceedings{Blömer_Bobolz_Porzenheim_2023, title={A Generic Construction
of an Anonymous Reputation System and Instantiations from Lattices}, author={Blömer,
Johannes and Bobolz, Jan and Porzenheim, Laurens Alexander}, year={2023} }'
chicago: Blömer, Johannes, Jan Bobolz, and Laurens Alexander Porzenheim. “A Generic
Construction of an Anonymous Reputation System and Instantiations from Lattices,”
2023.
ieee: J. Blömer, J. Bobolz, and L. A. Porzenheim, “A Generic Construction of an
Anonymous Reputation System and Instantiations from Lattices,” presented at the
Asiacrypt 2023, Guangzhou, China, 2023.
mla: Blömer, Johannes, et al. A Generic Construction of an Anonymous Reputation
System and Instantiations from Lattices. 2023.
short: 'J. Blömer, J. Bobolz, L.A. Porzenheim, in: 2023.'
conference:
end_date: 2023-12-08
location: Guangzhou, China
name: Asiacrypt 2023
start_date: 2023-12-04
date_created: 2023-04-12T08:18:41Z
date_updated: 2023-09-07T09:53:26Z
department:
- _id: '64'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2023/464
oa: '1'
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
status: public
title: A Generic Construction of an Anonymous Reputation System and Instantiations
from Lattices
type: conference
user_id: '47434'
year: '2023'
...
---
_id: '20888'
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
citation:
ama: Blömer J, Brauer S, Bujna K. A Complexity Theoretical Study of Fuzzy K-Means.
ACM Transactions on Algorithms. 2020;16(4):1-25. doi:10.1145/3409385
apa: Blömer, J., Brauer, S., & Bujna, K. (2020). A Complexity Theoretical Study
of Fuzzy K-Means. ACM Transactions on Algorithms, 16(4), 1–25. https://doi.org/10.1145/3409385
bibtex: '@article{Blömer_Brauer_Bujna_2020, title={A Complexity Theoretical Study
of Fuzzy K-Means}, volume={16}, DOI={10.1145/3409385},
number={4}, journal={ACM Transactions on Algorithms}, author={Blömer, Johannes
and Brauer, Sascha and Bujna, Kathrin}, year={2020}, pages={1–25} }'
chicago: 'Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Complexity Theoretical
Study of Fuzzy K-Means.” ACM Transactions on Algorithms 16, no. 4 (2020):
1–25. https://doi.org/10.1145/3409385.'
ieee: J. Blömer, S. Brauer, and K. Bujna, “A Complexity Theoretical Study of Fuzzy
K-Means,” ACM Transactions on Algorithms, vol. 16, no. 4, pp. 1–25, 2020.
mla: Blömer, Johannes, et al. “A Complexity Theoretical Study of Fuzzy K-Means.”
ACM Transactions on Algorithms, vol. 16, no. 4, 2020, pp. 1–25, doi:10.1145/3409385.
short: J. Blömer, S. Brauer, K. Bujna, ACM Transactions on Algorithms 16 (2020)
1–25.
date_created: 2021-01-08T08:51:42Z
date_updated: 2022-01-06T06:54:41Z
department:
- _id: '64'
doi: 10.1145/3409385
intvolume: ' 16'
issue: '4'
language:
- iso: eng
page: 1-25
project:
- _id: '45'
name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: ACM Transactions on Algorithms
publication_identifier:
issn:
- 1549-6325
- 1549-6333
publication_status: published
status: public
title: A Complexity Theoretical Study of Fuzzy K-Means
type: journal_article
user_id: '13291'
volume: 16
year: '2020'
...
---
_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: '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: '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'
...
---
_id: '4344'
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
citation:
ama: 'Blömer J, Brauer S, Bujna K. Coresets for Fuzzy K-Means with Applications.
In: 29th International Symposium on Algorithms and Computation (ISAAC 2018).
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik; 2018:46:1--46:12. doi:10.4230/LIPIcs.ISAAC.2018.46'
apa: 'Blömer, J., Brauer, S., & Bujna, K. (2018). Coresets for Fuzzy K-Means
with Applications. In 29th International Symposium on Algorithms and Computation
(ISAAC 2018) (pp. 46:1--46:12). Jiaoxi, Yilan County, Taiwan: Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2018.46'
bibtex: '@inproceedings{Blömer_Brauer_Bujna_2018, title={Coresets for Fuzzy K-Means
with Applications}, DOI={10.4230/LIPIcs.ISAAC.2018.46},
booktitle={29th International Symposium on Algorithms and Computation (ISAAC
2018)}, publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, author={Blömer,
Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2018}, pages={46:1--46:12}
}'
chicago: Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “Coresets for Fuzzy
K-Means with Applications.” In 29th International Symposium on Algorithms and
Computation (ISAAC 2018), 46:1--46:12. Schloss Dagstuhl--Leibniz-Zentrum
fuer Informatik, 2018. https://doi.org/10.4230/LIPIcs.ISAAC.2018.46.
ieee: J. Blömer, S. Brauer, and K. Bujna, “Coresets for Fuzzy K-Means with Applications,”
in 29th International Symposium on Algorithms and Computation (ISAAC 2018),
Jiaoxi, Yilan County, Taiwan, 2018, pp. 46:1--46:12.
mla: Blömer, Johannes, et al. “Coresets for Fuzzy K-Means with Applications.” 29th
International Symposium on Algorithms and Computation (ISAAC 2018), Schloss
Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018, pp. 46:1--46:12, doi:10.4230/LIPIcs.ISAAC.2018.46.
short: 'J. Blömer, S. Brauer, K. Bujna, in: 29th International Symposium on Algorithms
and Computation (ISAAC 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik,
2018, pp. 46:1--46:12.'
conference:
end_date: 2018-12-19
location: Jiaoxi, Yilan County, Taiwan
name: 29th International Symposium on Algorithms and Computation (ISAAC)
start_date: 2018-12-17
date_created: 2018-09-03T08:04:19Z
date_updated: 2022-01-06T07:00:57Z
department:
- _id: '64'
doi: 10.4230/LIPIcs.ISAAC.2018.46
language:
- iso: eng
page: 46:1--46:12
project:
- _id: '45'
name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: 29th International Symposium on Algorithms and Computation (ISAAC 2018)
publication_identifier:
isbn:
- 978-3-95977-094-1
publication_status: published
publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
status: public
title: Coresets for Fuzzy K-Means with Applications
type: conference
user_id: '13291'
year: '2018'
...
---
_id: '3873'
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. Enhanced Security of Attribute-Based Signatures.
In: The International Conference on Cryptology And Network Security (CANS).
Vol 11124. Lecture Notes in Computer Science. Springer; 2018:235-255. doi:10.1007/978-3-030-00434-7_12'
apa: Blömer, J., Eidens, F., & Juhnke, J. (2018). Enhanced Security of Attribute-Based
Signatures. The International Conference on Cryptology And Network Security
(CANS), 11124, 235–255. https://doi.org/10.1007/978-3-030-00434-7_12
bibtex: '@inproceedings{Blömer_Eidens_Juhnke_2018, series={Lecture Notes in Computer
Science}, title={Enhanced Security of Attribute-Based Signatures}, volume={11124},
DOI={10.1007/978-3-030-00434-7_12},
booktitle={The International Conference on Cryptology And Network Security (CANS)},
publisher={Springer}, author={Blömer, Johannes and Eidens, Fabian and Juhnke,
Jakob}, year={2018}, pages={235–255}, collection={Lecture Notes in Computer Science}
}'
chicago: Blömer, Johannes, Fabian Eidens, and Jakob Juhnke. “Enhanced Security of
Attribute-Based Signatures.” In The International Conference on Cryptology
And Network Security (CANS), 11124:235–55. Lecture Notes in Computer Science.
Springer, 2018. https://doi.org/10.1007/978-3-030-00434-7_12.
ieee: 'J. Blömer, F. Eidens, and J. Juhnke, “Enhanced Security of Attribute-Based
Signatures,” in The International Conference on Cryptology And Network Security
(CANS), Naples, Italy, 2018, vol. 11124, pp. 235–255, doi: 10.1007/978-3-030-00434-7_12.'
mla: Blömer, Johannes, et al. “Enhanced Security of Attribute-Based Signatures.”
The International Conference on Cryptology And Network Security (CANS),
vol. 11124, Springer, 2018, pp. 235–55, doi:10.1007/978-3-030-00434-7_12.
short: 'J. Blömer, F. Eidens, J. Juhnke, in: The International Conference on Cryptology
And Network Security (CANS), Springer, 2018, pp. 235–255.'
conference:
location: Naples, Italy
name: The International Conference on Cryptology And Network Security (CANS)
date_created: 2018-08-10T09:44:09Z
date_updated: 2023-01-10T10:26:13Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-030-00434-7_12
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-11-08T10:15:00Z
date_updated: 2018-11-08T10:15:00Z
file_id: '5427'
file_name: uc_abs.pdf
file_size: 574228
relation: main_file
file_date_updated: 2018-11-08T10:15:00Z
has_accepted_license: '1'
intvolume: ' 11124'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/874
oa: '1'
page: 235-255
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
- _id: '1'
name: SFB 901
publication: The International Conference on Cryptology And Network Security (CANS)
publication_identifier:
isbn:
- 978-3-030-00434-7
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Enhanced Security of Attribute-Based Signatures
type: conference
user_id: '25078'
volume: 11124
year: '2018'
...
---
_id: '2379'
abstract:
- lang: eng
text: 'In this paper, we introduce the notion of delegatable attribute-based anonymous
credentials (DAAC). Such systems offer fine-grained anonymous access control and
they give the credential holder the ability to issue more restricted credentials
to other users. In our model, credentials are parameterized with attributes that
(1) express what the credential holder himself has been certified and (2) define
which attributes he may issue to others. Furthermore, we present a practical construction
of DAAC. For this construction, we deviate from the usual approach of embedding
a certificate chain in the credential. Instead, we introduce a novel approach
for which we identify a new primitive we call dynamically malleable signatures
(DMS) as the main ingredient. This primitive may be of independent interest. We
also give a first instantiation of DMS with efficient protocols. '
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
citation:
ama: 'Blömer J, Bobolz J. Delegatable Attribute-based Anonymous Credentials from
Dynamically Malleable Signatures. In: ACNS 2018 Applied Cryptography &
Network Security. LNCS. doi:10.1007/978-3-319-93387-0_12'
apa: Blömer, J., & Bobolz, J. (n.d.). Delegatable Attribute-based Anonymous
Credentials from Dynamically Malleable Signatures. ACNS 2018 Applied Cryptography
& Network Security. The 16th International Conference on Applied Cryptography
and Network Security, Leuven, Belgium. https://doi.org/10.1007/978-3-319-93387-0_12
bibtex: '@inproceedings{Blömer_Bobolz, series={LNCS}, title={Delegatable Attribute-based
Anonymous Credentials from Dynamically Malleable Signatures}, DOI={10.1007/978-3-319-93387-0_12},
booktitle={ACNS 2018 Applied Cryptography & Network security}, author={Blömer,
Johannes and Bobolz, Jan}, collection={LNCS} }'
chicago: Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous
Credentials from Dynamically Malleable Signatures.” In ACNS 2018 Applied Cryptography
& Network Security. LNCS, n.d. https://doi.org/10.1007/978-3-319-93387-0_12.
ieee: 'J. Blömer and J. Bobolz, “Delegatable Attribute-based Anonymous Credentials
from Dynamically Malleable Signatures,” presented at the The 16th International
Conference on Applied Cryptography and Network Security, Leuven, Belgium, doi:
10.1007/978-3-319-93387-0_12.'
mla: Blömer, Johannes, and Jan Bobolz. “Delegatable Attribute-Based Anonymous Credentials
from Dynamically Malleable Signatures.” ACNS 2018 Applied Cryptography &
Network Security, doi:10.1007/978-3-319-93387-0_12.
short: 'J. Blömer, J. Bobolz, in: ACNS 2018 Applied Cryptography & Network Security,
n.d.'
conference:
location: Leuven, Belgium
name: The 16th International Conference on Applied Cryptography and Network Security
date_created: 2018-04-17T12:28:25Z
date_updated: 2023-01-10T10:28:43Z
ddc:
- '004'
department:
- _id: '7'
- _id: '64'
doi: 10.1007/978-3-319-93387-0_12
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:41:16Z
date_updated: 2018-11-02T13:41:16Z
file_id: '5252'
file_name: 2018-340.pdf
file_size: 542171
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:41:16Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2018/340
oa: '1'
project:
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subproject C1
publication: ACNS 2018 Applied Cryptography & Network security
publication_status: accepted
series_title: LNCS
status: public
title: Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable
Signatures
type: conference
user_id: '25078'
year: '2018'
...
---
_id: '2967'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Gennadij
full_name: Liske, Gennadij
last_name: Liske
citation:
ama: 'Blömer J, Liske G. Subtleties in Security Definitions for Predicate Encryption
with Public Index. In: Proceedings of the International Conference of Mathematical
Aspects of Computer and Information Sciences (MACIS). Vol 10693. Lecture Notes
in Computer Science. Cham: Springer International Publishing; 2017:438-453. doi:10.1007/978-3-319-72453-9_35'
apa: 'Blömer, J., & Liske, G. (2017). Subtleties in Security Definitions for
Predicate Encryption with Public Index. In Proceedings of the International
Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)
(Vol. 10693, pp. 438–453). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-72453-9_35'
bibtex: '@inproceedings{Blömer_Liske_2017, place={Cham}, series={Lecture Notes in
Computer Science}, title={Subtleties in Security Definitions for Predicate Encryption
with Public Index}, volume={10693}, DOI={10.1007/978-3-319-72453-9_35},
booktitle={Proceedings of the International Conference of Mathematical Aspects
of Computer and Information Sciences (MACIS)}, publisher={Springer International
Publishing}, author={Blömer, Johannes and Liske, Gennadij}, year={2017}, pages={438–453},
collection={Lecture Notes in Computer Science} }'
chicago: 'Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions
for Predicate Encryption with Public Index.” In Proceedings of the International
Conference of Mathematical Aspects of Computer and Information Sciences (MACIS),
10693:438–53. Lecture Notes in Computer Science. Cham: Springer International
Publishing, 2017. https://doi.org/10.1007/978-3-319-72453-9_35.'
ieee: J. Blömer and G. Liske, “Subtleties in Security Definitions for Predicate
Encryption with Public Index,” in Proceedings of the International Conference
of Mathematical Aspects of Computer and Information Sciences (MACIS), 2017,
vol. 10693, pp. 438–453.
mla: Blömer, Johannes, and Gennadij Liske. “Subtleties in Security Definitions for
Predicate Encryption with Public Index.” Proceedings of the International Conference
of Mathematical Aspects of Computer and Information Sciences (MACIS), vol.
10693, Springer International Publishing, 2017, pp. 438–53, doi:10.1007/978-3-319-72453-9_35.
short: 'J. Blömer, G. Liske, in: Proceedings of the International Conference of
Mathematical Aspects of Computer and Information Sciences (MACIS), Springer International
Publishing, Cham, 2017, pp. 438–453.'
date_created: 2018-06-04T12:17:48Z
date_updated: 2022-01-06T06:58:49Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/978-3-319-72453-9_35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T14:52:10Z
date_updated: 2018-11-02T14:52:10Z
file_id: '5286'
file_name: SubtletiesInSecurityDefinition.pdf
file_size: 463904
relation: main_file
success: 1
file_date_updated: 2018-11-02T14:52:10Z
has_accepted_license: '1'
intvolume: ' 10693'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2017/453.pdf
oa: '1'
page: 438-453
place: Cham
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 International Conference of Mathematical Aspects of
Computer and Information Sciences (MACIS)
publication_identifier:
isbn:
- '9783319724522'
- '9783319724539'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Subtleties in Security Definitions for Predicate Encryption with Public Index
type: conference
user_id: '477'
volume: 10693
year: '2017'
...