What is Cyber Forensics ? Part 34 Locard's principle , inman-Rudin Paradigm



What is Cyber Forensics ? Part 34
Locard's principle , inman-Rudin Paradigm 
===============
Locard's principle , inman-Rudin Paradigm အေၾကာင္းမေဖာ္ၿပခင္ က်န္ခဲ့တဲ့ တစ္ခ်က္ကုိ အရင္ဆုံးေဖာ္ၿပပါမည္။
Peer view 
===========
Peer View လုိ႕ေခၚတဲ့ ျပင္ပကေန သက္ဆုိင္ရာ Digital Forensics Field ကုိ ကြ်မ္းက်င္တဲ့သူရဲ႕ မွတ္ခ်က္ ဒါမွ မဟုတ္ ထြက္ဆုိခ်က္။ တရားရုံးမွာ တစ္ဖက္ေရွ႕ေနကေန သက္ေသ အေနနဲ႕သြင္းႏုိင္သလုိ အစုိးေရွ႕ေန ဒါမွ မဟုတ္ က်န္တစ္ဖက္ေရွ႕ေနကလဲ သြင္းႏုိင္ပါသည္။ (ႏုိင္ငံအလုိက္Cyber Law အေပၚမူတည္ပါသည္)
============
Locard's Principle ဆုိတာကေတာ့ ၿပင္သစ္လူမ်ဳိး မႈခင္းဆရာ၀န္ Dr.Edmond Locard (1877-1907) ေဖာ္ထုတ္ခဲ့တဲ့ အခ်က္ပါ။ 
" မႈခင္းတစ္ခုမွာ ရွာေဖြတတ္ရင္ သဲလြန္စကုိ ရရွိႏုိင္ပါသည္ဟူေသာ အခ်က္ပါ။ " ေဖာ္ထုတ္ခ်က္ကုိ Physical Investigation မွာသာ အဓိကထားၿပီး
သုံးေပမဲ့ digital ေခတ္ရာက္လာတဲ့ အခါမွာ Theory ကေန ၿပီး ထပ္ဆင့္ခ်ဲ့ယူၾကပါတယ္။ 
Digital Evidence ဆုိတာ ရွာေဖြဖုိ႕ခက္လဲသလုိ ပ်က္စီးလြယ္ပါသည္။
ဒါေၾကာင့္ က်န္ခဲ့ေသာ Evidence တစ္ခုထဲကေန ေဖာ္ထုတ္ႏုိင္ဖုိ႕နဲ ရရွိတဲ့ Evidence မပ်က္စီးေအာင္ Copy and hashing လုပ္ရမယ္ဆုိတဲ့ အခ်က္ 2 ခ်က္ေဖာ္ထုတ္ခဲ့ၾကပါသည္။ (Digital Forensics Investigator ရဲ႕ EQ IQ Skill အၿပင္ အခင္းျဖစ္ပြားရာကုိ အရင္ဆုံးေရာက္ရွိ စစ္ေဆးသူရဲ႕ Skill ကပါ အေရးၾကီးပါသည္) ခြ်င္းခ်က္မ်ားစြာလဲရွိပါသည္။ 
===================
inman-Rudin Paradigm
inman-Rudin Paradigm ဆုိတာကေတာ့ The origin of evidence စာအုပ္ထဲကေန ေကာက္ႏွဳတ္ထားတဲ့ အခ်က္ပါ ...
Transfer အပုိင္းမွာ 
(Locard's principle) ကုိ ရည္ညႊန္းပါသည္။
Identification 
Case က ဘာလဲ Evidence ကဘာလဲ
Individualization 
ဘယ္လုိေသာ Evidence အစအန မဆုိ အေရးၾကီးႏုိင္သည္။ Case ကုိ ေဘာင္က်ဥ္းေအာင္ ေတြးႏုိင္သည္။
Association 
သံသယရွိသူနဲ႕ဆက္စပ္ျခင္း
Reconstruction 
လုိအပ္ခ်က္မ်ား လြဲေခ်ာေနမႈမ်ားကုိ ျပန္လည္စဥ္းစားျခင္း
Evidence Transfer & Custody အပုိင္းကုိ ျပန္လည္ စစ္ေဆးျခင္း

Comments

Post a Comment

Popular posts from this blog

NTFS Index Attributes

Image
  NTFS Index Attributes Now that we have described the general concept of B-trees, we need to describe how they are implemented in NTFS to create indexes. Each entry in the tree uses a data structure called an index entry to store the values in each node. There are many types of index entries, but they all have the same standard header fields, which are given in Chapter 13. For example, a directory index entry contains a few header values and a $FILE_NAME attribute. The index entries are organized into nodes of the tree and stored in a list. An empty entry is used to signal the end of the list. Figure 11.18 shows an example of a node in a directory index with four $FILE_NAME index entries. Figure 11.18. A node in an NTFS directory index tree with four index entries. Figure 11.18 The index nodes can be stored in two types of MFT entry attributes. The $INDEX_ROOT attribute is always resident and can store only one node that contains a small number of index entries. The $INDEX_ROOT attrib
Read more

B-Trees (NTFS)

Image
  B-Trees An NTFS index sort attributes into a tree, specifically a B-tree. A tree is a group of data structures called nodes that are linked together such that there is a head node and its branches out to the other nodes. Consider Figure 11.13(A), where we see node A on top and it links to nodes B and C. Node B links to nodes D and E. A parent node is one that links to other nodes, and a child node is one that is linked to. For example, A is a parent node to B and C, which are children of A. A leaf node is one that has no links from it. Nodes C, D, and E are leaves. The example shown is a binary tree because there are a maximum of two children per node. Figure 11.13. Examples of A) a tree with 5 nodes and B) the same tree that is sorted by the node values FIG- 11.3 Trees are useful because they can be used to easily sort and find data. Figure 11.13(B) shows the same tree as we saw on the left side, but now with values that are assigned to each node. If we are trying to look up a valu
