0
$\begingroup$

For security against Chosen Plaintext Attack (CPA), we need randomized algorithms for encryption. But in some schemes (maybe almost all of them) take decryption algorithm deterministic. This procedure occurs in functional encryption, that its security definitions are more complicated than ordinary public encryption, too. This is a little confusing.

  1. Is using a deterministic algorithm for decryption equivalent to using a randomized algorithm? How?
  2. Which one give us more security?
  3. Why do we use deterministic algorithms for decryption when randomized algorithms have more merits? Are deterministic algorithms more efficient for decryption in the trade-off between security and efficiency?
  4. Are these situations for functional encryption too? i.e., in functional encryption, like ordinary public key encryption, we tend to use deterministic algorithms for decryption?
Improve this question
$\endgroup$
1
  • 2
    $\begingroup$ Seems to mostly be a dupe of [crypto.stackexchange.com/questions/87232/](this). Randomized decryption breaks the ability to reliably receive messages. "Secure" systems try to ensure confidentiality, availability, and integrity of messages. Randomizing decryption breaks the integrity property, and is thus insecure (and something to be avoided). $\endgroup$
    – SAI Peregrinus
    Jun 18 at 1:18

0

Reset to default

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.