---
_id: '63107'
abstract:
- lang: eng
  text: We construct good GKP (Gottesman-Kitaev-Preskill) codes (in the sense of Conrad,
    Eisert and Seifert proposed) from standard short integer solution lattices (SIS)
    as well as from ring SIS and module SIS lattices, R-SIS and M-SIS lattices, respectively.
    These lattice are crucial for lattice-based cryptography. Our construction yields
    GKP codes with distance $\sqrt{n/πe}$. This compares favorably with the NTRU-based
    construction by Conrad et al. that achieves distance $Ω(\sqrt{n/q}),$ with $n\le
    q^2/0.28$. Unlike their codes, our codes do not have secret keys that can be used
    to speed-up the decoding. However, we present a simple decoding algorithm that,
    for many parameter choices, experimentally yields decoding results similar to
    the ones for NTRU-based codes. Using the R-SIS and M-SIS construction, our simple
    decoding algorithm runs in nearly linear time. Following Conrad, Eisert and Seifert's
    work, our construction of GKP codes follows directly from an explicit, randomized
    construction of symplectic lattices with (up to constants $\approx 1$) minimal
    distance $(1/σ_{2n})^{1/2n}\approx \sqrt{\frac{n}{πe}}$, where $σ_{2n}$ is the
    volume of the 2n-dimensional unit ball. Before this result, Buser and Sarnak gave
    a non-constructive proof for the existence of such symplectic lattices.
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  last_name: Blömer
- first_name: Yinzi
  full_name: Xiao, Yinzi
  last_name: Xiao
- first_name: Zahra
  full_name: Raissi, Zahra
  last_name: Raissi
- first_name: Stanislaw
  full_name: Soltan, Stanislaw
  last_name: Soltan
citation:
  ama: Blömer J, Xiao Y, Raissi Z, Soltan S. Symplectic Lattices and GKP Codes --
    Simple Randomized Constructions from Cryptographic Lattices. <i>arXiv:250910183</i>.
    Published online 2025.
  apa: Blömer, J., Xiao, Y., Raissi, Z., &#38; Soltan, S. (2025). Symplectic Lattices
    and GKP Codes -- Simple Randomized Constructions from Cryptographic Lattices.
    In <i>arXiv:2509.10183</i>.
  bibtex: '@article{Blömer_Xiao_Raissi_Soltan_2025, title={Symplectic Lattices and
    GKP Codes -- Simple Randomized Constructions from Cryptographic Lattices}, journal={arXiv:2509.10183},
    author={Blömer, Johannes and Xiao, Yinzi and Raissi, Zahra and Soltan, Stanislaw},
    year={2025} }'
  chicago: Blömer, Johannes, Yinzi Xiao, Zahra Raissi, and Stanislaw Soltan. “Symplectic
    Lattices and GKP Codes -- Simple Randomized Constructions from Cryptographic Lattices.”
    <i>ArXiv:2509.10183</i>, 2025.
  ieee: J. Blömer, Y. Xiao, Z. Raissi, and S. Soltan, “Symplectic Lattices and GKP
    Codes -- Simple Randomized Constructions from Cryptographic Lattices,” <i>arXiv:2509.10183</i>.
    2025.
  mla: Blömer, Johannes, et al. “Symplectic Lattices and GKP Codes -- Simple Randomized
    Constructions from Cryptographic Lattices.” <i>ArXiv:2509.10183</i>, 2025.
  short: J. Blömer, Y. Xiao, Z. Raissi, S. Soltan, ArXiv:2509.10183 (2025).
date_created: 2025-12-15T15:34:08Z
date_updated: 2026-01-23T09:59:34Z
department:
- _id: '34'
- _id: '64'
- _id: '623'
external_id:
  arxiv:
  - '2509.10183'
language:
- iso: eng
project:
- _id: '191'
  name: 'PhoQuant: Photonische Quantencomputer -  Quantencomputing Testplattform'
publication: arXiv:2509.10183
status: public
title: Symplectic Lattices and GKP Codes -- Simple Randomized Constructions from Cryptographic
  Lattices
