On the Amortized Complexity of Zero-Knowledge Protocols

Download Now
Provided by: International Association for Cryptologic Research
Topic: Security
Format: PDF
In a zero-knowledge protocol, a prover tries to convince a skeptical verifier that a certain statement is true. Except with a small error probability, the verifier should be convinced if and only the statement is indeed true, but should learn nothing beyond the validity of the assertion. The statement can take the form of claiming that the input string x is in a given language L (interactive proofs) or claiming that the prover knows a \"Witness\" w such that (x, w) is in some given relation R (interactive proofs of knowledge).
Download Now

Find By Topic