Questions tagged [non-interactiveness]
The non-interactiveness tag has no usage guidance.
9 questions
0
votes
0
answers
50
views
Showing the zero-knowledge property in a NI-ZK scheme
To my understanding, whilst the definition of zero-knowledge (zk) is the same in the non-interactive context, how one shows a non-interactive scheme is zk is very different from interactive zk ...
1
vote
1
answer
77
views
Is it possible to forge valid proofs in this Schnorr signature-based ZKP system for proving knowledge about discrete logarithms?
I am currently reading the paper "A 2-round anonymous veto protocol" and have run into some trouble verifying the claims made about the zero knowledge proofs presented within. My knowledge ...
0
votes
1
answer
114
views
Threshold encryption
Is there any (k,n)-threshold encryption scheme, such that the decryption process is non-interactive, i.e., the decryption can be processed "in a line" where each party "in the middle of ...
2
votes
1
answer
115
views
What security problem would cause if I reuse a NIZK proof?
Some statements are expensive to prove. If I need to make a proof for such kind of statement repeatedly (generate new proof $\pi$ for each new verifier), I think it might be a waste of time (as well ...
2
votes
1
answer
221
views
Real-world instantiation of NIZK protocol from Fiat-Shamir
So I understand how one can use Fiat-Shamir to turn a HVZK sigma protocol into a non-interactive zk protocol in the random oracle model. My problem though is I don't understand why is this useful.
If ...
1
vote
0
answers
66
views
About SNARKs general recipes (regarding required assumptions)
I'm following ZK MOOC: https://zk-learning.org/
After some previous readings about these topics, I was believing to have understood that, stated that non-interactivity isn't attainable in standard/...
2
votes
1
answer
173
views
Zero knowledge proof for GCD
Let A(x) and B(x) be two secret polynomials. Suppose a user publishes commitments $C_A$ and $C_B$ to these polynomials (such that the lengths of $C_A$ and $C_B$ are sublinear in the degree of $A(x)$ ...
1
vote
0
answers
37
views
How does Diogenes prove equivalence of discreet logs despite the candidates not being composed of safe primes
In the paper describing a protocol for distributed RSA modulus generation, Diogenes, "[they] employ a special-purpose $\Sigma$-protocol based on [Sho00] for proving correctness of exponentiations ...
1
vote
1
answer
323
views
Schnorr based ZK scheme
TL;DR: This ABSOLUTELY does not work and presents a huge security risk. Posting it anyways in case there are other threats I missed or to dissuade any other person who comes up with this idea.
Hi! I’m ...