Anja Lehmann

Anja Lehmann

Auto-generated profile, based on publicly available information

Anja Lehmann

Hasso-Plattner-Institute, University of Potsdam, Potsdam, Germany

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 January 2012
Verified
Book Chapter
Open access
PDF file
MFMarc Fischlin
Marc Fischlin
ALAnja Lehmann
Anja Lehmann
DSDominique Schröder
Dominique Schröder
Aggregation schemes allow to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion of unforgeability is preserved. Recently, Eikemeier et al. (SCN 2010) considered the notion of history-free sequential aggregation for message authentication codes, where the sequentially-executed aggregation algorithm does not need to receive the previous messages in the sequence as input. Here we discuss the idea for signatures where the new aggregate does not rely on the previous messages and public keys either, thus inhibiting the costly verifications in each aggregation step as in previous schemes by Lysyanskaya et al. (Eurocrypt 2004) and Neven (Eurocrypt 2008). Analogously to MACs we argue about new security definitions for such schemes and compare them to previous notions for history-dependent schemes. We finally give a construction based on the BLS signature scheme which satisfies our notion.

28 April 2025
Verified
Book Chapter
Closed access
PDF file
ALAnja Lehmann
Anja Lehmann
PNPhillip Nazarian
Phillip Nazarian
CÖCavit Özbay
Cavit Özbay

29 June 2022 in Journal of Data and Information Quality
Verified
Journal Article
Open access
PHPhilipp Hacker
Philipp Hacker
FNFelix Naumann
Felix Naumann
TFTobias Friedrich
Tobias Friedrich
SGStefan Grundmann
Stefan Grundmann
ALAnja Lehmann
Anja Lehmann
HZHerbert Zech
Herbert Zech
This vision article outlines the main building blocks of what we term AI Compliance , an effort to bridge two complementary research areas: computer science and the law. Such research has the goal to model, measure, and affect the quality of AI artifacts, such as data, models, and applications, to then facilitate adherence to legal standards.

1 October 2023 in Proceedings on Privacy Enhancing Technologies
Verified
Journal Article
Open access
PDF file
MKMaximilian Kroschewski
Maximilian Kroschewski
ALAnja Lehmann
Anja Lehmann
OpenID Connect (OIDC) is a Single Sign-On (SSO) protocol that allows users to authenticate to various Relying Parties (RPs) via an Identity Provider (IdP). The main drawback of SSO is its lack of privacy, as the IdP learns the RP’s identity at each user’s login. OIDC supports several protocol flows, of which only one, the Implicit Flow, gives hope for any privacy, as it does not require direct communication between the IdP and RP. This design was initially intended for RPs with technical limitations that prevent them from storing credentials and thus authenticating to the IdP. However, RP authentication is crucial to ensure that users only access properly registered RPs. As a result, the Implicit Flow is being discussed to be excluded from the OAuth specification on which OIDC is based. This paper demonstrates a privacy-preserving approach incorporating RP authentication into the Implicit Flow. The IdP can restrict its service to authenticated RPs and tie each authentication token to a specific user and RP without acquiring knowledge of which user is accessing which RP. We formally define the desired security and privacy properties of such an authenticated Implicit Flow, propose a provably secure construction from generic building blocks, and report on an implementation of our scheme