Open donkey-donkey opened 10 months ago
Is this what you're looking for https://github.com/mikelodder7/paillier-rs/blob/main/src/proof_psf.rs
i dont think so. im thinking more like zk proofs of correct formation of cyphertext and zk proofs of values in range...
I don't have it in this code but can add it.
Here's an example of the math for it
that would be super rad! also looking for a way to use a zk proof to prove that a plaintext number was encrypted to 2 different public keys. and of course proving that zero was encrypted.
There are these zk proofs at https://github.com/ZenGo-X/zk-paillier They have a non interactive range proof and proof of encrypting zero in there, but they use a different big number solution.
I would definitely be interested in the above proofs.
I would definitely be interested in the above proofs.
do you know how to do them? what is needed?
Yes I do. It's just a matter of priorities and time
Hi, are there any examples of using zero knowledge proofs with the paillier-rs?