Score:0

Why is decryption algorithm usyally deterministic?

pt flag

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?
SAI Peregrinus avatar
si flag
Seems to mostly be a dupe of [https://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).
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.