A General Zero-Knowledge Scheme

Authors:
Mike Burmester;Yvo G. Desmedt;Fred Piper;Michael Walker
Affiliations:
Information Security Group, Royal Holloway – University of London, Egham, TW20 OEX, U.K.;Department of Electrical Engineering and Computer Science, University of Wisconsin – Milwaukee, P.O. Box 784, WI 53201 Milwaukee, U.S.A.;Information Security Group, Royal Holloway – University of London, Egham, TW20 OEX, U.K.;Vodafone Ltd, 2 - 4 London Road, Newbury, Berks RG13 1JL, U.K.
Venue:
Designs, Codes and Cryptography
Year:
1997

Citing 18
Cited 1

Trading group theory for randomness

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The complexity of perfect zero-knowledge

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
Demonstrating possession of a discrete logarithm without revealing it

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
Subliminal-free authentication and signature

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

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Zero-knowledge proofs of identity

Journal of Cryptology
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Perfect zero-knowledge in constant rounds

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A general zero-knowledge scheme

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Sorting out zero-knowledge

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Efficient zero-knowledge identification schemes for smart cards

The Computer Journal - Special issue on safety and security parallel computation
An almost-constant round interactive zero-knowledge proof

Information Processing Letters
Direct Minimum-Knowledge Computations

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
On Defining Proofs of Knowledge

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology

On the Security of Beth's Identification Schemes against Active and Concurrent Adversaries

Mathematical Methods in Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

There is a great similarity between the zero-knowledgeproof of quadratic residuocity presented by Goldwasser-Micali-Rackoffand the graph isomorphism proof presented by Goldreich-Micali-Wigderson.There is also a resemblance between the zero-knowledge proofsof Fiat-Shamir, Chaum-Evertse-van de Graaf, Beth and Guillou-Quisquater.A similar observation holds for zero-knowledge proofs based onencryption: the 3-colourability proofs and the Hamiltonian-circuitproofs of Blum and Goldreich-Micali-Wigderson, and the Brassard-Chaum-Crepeauproof for SAT. Feige, Fiat and Shamir introduced the conceptof zero-knowledge proofs of knowledge. In this paper we presenta general zero-knowledge scheme which unifies all these Arthur-Merlinproofs.