Secur. Commun. Networks最新文献_第4页

Module-LWE-Based Key Exchange Protocol Using Error Reconciliation Mechanism 基于错误协调机制的模块lwe密钥交换协议

Secur. Commun. Networks Pub Date : 2022-02-01 DOI: 10.1155/2022/8299232

Wenjuan Jia, Gu Xue, Baocang Wang, Yu-pu Hu

引用次数: 0

Anomaly Detection of System Call Sequence Based on Dynamic Features and Relaxed-SVM 基于动态特征和松弛支持向量机的系统调用序列异常检测

Secur. Commun. Networks Pub Date : 2022-02-01 DOI: 10.1155/2022/6401316

Xiaoyao Liao, Changzhi Wang, Wen Chen

{"title":"Anomaly Detection of System Call Sequence Based on Dynamic Features and Relaxed-SVM","authors":"Xiaoyao Liao, Changzhi Wang, Wen Chen","doi":"10.1155/2022/6401316","DOIUrl":"https://doi.org/10.1155/2022/6401316","url":null,"abstract":"The system call sequences of processes are important for host-based anomaly detection. However, the detection accuracy can be seriously degenerated by the subsequences which simultaneously appeared in the call sequences of both normal and abnormal processes. Furthermore, the detection may be obstructed especially when the normal/abnormal distributions of subsequences are extremely imbalanced along with many ambiguous samples. In the paper, the system call sequences are divided into weighted subsequences with fixed-length. Secondly, a suffix tree of each system call sequence is constructed to automatically extract the variable-length subsequence from the longest repeated substring of the tree. The frequencies of the fixed-and variable-length subsequences that appeared in each system call sequence constitute its feature vector. Finally, vectors are input into a cost-sensitive and relaxed support vector machine, in which the penalty-free slack of the relaxed SVM is split independently between the two classes with different weights. The experimental results on two public datasets ADFA-LD and UNM showed that the AUC of the proposed method can reach 99%, while the false alarm rate is only 2.4%.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"2022 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130947207","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}

引用次数: 4

Individual Attribute and Cascade Influence Capability-Based Privacy Protection Method in Social Networks 基于个体属性和级联影响能力的社交网络隐私保护方法

Secur. Commun. Networks Pub Date : 2022-02-01 DOI: 10.1155/2022/6338123

Jing Zhang, Sitong Shi, Cai-Jie Weng, Li Xu

{"title":"Individual Attribute and Cascade Influence Capability-Based Privacy Protection Method in Social Networks","authors":"Jing Zhang, Sitong Shi, Cai-Jie Weng, Li Xu","doi":"10.1155/2022/6338123","DOIUrl":"https://doi.org/10.1155/2022/6338123","url":null,"abstract":"Users can obtain intelligent services by sharing information in social networks. Big data technologies can discover underlying benefits from this information. However, stringent security concern is raised at the same time. The public data can be utilized by adversaries, which will bring dire consequences. In this paper, the influence maximization problem is investigated in a privacy protection environment, which aims to find a subset of secure users that can make the spread of influence maximization and privacy disclosure minimization. At first, in order to estimate the risk level for each user, a Bayesian-based individual privacy risk evaluation model is proposed to rank the individual risk levels. Secondly, as the aim is to measure the influence capability for each user, a cascade influence capability evaluation model is designed to rank the friend influence capability levels. Finally, based on these two factors, a privacy protection method is designed for solving the influence maximization with attack constraint problem. In addition, the comparison experiments show that our method can achieve the goal of influence maximization and privacy disclosure minimization efficiently.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"62 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125937607","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}

引用次数: 3

Reversible Data Hiding Based on Multiple Pairwise PEE and Two-Layer Embedding 基于多重成对PEE和两层嵌入的可逆数据隐藏

Secur. Commun. Networks Pub Date : 2022-01-31 DOI: 10.1155/2022/2051058

Wenguang He, Gangqiang Xiong, Yaomin Wang