type: preprint
user_id: '41047'
year: '2025'
...
---
_id: '63407'
author:
- first_name: A
  full_name: Anonymous, A
  last_name: Anonymous
citation:
  ama: Anonymous A. <i>Limitations of the Random Oracle Model</i>.; 2025.
  apa: Anonymous, A. (2025). <i>Limitations of the Random Oracle Model</i>.
  bibtex: '@book{Anonymous_2025, title={Limitations of the Random Oracle Model}, author={Anonymous,
    A}, year={2025} }'
  chicago: Anonymous, A. <i>Limitations of the Random Oracle Model</i>, 2025.
  ieee: A. Anonymous, <i>Limitations of the Random Oracle Model</i>. 2025.
  mla: Anonymous, A. <i>Limitations of the Random Oracle Model</i>. 2025.
  short: A. Anonymous, Limitations of the Random Oracle Model, 2025.
date_created: 2025-12-23T11:32:25Z
date_updated: 2026-02-04T14:20:08Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Limitations of the Random Oracle Model
type: bachelorsthesis
user_id: '41047'
year: '2025'
...
---
_id: '63408'
author:
- first_name: A
  full_name: Anonymous, A
  last_name: Anonymous
citation:
  ama: Anonymous A. <i>Clustering with Rényi Divergence</i>.; 2025.
  apa: Anonymous, A. (2025). <i>Clustering with Rényi Divergence</i>.
  bibtex: '@book{Anonymous_2025, title={Clustering with Rényi Divergence}, author={Anonymous,
    A}, year={2025} }'
  chicago: Anonymous, A. <i>Clustering with Rényi Divergence</i>, 2025.
  ieee: A. Anonymous, <i>Clustering with Rényi Divergence</i>. 2025.
  mla: Anonymous, A. <i>Clustering with Rényi Divergence</i>. 2025.
  short: A. Anonymous, Clustering with Rényi Divergence, 2025.
date_created: 2025-12-23T11:35:05Z
date_updated: 2026-02-04T14:20:16Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Clustering with Rényi Divergence
type: mastersthesis
user_id: '41047'
year: '2025'
...
---
_id: '63406'
author:
- first_name: A
  full_name: Anoynmous, A
  last_name: Anoynmous
citation:
  ama: Anoynmous A. <i>BUFF Transform</i>.; 2025.
  apa: Anoynmous, A. (2025). <i>BUFF Transform</i>.
  bibtex: '@book{Anoynmous_2025, title={BUFF Transform}, author={Anoynmous, A}, year={2025}
    }'
  chicago: Anoynmous, A. <i>BUFF Transform</i>, 2025.
  ieee: A. Anoynmous, <i>BUFF Transform</i>. 2025.
  mla: Anoynmous, A. <i>BUFF Transform</i>. 2025.
  short: A. Anoynmous, BUFF Transform, 2025.
date_created: 2025-12-23T11:31:38Z
date_updated: 2026-02-04T14:20:13Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: BUFF Transform
type: bachelorsthesis
user_id: '41047'
year: '2025'
...
---
_id: '61879'
author:
- first_name: A.
  full_name: Anonymous, A.
  last_name: Anonymous
citation:
  ama: Anonymous A. <i>Overview on Threshold Signature Schemes and Their Applications</i>.;
    2025.
  apa: Anonymous, A. (2025). <i>Overview on Threshold Signature Schemes and their
    Applications</i>.
  bibtex: '@book{Anonymous_2025, title={Overview on Threshold Signature Schemes and
    their Applications}, author={Anonymous, A.}, year={2025} }'
  chicago: Anonymous, A. <i>Overview on Threshold Signature Schemes and Their Applications</i>,
    2025.
  ieee: A. Anonymous, <i>Overview on Threshold Signature Schemes and their Applications</i>.
    2025.
  mla: Anonymous, A. <i>Overview on Threshold Signature Schemes and Their Applications</i>.
    2025.
  short: A. Anonymous, Overview on Threshold Signature Schemes and Their Applications,
    2025.
date_created: 2025-10-20T08:52:45Z
date_updated: 2025-10-20T08:53:28Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Overview on Threshold Signature Schemes and their Applications
type: bachelorsthesis
user_id: '41047'
year: '2025'
...
---
_id: '61878'
author:
- first_name: A
  full_name: Anonymous, A
  last_name: Anonymous
citation:
  ama: Anonymous A. <i>Comparison of Time-Lock Puzzle Constructions and Their Security</i>.;
    2025.
  apa: Anonymous, A. (2025). <i>Comparison of Time-Lock Puzzle Constructions and Their
    Security</i>.
  bibtex: '@book{Anonymous_2025, title={Comparison of Time-Lock Puzzle Constructions
    and Their Security}, author={Anonymous, A}, year={2025} }'
  chicago: Anonymous, A. <i>Comparison of Time-Lock Puzzle Constructions and Their
    Security</i>, 2025.
  ieee: A. Anonymous, <i>Comparison of Time-Lock Puzzle Constructions and Their Security</i>.
    2025.
  mla: Anonymous, A. <i>Comparison of Time-Lock Puzzle Constructions and Their Security</i>.
    2025.
  short: A. Anonymous, Comparison of Time-Lock Puzzle Constructions and Their Security,
    2025.
date_created: 2025-10-20T08:51:06Z
date_updated: 2025-10-20T08:53:24Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Comparison of Time-Lock Puzzle Constructions and Their Security
type: bachelorsthesis
user_id: '41047'
year: '2025'
...
---
_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., &#38; Porzenheim, L. A. (n.d.). <i>Secure
    Distributed State Management for Stateful Signatures with a Practical and Universally
    Composable Protocol</i>.
  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. <i>Secure Distributed State Management for Stateful
    Signatures with a Practical and Universally Composable Protocol</i>.
  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: '47658'
author:
- first_name: A.
  full_name: Anonymous, A.
  last_name: Anonymous
citation:
  ama: Anonymous A. <i>Private Set Intersection Using Third Generation FHE</i>.; 2023.
  apa: Anonymous, A. (2023). <i>Private Set Intersection using Third Generation FHE</i>.
  bibtex: '@book{Anonymous_2023, title={Private Set Intersection using Third Generation
    FHE}, author={Anonymous, A.}, year={2023} }'
  chicago: Anonymous, A. <i>Private Set Intersection Using Third Generation FHE</i>,
    2023.
  ieee: A. Anonymous, <i>Private Set Intersection using Third Generation FHE</i>.
    2023.
  mla: Anonymous, A. <i>Private Set Intersection Using Third Generation FHE</i>. 2023.
  short: A. Anonymous, Private Set Intersection Using Third Generation FHE, 2023.
date_created: 2023-10-05T13:55:55Z
date_updated: 2023-10-05T13:56:00Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
status: public
title: Private Set Intersection using Third Generation FHE
type: mastersthesis
user_id: '41047'
year: '2023'
...
---
_id: '47659'
author:
- first_name: A.
  full_name: Anonymous, A.
  last_name: Anonymous
citation:
  ama: Anonymous A. <i>Rational Models in Cryptography Applied to Matching</i>.; 2023.
  apa: Anonymous, A. (2023). <i>Rational Models in Cryptography Applied to Matching</i>.
  bibtex: '@book{Anonymous_2023, title={Rational Models in Cryptography Applied to
    Matching}, author={Anonymous, A.}, year={2023} }'
  chicago: Anonymous, A. <i>Rational Models in Cryptography Applied to Matching</i>,
    2023.
  ieee: A. Anonymous, <i>Rational Models in Cryptography Applied to Matching</i>.
    2023.
  mla: Anonymous, A. <i>Rational Models in Cryptography Applied to Matching</i>. 2023.
  short: A. Anonymous, Rational Models in Cryptography Applied to Matching, 2023.
date_created: 2023-10-05T13:58:18Z
date_updated: 2023-10-05T13:58:35Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
status: public
title: Rational Models in Cryptography Applied to Matching
type: mastersthesis
user_id: '41047'
year: '2023'
...
---
_id: '40440'
author:
- first_name: Matthias
  full_name: Pilot, Matthias
  last_name: Pilot
