GROUP COMMITMENT PROTOCOL BASED ON ZERO-KNOWLEDGE PROOFS

Based on the concept of zero knowledge proofs, this research note presents a group commitment protocol which can verify the members of a certain group without revealing the prover's or verifier's secret information. The proposed protocol give the commitment answer quickly. The commitment protocol is achieved successfully only if both the prover and verifier are in the same group. We show that the proposed protocol can withstand the attack on replaying the previously intercepted commitment challenges (or dialogues). Further, the problems of dynamically adding and deleting group members in the existing system are discussed.