In the decryption step in helios, why do we need Chaum-Pedersen to prove that a certain plaintext $m$ corresponds to a given ciphertext $c$? Why can we just encrypt $m$ and see if it's equal to $c$?

  • 1
    $\begingroup$ How exactly you know the randomness r that was used for generating c? $\endgroup$ – pintor Feb 6 at 10:24
  • $\begingroup$ Some plaintext can generate different ciphertexts. It is about IND-CPA? $\endgroup$ – mip Feb 6 at 10:33

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.