Crescenzo, 2008

Type	Article
Title	On the Security of Beth’s Identification Schemes against Active and Concurrent Adversaries
Authors	Crescenzo, G.
Year	2008
Harvard	Crescenzo, G., 2008, On the Security of Beth’s Identification Schemes against Active and Concurrent Adversaries in Calmet et al., 2008
IDs	DOI: 10.1007/978-3-540-89994-5_1 Corpus ID: 40011424
Links	https://www.semanticscholar.org/paper/On-the-Security-of-Beth's-Identification-Schemes-Crescenzo/3477d8e58fbb46b748233b81e587024dda535321

Abstract

One of the earliest identification schemes was proposed by Beth in [6]. Since its introduction, variations and generalizations of this scheme have been considered, and, recently, the property of security against passive impersonation was shown, under a weak unforgeability assumption on the hashed El Gamal signature scheme, for two such variants: one in the standard (i.e., not identity-based) and one in the identity-based model. However, the security of both protocols under active and concurrent impersonation attacks was left open.
In this paper we prove that very minor modifications to these schemes result in schemes that satisfy security under active and concurrent impersonation attacks, assuming a one-more-dlog assumption. The resulting protocols are just as efficient as the original variants, which are, in turn, somewhat more efficient (but less general) of the original one proposed by Beth.

(Crescenzo, 2008, p. 1)