Defense strategy (computing)

Revision as of 08:48, 4 December 2019 by wikipedia>Al Ligorie (Made it more readable by fixing typo and grammar errors. Removed double-spacing between words, Added section sub-headers.)

Template:Copy edit Defense strategy (in computing) is a concept and form of practice used by computer designers, users, and IT personnel to help reduce the risk of computer security or cybersecurity problems.

Common Strategies

Boundary protection - strategy employing different security measures and devices preventing unauthorized access to computer systems (controlling system border). Approach is based on assumption that attacker did not penetrate system.

Examples of this strategy are using of Firewall (computing), password check, deleting suspicious mails / messages, using gateways, routers and limiting physical access.[1]

Information System Monitoring - strategy performing different security measures to find intruders, or damage done by intruders. Strategy based on assumption that system is penetrated, but intruder did not gain full control.[2]

Examples of this strategy are using of antivirus software, using Patch (computing),Network behavior anomaly detection.

Unavoidable actions - strategy performing different security measures that cannot be prevented or neutralized. Strategy based on assumption that system is penetrated, but intruder cannot access defensive mechanism.

Examples of this strategy are computer Reboot, using Physical unclonable function, and using Security switch.

Secure enclave - strategy performing different security measures preventing access to some parts of system. Strategy based on assumption that system is penetrated, but intruder cannot access its special parts.

Examples of this strategy are using of Access level, using Trusted Platform Module, using microkernel, using Diode (unidirectional network device),Air gap (networking).

False target – strategy of preparing non-real target for intruder. Strategy based on assumption that system is penetrated, but intruder does not know system architecture.

Examples of this strategy are Honeypot (computing), Virtual Computer, Virtual security switch, fake files, addresses / passwords copies.

Moving target - strategy performing different security measures of changing data, processes. Strategy based on assumption that system is penetrated, but intruder does not know system architecture, processes.

Examples of this strategy are changing password, changing Key (cryptography), using Dynamic Platform [3]

Useless information - strategy performing different security measures to make important information useless for intruder. Strategy based on assumption that system is penetrated, but intruder is not able to decrypt information, or does not have enough time to decrypt it.

Examples of this strategy are Encrypting File System, using Encryption software.

Delete- strategy performing different security measures preventing intruder from gaining sensitive information at all cost. Strategy based on assumption that damage from information disclosure is more than system integrity. Assuming system may be penetrated, attempt is detected. Strategy is part of Data-centric security approach.

Examples of this strategy are information deletion as response to security violation, unauthorized access attempt, password reset.

Information redundancy -strategy performing different security measures to keep redundancy for information and using it in case of damage. Strategy based on assumption that finding and repairing damage is more complicated than restoration of system.

Examples of this strategy are using system restoration, keeping backup files, using backup computer.

Limiting of actions made by robot - strategy performing different security measures to limit robots (software bot) actions. Strategy based on assumption that robot can make more actions, or create damage that a human cannot create.

Examples of this strategy are using Anti-spam techniques, using CAPTCHA and other Human presence detection techniques, using DDS based defense (protection from Denial-of-service attack).

Active defense - strategy performing different security measures attacking potential intruder. Strategy based on assumption that potential intruder under attack has fewer abilities.

Examples of this strategy are creating and using lists of trusted networks, devices, applications, blocking addresses, Vendor Management.

Strategy Analysis

Boundary protection Strategy Analysis

Main strategy for computing system, if this type of defense is successful, no other strategies are required. Resources consuming strategy, scope is known. External information system monitoring is part of Boundary protection.[4]

Information System Monitoring Strategy Analysis

Strategy success based on competition of offence and defense. Time and Resources consuming strategy, affecting performance. Scope is variable in time. Cannot be fully successful if not supported by other strategies.

Unavoidable actions Strategy Analysis

Strategy can support any other strategy. Resources consuming strategy, scope is determined by designer. Strategy can be fully successful, however, in most cases, it is limiting system functionality.

Secure enclave Strategy Analysis

Supporting strategy for Boundary protection and Information System Monitoring. Time and Resources consuming strategy, scope is known. Strategy can be fully successful in its part, which does not guarantee overall success.

False target Strategy Analysis

Supporting strategy for Information System Monitoring. Time-consuming strategy, scope is determined by designer. Cannot be fully successful if not supported by other strategies.

Moving target Strategy Analysis

Supporting strategy for Information System Monitoring. Time-consuming strategy, scope is determined by designer. Cannot be fully successful if not supported by other strategies.

Useless information Strategy Analysis

Supporting strategy for Information System Monitoring. Time and Resources consuming strategy, affecting performance. Scope is known. Cannot be successful if not supported by other strategies.  Consequences of Claude Shannon theorems shows that if encryption key is smaller than 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. This strategy need to be supported by Moving target strategy or Delete strategy.

Delete Strategy Analysis

Supporting strategy for Information System Monitoring.  Resources consuming strategy, scope is determined by designer. Cannot be fully successful, since detection is not quarantined.

Information redundancy Strategy Analysis

Supporting strategy for Information System Monitoring. Considerable resources consuming strategy, scope is known. Can be fully successful in its part.

Limiting of actions made by robots Strategy Analysis

Supporting strategy for Boundary protection and Information System Monitoring. Time and Resources consuming strategy, scope is determined by designer. Strategy cannot be fully successful.

Active defense Strategy Analysis

Supporting strategy for Boundary protection and Information System Monitoring. Time and Resources consuming strategy, scope is determined by designer. Strategy cannot be fully successful.

See also

References