{"title":"Reversible Data Hiding Based on Multiple Pairwise PEE and Two-Layer Embedding","authors":"Wenguang He, Gangqiang Xiong, Yaomin Wang","doi":"10.1155/2022/2051058","DOIUrl":"https://doi.org/10.1155/2022/2051058","url":null,"abstract":"Recent reversible data hiding (RDH) work tends to realize adaptive embedding by discriminately modifying pixels according to image content. However, further optimization and computational complexity remain great challenges. By presenting a better incorporation of pixel value ordering (PVO) prediction and pairwise prediction-error expansion (PEE) technologies, this paper proposes a new RDH scheme. The largest/smallest three pixels of each block are utilized to generate error-pairs. To achieve optimization of the distribution of error pairs, two-layer embedding is introduced such that full-enclosed pixels of each block can be used to determine how to optimally define the spatial location of pixels within block. Then, to modify error pairs with less distortion introduced, the shifted pairing error is involved in the separable utilization of the other one; i.e., it serves as the context for recalculating the other one. Since the recalculation is equivalent to expansion bins selection, various extensions of original pairwise PEE are designed, parameterized, and combined into the so-called multiple pairwise PEE, with which the 2D histogram can be divided into a set of sub-ones for more accurate modification. The experimental results verify the superiority of the proposed scheme over several PVO-based schemes. On the Kodak image database, the average PSNR gains over original PVO-based pairwise PEE are 0.83 and 0.99 dB for capacities of 10,000 and 20,000 bits, respectively.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114707829","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}

引用次数: 3

A Method of the Active and Passive Event Service Based on the Sensor Web 一种基于传感器Web的主动和被动事件服务方法

Secur. Commun. Networks Pub Date : 2022-01-31 DOI: 10.1155/2022/2578744

Lan Liu, Jingjing Fan, Chengfan Li, Xuefeng Liu

{"title":"A Method of the Active and Passive Event Service Based on the Sensor Web","authors":"Lan Liu, Jingjing Fan, Chengfan Li, Xuefeng Liu","doi":"10.1155/2022/2578744","DOIUrl":"https://doi.org/10.1155/2022/2578744","url":null,"abstract":"The intelligent information system constructed by the sensor web can monitor all kinds of sudden abnormal events, improve the ability of event discovery and rapid disposal, and promote the development of smart city and the construction of the Internet of Things (IoT). In this paper, we consider the problem of complex integration and poor expansibility in the large-scale full-network operation and maintenance system construction and propose an active and passive event service (APES) method based on the sensor web. In the APES, a system framework with the perception layer, data service layer, event service layer, and user layer is firstly defined and constructed. Secondly, a middleware with the ability to active and passive event service (APES) is designed and implemented based on the system framework. Finally, taking abnormal weather and fire warning as examples, the performance of the proposed event service middleware is tested, respectively. Experimental results show that the proposed APES model in this paper has the advantages of high precision, stable operation, and strong practicability and solves “Information Island” and low reusability in the whole network operation and maintenance system. This is an attempt at the structural design of a similar intelligent information system.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114936702","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}

引用次数: 0

A Method for Identifying Tor Users Visiting Websites Based on Frequency Domain Fingerprinting of Network Traffic 一种基于网络流量频域指纹识别的Tor访问用户识别方法

Secur. Commun. Networks Pub Date : 2022-01-31 DOI: 10.1155/2022/3306098

Yuchen Sun, X. Luo, Han Wang, Zhaorui Ma

{"title":"A Method for Identifying Tor Users Visiting Websites Based on Frequency Domain Fingerprinting of Network Traffic","authors":"Yuchen Sun, X. Luo, Han Wang, Zhaorui Ma","doi":"10.1155/2022/3306098","DOIUrl":"https://doi.org/10.1155/2022/3306098","url":null,"abstract":"Although the anonymous communication network Tor can protect the security of users’ data and privacy during their visits to the Internet, it also facilitates illegal users to access illegal websites. Website fingerprinting attacks can identify the websites that users are visiting to discern whether they are performing illegal operations. Existing methods tend to manually extract the traffic features of users visiting websites and construct machine learning or deep learning models to classify the features. While these methods can be effective in classifying unknown website traffic, the effect of classification in the use of defensive measures or onion service scenarios is not yet ideal. This paper proposes a method to identify Tor users visiting websites based on frequency domain fingerprinting of network traffic (FDF). We extract the direction and length features of circuit sequences in access traffic and combine and transform them into the frequency domain. The classification of access traffic is accomplished by using a deep learning classification model combining CNN, FC, and Self-Attention. In this paper, the proposed FDF method is experimentally validated in common scenarios of Tor networks. The results show that FDF outperforms the existing methods for classification in different Tor scenarios. It can achieve 98.8% and 94.3% classification accuracy in undefended and WTF-PAD defense scenarios, respectively. In the onion service scenario, the accuracy is improved by 4.7% over the current state-of-the-art Tik-Tok method.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126719166","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}

引用次数: 3

Research on Fast Recommendation Algorithm of Library Personalized Information Based on Density Clustering 基于密度聚类的图书馆个性化信息快速推荐算法研究

Secur. Commun. Networks Pub Date : 2022-01-29 DOI: 10.1155/2022/1169115

Y. Shi, Yuelong Zhu

引用次数: 4

An Android Malicious Application Detection Method with Decision Mechanism in the Operating Environment of Blockchain 区块链运行环境下具有决策机制的Android恶意应用检测方法

Secur. Commun. Networks Pub Date : 2022-01-29 DOI: 10.1155/2022/3111540

Xingyu Li, Zongqu Zhao, Yongli Tang, Jing Zhang, Chengyi Wu, Ying Li

{"title":"An Android Malicious Application Detection Method with Decision Mechanism in the Operating Environment of Blockchain","authors":"Xingyu Li, Zongqu Zhao, Yongli Tang, Jing Zhang, Chengyi Wu, Ying Li","doi":"10.1155/2022/3111540","DOIUrl":"https://doi.org/10.1155/2022/3111540","url":null,"abstract":"Recently, security policies and behaviour detection methods have been proposed to improve the security of blockchain by many researchers. However, these methods cannot discover the source of typical behaviours, such as the malicious applications in the blockchain environment. Android application is an important part of the blockchain operating environment, and machine learning-based Android malware application detection method is significant for blockchain user security. The way of constructing features in these methods determines the performance. The single-feature mechanism, training classifiers with one type of features, cannot detect the malicious applications effectively which exhibit the typical behaviours in various forms. The multifeatures fusion mechanism, constructing mixed features from multiple types of data sources, can cover more kinds of information. However, different types of data sources will interfere with each other in the mixed features constructed by this mechanism. That limits the performance of the model. In order to improve the detection performance of Android malicious applications in complex scenarios, we propose an Android malicious application detection method which includes parallel feature processing and decision mechanism. Our method uses RGB image visualization technology to construct three types of RGB image which are utilized to train different classifiers, respectively, and a decision mechanism is designed to fuse the outputs of subclassifiers through weight analysis. This approach simultaneously extracts different types of features, which preserve application information comprehensively. Different classifiers are trained by these features to guarantee independence of each feature and classifier. On this basis, a comprehensive analysis of many methods is performed on the Android malware dataset, and the results show that our method has better efficiency and adaptability than others.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122884127","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}

引用次数: 0

An Improved Image Steganography Framework Based on Y Channel Information for Neural Style Transfer 一种改进的基于Y通道信息的图像隐写框架用于神经风格迁移

Secur. Commun. Networks Pub Date : 2022-01-29 DOI: 10.1155/2022/2641615

Wen-Bin Lin, Xueke Zhu, Wujian Ye, Chinchen Chang, Yijun Liu, Chengmin Liu

{"title":"An Improved Image Steganography Framework Based on Y Channel Information for Neural Style Transfer","authors":"Wen-Bin Lin, Xueke Zhu, Wujian Ye, Chinchen Chang, Yijun Liu, Chengmin Liu","doi":"10.1155/2022/2641615","DOIUrl":"https://doi.org/10.1155/2022/2641615","url":null,"abstract":"Neural style transfer has effectively assisted artistic design in recent years, but it has also accelerated the tampering, synthesis, and dissemination of a large number of digital image resources without permission, resulting in a large number of copyright disputes. Image steganography can hide secret information in cover images to realize copyright protection, but the existing methods have poor robustness, which is hard to extract the original secret information from stylized steganographic (stego) images. To solve the above problem, we propose an improved image steganography framework for neural style transfer based on Y channel information and a novel structural loss, composed of an encoder, a style transfer network, and a decoder. By introducing a structural loss to restrain the process of network training, the encoder can embed the gray-scale secret image into Y channel of the cover image and then generate steganographic image, while the decoder can directly extract the above secret image from a stylized stego image output by the style transfer network. The experimental results demonstrate that the proposed method can effectively recover the original secret information from the stylized stego image, and the PSNR of the extracted secret image and the original secret image can reach 23.4 and 27.29 for the gray-scale secret image and binary image with the size of 256×256, respectively, maintaining most of the details and semantics. Therefore, the proposed method can not only preserve most of the secret information embedded in a stego image during the stylization process, but also help to further hide secret information and avoid steganographic attacks to a certain extent due to the stylization of a stego image, thus protecting secret information like copyright.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"372 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122853625","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}

引用次数: 4

Antitampering Scheme of Evidence Transfer Information in Judicial System Based on Blockchain 基于区块链的司法系统证据传递信息防篡改方案

Secur. Commun. Networks Pub Date : 2022-01-29 DOI: 10.1155/2022/5804109

Jingjing Guo, Xuliang Wei, Yuling Zhang, Jianfeng Ma, Huamin Gao, Libo Wang, Zhiquan Liu

{"title":"Antitampering Scheme of Evidence Transfer Information in Judicial System Based on Blockchain","authors":"Jingjing Guo, Xuliang Wei, Yuling Zhang, Jianfeng Ma, Huamin Gao, Libo Wang, Zhiquan Liu","doi":"10.1155/2022/5804109","DOIUrl":"https://doi.org/10.1155/2022/5804109","url":null,"abstract":"In the process of handling criminal cases, it is crucial to avoid evidence tampering and ensure the integrity, consistency, and nonrepudiation of evidence transfer records, which is highly related to the fairness and credibility of the judiciary. To address this problem, we propose a consortium blockchain network to record evidence transfer events among different departments of China's judicial system. We design the format of a transaction and a block. In addition, the smart contracts for three types of transactions are also proposed. The Raft consensus algorithm is adopted to accomplish the consensus process. A security analysis shows that the proposed scheme can achieve the design goal (the integrity, consistency, and nonrepudiation of evidence transfer records stored in blockchain). Furthermore, a set of experiments were conducted to analyse the performance of the proposed scheme. The experiments results show that the throughput of the system is proportional to the send rate within a certain threshold. The latency decreases with increasing send rate if the send rate is within a certain threshold. Peer nodes in the system consume the most storage and communication cost. The values of block size and block generation interval time have a slight influence on the performance of the system.","PeriodicalId":167643,"journal":{"name":"Secur. Commun. Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126498644","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}

引用次数: 1