Johannes T.A. Bressers
No abstract is available for this record.
Follow blockchain research across journals, conferences, and preprint repositories.
123 results · page 6 of 6
Johannes T.A. Bressers
No abstract is available for this record.
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...
Wellner, Ingrid
No abstract is available for this record.