Score:2

Encrypting random coins used for the encryption itself

ru flag

Circular security notions for PKE schemes capture the security of (PKE) schemes when encrypting the secret decryption key.

Is there an analogous notion but for encrypting the randomness used for the encryption? i.e. what if one first fixes the random coins $r$ to be used for for the encryption, and then computes the ciphertext for this $r$: $c := E_{pk}(m; r)$, with $m = r$?

SEJPM avatar
us flag
The closest thing I'm aware of to what you seem to be looking for is [this paper](https://eprint.iacr.org/2019/624) though that one's for symmetric encryption and the related notion of the message and the nonce having some relation.
guilhermemtr avatar
ru flag
Thanks for the link!
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.