| Literature DB >> 25097880 |
Suleman Khan1, Muhammad Shiraz1, Ainuddin Wahid Abdul Wahab1, Abdullah Gani1, Qi Han1, Zulkanain Bin Abdul Rahman2.
Abstract
Network forensics enables investigation and identification of network attacks through the retrieved digital content. The proliferation of smartphones and the cost-effective universal data access through cloud has made Mobile Cloud Computing (MCC) a congenital target for network attacks. However, confines in carrying out forensics in MCC is interrelated with the autonomous cloud hosting companies and their policies for restricted access to the digital content in the back-end cloud platforms. It implies that existing Network Forensic Frameworks (NFFs) have limited impact in the MCC paradigm. To this end, we qualitatively analyze the adaptability of existing NFFs when applied to the MCC. Explicitly, the fundamental mechanisms of NFFs are highlighted and then analyzed using the most relevant parameters. A classification is proposed to help understand the anatomy of existing NFFs. Subsequently, a comparison is given that explores the functional similarities and deviations among NFFs. The paper concludes by discussing research challenges for progressive network forensics in MCC.Entities:
Mesh:
Year: 2014 PMID: 25097880 PMCID: PMC4109117 DOI: 10.1155/2014/547062
Source DB: PubMed Journal: ScientificWorldJournal ISSN: 1537-744X
Figure 1Mobile cloud computing basic network architecture.
Figure 2Digital forensics process model.
Generalized network positions in MCC.
| Network positioning | Entities link | Example | Objective | Accessibility |
|---|---|---|---|---|
| Cloud access network [ | User ↔ cloud services | Internet, NGN, 4G | Dynamic routing, accessibility to cloud | Possible |
| Data center network [ | Data center ↔ data center | Cluster computing | Load balancing, virtualization, intensive computing | CSP |
| Inter cloud network [ | Cloud system ↔ cloud system | Cloud resource migration | Cloud collaboration | CSP |
Description of network positioning in MCC.
| Cloud access network | Data center network (DCN) | Intercloud network |
|---|---|---|
| Connects smartphone user to cloud system through wireless, ratio access network (RAN), 3G/4G and LTE networks [ | DCN connects application software & cluster of computers within data center [ | Connects two or more cloud systems for cloud collaboration [ |
|
| ||
| Public cloud networking makes availability of network applications to users via internet [ | Its network expands towards connecting two or more data centers with a single cloud system [ | It not only connects two cloud systems but provides additional functionality such as data format conversions, network virtualization, service availability, address management, intelligent routing, and efficient security [ |
|
| ||
| It faces challenges related to security, compliance, privacy, and high availability [ | It maintains low cost with maximizing efficiency and throughput [ | It benefits by connecting with one cloud system and acquires its services, dedicated network, and increase transfer speed through protocol optimization [ |
|
| ||
| RAN lacks centralize organization for emerging heterogeneous networks, flexibility to drift network services towards network verge for new application utilization and generate revenue from it [ | Mostly faces two challenges such as scalability and cost effectiveness. Scalability depends on architectural design of DCN while cost depends on its power consumption [ | |
Issues in current network forensics and MCC network forensics.
| Issues | Current | MCC |
|---|---|---|
| Data acquisition [ | No | Yes |
| Access to artifacts [ | No | Yes |
| Bandwidth utilization [ | No | Yes |
| Chain of custody [ | No | Yes |
| Data Integrity [ | No | Yes |
| Privacy [ | No | Yes |
| Real time Analysis [ | No | Yes |
| Volatile data [ | No | Yes |
| Forensics tools [ | No | Yes |
Classification of network forensics frameworks.
| Frameworks | Functions | |
|---|---|---|
| Traceback | NFEA [ | Proposes effective tracking range to provide admissible digital evidence with guarantee of integrity and authenticity of track data. Further, it marks packets at edge router which increase efficiency and decrease loss of data. |
| LWIP [ | Considers only time to live (TTL) field of IP header to trace out attack path in DDoS attacks. It used three algorithms that address three steps to make proposed scheme efficient, robust, and simple such as (a) embeds TTL value in IP header, (b) performed soon as DDoS attack occur, and (c) attack tree analysis algorithms is executed. | |
| Scalable NF [ | Proposes scalable network forensics scheme for stealthy self-propagating attacks to traceback the origin of attack. Moreover, scheme is scalable in terms of computational time and space to accurately discover origin of attack. In addition, data reduction mechanism is used to identify deviations of each host and it acts as indication for a potential attack which is further process for forensics investigation. | |
| HB-SST [ | Presents generic hopping based spread spectrum technique for network forensics traceback in anonymous communication networks. It provides randomized effect to mark network traffic in both time and frequency domains. | |
| ITP [ | A protocol is design to traceback attacks in real time as well as periodically using compressed hash table in the router. Further, it addresses replay attacks through timestamp attached to the messages and its integrity is verified through using hash function. Moreover, it enhances detection rate of attacks by updating attack list periodically in routers. | |
|
| ||
| Converged network | PBNF [ | Proposes VoIP network forensics patterns that use to collect and analyze voice traffic in a systematic way. |
| VoIP-NFDE [ | A digital evidence procedure for VoIP network forensics is proposed especially for internet phone. Evidence is identified by comparing normal and abnormal packets in voice communication. | |
| VoIPEM [ | Model based forensics method is proposed to identify malicious attacks in VoIP communication that formalize hypothesis through information gathering. Moreover, attack path is reconstructed by adapting secure temporal logic of action (S-TLA+) which provide clear evidence about attacks. | |
|
| ||
| Intrusion detection system | AIDF [ | An analytical intrusion detection framework proposed, based on probability model discovery approach & inference mechanism. It provides forensics explanation not only on intrusion alerts, but also on unidentified signature rules. Moreover, it integrates intrusion alerts from disseminated IDS sensors. |
| DFITM [ | Intrusion tolerance base dynamic forensics modeling is performed to enhance availability of forensics server in case of an attack. Modeling is conducted with finite state machine and forensics server availability is analyzed through numerical analysis. | |
| IIFDH [ | Steganography is applied to identify alteration in log files performed by an intruder after his malicious attack. It maintains reliability and completeness of the evidence for future decisions. | |
| NFIDA [ | Network forensics based on intrusion detection static and dynamic analysis is performed to provide complete record of data and logs while ensuring credibility and reliability. | |
|
| ||
| Attack graphs | SA [ | Proposes a framework that performs scalable analysis of attack scenarios by analyzing massive amount of alerts in real-time situation. Moreover, it also addresses individual attacks and its impacts on the enterprise. |
| MLL-AT [ | It identifies multistage network attacks and analyzes system risk by evaluating various security threads that occurs due to attack sequences. | |
| AGFE [ | Integrates antiforensics mechanism with attack graph to fully observe intruders while deleting certain traces after attack performed. | |
| FCM [ | Generate fuzzy cognitive map from attack graph with the help of genetic algorithm to find a worst attacks in the network. It simples a situation for network investigator to tackle such attacks with great concern. | |
| CSBH [ | A probabilistic approach is proposed that integrates attack graph with hidden Markov model for exploring system states and its observation. It identifies the root cause of attack with providing automation, adaptability, and scalability in large network for cost benefit security hardens. | |
| AGVI [ | RAVEN framework is proposed that reduces sophistication in large attack graphs by providing interactive visualize interfaces for user to illustrate attack graphs easily. | |
|
| ||
| Distributive | ForNet [ | Proposes distributive framework to collect network logs from different network devices in disseminated network. It analyze IP packet header for IP connection, ports, and various sessions through bloom filter tracking. |
| DRNIFS [ | It captures network packets soon as an attack is detected in a real-time situation. Moreover, it collects potential evidences that are deleted in most of the cases by intruders after its malicious attacks. It uses centralize network forensics server with disseminative detective agents. | |
| DCNFM [ | Proposes framework that identifies potential risk, misbehavior of packets, and origin of attack with having distributed cooperative network forensics system. The system is comprised of client server architecture, with client agents installed on different system to capture network traffic logs from different network artifacts. | |
| DNF-IA [ | It proposes artificial intelligence immunity theory to address network forensics in real time with keeping evidence in a safe way. It provides validity, integrality, and authenticity for evidence in a real time situation. | |
Structure of network forensics frameworks.
| Frameworks | Approach | Methods | Evaluation | Limitations | Performance | |
|---|---|---|---|---|---|---|
| Traceback | NFEA [ | LO, PM | Authenticated evidence marking scheme (AEMS) | Test bed & Simulation | Computational & Storage overhead | 50% performance degrades when AEMS applied to each packet. However, performance gains 40% when it is applied to only select packets. |
| LWIP [ | PM | Lightweight IP traceback based on TTL | Tree analysis algorithm | Router overhead | Significant path reconstruction in DDoS attack | |
| Scalable-NF [ | LO | Scalable network forensics | Real world traffic traces | Capture real time traffic | Reduce 97% of irrelevant data for analysis | |
| HB-SST [ | Spread spectrum techniques | Hopping based spread spectrum | Simulation | Scalability | False positive decrease exponential with increase in signal length. | |
| ITP [ | LO | IP traceback protocol (ITP) | Simulation | Router overhead | ITP shows better results in term of false positive rate & attack detection as comparing with existing frameworks | |
|
| ||||||
| Converge network | PBNF [ | LO | VoIP network forensics patterns | Suggest to use NFATs | Scalability, Forensics server bottle neck | Faster and structural investigation in VoIP traffic |
| VoIP-NFDE [ | LO | VoIP network forensics with digital evidence | Test bed | Time consuming, bandwidth utilization | Collects, analyzes, and performs forensics in VoIP DEFSOP operational stage | |
| VoIPEM [ | LO | VoIP Evidence Model | S-TLC+ | Not trace anonymous attacks | Identifies significant information relate to attacks | |
|
| ||||||
| Intrusion detection system | AIDF [ | Probabilistic model | Probabilistic discovery & inference | Test bed | Database for untreated data | Perfect discovery results in 16.67% and information combining from multiple IDS for forensics explanation is 87% |
| DFITM [ | Dynamic forensics intrusion tolerance | Formal methods | Finite state machine | Storage overhead | Enhancement of availability of forensics server with improvement of collected significant evidence | |
| IIFDH [ | LO | Steganography | Prototyped | Scalability | Real-time detection with preservation of evidence | |
| NFIDA [ | LO | Multi-dimensional analysis | Not applicable | Computational overhead | Records complete network data with providing data integrity that results in network forensics solution based on intrusion detection analysis. | |
|
| ||||||
| Attack graph (AG) | SA [ | Measure current & future attacks | Scalable analysis | Synthetic & real AG | Computational overhead | For large graph the integer value |
| MLL-AT [ | Network attack modeling | Multi-level & layer attack tree | Case study | Scalability, Storage overhead | Model attack more accurately, address system risk | |
| AGFE [ | Forensics examination | Anti-forensics injection in AG | Test bed | Scalability | Identifies alteration performed by intruders in log files. | |
| FCM [ | Network security evaluation | finite cognitive map & genetic algorithm | Simulation | Observation depended, lack of awareness | Results best fit value of 1.64 that shows the probability of goal achieved. | |
| CSBH [ | Probabilistic | Design model | Scenario based | Computational overhead | It finds that an approach is user centric, with complexity O (MN2). | |
| AGVI [ | Visualization & Interaction | RAVEN | Not applicable | Visualization in real time situation | Address impact of HCI techniques on attack graphs | |
|
| ||||||
| Distributive | ForNet [ | distributive network forensics | Architecture | Not applicable | Limited attack detection due to lightweight filtering | Provide valuable, trustworthy information about network events |
| DRNIFS [ | LO, PM | Architecture | Not applicable | Storage overhead | Real time detection with quick incident response | |
| DCNFM [ | LO | Client Server Architecture | Not applicable | Forensics server bottle neck, Storage overhead | Identifies origin of attack and potential risk | |
| DNF-IA [ | LO | Dynamic network forensics model | Laboratory test | Lack of cryptography, forensics server bottle neck | Integrated, accurate results in real-time situation when attacks are occurred. | |
Approaches: LO: logging; PM: packet marking.
Analysis of network forensics frameworks in context of adaptability to MCC.
| Frameworks | Scalability | Overhead | Accuracy | Complexity | Privacy | Adaptability | ||
|---|---|---|---|---|---|---|---|---|
| Computational | Storage | |||||||
| Traceback | NFEA [ | N/A | H | H | L | IM | L | N/A |
| LWIP [ | HT | H | M | M | AL | M | D | |
| Scalable NF [ | VT | L | L | H | IV | L | M | |
| HB-SST [ | HT | M | N/A | N/A | IM | N/A | D | |
| ITP [ | N/A | H | H | M | IM | M | D | |
|
| ||||||||
| Converge networks | PBNF [ | N/A | H | L | L | IM, AL | L | D |
| VoIP-NFDE [ | N/A | M | M | N/A | IM, CL, AL | L | D | |
| VoIPEM [ | HT | M | M | N/A | IM, AL | L | N/A | |
|
| ||||||||
| Intrusion detection system | AIDF [ | HT | M | M | N/A | IM, AL | N/A | D |
| DFITM [ | HT | H | L | N/A | IM, AL | N/A | D | |
| IIFDH [ | N/A | H | L | N/A | AL | L | D | |
| NFIDA [ | N/A | L | L | L | IM, AL | L | D | |
|
| ||||||||
| Attack graph | SA [ | HT | M | L | N/A | AL | L | L |
| MLL-AT [ | N/A | M | L | N/A | IM, CL, AL | M | L | |
| AGFE [ | N/A | H | M | L | IM, AL | M | D | |
| FCM [ | HT | M | M | H | AL | M | M | |
| CSBH [ | HT | L | L | M | AL | M | H | |
| AGVI [ | HT | L | N/A | N/A | AL | H | M | |
|
| ||||||||
| Distribution | ForNet [ | VT | M | M | N/A | CL, AL | L | M |
| DRNIFS [ | BT | M | M | N/A | AL | L | L | |
| DCNFM [ | HT | M | M | L | CL, AL | L | L | |
| DNF-IA [ | HT | L | L | L | IM, CL, AL | L | M | |
Scalability: HT: horizontal; VT: vertical; BT: both; N/A: not applicable.
Overhead: H: high; M: moderate; L: low; N/A: not applicable.
Accuracy: H: high; M: moderate; L: low; N/A: not applicable.
Complexity: IM: implementation; AL: analysis; CL: collection; IV: investigation.
Privacy: H: high; M: moderate; L: low; N/A: not applicable.
Adaptability: D: difficult; H: high; M: moderate; L: low; N/A: not applicable.
Figure 3Network forensics: issues and challenges for CSPs in MCC.