Zero-Knowledge Proofs and Accumulators Using Kryptography and Crypto Pairings
We give away too much of our private information. In most cases when we log into a system we have to reveal our password to the system. If someone is listening to the communications, they could reveal our password. So why can’t we just prove that we know something, without revealing it? Well, Zero-Knowledge Proofs (ZKPs) aim to do that. In this case, we will look at an accumulator method using Bilinear Maps, as first proposed by Lan Nyugen [1] [here]:
An accumulator allows Bob to add values onto a fixed-length digest, and to provide proof of the values added, without revealing them within the accumulated value. In this case, we will add a message onto an accumulator for a given message, and then we will remove it to show that the accumulator goes back to its original state. In this was Bob can prove that he knows something without actually revealing it to Alice, and where Bob can provide proof to it. In this case, we will use the Kyptography library from Coinbase, and add a message onto an accumulator, to prove that we know the message without actually revealing it. After we generate the proof, we will remove the message from the accumulator, and…
