1
$\begingroup$

I'm aware that Zero-Knowledge for Diffie-Hellman Tuples requires 4 rounds. I wondered if there is any non-interactive version of it.

$\endgroup$
2
$\begingroup$

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.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.