AN INTERACTIVE ZERO-KNOWLEDGE PROOF BASED PROTOCOL OF IDENTIFICATION AND DIGITAL SIGNATURE

An interactive zero-knowledge proof based protocol of identification and digital signature is proposed in this paper. The security of protocol is based on large number factorization and security of RSA problems. This protocol can be applied to smart cards. This scheme requires minimal amount of computation and communications information. Compared with Nyang’s scheme, the scheme is more likely to win higher security. The k , which is the cycle number in order to achieve zero-knowledge, is smaller than Nyang’s. On one cycle, the highest security degree, which the protocol can achieve, is independent of the user’s identity. The protocol is versatile enough to be applied to digital signature, multiple digital signature, and （N, T） threshold digital signature.