Question: Computer Security Questions: Proof Perfect Secrecy Let us assume CT and PT are discrete random variables which can take values from the domain of ciphertext
Computer Security Questions: Proof Perfect Secrecy

Let us assume CT and PT are discrete random variables which can take values from the domain of ciphertext and plaintext, respectively. Let us also assume that C and M are arbitrary elements from the ciphertext and plaintext domains, respectively. Prove that for any cipher that offers perfect secrecy, it satisfies: Pr[CT = C | PT = M] = Pr[CT = C]
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
