Secure implementation of identification systems

In this paper we demonstrate that widely known identification systems, such as the public-file-based Feige-Fiat-Shamir scheme, can be insecure if proper care is not taken with their implementation. We suggest possible solutions. On the other hand, identity-based versions of the Feige-Fiat-Shamir scheme are conceptually more complicated than necessary.

[1]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[2]  Jerome H. Saltzer,et al.  On digital signatures , 1978, OPSR.

[3]  Gilles Brassard,et al.  How to Improve Signature Schemes , 1990, EUROCRYPT.

[4]  J. Conway.  On Numbers and Games , 1976 .

[5]  Y. Desmedt,et al.  Remarks on soundness of proofs (zero-knowledge schemes) , 1989 .

[6]  Amos Fiat,et al.  Zero Knowledge Proofs of Identity , 1987, STOC.

[7]  Jan van Leeuwen,et al.  Fast Simulation of Turing Machines by Random Access Machines , 1988, SIAM J. Comput..

[8]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[9]  J. Levine,et al.  The Hill cryptographic system with unknown cipher alphabet but known plaintext , 1984 .

[10]  Yvo Desmedt,et al.  Identification Tokens - or: Solving the Chess Grandmaster Problem , 1990, CRYPTO.

[11]  Samy Bengio,et al.  Special Uses and Abuses of the Fiat-Shamir Passport Protocol , 1987, CRYPTO.

[12]  Gustavus J. Simmons,et al.  The Prisoners' Problem and the Subliminal Channel , 1983, CRYPTO.

[13]  Philip Babcock Gove,et al.  Webster's third new international dictionary of the English language, unabridged, with seven language dictionary , 1971 .

[14]  Butler W. Lampson,et al.  A note on the confinement problem , 1973, CACM.

[15]  P. D. Merillat.  Secure stand alone positive personnel identity verification system (SSA-PPIV) , 1979 .

[16]  Amos Fiat,et al.  Zero-knowledge proofs of identity , 1987, Journal of Cryptology.

[17]  Silvio Micali,et al.  A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..

[18]  Yvo Desmedt,et al.  Public-Key Systems Based on the Difficulty of Tampering (Is There a Difference Between DES and RSA?) , 1986, CRYPTO.

[19]  M. Rabin.  DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .

[20]  Gustavus J. Simmons,et al.  A System for Verifying User Identity and Authorization at the Point-of Sale or Access , 1984, Cryptologia.