citation:
  ama: Pilot M. <i>Updatable Privacy-Preserving Reputation System Based on Blockchain</i>.;
    2023.
  apa: Pilot, M. (2023). <i>Updatable Privacy-Preserving Reputation System based on
    Blockchain</i>.
  bibtex: '@book{Pilot_2023, title={Updatable Privacy-Preserving Reputation System
    based on Blockchain}, author={Pilot, Matthias}, year={2023} }'
  chicago: Pilot, Matthias. <i>Updatable Privacy-Preserving Reputation System Based
    on Blockchain</i>, 2023.
  ieee: M. Pilot, <i>Updatable Privacy-Preserving Reputation System based on Blockchain</i>.
    2023.
  mla: Pilot, Matthias. <i>Updatable Privacy-Preserving Reputation System Based on
    Blockchain</i>. 2023.
  short: M. Pilot, Updatable Privacy-Preserving Reputation System Based on Blockchain,
    2023.
date_created: 2023-01-26T16:07:19Z
date_updated: 2023-01-26T16:08:11Z
department:
- _id: '7'
- _id: '64'
extern: '1'
language:
- iso: eng
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'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Updatable Privacy-Preserving Reputation System based on Blockchain
type: mastersthesis
user_id: '27207'
year: '2023'
...
---
_id: '43374'
author:
- first_name: Patrick
  full_name: Schürmann, Patrick
  last_name: Schürmann
citation:
  ama: Schürmann P. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>.;
    2023.
  apa: Schürmann, P. (2023). <i> A Formal Comparison of Advanced Digital Signature
    Primitives</i>.
  bibtex: '@book{Schürmann_2023, title={ A Formal Comparison of Advanced Digital Signature
    Primitives}, author={Schürmann, Patrick}, year={2023} }'
  chicago: Schürmann, Patrick. <i> A Formal Comparison of Advanced Digital Signature
    Primitives</i>, 2023.
  ieee: P. Schürmann, <i> A Formal Comparison of Advanced Digital Signature Primitives</i>.
    2023.
  mla: Schürmann, Patrick. <i> A Formal Comparison of Advanced Digital Signature Primitives</i>.
    2023.
  short: P. Schürmann,  A Formal Comparison of Advanced Digital Signature Primitives,
    2023.
date_created: 2023-04-03T14:07:32Z
date_updated: 2023-04-25T22:43:21Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: bhenrik
  date_created: 2023-04-25T10:49:36Z
  date_updated: 2023-04-25T10:49:36Z
  file_id: '44177'
  file_name: masters_thesis_schuermann.pdf
  file_size: 1367369
  relation: main_file
  title: ' A Formal Comparison of Advanced Digital Signature Primitives'
file_date_updated: 2023-04-25T10:49:36Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
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'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: ' A Formal Comparison of Advanced Digital Signature Primitives'
type: mastersthesis
user_id: '41047'
year: '2023'
...
---
_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: <i>ECIS 2023 Research Papers</i>. ; 2023.'
  apa: Hemmrich, S., Bobolz, J., Beverungen, D., &#38; Blömer, J. (2023). Designing
    Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings
    on a Blockchain. <i>ECIS 2023 Research Papers</i>. 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 <i>ECIS 2023 Research Papers</i>, 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.” <i>ECIS 2023 Research
    Papers</i>, 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: '43375'
author:
- first_name: Angelina
  full_name: Koch, Angelina
  last_name: Koch
citation:
  ama: Koch A. <i>Privacy-Preserving Collection and Evaluation of Log Files</i>.;
    2023.
  apa: Koch, A. (2023). <i>Privacy-Preserving Collection and Evaluation of Log Files</i>.
  bibtex: '@book{Koch_2023, title={Privacy-Preserving Collection and Evaluation of
    Log Files}, author={Koch, Angelina}, year={2023} }'
  chicago: Koch, Angelina. <i>Privacy-Preserving Collection and Evaluation of Log
    Files</i>, 2023.
  ieee: A. Koch, <i>Privacy-Preserving Collection and Evaluation of Log Files</i>.
    2023.
  mla: Koch, Angelina. <i>Privacy-Preserving Collection and Evaluation of Log Files</i>.
    2023.
  short: A. Koch, Privacy-Preserving Collection and Evaluation of Log Files, 2023.
