Research note: Group commitment protocol based on zero knowledge proofs

Authors:
Tzong-Chen Wu;Tzong-Sun Wu
Affiliations:
Department of Information Management, National Taiwan Institute of Technology, Taipei, Taiwan 107, ROC;Department of Information Management, National Taiwan Institute of Technology, Taipei, Taiwan 107, ROC
Venue:
Computer Communications
Year:
1995

Citing 7
Cited 1

Zero knowledge proofs of identity

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Zero-knowledge proofs of identity and veracity of transaction receipts

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Efficient zero-knowledge identification schemes for smart cards

The Computer Journal - Special issue on safety and security parallel computation
Efficient Identification Schemes Using Two Prover Interactive Proofs

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Research note: Remote password authentication scheme based on cross-product

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

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.