2022 Developer Survey is open! Take survey.

New answers tagged

0 votes
Accepted

Schnorr based ZK scheme

Consider an equivalent variant of a regular Schnorr signature that signs a message $m$. I'm assuming $s$ is a sufficiently high-entropy secret, and so that therefore $S$ cannot be brute forced. The ...
user avatar
  • 2,613
0 votes

Is Schnorr's digital signature a non-interactive zero-knowledge proof?

The proof is better done other way round – from NIZK to Schnorr Digital signature. It goes like this. Fiat-Shamir NIZK Heuristic requires the Prover to use a hash of transcript/timestamp/last-message ...
user avatar
1 vote

Σ-protocol that proves an even number was committed using Pedersen commitment scheme

A standard Pedersen commitment range proof will demonstrate that $y$ is constructed from the addition of a series of powers of 2. All you have to do is slightly modify the range proof so that you do ...
user avatar
  • 2,613
0 votes

Range proof for elgamal ciphertext

If your method of mapping your value $b$ to a group element is $g^b$, then creating a range proof for an El Gamal encryption is exactly the same as creating a range proof for a Pedersen commitment. ...
user avatar
  • 2,613
0 votes

Zero knowledge proof for verifying a machine learning model

I am almost two years late to this, but I think this is what you are looking for: https://dl.acm.org/doi/10.1145/3411501.3418608 (Zero-Knowledge Proofs for Machine Learning)
user avatar
1 vote

Zero Knowledge proof of correct ElGamal encryption

The proof doesn't work (even if you fix it up by having the prover initially send $R_1, R_2$, rather than $q_1, q_2$, which you likely intended); the holder of the private key can generate a valid ...
user avatar
  • 131k

Top 50 recent answers are included