A General Zero-Knowledge Scheme |
| |
| Authors: | Mike Burmester Yvo G. Desmedt Fred Piper Michael Walker |
| |
| Affiliation: | (1) Information Security Group, Royal Holloway – University of London, Egham, TW20 OEX, U.K;(2) Department of Electrical Engineering and Computer Science, University of Wisconsin – Milwaukee, P.O. Box 784, WI, 53201 Milwaukee, U.S.A;(3) Vodafone Ltd, 2 - 4 London Road, Newbury, Berks, RG13 1JL, U.K |
| |
| Abstract: | ![]()
There is a great similarity between the zero-knowledge proof of quadratic residuocity presented by Goldwasser-Micali-Rackoff and the graph isomorphism proof presented by Goldreich-Micali-Wigderson. There is also a resemblance between the zero-knowledge proofs of Fiat-Shamir, Chaum-Evertse-van de Graaf, Beth and Guillou-Quisquater. A similar observation holds for zero-knowledge proofs based on encryption: the 3-colourability proofs and the Hamiltonian-circuit proofs of Blum and Goldreich-Micali-Wigderson, and the Brassard-Chaum-Crepeau proof for SAT. Feige, Fiat and Shamir introduced the concept of zero-knowledge proofs of knowledge. In this paper we present a general zero-knowledge scheme which unifies all these Arthur-Merlin proofs. |
| |
| Keywords: | Combinatorics Complexity Theory Cryptography Discrete mathematics Zero-knowledge |
| 本文献已被 SpringerLink 等数据库收录！ |
|
