Abstract
The security bounds we will define and discuss in this paper is an universal security measure for parallel versions of identification protocols. From this bound we can judge which of the security measures defined in [FFS],[FeS],[OO] are satisfied. The bounds are controllable in the sense that they are connected with a security parameter. When the bound is a “sharp-threshold” security bound, it is tight enough to describe the security of the protocol precisely. Using this bound, we discuss the generalized Fiat-Shamir identification scheme ID(L,k,t,n) which is defined in [CDL]. Under the assumption that there is no polynomial time algorithm of factoring, the parallel version of the scheme is secure in the sense that even cheating verifier B can get some information from the interacting with the prover, the information he get is absolutely useless for cheating.
Chapter PDF
References
E.F. Brickell, K.S. McCurley “An Interactive Identification Scheme Based on Discrete Logarithms and Factoring” The oringinal one is from Proc. of EUROCRYPT’90 pp 63–71. Here we refer to a new version of it.
L. Chen, I. Damgård, P. Landrock “Extension and Analysis of Fiat-Shamir Identification Scheme” to appear.
U. Feige, A. Fiat and A. Shamir “Zero-Knowledge Proofs of Identity” Journal Cryptology 1(2), 1988
U. feige, A. Shamir “Witness Indistinguishable and Witness Hiding Protocols” Proc. of the 22nd ACM Symposium on Theory of Computing pp416–424
K. Ohta and T. Okamoto “A Modification of the Fiat Shamir Scheme” Proc. of CRYPTO’88 pp 232–243.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, L., Damgård, I. (1993). Security Bounds for Parallel Versions of Identification Protocols. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_40
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive