The performance of an efficient zero-knowledge identification scheme

Abstract

Fiat and Shamir have proposed to use ZeroKnowledge interactive proofs to obtain secure identification mechanisms. Zero-Knowledge protocols are designed to address the identification service, by allowing a prover to demonstrate knowledge of a secret while revealing no information to be use by the verifier to convey the demonstration of knowledge to others. The invention of an efficient Zero-Knowledge identification scheme has provided anther public-key cryptosystem besides the renowned Fiat-Shamir scheme, for which in addition to the identification feature both key exchange and mutual identification are available. The availability of the elliptic curve discrete logarithm problem made the invented scheme very efficient. The purpose of this paper is to show the security level performance of our scheme and show its ability to resist the brute-force attack of an unauthorized prover.