Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Digital forensics (16)
- Forensics (7)
- Approximate matching (6)
- Security (6)
- Survey (6)
-
- Mrsh-v2 (5)
- Android (4)
- Cryptocurrency (4)
- Cyber forensics (4)
- Hashing (4)
- Mobile device forensics (4)
- Sdhash (4)
- Applications (3)
- Artifacts (3)
- Computer forensics (3)
- Digital Forensics (3)
- Education (3)
- Memory Forensics (3)
- Mobile forensics (3)
- Network forensics (3)
- Android forensics (2)
- Attacks (2)
- Bloom filter (2)
- Cyber Forensics (2)
- Cybersecurity (2)
- Digital evidence (2)
- Distributed storage attacks (2)
- Frameup (2)
- Games (2)
- IOS forensics (2)
- Publication Year
- Publication
- Publication Type
Articles 61 - 64 of 64
Full-Text Articles in Entire DC Network
Iphone 3gs Forensics: Logical Analysis Using Apple Itunes Backup Utility, Mona Bader, Ibrahim Baggili
Iphone 3gs Forensics: Logical Analysis Using Apple Itunes Backup Utility, Mona Bader, Ibrahim Baggili
Electrical & Computer Engineering and Computer Science Faculty Publications
The iPhone mobile is used worldwide due to its enhanced computing capabilities, increased storage capacity as well as its attractive touch interface. These characteristics made the iPhone a popular smart phone device. The increased use of the iPhone lead it to become a potential source of digital evidence in criminal investigations. Therefore, iPhone forensics turned into an essential practice for forensic and security practitioners today. This research aimed at investigating and examining the logical backup acquisition of the iPhone 3GS mobile device using the Apple iTunes backup utility. It was found that significant data of forensic value such as e-mail …
Generating System Requirements For A Mobile Digital Evidence Collection System: A Preliminary Step Towards Enhancing The Forensic Collection Of Digital Devices, Ibrahim Baggili
Electrical & Computer Engineering and Computer Science Faculty Publications
Collecting digital devices in a forensically sound manner is becoming more critical since 80% of all cases have some sort of digital evidence involved in them (Rogers, 2006, p. 1) .The process of documenting and tagging digital devices is cumbersome and involves details that might not apply to other types of evidence, since each evidence item has unique physical characteristics (Hesitis & Wilbon, 2005, p. 17). The process becomes less manageable when a large number of digital devices are seized. This paper examines the information and issues investigators should be aware of when collecting digital devices at crime scenes. Furthermore, …
Self-Reported Cyber Crime: An Analysis On The Effects Of Anonymity And Pre-Employment Integrity, Ibrahim Baggili, Marcus Rogers
Self-Reported Cyber Crime: An Analysis On The Effects Of Anonymity And Pre-Employment Integrity, Ibrahim Baggili, Marcus Rogers
Electrical & Computer Engineering and Computer Science Faculty Publications
A key issue facing today’s society is the increase in cyber crimes. Cyber crimes pose threats to nations, organizations and individuals across the globe. Much of the research in cyber crime has risen from computer science-centric programs, and little experimental research has been performed on the psychology of cyber crime. This has caused a knowledge gap in the study of cyber crime. To this end, this research focuses on understanding psychological concepts related to cyber crime. Through an experimental design, participants were randomly assigned to three groups with varying degrees of anonymity. After each treatment, participants were asked to self-report …
An Ad Hoc Adaptive Hashing Technique For Non-Uniformly Distributed Ip Address Lookup In Computer Networks, Christopher Martinez, Wei-Ming Lin
An Ad Hoc Adaptive Hashing Technique For Non-Uniformly Distributed Ip Address Lookup In Computer Networks, Christopher Martinez, Wei-Ming Lin
Electrical & Computer Engineering and Computer Science Faculty Publications
Hashing algorithms have been widely adopted for fast address look-up, which involves a search through a database to find a record associated with a given key. Hashing algorithms transforms a key into a hash value hoping that the hashing renders the database a uniform distribution with respect to the hash value. The closer to uniform hash values, the less search time required for a query. When the database is key-wise uniformly distributed, any regular hashing algorithm (bit-extraction, bit-group XOR, etc.) leads to a statistically perfect uniform hash distribution. When the database has keys with a non-uniform distribution, performance of regular …