{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T04:25:28Z","timestamp":1786940728578,"version":"build-2736575974"},"reference-count":53,"publisher":"Wiley","license":[{"start":{"date-parts":[[2026,8,16]],"date-time":"2026-08-16T00:00:00Z","timestamp":1786838400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"},{"start":{"date-parts":[[2026,8,16]],"date-time":"2026-08-16T00:00:00Z","timestamp":1786838400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Forensic Sciences"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Smartphones provide crucial but duplicate information in forensic investigations. The major deduplication tools designed for the cloud ignore constraints on phone storage, power, data fragmentation, and dynamic handling, leading to processing delays and limiting their efficient use. It also affects evidence integrity and increases the potential risk of data leakage. This paper proposes a data deduplication technique for resource\u2010constrained Android devices with limited computing power and memory. The use of the Blake2b\u2010Hash Algorithm in the proposed deduplication algorithm reduces overhead and enables dynamic memory allocation. Multiple strategies were proposed and tested using a wide range of Smartphones. The proposed algorithm is validated based on file analysis time, device storage and memory utilization, and storage overhead. The paper also assesses the hash function's cryptographic robustness. The experimental analysis demonstrates that the proposed method achieved a 45.90% processing time to identify 29.52% duplicate files. A 48.55% reduction in storage space was achieved, and battery consumption was reduced to 81.15% compared to MD5 and SHA224. It achieved up to 52.71% RAM optimization, along with only 0.0033% storage overhead to maintain the metadata of deleted files for forensic purposes. This proves the effectiveness and reliability of the proposed solutions in facilitating digital forensic analysis.<\/jats:p>","DOI":"10.1111\/1556-4029.70442","type":"journal-article","created":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T04:04:37Z","timestamp":1786939477000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["<scp>MobDedup<\/scp>\n                    : Mobile data deduplication for enhancing digital forensics"],"prefix":"10.1111","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6544-8514","authenticated-orcid":false,"given":"Priteshkumar","family":"Prajapati","sequence":"first","affiliation":[{"name":"Chandubhai S. Patel Institute of Technology (CSPIT), Faculty of Technology &amp; Engineering (FTE) Charotar University of Science and Technology (CHARUSAT)  Changa Gujarat India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3579-8708","authenticated-orcid":false,"given":"Hiren","family":"Mewada","sequence":"additional","affiliation":[{"name":"Prince Mohammad Bin Fahd University  Khobar, Dhahran Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4641-7787","authenticated-orcid":false,"given":"Parth","family":"Shah","sequence":"additional","affiliation":[{"name":"School of National Security Studies (SNSS) Central University of Gujarat (CUG)  Vadodara Gujarat India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2026,8,16]]},"reference":[{"key":"e_1_2_9_2_1","volume-title":"Guidelines on mobile device forensics (draft)","author":"Ayers R","year":"2013"},{"key":"e_1_2_9_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3124262"},{"key":"e_1_2_9_4_1","unstructured":"National Crime Records Bureau.Crime in India.https:\/\/ncrb.gov.in\/crime\u2010in\u2010india\u2010table\u2010content.html. Accessed 15 Jul 2026"},{"key":"e_1_2_9_5_1","unstructured":"Ministry of Home Affairs Government of India.Ministry of Home Affairs.https:\/\/www.mha.gov.in\/en. Accessed 5 Jun 2026"},{"key":"e_1_2_9_6_1","unstructured":"Open Government Data Platform India.Open Government Data (OGD) Platform India.https:\/\/data.gov.in. Accessed 5 Jun 2026"},{"key":"e_1_2_9_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2020.10.021"},{"key":"e_1_2_9_8_1","doi-asserted-by":"publisher","DOI":"10.1186\/s41935\u2010021\u201000234\u20106"},{"key":"e_1_2_9_9_1","doi-asserted-by":"publisher","DOI":"10.3390\/app10124231"},{"key":"e_1_2_9_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3014615"},{"key":"e_1_2_9_11_1","first-page":"1257","volume-title":"Proceedings of the 2024 5th international conference on electronics and sustainable communication systems (ICESC); 2024 Aug 7\u20139; Coimbatore, India","author":"Mehta J","year":"2024"},{"key":"e_1_2_9_12_1","first-page":"1674","volume-title":"Proceedings of the 2018 17th IEEE international conference on trust, security and privacy in computing and communications\/12th IEEE international conference on big data science and engineering (TrustCom\/BigDataSE); 2018 Aug 1\u20133; New York, NY","author":"Du X","year":"2018"},{"key":"e_1_2_9_13_1","first-page":"1","volume-title":"Proceedings of the 2017 International Conference on Cyber Security and Protection of Digital Services (Cyber Security), Jun 19\u201320","author":"Rajan AV","year":"2017"},{"key":"e_1_2_9_14_1","doi-asserted-by":"publisher","DOI":"10.1186\/s41935\u2010023\u201000336\u20103"},{"key":"e_1_2_9_15_1","first-page":"1","volume-title":"International conference for convergence of technology (I2CT); 2014 Apr 6\u20138; Pune, India","author":"Prajapati P","year":"2014"},{"key":"e_1_2_9_16_1","doi-asserted-by":"publisher","DOI":"10.17706\/jcp.12.4.362\u2010370"},{"key":"e_1_2_9_17_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-42280-0","volume-title":"Data deduplication for data optimization for storage and network systems","author":"Kim D","year":"2017"},{"key":"e_1_2_9_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116420"},{"key":"e_1_2_9_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119257"},{"key":"e_1_2_9_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177847"},{"key":"e_1_2_9_21_1","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-030-94029-4_14","volume-title":"Cyberspace safety and security: 13th international symposium, CSS 2021; 2021 Nov 9\u201311; held virtually","author":"Savi\u0107 I","year":"2022"},{"key":"e_1_2_9_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.diin.2017.01.008"},{"key":"e_1_2_9_23_1","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1418"},{"key":"e_1_2_9_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2021.3111535"},{"key":"e_1_2_9_25_1","unstructured":"HoytB.dhash: Python library to calculate the difference hash (perceptual hash) for a given image useful for detecting duplicates.https:\/\/github.com\/benhoyt\/dhash. Accessed 5 Jun 2026"},{"key":"e_1_2_9_26_1","first-page":"633","volume-title":"Proceedings of the 2019 USENIX annual technical conference (USENIX ATC 2019); 2019 Jul 10\u201312; Renton, WA","author":"Yang Q","year":"2019"},{"key":"e_1_2_9_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.06.023"},{"key":"e_1_2_9_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2016.2571298"},{"key":"e_1_2_9_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167\u20104048(92)90007\u2010E"},{"key":"e_1_2_9_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3047307"},{"key":"e_1_2_9_31_1","doi-asserted-by":"publisher","DOI":"10.5120\/ijca2020920014"},{"key":"e_1_2_9_32_1","volume-title":"Cryptography and network security: principles and practice","author":"Stallings W","year":"2020"},{"key":"e_1_2_9_33_1","volume-title":"Scalable hash tables [dissertation]","author":"Maier T","year":"2021"},{"key":"e_1_2_9_34_1","unstructured":"ColletY.xxHash: Extremely fast non\u2010cryptographic hash algorithm.https:\/\/github.com\/Cyan4973\/xxHash. Accessed 5 Jun 2026."},{"key":"e_1_2_9_35_1","volume-title":"Cryptography engineering: design principles and practical applications","author":"Ferguson N","year":"2011"},{"key":"e_1_2_9_36_1","doi-asserted-by":"publisher","DOI":"10.3390\/fi3010031"},{"key":"e_1_2_9_37_1","doi-asserted-by":"publisher","DOI":"10.5755\/j01.eee.18.10.3069"},{"key":"e_1_2_9_38_1","first-page":"160","volume-title":"Information security theory and practice: security and privacy of Mobile devices in wireless communication","author":"Hoerder S","year":"2011"},{"key":"e_1_2_9_39_1","first-page":"1","volume-title":"Proceedings of the 2019 4th International Conference on Computational Systems and Information Technology for Sustainable Solutions (CSITSS); 2019 Dec 20\u201321; Bengaluru, India","author":"Rao V","year":"2019"},{"key":"e_1_2_9_40_1","first-page":"12","volume-title":"Proceedings of the 2020 IEEE International Conference on Distributed Computing, VLSI, Electrical Circuits and Robotics (DISCOVER); 2020 Oct 30\u201331; Udupi, India","author":"Rao V","year":"2020"},{"key":"e_1_2_9_41_1","first-page":"1","volume-title":"Proceedings of the IEEE international conference on communications (ICC 2020); 2020 Jun 7\u201311; Dublin, Ireland","author":"Sarker VK","year":"2020"},{"key":"e_1_2_9_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2023.3276936"},{"key":"e_1_2_9_43_1","first-page":"91","volume-title":"Proceedings of the 11th Latin\u2010American symposium on dependable computing (LADC 2022); 2022 Nov 22\u201325; Natal, Brazil","author":"Mosca EE","year":"2022"},{"key":"e_1_2_9_44_1","first-page":"51","volume-title":"Proceedings of the world conference on information Systems for Business Management (ISBM 2024); 2024 Dec 20\u201321; Ahmedabad, India","author":"Prajapati P","year":"2025"},{"key":"e_1_2_9_45_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-44757-4","volume-title":"The hash function BLAKE","author":"Aumasson JP","year":"2014"},{"key":"e_1_2_9_46_1","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-642-38980-1_8","volume-title":"Applied cryptography and network security: 11th international conference, ACNS 2013; 2013 Jun 25\u201328; Banff, AB, Canada","author":"Aumasson JP","year":"2013"},{"key":"e_1_2_9_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.diin.2019.01.020"},{"key":"e_1_2_9_48_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-47131-6","volume-title":"Cyber and digital forensic investigations","author":"Le\u2010Khac NA","year":"2020"},{"key":"e_1_2_9_49_1","doi-asserted-by":"crossref","DOI":"10.1002\/9781119795667","volume-title":"Cyber security and digital forensics: challenges and future trends","author":"Ghonge MM","year":"2022"},{"key":"e_1_2_9_50_1","doi-asserted-by":"crossref","DOI":"10.1201\/9781003369479","volume-title":"Advancements in cybercrime investigation and digital forensics","author":"Harisha A","year":"2023"},{"key":"e_1_2_9_51_1","volume-title":"Introduction to algorithms","author":"Cormen TH","year":"2022"},{"key":"e_1_2_9_52_1","unstructured":"Storage Networking Industry Association.Understanding data deduplication ratios.https:\/\/www.snia.org\/sites\/default\/files\/Understanding_Data_Deduplication_Ratios\u201020080718.pdf. Accessed 5 Jun 2026"},{"key":"e_1_2_9_53_1","unstructured":"Oracle Corporation.What is data deduplication? Methods and benefits.https:\/\/www.oracle.com\/in\/data\u2010deduplication\/. Accessed 5 Jun 2026"},{"key":"e_1_2_9_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2078861.2078864"}],"container-title":["Journal of Forensic Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/1556-4029.70442","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1111\/1556-4029.70442","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/1556-4029.70442","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T04:04:43Z","timestamp":1786939483000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/1556-4029.70442"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,16]]},"references-count":53,"alternative-id":["10.1111\/1556-4029.70442"],"URL":"https:\/\/doi.org\/10.1111\/1556-4029.70442","archive":["Portico"],"relation":{},"ISSN":["0022-1198","1556-4029"],"issn-type":[{"value":"0022-1198","type":"print"},{"value":"1556-4029","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8,16]]},"assertion":[{"value":"2026-04-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-07-15","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-08-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"1556-4029.70442"}}