Read more

eCDFP (Module-6) (Window Forensics) (Part - 1 )

Image
လက်ရှိအချိန်မှာ PC/Laptop သုံးစွဲတဲ့အထဲမှာ Window အသုံးပြုသူက ကမ္ဘာမှာ အများဆုံးဖြစ်ပါတယ်။ Operation System အနေနဲ့ကြည့်မယ်ဆိုရင် ဒုတိယအများဆုံးဖြစ်ပါတယ်၊ ပထမအများဆုံးကတော့ Android ဖြစ်ပါတယ်။ Window 1.0 ကနေ အခုနောက်ဆုံးထွက်တဲ့ Window 11 အထိမှာ လက်ရှိလူတွေ အများဆုံးအသုံးပြုတာကတော့ Window 10/ Window 11 ဖြစ်ပါတယ်။ Forensics Analysis လုပ်မယ်ဆိုရင် Window ကနေရနိုင်တဲ့ Artifact (2) မျိုးရှိပါတယ်။ (1) System Artifacts  (2) User Artifacts  System Artifacts  ကတော့ Window Operation System   ကနေရနိုင်တဲ့ Artifacts တွေဖြစ်ပါတယ်။  System Artifacts Example  Registry Artifacts Event Logs File System Artifacts (Master File Table) Prefetch Files Volume Shadow Copies  User Artifacts ကတော့ User အသုံးပြုတဲ့ Computer ပေါ်မှာ User ကနေအသုံးပြုတဲ့ Activity တွေဖြစ်ပါတယ်။ တစ်ကယ်တန်း Forensics Analysis လုပ်မယ်ဆိုရင် System Artifacts ကိုရော User Artifacts ကိုရော Analysis ပြုလုပ်ပါတယ်။  User Artifacts Example  UserAssist  LNK Files Browser Artifacts  Recycle Bin  Recent File  Jump Lists  .LNK File (Shortcut) An
Read more