Semantic Security
In cryptography, a cryptosystem is semantically secure if any probabilistic, polynomial-time algorithm (PPTA) that is given the ciphertext of a certain message (taken from any distribution of messages), and the message's length, cannot determine any partial information on the message with probability non-negligibly higher than all other PPTA's that only have access to the message length (and not the ciphertext). In other words, knowledge of the ciphertext (and length) of some unknown message does not reveal any additional information on the message that can be feasibly extracted. This concept is the computational complexity analogue to Shannon's concept of perfect secrecy. Perfect secrecy means that the ciphertext reveals no information at all about the plaintext, whereas semantic security implies that any information revealed cannot be feasibly extracted.
Read more about Semantic Security: History, Private-key Cryptography, Public-key Cryptography
Famous quotes containing the words semantic and/or security:
“Watt’s need of semantic succour was at times so great that he would set to trying names on things, and on himself, almost as a woman hats.”
—Samuel Beckett (1906–1989)
“Thanks to recent trends in the theory of knowledge, history is now better aware of its own worth and unassailability than it formerly was. It is precisely in its inexact character, in the fact that it can never be normative and does not have to be, that its security lies.”
—Johan Huizinga (1872–1945)