{"title":"Rumor Detection with Bidirectional Graph Attention Networks","authors":"Xiaohui Yang, Hailong Ma, Miao Wang","doi":"10.1155/2022/4840997","DOIUrl":"https://doi.org/10.1155/2022/4840997","url":null,"abstract":"In order to extract the relevant features of rumors effectively, this paper proposes a novel rumor detection model with bidirectional graph attention network on the basis of constructing a directed graph, named P-BiGAT. Firstly, this model builds the propagation tree and diffusion tree through the tweet comment and reposting relationship. Secondly, the improved graph attention network (GAT) is used to extract the propagation feature and the diffusion feature through two different directions, and the multihead attention mechanism is used to extract the semantic information of the source tweet. Finally, the propagation feature, diffusion feature, and semantic information representation of the source tweet are connected together through a fully connected layer, and the mapping function is used to determine the authenticity of the information. In addition, this paper also proposes a new node update method and applies it to the model in order to select neighbor node information effectively. Specifically, it can select the neighbor information node with larger weight to update the node according to the weight of the neighbor node. The results of the experiment show that the model is better than the baseline method of comparison in accuracy, precision, recall, and F1 measure on the public datasets.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125227182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zhenjie Huang, Yafeng Guo, Hui Huang, R. Duan, Xiaolong Zhao
{"title":"Analysis and Improvement of Blockchain-Based Multilevel Privacy-Preserving Location Sharing Scheme for Telecare Medical Information Systems","authors":"Zhenjie Huang, Yafeng Guo, Hui Huang, R. Duan, Xiaolong Zhao","doi":"10.1155/2022/1926902","DOIUrl":"https://doi.org/10.1155/2022/1926902","url":null,"abstract":"Patient location sharing is an important part of modern smart healthcare and mobile medical services. Blockchain has many attractive properties and is suitable for managing patient locations in telecare medical information systems (TMIS). Recently, Ji et al. proposed a blockchain-based multilevel privacy-preserving location sharing (BMPLS) scheme for TMIS. In this paper, we show that Ji et al.’s BMPLS scheme does not achieve confidentiality and multilevel privacy-preserving. An adversary outside the system can use an ordinary personal computer to completely break the system within a dozen hours and obtain the location of any patient at any time. The adversary inside the system can use an ordinary personal computer to obtain the location of the designated patient within tens of seconds. Using salting technology, we propose an improved BMPLS scheme to fix our attacks. We also optimized the BMLS scheme to make it correct and executable. The security analysis shows that the improved BMPLS scheme achieves decentralization, untamperability, confidentiality, multilevel privacy-preserving, retrievability, and verifiability. The simulation shows that the improved BMPLS scheme is practical, the computational overhead of the location record phase is within 10 ms, and the computational overheads of the location sharing and location extraction phases are both within 30 ms.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"2022 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130024247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Deep Neural Embedding for Software Vulnerability Discovery: Comparison and Optimization","authors":"Xue Yuan, Guanjun Lin, Yonghang Tai, Jun Zhang","doi":"10.1155/2022/5203217","DOIUrl":"https://doi.org/10.1155/2022/5203217","url":null,"abstract":"Due to multitudinous vulnerabilities in sophisticated software programs, the detection performance of existing approaches requires further improvement. Multiple vulnerability detection approaches have been proposed to aid code inspection. Among them, there is a line of approaches that apply deep learning (DL) techniques and achieve promising results. This paper attempts to utilize CodeBERT which is a deep contextualized model as an embedding solution to facilitate the detection of vulnerabilities in C open-source projects. The application of CodeBERT for code analysis allows the rich and latent patterns within software code to be revealed, having the potential to facilitate various downstream tasks such as the detection of software vulnerability. CodeBERT inherits the architecture of BERT, providing a stacked encoder of transformer in a bidirectional structure. This facilitates the learning of vulnerable code patterns which requires long-range dependency analysis. Additionally, the multihead attention mechanism of transformer enables multiple key variables of a data flow to be focused, which is crucial for analyzing and tracing potentially vulnerable data flaws, eventually, resulting in optimized detection performance. To evaluate the effectiveness of the proposed CodeBERT-based embedding solution, four mainstream-embedding methods are compared for generating software code embeddings, including Word2Vec, GloVe, and FastText. Experimental results show that CodeBERT-based embedding outperforms other embedding models on the downstream vulnerability detection tasks. To further boost performance, we proposed to include synthetic vulnerable functions and perform synthetic and real-world data fine tuning to facilitate the model learning of C-related vulnerable code patterns. Meanwhile, we explored the suitable configuration of CodeBERT. The evaluation results show that the model with new parameters outperform some state-of-the-art detection methods in our dataset.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127305106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Black-Box Adversarial Attacks against Audio Forensics Models","authors":"Yi Jiang, Dengpan Ye","doi":"10.1155/2022/6410478","DOIUrl":"https://doi.org/10.1155/2022/6410478","url":null,"abstract":"Speech synthesis technology has made great progress in recent years and is widely used in the Internet of things, but it also brings the risk of being abused by criminals. Therefore, a series of researches on audio forensics models have arisen to reduce or eliminate these negative effects. In this paper, we propose a black-box adversarial attack method that only relies on output scores of audio forensics models. To improve the transferability of adversarial attacks, we utilize the ensemble-model method. A defense method is also designed against our proposed attack method under the view of the huge threat of adversarial examples to audio forensics models. Our experimental results on 4 forensics models trained on the LA part of the ASVspoof 2019 dataset show that our attacks can get a \u0000 \u0000 99\u0000 %\u0000 \u0000 attack success rate on score-only black-box models, which is competitive to the best of white-box attacks, and \u0000 \u0000 60\u0000 %\u0000 \u0000 attack success rate on decision-only black-box models. Finally, our defense method reduces the attack success rate to \u0000 \u0000 16\u0000 %\u0000 \u0000 and guarantees \u0000 \u0000 98\u0000 %\u0000 \u0000 detection accuracy of forensics models.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116295975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Lightweight Flow Feature-Based IoT Device Identification Scheme","authors":"Ruizhong Du, Jingze Wang, Shuang Li","doi":"10.1155/2022/8486080","DOIUrl":"https://doi.org/10.1155/2022/8486080","url":null,"abstract":"Internet of Things (IoT) device identification is a key step in the management of IoT devices. The devices connected to the network must be controlled by the manager. For this purpose, many schemes are proposed to identify IoT devices, especially the schemes working on the gateway. However, almost all researchers do not pay close attention to the cost. Thus, considering the gateway’s limited storage and computational resources, a new lightweight IoT device identification scheme is proposed. First, the DFI (deep/dynamic flow inspection) technology is utilized to efficiently extract flow-related statistical features based on in-depth studies. Then, combined with symmetric uncertainty and correlation coefficient, we proposed a novel filter feature selection method based on NSGA-III to select effective features for IoT device identification. We evaluate our proposed method by using a real smart home IoT data set and three different ML algorithms. The experimental results showed that our proposed method is lightweight and the feature selection algorithm is also effective, only using 6 features can achieve 99.5% accuracy with a 3-minute time interval.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122385177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"BCST-APTS: Blockchain and CP-ABE Empowered Data Supervision, Sharing, and Privacy Protection Scheme for Secure and Trusted Agricultural Product Traceability System","authors":"Guofeng Zhang, Xiao Chen, Bin Feng, Xuchao Guo, Xia Hao, Henggang Ren, Chunyan Dong, Yanan Zhang","doi":"10.1155/2022/2958963","DOIUrl":"https://doi.org/10.1155/2022/2958963","url":null,"abstract":"Blockchain provides new technologies and ideas for the construction of agricultural product traceability system (APTS). However, if data is stored, supervised, and distributed on a multiparty equal blockchain, it will face major security risks, such as data privacy leakage, unauthorized access, and trust issues. How to protect the privacy of shared data has become a key factor restricting the implementation of this technology. We propose a secure and trusted agricultural product traceability system (BCST-APTS), which is supported by blockchain and CP-ABE encryption technology. It can set access control policies through data attributes and encrypt data on the blockchain. This can not only ensure the confidentiality of the data stored in the blockchain, but also set flexible access control policies for the data. In addition, a whole-chain attribute management infrastructure has been constructed, which can provide personalized attribute encryption services. Furthermore, a reencryption scheme based on ciphertext-policy attribute encryption (RE-CP-ABE) is proposed, which can meet the needs of efficient supervision and sharing of ciphertext data. Finally, the system architecture of the BCST-APTS is designed to successfully solve the problems of mutual trust, privacy protection, fine-grained, and personalized access control between all parties.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114835084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Muhammad Asghar Khan, Insaf Ullah, M. Alsharif, A. Alghtani, A. Aly, Chien‐Ming Chen
{"title":"An Efficient Certificate-Based Aggregate Signature Scheme for Internet of Drones","authors":"Muhammad Asghar Khan, Insaf Ullah, M. Alsharif, A. Alghtani, A. Aly, Chien‐Ming Chen","doi":"10.1155/2022/9718580","DOIUrl":"https://doi.org/10.1155/2022/9718580","url":null,"abstract":"Internet of drones (IoD) is a network of small drones that leverages IoT infrastructure to deliver real-time data communication services to users. On the one hand, IoD is an excellent choice for a number of military and civilian applications owing to key characteristics like agility, low cost, and ease of deployment; on the other hand, small drones are rarely designed with security and privacy concerns in mind. Intruders can exploit this vulnerability to compromise the security and privacy of IoD networks and harm the information exchange operation. An aggregate signature scheme is the best solution for resolving security and privacy concerns since multiple drones are connected in IoD networks to gather data from a certain zone. However, most aggregate signature schemes proposed in the past for this purpose are either identity-based or relied on certificateless cryptographic methods. Using these methods, a central authority known as a trusted authority (TA) is responsible for generating and distributing secret keys of every user. However, the key escrow problem is formulated as knowing the secret key generated by the TA. These methods are hampered by key distribution issues, which restrict their applicability in a variety of situations. To address these concerns, this paper presents a certificate-based aggregate signature (CBS-AS) scheme based on hyperelliptic curve cryptography (HECC). The proposed scheme has been shown to be both efficient in terms of computation cost and unforgeable while testing its toughness through formal security analysis.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126158962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Containing Misinformation Spread: A Collaborative Resource Allocation Strategy for Knowledge Popularization and Expert Education","authors":"Linhong Li, Kaifan Huang, Xiaofan Yang","doi":"10.1155/2022/4510694","DOIUrl":"https://doi.org/10.1155/2022/4510694","url":null,"abstract":"With the prevalence of online social networks, the potential threat of misinformation has greatly enhanced. Therefore, it is significant to study how to effectively control the spread of misinformation. Publishing the truth to the public is the most effective approach to controlling the spread of misinformation. Knowledge popularization and expert education are two complementary ways to achieve that. It has been proven that if these two ways can be combined to speed up the release of the truth, the impact caused by the spread of misinformation will be dramatically reduced. However, how to reasonably allocate resources to these two ways so as to achieve a better result at a lower cost is still an open challenge. This paper provides a theoretical guidance for designing an effective collaborative resource allocation strategy. First, a novel individual-level misinformation spread model is proposed. It well characterizes the collaborative effect of the two truth-publishing ways on the containment of misinformation spread. On this basis, the expected cost of an arbitrary collaborative strategy is evaluated. Second, an optimal control problem is formulated to find effective strategies, with the expected cost as the performance index function and with the misinformation spread model as the constraint. Third, in order to solve the optimal control problem, an optimality system that specifies the necessary conditions of an optimal solution is derived. By solving the optimality system, a candidate optimal solution can be obtained. Finally, the effectiveness of the obtained candidate optimal solution is verified by a series of numerical experiments.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130705516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Differential Evolution and Multiclass Support Vector Machine for Alzheimer's Classification","authors":"Jhansi Rani Kaka, K. Prasad","doi":"10.1155/2022/7275433","DOIUrl":"https://doi.org/10.1155/2022/7275433","url":null,"abstract":"Early diagnosis of Alzheimer’s helps a doctor to decide the treatment for the patient based on the stages. The existing methods involve applying the deep learning methods for Alzheimer’s classification and have the limitations of overfitting problems. Some researchers were involved in applying the feature selection based on the optimization method, having limitations of easily trapping into local optima and poor convergence. In this research, Differential Evolution-Multiclass Support Vector Machine (DE-MSVM) is proposed to increase the performance of Alzheimer’s classification. The image normalization method is applied to enhance the quality of the image and represent the features effectively. The AlexNet model is applied to the normalized images to extract the features and also applied for feature selection. The Differential Evolution method applies Pareto Optimal Front for nondominated feature selection. This helps to select the feature that represents the characteristics of the input images. The selected features are applied in the MSVM method to represent in high dimension and classify Alzheimer’s. The DE-MSVM method has accuracy of 98.13% in the axial slice, and the existing whale optimization with MSVM has 95.23% accuracy.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125826154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Visual Dynamic Simulation Model of Unstructured Data in Social Networks","authors":"Zhang Xiang","doi":"10.1155/2022/9095330","DOIUrl":"https://doi.org/10.1155/2022/9095330","url":null,"abstract":"Social networks contain a large amount of unstructured data. To ensure the stability of unstructured big data, this study proposes a method for visual dynamic simulation model of unstructured data in social networks. This study uses the Hadoop platform and data visualization technology to establish a univariate linear regression model according to the time correlation between data, estimates and approximates perceptual data, and collects unstructured data of social networks. Then, the unstructured data collected from the original social network are processed, and an adaptive threshold is designed to filter out the influence of noise. The unstructured data of social network after feature analysis are processed to extract its visual features. Finally, this study carries out the Hadoop cluster design, implements data persistence by HDFS, uses MapReduce to extract data clusters for distributed computing, builds a visual dynamic simulation model of unstructured data in social network, and realizes the display of unstructured data in social network. The experimental results show that this method has a good visualization effect on unstructured data in social networks and can effectively improve the stability and efficiency of unstructured data visualization in social networks.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123348664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}