Minimum resource zero-knowledge proofs

14Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

Abstract

What are the resources of a zero-knowledge Proof? Interaction, communication, and en- velops. That interaction, that is the number of rounds of a protocol, is a resource is clear. Actually, it is not a very available one: having someone on the line to answer your questions all the time is quite a luxury. Thus, minimizing the number of rounds in zero-knowledge proofs will make these proofs much more attractive from a practical standpoint. That communication, that is the number of bits exchanged in a protocol, is a resource is also immediately clear. Perhaps, what is less clear is why envelopes are a resource. Let us explain why this is the case.

Cited by Powered by Scopus

Commitments and efficient zero-knowledge proofs from learning parity with noise

89Citations
N/AReaders
Get full text

Perfect NIZK with adaptive soundness

66Citations
N/AReaders
Get full text

Efficient zero-knowledge proofs for commitments from learning with errors over rings

46Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Kilian, J., Micali, S., & Ostrovsky, R. (1990). Minimum resource zero-knowledge proofs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 435 LNCS, pp. 545–546). Springer Verlag. https://doi.org/10.1007/0-387-34805-0_47

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 10

67%

Researcher 3

20%

Professor / Associate Prof. 2

13%

Readers' Discipline

Tooltip

Computer Science 15

88%

Physics and Astronomy 1

6%

Engineering 1

6%

Save time finding and organizing research with Mendeley

Sign up for free