Information-Theoretic Security

A encryption method is secure if for every message M and every cipher C the following holds:

Pr(X=M|Y=C) = Pr(X=M)

This basically says, it is impossible to make conclusions about the message on the basis of knowing the cipher text.