date_created: 2023-04-03T14:09:14Z
date_updated: 2023-05-30T11:43:18Z
ddc:
- '000'
department:
- _id: '64'
file:
- access_level: open_access
  content_type: application/pdf
  creator: feidens
  date_created: 2023-05-26T07:07:39Z
  date_updated: 2023-05-30T11:43:18Z
  file_id: '45303'
  file_name: thesis_koch.pdf
  file_size: 2275949
  relation: main_file
file_date_updated: 2023-05-30T11:43:18Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
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'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Privacy-Preserving Collection and Evaluation of Log Files
type: bachelorsthesis
user_id: '25078'
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., &#38; Bröcher, H. (2023). <i>On the impossibility of
    surviving (iterated) deletion of weakly dominated strategies in rational MPC</i>.
    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. <i>On the Impossibility of Surviving (Iterated) Deletion
    of Weakly Dominated Strategies in Rational MPC</i>. 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., &#38; Porzenheim, L. A. (2023). <i>A Generic Construction
    of an Anonymous Reputation System and Instantiations from Lattices</i>. 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. <i>A Generic Construction of an Anonymous Reputation
    System and Instantiations from Lattices</i>. 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: '32399'
author:
- first_name: Ella
  full_name: Vahle, Ella
  last_name: Vahle
citation:
  ama: Vahle E. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable
    Matching</i>.; 2022.
  apa: Vahle, E. (2022). <i>Modelling and Proving Security for a Secure MPC Protocol
    for Stable Matching</i>.
  bibtex: '@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC
    Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }'
  chicago: Vahle, Ella. <i>Modelling and Proving Security for a Secure MPC Protocol
    for Stable Matching</i>, 2022.
  ieee: E. Vahle, <i>Modelling and Proving Security for a Secure MPC Protocol for
    Stable Matching</i>. 2022.
  mla: Vahle, Ella. <i>Modelling and Proving Security for a Secure MPC Protocol for
    Stable Matching</i>. 2022.
  short: E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable
    Matching, 2022.
date_created: 2022-07-20T09:38:39Z
date_updated: 2022-07-26T14:31:54Z
department:
- _id: '64'
language:
- iso: eng
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'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Modelling and Proving Security for a Secure MPC Protocol for Stable Matching
type: bachelorsthesis
user_id: '25078'
year: '2022'
...
---
_id: '32398'
author:
- first_name: Hanna
  full_name: Siek, Hanna
  last_name: Siek
citation:
  ama: 'Siek H. <i>Bringing Structure to Structure-Preserving Signatures: Overview,
    Implementation and Comparison of Selected SPS Schemes</i>.; 2022.'
  apa: 'Siek, H. (2022). <i>Bringing Structure to Structure-Preserving Signatures:
    Overview, Implementation and Comparison of Selected SPS Schemes</i>.'
  bibtex: '@book{Siek_2022, title={Bringing Structure to Structure-Preserving Signatures:
    Overview, Implementation and Comparison of Selected SPS Schemes}, author={Siek,
    Hanna}, year={2022} }'
  chicago: 'Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures:
    Overview, Implementation and Comparison of Selected SPS Schemes</i>, 2022.'
  ieee: 'H. Siek, <i>Bringing Structure to Structure-Preserving Signatures: Overview,
    Implementation and Comparison of Selected SPS Schemes</i>. 2022.'
  mla: 'Siek, Hanna. <i>Bringing Structure to Structure-Preserving Signatures: Overview,
    Implementation and Comparison of Selected SPS Schemes</i>. 2022.'
  short: 'H. Siek, Bringing Structure to Structure-Preserving Signatures: Overview,
    Implementation and Comparison of Selected SPS Schemes, 2022.'
date_created: 2022-07-20T09:36:39Z
date_updated: 2022-11-18T09:38:04Z
department:
- _id: '64'
- _id: '7'
language:
- iso: eng
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'
- _id: '84'
  name: 'SFB 901 - T2: SFB 901 -Subproject T2'
