{"title":"增强机会主义移动社交网络中的数据完整性:利用伯克树和安全数据路由对抗攻击","authors":"Vimitha R. Vidhya Lakshmi , Gireesh Kumar T","doi":"10.1016/j.cose.2024.104133","DOIUrl":null,"url":null,"abstract":"<div><div>In Opportunistic Mobile Social Networks (OMSNs), ensuring data integrity is crucial. The anonymous and opportunistic nature of node communication makes these networks vulnerable to data integrity attacks. The existing literature identified significant shortcomings in effectively addressing data integrity attacks with high efficiency and accuracy. This paper addresses these issues by proposing the \"Berkle Tree\", a novel data structure designed to mitigate data integrity attacks in OMSNs. The Berkle Tree leverages the EvolvedBloom filter, which is a variant of the bloom filter with a negligible False Positive Rate (FPR). The key contributions of this study include i) an innovative application of EvolvedBloom for membership testing and Berkle Tree root validation, and ii) comparative analysis with existing data structures like Merkle and Verkle Trees. The Berkle Tree demonstrates superior performance, reducing tree generation and integrity validation times and leading to substantial computational cost reductions of 79.50 % and 90.57 %, respectively. The proposed method integrates the Berkle Tree into OMSN routing models and evaluates performance against Packet Drop, Modification, and Fake Attacks (PDA, PMA, PFA). Results show average Malicious Node Detection Accuracy of 98.2 %, 85.2 %, and 94.4 %; Malicious Path Detection Accuracy of 98.6 %, 86.6 %, and 90.2 %; Malicious Data Detection Accuracy of 98.4 %, 80.2 %, and 93.4 %; and False Negative Rates of 1.8 %, 14.8 %, and 5.6 % for PDA, PMA, and PFA, respectively. The major findings demonstrate that the proposed approach significantly improves OMSN routing models by reducing Packet Dropping, Modifying, and Faking Rates by 48.62 %, 28.99 %, and 31.2 %, respectively. Compared to existing methods, the Berkle Tree achieves a substantial reduction in filter size by approximately 25 %–40 %, while maintaining a negligible FPR. These advancements contribute to the state-of-the-art of OMSNs by providing robust solutions for data integrity with significant implications for enhancing security and trustworthiness in OMSNs.</div></div>","PeriodicalId":51004,"journal":{"name":"Computers & Security","volume":"148 ","pages":"Article 104133"},"PeriodicalIF":4.8000,"publicationDate":"2024-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhancing data integrity in opportunistic mobile social network: Leveraging Berkle Tree and secure data routing against attacks\",\"authors\":\"Vimitha R. Vidhya Lakshmi , Gireesh Kumar T\",\"doi\":\"10.1016/j.cose.2024.104133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In Opportunistic Mobile Social Networks (OMSNs), ensuring data integrity is crucial. The anonymous and opportunistic nature of node communication makes these networks vulnerable to data integrity attacks. The existing literature identified significant shortcomings in effectively addressing data integrity attacks with high efficiency and accuracy. This paper addresses these issues by proposing the \\\"Berkle Tree\\\", a novel data structure designed to mitigate data integrity attacks in OMSNs. The Berkle Tree leverages the EvolvedBloom filter, which is a variant of the bloom filter with a negligible False Positive Rate (FPR). The key contributions of this study include i) an innovative application of EvolvedBloom for membership testing and Berkle Tree root validation, and ii) comparative analysis with existing data structures like Merkle and Verkle Trees. The Berkle Tree demonstrates superior performance, reducing tree generation and integrity validation times and leading to substantial computational cost reductions of 79.50 % and 90.57 %, respectively. The proposed method integrates the Berkle Tree into OMSN routing models and evaluates performance against Packet Drop, Modification, and Fake Attacks (PDA, PMA, PFA). Results show average Malicious Node Detection Accuracy of 98.2 %, 85.2 %, and 94.4 %; Malicious Path Detection Accuracy of 98.6 %, 86.6 %, and 90.2 %; Malicious Data Detection Accuracy of 98.4 %, 80.2 %, and 93.4 %; and False Negative Rates of 1.8 %, 14.8 %, and 5.6 % for PDA, PMA, and PFA, respectively. The major findings demonstrate that the proposed approach significantly improves OMSN routing models by reducing Packet Dropping, Modifying, and Faking Rates by 48.62 %, 28.99 %, and 31.2 %, respectively. Compared to existing methods, the Berkle Tree achieves a substantial reduction in filter size by approximately 25 %–40 %, while maintaining a negligible FPR. These advancements contribute to the state-of-the-art of OMSNs by providing robust solutions for data integrity with significant implications for enhancing security and trustworthiness in OMSNs.</div></div>\",\"PeriodicalId\":51004,\"journal\":{\"name\":\"Computers & Security\",\"volume\":\"148 \",\"pages\":\"Article 104133\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2024-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Security\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167404824004383\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Security","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167404824004383","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Enhancing data integrity in opportunistic mobile social network: Leveraging Berkle Tree and secure data routing against attacks
In Opportunistic Mobile Social Networks (OMSNs), ensuring data integrity is crucial. The anonymous and opportunistic nature of node communication makes these networks vulnerable to data integrity attacks. The existing literature identified significant shortcomings in effectively addressing data integrity attacks with high efficiency and accuracy. This paper addresses these issues by proposing the "Berkle Tree", a novel data structure designed to mitigate data integrity attacks in OMSNs. The Berkle Tree leverages the EvolvedBloom filter, which is a variant of the bloom filter with a negligible False Positive Rate (FPR). The key contributions of this study include i) an innovative application of EvolvedBloom for membership testing and Berkle Tree root validation, and ii) comparative analysis with existing data structures like Merkle and Verkle Trees. The Berkle Tree demonstrates superior performance, reducing tree generation and integrity validation times and leading to substantial computational cost reductions of 79.50 % and 90.57 %, respectively. The proposed method integrates the Berkle Tree into OMSN routing models and evaluates performance against Packet Drop, Modification, and Fake Attacks (PDA, PMA, PFA). Results show average Malicious Node Detection Accuracy of 98.2 %, 85.2 %, and 94.4 %; Malicious Path Detection Accuracy of 98.6 %, 86.6 %, and 90.2 %; Malicious Data Detection Accuracy of 98.4 %, 80.2 %, and 93.4 %; and False Negative Rates of 1.8 %, 14.8 %, and 5.6 % for PDA, PMA, and PFA, respectively. The major findings demonstrate that the proposed approach significantly improves OMSN routing models by reducing Packet Dropping, Modifying, and Faking Rates by 48.62 %, 28.99 %, and 31.2 %, respectively. Compared to existing methods, the Berkle Tree achieves a substantial reduction in filter size by approximately 25 %–40 %, while maintaining a negligible FPR. These advancements contribute to the state-of-the-art of OMSNs by providing robust solutions for data integrity with significant implications for enhancing security and trustworthiness in OMSNs.
期刊介绍:
Computers & Security is the most respected technical journal in the IT security field. With its high-profile editorial board and informative regular features and columns, the journal is essential reading for IT security professionals around the world.
Computers & Security provides you with a unique blend of leading edge research and sound practical management advice. It is aimed at the professional involved with computer security, audit, control and data integrity in all sectors - industry, commerce and academia. Recognized worldwide as THE primary source of reference for applied research and technical expertise it is your first step to fully secure systems.