论文信息 - Divertible Zero-Knowledge Proof of Polynominal Relations and Blind Group Signature

Divertible Zero-Knowledge Proof of Polynominal Relations and Blind Group Signature

A divertible protocol is a protocol between three parties in which one party is able to divert another party's proof of some facts to prove some other facts to the other party. This paper presents a divertible protocol to prove multi-variant polynomial relations. Its direct application to blind group signature is also shown.

Yi Mu | Vijay Varadharajan | Khanh Quoc Nguyen

[1] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.

[2] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[3] Ivan Damgård,et al. Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? , 1998, CRYPTO.

[4] Tatsuaki Okamoto,et al. Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes , 1992, CRYPTO.

[5] Kazuo Ohta,et al. Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash , 1989, CRYPTO.

[6] David Chaum,et al. Group Signatures , 1991, EUROCRYPT.

[7] Tatsuaki Okamoto,et al. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.

[8] Jan Camenisch,et al. Efficient and Generalized Group Signatures , 1997, EUROCRYPT.

[9] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[10] Lidong Chen,et al. New Group Signature Schemes (Extended Abstract) , 1994, EUROCRYPT.

[11] Samy Bengio,et al. Special Uses and Abuses of the Fiat-Shamir Passport Protocol , 1987, CRYPTO.

[12] David Chaum,et al. Wallet Databases with Observers , 1992, CRYPTO.

[13] Gustavus J. Simmons,et al. The Prisoners' Problem and the Subliminal Channel , 1983, CRYPTO.