Questions tagged [zero-knowledge-proofs]
Zero-knowledge proofs are an interactive method for one party to prove to another that a statement is true, without revealing anything other than the veracity of the statement.
1,194 questions
4 votes
0 answers
93 views
Hash function with lightweight ZKP of a preimage
For a standard hash function $H$ like SHA-256, one can choose a secret message $M$, compute and publish $h=H(M)$, then prove knowledge of the preimage $M$ in zero knowledge [that is without disclosing ...
- 151k
3 votes
1 answer
430 views
In Schnorr's protocol, why the form of response is `z=r+cx` instead of `z=cr+x`?
"In the third step of the Schnorr protocol, the prover's response takes the form $z=r+cx$. Why can't this form $z=cr+x$ work? I found these answers 1 and 2 are related to my questions However, ...
- 55
1 vote
0 answers
80 views
Is the following scheme in zero knowledge?
I have a zero knowledge proof scheme for a blockchain and I don't know if it's truly in zero knowledge. It goes like this; I have two arrays of homomorphically encrypted values. I use homomorphic ...
- 385
2 votes
0 answers
79 views
Twist and Shout
In the paper Twist and Shout, page 22, there is a reduction: from what I understand, because the following equation holds: $\mathsf{Val(k,j)} = \sum\limits_{j'<j}\mathsf{Inc}(k,j')\cdot \mathsf{LT}...
- 21
1 vote
0 answers
49 views
Are there lattice-based or post-quantum secure constructions of updatable SNARKs?
Updatable SNARKs allow anyone to update the structured reference string (SRS), providing security as long as at least one party in the update chain is honest. However, all current known constructions ...
- 11
0 votes
1 answer
143 views
Is Sigma protocol a proof of knowledge or an argument？
As far as I know, the difference between proof system and argument system is whether the adversary is computationally unbounded. My question is, in the definition of special soundness in Sigma ...
- 135
0 votes
0 answers
44 views
Check equality of range proof subject
The prover has a secret scalar $s$, that needs to be encrypted for a receiver. But we also want to publicly verify that the secret is within a range (< 256). One scheme could be (quite possible ...
- 131
1 vote
2 answers
888 views
Looking for a distributed system where two people can prove they know the same secret
I'm new to learning about cryptography. I'd like to build a system for two people to reveal they know the same secret data, without revealing the secret to each other, or to anyone else. The idea is ...
- 11