自行车计算机取证:一个有效和稳健的方法为FIT文件恢复

IF 2 4区 医学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Kwangkeun Song , Dongbin Oh
{"title":"自行车计算机取证:一个有效和稳健的方法为FIT文件恢复","authors":"Kwangkeun Song ,&nbsp;Dongbin Oh","doi":"10.1016/j.fsidi.2023.301606","DOIUrl":null,"url":null,"abstract":"<div><p>The popularity of bike computer devices has grown in recent years. These devices generate a wealth of data in the form of Flexible and Interoperable Data Transfer (FIT) files, which can be used to store fitness related data efficiently. However, the recovery of corrupted FIT files remains a significant challenge due to their inherent structure. The format relies on a chain of messages stored sequentially, with each message referencing previous data to parse the subsequent record. As a result, the recovery of data situated between corrupted portions becomes notably challenging. This study introduces an efficient, and robust method for dense recovery of corrupted files. Our approach combines multiple phases of data carving techniques to maximize data recovery. By employing this method, investigators can effectively access crucial information including accident reconstruction, and criminal activities. The proposed methods demonstrate higher recovery rate through the proof-of-concept and real-world experiments, proving its utility and reliability in the field of digital forensics.</p></div>","PeriodicalId":48481,"journal":{"name":"Forensic Science International-Digital Investigation","volume":null,"pages":null},"PeriodicalIF":2.0000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bike computer forensics: An efficient and robust method for FIT file recovery\",\"authors\":\"Kwangkeun Song ,&nbsp;Dongbin Oh\",\"doi\":\"10.1016/j.fsidi.2023.301606\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The popularity of bike computer devices has grown in recent years. These devices generate a wealth of data in the form of Flexible and Interoperable Data Transfer (FIT) files, which can be used to store fitness related data efficiently. However, the recovery of corrupted FIT files remains a significant challenge due to their inherent structure. The format relies on a chain of messages stored sequentially, with each message referencing previous data to parse the subsequent record. As a result, the recovery of data situated between corrupted portions becomes notably challenging. This study introduces an efficient, and robust method for dense recovery of corrupted files. Our approach combines multiple phases of data carving techniques to maximize data recovery. By employing this method, investigators can effectively access crucial information including accident reconstruction, and criminal activities. The proposed methods demonstrate higher recovery rate through the proof-of-concept and real-world experiments, proving its utility and reliability in the field of digital forensics.</p></div>\",\"PeriodicalId\":48481,\"journal\":{\"name\":\"Forensic Science International-Digital Investigation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2023-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Forensic Science International-Digital Investigation\",\"FirstCategoryId\":\"3\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S266628172300118X\",\"RegionNum\":4,\"RegionCategory\":\"医学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Forensic Science International-Digital Investigation","FirstCategoryId":"3","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S266628172300118X","RegionNum":4,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

近年来,自行车电脑设备越来越受欢迎。这些设备以灵活和可互操作的数据传输(FIT)文件的形式生成大量数据,这些文件可用于有效地存储健身相关数据。然而,由于其固有的结构,损坏的FIT文件的恢复仍然是一个重大挑战。该格式依赖于按顺序存储的消息链,每个消息引用之前的数据来解析后续记录。因此,位于损坏部分之间的数据的恢复变得非常具有挑战性。本文介绍了一种高效、稳健的密集恢复损坏文件的方法。我们的方法结合了数据雕刻技术的多个阶段,以最大限度地恢复数据。通过使用这种方法,调查人员可以有效地获取包括事故重建和犯罪活动在内的关键信息。通过概念验证和实际实验证明,该方法具有较高的恢复率,证明了其在数字取证领域的实用性和可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bike computer forensics: An efficient and robust method for FIT file recovery

The popularity of bike computer devices has grown in recent years. These devices generate a wealth of data in the form of Flexible and Interoperable Data Transfer (FIT) files, which can be used to store fitness related data efficiently. However, the recovery of corrupted FIT files remains a significant challenge due to their inherent structure. The format relies on a chain of messages stored sequentially, with each message referencing previous data to parse the subsequent record. As a result, the recovery of data situated between corrupted portions becomes notably challenging. This study introduces an efficient, and robust method for dense recovery of corrupted files. Our approach combines multiple phases of data carving techniques to maximize data recovery. By employing this method, investigators can effectively access crucial information including accident reconstruction, and criminal activities. The proposed methods demonstrate higher recovery rate through the proof-of-concept and real-world experiments, proving its utility and reliability in the field of digital forensics.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
5.90
自引率
15.00%
发文量
87
审稿时长
76 days
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信