- _id: '82'
  name: 'SFB 901 - T: SFB 901 - Project Area T'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: 'Bringing Structure to Structure-Preserving Signatures: Overview, Implementation
  and Comparison of Selected SPS Schemes'
type: bachelorsthesis
user_id: '477'
year: '2022'
...
---
_id: '31485'
author:
- first_name: Paul
  full_name: Kramer, Paul
  id: '64594'
  last_name: Kramer
citation:
  ama: Kramer P. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.;
    2022.
  apa: Kramer, P. (2022). <i>On Transforming Lattice-Based Cryptography to the Ring
    Setting</i>.
  bibtex: '@book{Kramer_2022, title={On Transforming Lattice-Based Cryptography to
    the Ring Setting}, author={Kramer, Paul}, year={2022} }'
  chicago: Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring
    Setting</i>, 2022.
  ieee: P. Kramer, <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.
    2022.
  mla: Kramer, Paul. <i>On Transforming Lattice-Based Cryptography to the Ring Setting</i>.
    2022.
  short: P. Kramer, On Transforming Lattice-Based Cryptography to the Ring Setting,
    2022.
date_created: 2022-05-28T08:07:40Z
date_updated: 2022-11-18T09:40:28Z
department:
- _id: '7'
- _id: '64'
extern: '1'
language:
- iso: eng
project:
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
  name: 'SFB 901 - C1: SFB 901 - Subproject C1'
- _id: '1'
  name: 'SFB 901: SFB 901'
status: public
title: On Transforming Lattice-Based Cryptography to the Ring Setting
type: mastersthesis
user_id: '477'
year: '2022'
...
---
_id: '34962'
author:
- first_name: A
  full_name: Anonymous, A
  last_name: Anonymous
citation:
  ama: Anonymous A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>.;
    2022.
  apa: Anonymous, A. (2022). <i>Evaluating database systems relying on secure multiparty
    computation</i>.
  bibtex: '@book{Anonymous_2022, title={Evaluating database systems relying on secure
    multiparty computation}, author={Anonymous, A}, year={2022} }'
  chicago: Anonymous, A. <i>Evaluating Database Systems Relying on Secure Multiparty
    Computation</i>, 2022.
  ieee: A. Anonymous, <i>Evaluating database systems relying on secure multiparty
    computation</i>. 2022.
  mla: Anonymous, A. <i>Evaluating Database Systems Relying on Secure Multiparty Computation</i>.
    2022.
  short: A. Anonymous, Evaluating Database Systems Relying on Secure Multiparty Computation,
    2022.
date_created: 2022-12-24T00:14:34Z
date_updated: 2023-01-10T10:31:35Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
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'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Evaluating database systems relying on secure multiparty computation
type: bachelorsthesis
user_id: '41047'
year: '2022'
...
---
_id: '34963'
author:
- first_name: A
  full_name: Anonymous, A
  last_name: Anonymous
citation:
  ama: Anonymous A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>.;
    2022.
  apa: Anonymous, A. (2022). <i>Cost of Privacy-preserving SMPC Protocols for NN-Based
    Inference</i>.
  bibtex: '@book{Anonymous_2022, title={Cost of Privacy-preserving SMPC Protocols
    for NN-Based Inference}, author={Anonymous, A}, year={2022} }'
  chicago: Anonymous, A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based
    Inference</i>, 2022.
  ieee: A. Anonymous, <i>Cost of Privacy-preserving SMPC Protocols for NN-Based Inference</i>.
    2022.
  mla: Anonymous, A. <i>Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference</i>.
    2022.
  short: A. Anonymous, Cost of Privacy-Preserving SMPC Protocols for NN-Based Inference,
    2022.
date_created: 2022-12-24T00:16:39Z
date_updated: 2023-01-10T10:31:49Z
department:
- _id: '34'
- _id: '64'
language:
- iso: eng
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'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Cost of Privacy-preserving SMPC Protocols for NN-Based Inference
type: mastersthesis
user_id: '41047'
year: '2022'
...