Blockchain Papers

Follow blockchain research across journals, conferences, and preprint repositories.

123 papersLast indexed Aug 31, 2026
Search papers

Paper index

123 results · page 6 of 6

Clear filters
Jan 1, 1991·Theoretical Computer Science
56 cites
Constant-round perfect zero-knowledge computationally convincing protocols

Gilles Brassard, Claude Crépeau, Moti Yung

A perfect zero-knowledge interactive protocol allows a prover to convince a verifier of the validity of a statement in a way that does not give the verifier any additional information [GMR,GMW]. Such protocols take place by the exchange of messages back and forth between the prover and the verifier. An important measure of efficiency for these protocols is the number of rounds in the interaction. In previously known perfect zero-knowledge protocols for statements concerning NP--complete problems [BCC], at least k rounds were necessary in order to prevent one party from having a probability of undetected cheating greater than 2 \\Gammak . In this paper, we give the first perfect zero-knowledge protocol that offers arbitrarily high security for any statement in NP with a constant number of rounds. The protocol is computationally convincing (rather than statistically convincing as would have been an interactive proof--system in the sense of Goldwasser, Micali and Rackoff) because the ver...

2 source records
Cryptography and Data Security
Complexity and Algorithms in Graphs
Logic, Reasoning, and Knowledge
Original source
Jan 1, 1990·TUbilio (Technical University of Darmstadt)
0 cites
Zur Theorie der Zero Knowledge Proofs

Wellner, Ingrid

No abstract is available for this record.

Hermeneutics and Narrative Identity
Aging, Elder Care, and Social Issues
Health, Medicine and Society
Original source