1
$\begingroup$

How can I provide a non interactive proof using the Fiat Shamir method for the valid reencryption of a simple mixnet?

$\endgroup$
  • 1
    $\begingroup$ With "Fiat Shamir", did you mean a proof systems with quadratic residues and RSA modulus? What kind of ciphertext is there with this mixnet? What would google return on a basic "mixnet re-encryption proof" query? Welcome to stackexchange. Some homework is expected. $\endgroup$ – Vadym Fedyukovych Jan 14 '17 at 21:13

Your Answer

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

Browse other questions tagged or ask your own question.