Zero-Knowledge Proofs. J.W. Pope M.S. – Mathematics May 2004. What is a Zero- Knowledge Proof?. A zero-knowledge proof is a way that a “prover” can prove possession of a certain piece of information to a “verifier” without revealing it.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
M.S. – Mathematics
A zero-knowledge proof is a way that a “prover” can prove possession of a certain piece of information to a “verifier” without revealing it.
This is done by manipulating data provided by the verifier in a way that would be impossible without the secret information in question.
A third party, reviewing the transcript created, cannot be convinced that either prover or verifier knows the secret.
Unconditionally binding blobs
Computationally concealing blobs
Computationally binding blobs
Unconditionally concealing blobsProof vs. Argument