We have 2 ciphertexts, one encrypted using Paillier and another encrypted under Elgamal encryption schemes. Is there a way to design ZK-proof to prove equality of the underlying plaintexts of these 2 ciphertexts.

  • $\begingroup$ I'd say this is quite straightforward via generic proof systems if the encryption protocols can be easily represented as arithmetic circuits over the same field, which is not the case here. $\endgroup$
    – Lev
    Apr 25 at 23:19


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.