I'm aware that Zero-Knowledge for Diffie-Hellman Tuples requires 4 rounds. I wondered if there is any non-interactive version of it.
$\begingroup$
$\endgroup$
Add a comment
|
$\begingroup$
$\endgroup$
Usually, non-interactive ZK proofs are achieved by using a technique to transform an interactive proof into a non-interactive. For example you can use a common reference string or the Fiat-Shamir heuristic. If you assume pairings, then you can also use the techniques used in Groth-Sahai proofs, but I guess that doesn't apply to Diffie-Hellman tuples.
