Defense strategy (computing): Difference between revisions

m FlammableBot: Corrections to implement MOS:POSLINK
Line 32: Line 32:
Useless information comprises  security measures to turn important information into useless data for an intruder. The strategy is based on the assumption that the system has been penetrated, but the intruder is not able to decrypt information, or does not have enough time to decrypt it. For example, [[Encrypting File System|encrypting the file system]] or using [[encryption software]] can render the data useless even if an attacker gets access to the file system, or using [[data masking]], where sensitive data is hidden in non-sensitive data with modified content.
Useless information comprises  security measures to turn important information into useless data for an intruder. The strategy is based on the assumption that the system has been penetrated, but the intruder is not able to decrypt information, or does not have enough time to decrypt it. For example, [[Encrypting File System|encrypting the file system]] or using [[encryption software]] can render the data useless even if an attacker gets access to the file system, or using [[data masking]], where sensitive data is hidden in non-sensitive data with modified content.


This is a supporting strategy for information system monitoring. It is a time and resource-consuming strategy, affecting performance. The scope is known. It cannot be successful if not supported by other strategies. [[Claude Shannon|Claude Shannon's]] theorems show that if the encryption key is smaller than the secured information, the [[information-theoretic security]] can not be achieved. There is only one known unbreakable cryptographic system: the [[one-time pad]]. This strategy is not generally possible to use because of the difficulties involved in exchanging one-time pads without the risk of being compromised. Other cryptographic systems are only buying time or can be broken (see [[Cryptographic hash function#Degree_of_difficulty]]). This strategy needs to be supported by the moving target or deletes strategies.
This is a supporting strategy for information system monitoring. It is a time and resource-consuming strategy, affecting performance. The scope is known. It cannot be successful if not supported by other strategies. [[Claude Shannon]]'s theorems show that if the encryption key is smaller than the secured information, the [[information-theoretic security]] can not be achieved. There is only one known unbreakable cryptographic system: the [[one-time pad]]. This strategy is not generally possible to use because of the difficulties involved in exchanging one-time pads without the risk of being compromised. Other cryptographic systems are only buying time or can be broken (see [[Cryptographic hash function#Degree_of_difficulty]]). This strategy needs to be supported by the moving target or deletes strategies.


=== Deletion ===
=== Deletion ===