Book Image

Practical Windows Forensics

Book Image

Practical Windows Forensics

Overview of this book

Over the last few years, the wave of the cybercrime has risen rapidly. We have witnessed many major attacks on the governmental, military, financial, and media sectors. Tracking all these attacks and crimes requires a deep understanding of operating system operations, how to extract evident data from digital evidence, and the best usage of the digital forensic tools and techniques. Regardless of your level of experience in the field of information security in general, this book will fully introduce you to digital forensics. It will provide you with the knowledge needed to assemble different types of evidence effectively, and walk you through the various stages of the analysis process. We start by discussing the principles of the digital forensics process and move on to show you the approaches that are used to conduct analysis. We will then study various tools to perform live analysis, and go through different techniques to analyze volatile and non-volatile data.

Related Content you might be interested in

Current Title:

Small book image
Practical Windows Forensics
Jun, 2016 | 322 pages
No titles found
Table of Contents (20 chapters)
Practical Windows Forensics
Practical Windows Forensics
Credits
Credits
About the Authors
About the Authors
About the Reviewers
About the Reviewers
www.PacktPub.com
www.PacktPub.com
Preface
Preface
Free Chapter
1
The Foundations and Principles of Digital Forensics
The Foundations and Principles of Digital Forensics
What is digital crime?
Digital forensics
Digital evidence
Digital forensic goals
Analysis approaches
Summary
2
Incident Response and Live Analysis
Incident Response and Live Analysis
Personal skills
Security fundamentals
The hardware for IR and Jump Bag
Remote live response
Summary
3
Volatile Data Collection
Volatile Data Collection
Memory acquisition
Network-based data collection
Summary
4
Nonvolatile Data Acquisition
Nonvolatile Data Acquisition
Forensic image
Incident Response CDs
Live imaging of a hard drive
Linux for the imaging of a hard drive
Virtualization in data acquisition
Evidence integrity (the hash function)
Disk wiping in Linux
Summary
5
Timeline
Timeline
Timeline introduction
The Sleuth Kit
Super timeline – Plaso
Plaso architecture
Plaso in practice
Summary
6
Filesystem Analysis and Data Recovery
Filesystem Analysis and Data Recovery
Hard drive structure
The FAT filesystem
The NTFS filesystem
The Sleuth Kit (TSK)
Autopsy
Foremost
Summary
7
Registry Analysis
Registry Analysis
The registry structure
Backing up the registry files
Extracting registry hives
Parsing registry files
Auto-run keys
Registry analysis
Summary
8
Event Log Analysis
Event Log Analysis
Event Logs - an introduction
Event Logs system
Extracting Event Logs
Summary
9
Windows Files
Windows Files
Windows prefetch files
Windows tasks
Windows Thumbs DB
Windows RecycleBin
Windows shortcut files
Summary
10
Browser and E-mail Investigation
Browser and E-mail Investigation
Browser investigation
Microsoft Internet Explorer
Firefox
Other browsers
E-mail investigation
Summary
11
Memory Forensics
Memory Forensics
Memory structure
Memory acquisition
The sources of memory dump
Processes in memory
Network connections in memory
The DLL injection
API hooking
Memory analysis
Summary
12
Network Forensics
Network Forensics
Network data collection
Exploring logs
Using tcpdump
Using tshark
Using WireShark
Knowing Bro
Summary
Building a Forensic Analysis Environment
Building a Forensic Analysis Environment
Factors that need to be considered
Case Study
Case Study
Introduction
Scenario
Acquisition
Live analysis
Prefetch files
Browser analysis
Postmortem analysis
Summary

Evidence integrity (the hash function)

What can we do to prove that the evidence hasn't been altered or changed? This step is very important to prove in court, if required, that you didn't add, remove, or edit the evidence during imaging or analysis. Most of the imaging tools come with many hash function implementations, such as MD5, SHA1, and SHA256. The hash function is a mathematical implementation, which is an irreversible or one-way function. This means that if you have input data A and hash function F, you will get F(A) = H. However, it's been proved that F'(H) != A, where F is the hash function and F' is any mathematical function. We can't get A, the original data, from H, the hash digest.

For example, if we have different strings applied to the same hash function, the hash function must map each string to different hashes:

The hash function

As shown in the preceding diagram, each text resulted in a different hash after applying all the texts to the same hash function. Even if the change...

Previous Section
End of Section 7
Next Section