New kind of one-round resettable zero-knowledge proofs

Abstract

There is the advantage of zero-knowledge proofs of identity without letting out any users' secret when prover and verifier are communicating.But most of existing zero-knowledge proofs are iterative in nature,and require multiple communication rounds.To solve this problem,a new protocol was proposed based on challenge-response mode and elliptic curve algorithm.The interactive process of the new scheme was analyzed in detail.The analysis shows that the scheme ensures high security and also is resettable with only one-round communication,and low computing cost.