Data Portal @ linkeddatafragments.org

Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Information-theoretic_security> ?p ?o. }

• Information-theoretic_security abstract "A cryptosystem is information-theoretically secure if its security derives purely from information theory. That is, it cannot be broken even when the adversary has unlimited computing power. The adversary simply does not have enough information to break the encryption, so these cryptosystems are considered cryptanalytically unbreakable. An encryption protocol that has information-theoretic security does not depend for its effectiveness on unproven assumptions about computational hardness, and such an algorithm is not vulnerable to future developments in computer power such as quantum computing. An example of an information-theoretically secure cryptosystem is the one-time pad. The concept of information-theoretically secure communication was introduced in 1949 by American mathematician Claude Shannon, the inventor of information theory, who used it to prove that the one-time pad system was secure. Information-theoretically secure cryptosystems have been used for the most sensitive governmental communications, such as diplomatic cables and high-level military communications, because of the great efforts enemy governments expend toward breaking them.An interesting special case is perfect security: an encryption algorithm is perfectly secure if a ciphertext produced using it provides no information about the plaintext without knowledge of the key. If E is a perfectly secure encryption function, for any fixed message m there must exist for each ciphertext c at least one key k such that . It has been proven that any cipher with the perfect secrecy property must use keys with effectively the same requirements as one-time pad keys.It is common for a cryptosystem to leak some information but nevertheless maintain its security properties even against an adversary that has unlimited computational resources. Such a cryptosystem would have information theoretic but not perfect security. The exact definition of security would depend on the cryptosystem in question.There are a variety of cryptographic tasks for which information-theoretic security is a meaningful and useful requirement. A few of these are: Secret sharing schemes such as Shamir's are information-theoretically secure (and also perfectly secure) in that less than the requisite number of shares of the secret provide no information about the secret. More generally, secure multiparty computation protocols often, but not always have information theoretic security. Private information retrieval with multiple databases can be achieved with information-theoretic privacy for the user's query. Reductions between cryptographic primitives or tasks can often be achieved information-theoretically. Such reductions are important from a theoretical perspective, because they establish that primitive can be realized if primitive can be realized. Symmetric encryption can be constructed under an information-theoretic notion of security called entropic security, which assumes that the adversary knows almost nothing about the message being sent. The goal here is to hide all functions of the plaintext rather than all information about it. Quantum cryptography is largely part of information-theoretic cryptography.↑ 1.0 1.1".
• Information-theoretic_security wikiPageExternalLink encryption-euro-final.pdf.
• Information-theoretic_security wikiPageID "677968".
• Information-theoretic_security wikiPageRevisionID "589867460".
• Information-theoretic_security hasPhotoCollection Information-theoretic_security.
• Information-theoretic_security subject Category:Information-theoretically_secure_algorithms.
• Information-theoretic_security subject Category:Theory_of_cryptography.
• Information-theoretic_security type Abstraction100002137.
• Information-theoretic_security type Act100030358.
• Information-theoretic_security type Activity100407535.
• Information-theoretic_security type Algorithm105847438.
• Information-theoretic_security type Event100029378.
• Information-theoretic_security type Information-theoreticallySecureAlgorithms.
• Information-theoretic_security type Procedure101023820.
• Information-theoretic_security type PsychologicalFeature100023100.
• Information-theoretic_security type Rule105846932.
• Information-theoretic_security type YagoPermanentlyLocatedEntity.
• Information-theoretic_security comment "A cryptosystem is information-theoretically secure if its security derives purely from information theory. That is, it cannot be broken even when the adversary has unlimited computing power. The adversary simply does not have enough information to break the encryption, so these cryptosystems are considered cryptanalytically unbreakable.".
• Information-theoretic_security label "Information-theoretic security".
• Information-theoretic_security label "Perfekte Sicherheit".
• Information-theoretic_security label "الأمان من حيث نظرية المعلومات".
• Information-theoretic_security label "資訊理論安全性".
• Information-theoretic_security sameAs Perfekte_Sicherheit.
• Information-theoretic_security sameAs m.0325g9.
• Information-theoretic_security sameAs Q4117218.
• Information-theoretic_security sameAs Q4117218.
• Information-theoretic_security sameAs Information-theoretic_security.
• Information-theoretic_security wasDerivedFrom Information-theoretic_security?oldid=589867460.
• Information-theoretic_security isPrimaryTopicOf Information-theoretic_security.