Jump to ContentJump to Main Navigation
The Cybersecurity DilemmaHacking, Trust and Fear Between Nations$
Users without a subscription are not able to see the full content.

Ben Buchanan

Print publication date: 2017

Print ISBN-13: 9780190665012

Published to Oxford Scholarship Online: June 2017

DOI: 10.1093/acprof:oso/9780190665012.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 04 April 2020

The Defender’s View

The Defender’s View

(p.51) 3 The Defender’s View
The Cybersecurity Dilemma

Ben Buchanan

Oxford University Press

This chapter examines defensive cyber operations in a fashion similar to kill chain analysis. It presents an outline of how baseline network defense is done, and what technologies and techniques contribute to that mission. This includes memory forensics, penetration testing, and incident response. It shows as well how those efforts are likely to be insufficient, and how advanced states have an incentive to go further and intrude into other states’ networks for defensive reasons—operations that are sometimes called counter-computer network exploitation. It is these intrusions, which are genuinely defensive, that can be misperceived and interpreted as offensive intrusions—leading to a cycle of escalation.

Keywords:   Computer network defense, Defensive cyber operations, Incident response, Network exploitation, Memory forensics, Penetration testing, Indicators of compromise, Kill Chain

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .