Balthazar Bauer

Balthazar Bauer

Auto-generated profile, based on publicly available information

Balthazar Bauer

UVSQ

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 November 2023
Verified
Conference Paper
Open access
OMOmid Mir
Omid Mir
BBBalthazar Bauer
Balthazar Bauer
SGScott Griffy
Scott Griffy
ALAnna Lysyanskaya
Anna Lysyanskaya
DSDaniel Slamanig
Daniel Slamanig
Anonymous credentials (AC) offer privacy in user-centric identity management. They enable users to authenticate anonymously, revealing only necessary attributes. With the rise of decentralized systems like self-sovereign identity, the demand for efficient AC systems in a decentralized setting has grown. Relying on conventional AC systems, however, require users to present independent credentials when obtaining them from different issuers, leading to increased complexity. AC systems should ideally support being multi-authority for efficient presentation of multiple credentials from various issuers. Another vital property is issuer hiding, ensuring that the issuer's identity remains concealed, revealing only compliance with the verifier's policy. This prevents unique identification based on the sole combination of credential issuers. To date, there exists no AC scheme satisfying both properties simultaneously. This paper introduces Issuer-Hiding Multi-Authority Anonymous Credentials (IhMA), utilizing two novel signature primitives: Aggregate Signatures with Randomizable Tags and Public Keys and Aggregate Mercurial Signatures. We provide two constructions of IhMA with different trade-offs based on these primitives and believe that they will have applications beyond IhMA. Besides defining the notations and rigorous security definitions for our primitives, we provide provably secure and efficient constructions, and present benchmarks to showcase practical efficiency.

1 December 2021
Verified
Book Chapter
Closed access
PDF file
BBBalthazar Bauer
Balthazar Bauer
GFGeorg Fuchsbauer
Georg Fuchsbauer
APAntoine Plouviez
Antoine Plouviez

1 July 2023 in Proceedings on Privacy Enhancing Technologies
Verified
Journal Article
Open access
PDF file
OMOmid Mir
Omid Mir
DSDaniel Slamanig
Daniel Slamanig
BBBalthazar Bauer
Balthazar Bauer
RMRené Mayrhofer
René Mayrhofer
Anonymous credentials (ACs) systems are a powerful cryptographic tool for privacy-preserving applications and provide strong user privacy guarantees for authentication and access control. ACs allow users to prove possession of attributes encoded in a credential without revealing any information beyond them. A delegatable AC (DAC) system is an enhanced AC system that allows the owners of credentials to delegate the obtained credential to other users. This allows to model hierarchies as usually encountered within public-key infrastructures (PKIs). DACs also provide stronger privacy guarantees than traditional AC systems since the identities of issuers and delegators can also be hidden. In this paper we present a novel DAC scheme that supports attributes, provides anonymity for delegations, allows the delegators to restrict further delegations, and also comes with an efficient construction. Our approach builds on a new primitive that we call structure-preserving signatures on equivalence classes on updatable commitments (SPSEQ-UC). The high-level idea is to use a special signature scheme that can sign vectors of set commitments, where signatures can be extended by additional set commitments. Signatures additionally include a user's public key, which can be switched. This allows us to efficiently realize delegation in the DAC. Similar to conventional SPSEQ, the signatures and messages can be publicly randomized and thus allow unlinkable delegation and showings in the DAC system. We present further optimizations such as cross-set commitment aggregation that, in combination, enable efficient selective showing of attributes in the DAC without using costly zero-knowledge proofs. We present an efficient instantiation that is proven to be secure in the generic group model and finally demonstrate the practical efficiency of our DAC by presenting performance benchmarks based on an implementation.

1 May 2021
Verified
Book Chapter
Closed access
PDF file
BBBalthazar Bauer
Balthazar Bauer
GFGeorg Fuchsbauer
Georg Fuchsbauer
CQChen Qian
Chen Qian

7 September 2020
Verified
Book Chapter
Closed access
PDF file
BBBalthazar Bauer
Balthazar Bauer
GFGeorg Fuchsbauer
Georg Fuchsbauer

11 December 2024
Verified
Book Chapter
Closed access
PDF file
BBBalthazar Bauer
Balthazar Bauer
GFGeorg Fuchsbauer
Georg Fuchsbauer
FRFabian Regen
Fabian Regen