Score:0

Indistinguishability proof of an encryption scheme

in flag

Is there any indistinguishability proof (e.g., IND-CPA, IND-CCA, IND-CCA1, IND-CCA2, IND-CKA) based on games that involve breaking the AES security? Usually the proof involve breaking hard problems like DL, CDH, DDH, BDH.

cn flag
Sure, instantiate any PRP/blockcipher based encryption scheme with AES and look at the proof. AES-CBC, AES-CTR, AES-GCM.
Rabindra Moirangthem avatar
in flag
Could you please provide some links or papers. I want to check the security analysis of the encryption scheme where the security proof involve breaking the AES algo as in if an adversary can break our scheme, then an algo C (Challenger) can break the AES security.
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.