A general zero-knowledge scheme

12Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

There is a great similarity between the Fiat-Shamir zero-knowledge scheme [8], the Chaum-Evertse-van de Graaf [4], the Beth [1] and the Guillou-Quisquater [12] schemes. The Feige-Fiat-Shamir [7] and the Desmedt [6] proofs of knowledge also look alike. This suggests that a generalization is overdue. We present a general zero-knowledge proof which encompasses all these schemes.

Cite

CITATION STYLE

APA

Burmester, M. V. D., Piper, F., Desmedt, Y., & Walker, M. (1990). A general zero-knowledge scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 434 LNCS, pp. 122–133). Springer Verlag. https://doi.org/10.1007/3-540-46885-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free