Perfect Secrecy

• Cryptosystem has perfect secrecy if

Prob (plaintext | ciphertext) = Prob(plaintext)

I.e., a posteriori probability of plaintext, given that the ciphertext is observed is identical to the a priori probability of plaintext.

Previous slide

Next slide

Back to first slide

View graphic version