Pub Date : 2021-01-01DOI: 10.6633/IJNS.202101_23(1).08
Yong-Bing Zhang, Qiu-yu Zhang, Yan Yan, Yiqiang Jiang, Mo-yi Zhang
In order to solve the problem of out-off-balance caused by accuracy of location information between privacy protection security and query service quality, considering basic information comprehensively such as the environment and geographical features and so on, and adopting k- anonymous privacy protection mechanism, we present a k-anonymous location privacy protection method of polygon based on density distribution. Firstly, a k-anonymous irregular polygon region is structured in whole area. Then, according to the preset anonymous region and density threshold, the better effects of anonymous are obtained by expanding the region or adding the random dummy locations. Experimental results show that the proposed method improves the efficiency of anonymous and query accuracy. The balance between privacy protection security and query quality is achieved.
{"title":"A k-Anonymous Location Privacy Protection Method of Polygon Based on Density Distribution","authors":"Yong-Bing Zhang, Qiu-yu Zhang, Yan Yan, Yiqiang Jiang, Mo-yi Zhang","doi":"10.6633/IJNS.202101_23(1).08","DOIUrl":"https://doi.org/10.6633/IJNS.202101_23(1).08","url":null,"abstract":"In order to solve the problem of out-off-balance caused by accuracy of location information between privacy protection security and query service quality, considering basic information comprehensively such as the environment and geographical features and so on, and adopting k- anonymous privacy protection mechanism, we present a k-anonymous location privacy protection method of polygon based on density distribution. Firstly, a k-anonymous irregular polygon region is structured in whole area. Then, according to the preset anonymous region and density threshold, the better effects of anonymous are obtained by expanding the region or adding the random dummy locations. Experimental results show that the proposed method improves the efficiency of anonymous and query accuracy. The balance between privacy protection security and query quality is achieved.","PeriodicalId":93303,"journal":{"name":"International journal of network security & its applications","volume":"42 1","pages":"57-66"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84518428","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}
Pub Date : 2021-01-01DOI: 10.6633/IJNS.202101_23(1).17
Zeyu Wang, Min-Xu Gao, Lu Chen, Shimin Sun
In the era of rapid development of information, people are spreading and sharing information all the time. These resources bring us a lot of privacy challenges while bringing us convenience. Therefore, We propose an attribute based encryption access control scheme based on access tree structure pruning (ATSP-ABE). The scheme mainly prune the branch of the ID attribute of the right subtree user managed by the Data Owner (DO) and design the permission access attribute as the leaf node to replace the branch. For the left subtree of the access tree managed by the Attribute Authorization Center (AAC) the decision tree is generated by the data of the user feature attribute and the subtree with the best pruning performance is selected as the pruning result. Finally, pruning the reduced feature attributes in the decision tree in the access left subtree. The experimental results show that the ATSPABE scheme can improve the computational efficiency of attribute-based access control encryption, decryption and user attribute revocation in cloud computing. More than that makes the access tree structure more concise and strengthen the DO control attribute ability. Reducing Calculation overhead in the process of encryption and decryption of DO and AAC.
在信息快速发展的时代，人们每时每刻都在传播和分享信息。这些资源在给我们带来便利的同时，也给我们带来了很多隐私方面的挑战。因此，我们提出了一种基于访问树结构修剪(ATSP-ABE)的基于属性的加密访问控制方案。该方案主要对DO (Data Owner)所管理的权限子树用户ID属性的分支进行剪枝，并将权限访问属性设计为叶子节点来代替该分支。对于属性授权中心(Attribute Authorization Center, AAC)管理的访问树的左子树，由用户特征属性数据生成决策树，并选择剪枝性能最好的子树作为剪枝结果。最后，在访问左子树中对决策树中的约简特征属性进行剪枝。实验结果表明，ATSPABE方案可以提高云计算中基于属性的访问控制加解密和用户属性撤销的计算效率。使访问树结构更加简洁，增强了DO控制属性能力。减少了DO和AAC加解密过程中的计算开销。
{"title":"An Access Control Scheme Based on Access Tree Structure Pruning for Cloud Computing","authors":"Zeyu Wang, Min-Xu Gao, Lu Chen, Shimin Sun","doi":"10.6633/IJNS.202101_23(1).17","DOIUrl":"https://doi.org/10.6633/IJNS.202101_23(1).17","url":null,"abstract":"In the era of rapid development of information, people are spreading and sharing information all the time. These resources bring us a lot of privacy challenges while bringing us convenience. Therefore, We propose an attribute based encryption access control scheme based on access tree structure pruning (ATSP-ABE). The scheme mainly prune the branch of the ID attribute of the right subtree user managed by the Data Owner (DO) and design the permission access attribute as the leaf node to replace the branch. For the left subtree of the access tree managed by the Attribute Authorization Center (AAC) the decision tree is generated by the data of the user feature attribute and the subtree with the best pruning performance is selected as the pruning result. Finally, pruning the reduced feature attributes in the decision tree in the access left subtree. The experimental results show that the ATSPABE scheme can improve the computational efficiency of attribute-based access control encryption, decryption and user attribute revocation in cloud computing. More than that makes the access tree structure more concise and strengthen the DO control attribute ability. Reducing Calculation overhead in the process of encryption and decryption of DO and AAC.","PeriodicalId":93303,"journal":{"name":"International journal of network security & its applications","volume":"27 1","pages":"143-156"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80730383","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}
Pub Date : 2021-01-01DOI: 10.1016/S1353-4858(21)00039-8
Sivaraman Eswaran, Aruna Srinivasan, Prasad B. Honnavalli
{"title":"A threshold-based, real-time analysis in early detection of endpoint anomalies using SIEM expertise","authors":"Sivaraman Eswaran, Aruna Srinivasan, Prasad B. Honnavalli","doi":"10.1016/S1353-4858(21)00039-8","DOIUrl":"https://doi.org/10.1016/S1353-4858(21)00039-8","url":null,"abstract":"","PeriodicalId":93303,"journal":{"name":"International journal of network security & its applications","volume":"44 1","pages":"7-16"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89077296","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}
Pub Date : 2021-01-01DOI: 10.5121/ijnsa.2021.13502
P. Pospiech, Aleksander Marianski, M. Kedziora
The paper focuses onintroducing a decentralized e-voting scheme that uses blockchain to achieve security and anonymity. A blockchain network based on Ethereum was applied, to provide a decentralized and distributed database based on the Peer-to-Peer architecture. During the implementation, smart contractswere used. Thanks to this, it is possible to code the terms of the contract required to perform the transaction. The proof-of-conceptimplementation uses the blind signature protocol and encryption with the RSA algorithm. Presented in this paper scheme for blockchain decentralized voting is fully implemented and potential issues are analyzed and discussed.
{"title":"Secure Blockchain Decentralized Voting for Verified Users","authors":"P. Pospiech, Aleksander Marianski, M. Kedziora","doi":"10.5121/ijnsa.2021.13502","DOIUrl":"https://doi.org/10.5121/ijnsa.2021.13502","url":null,"abstract":"The paper focuses onintroducing a decentralized e-voting scheme that uses blockchain to achieve security and anonymity. A blockchain network based on Ethereum was applied, to provide a decentralized and distributed database based on the Peer-to-Peer architecture. During the implementation, smart contractswere used. Thanks to this, it is possible to code the terms of the contract required to perform the transaction. The proof-of-conceptimplementation uses the blind signature protocol and encryption with the RSA algorithm. Presented in this paper scheme for blockchain decentralized voting is fully implemented and potential issues are analyzed and discussed.","PeriodicalId":93303,"journal":{"name":"International journal of network security & its applications","volume":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87371029","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}
Pub Date : 2020-11-01DOI: 10.6633/IJNS.202011_22(6).04
Yanpeng Cui, Zichuan Jin, Jianwei Hu
At present, traditional intrusion detection methods have some shortcomings, such as long detection time, low detection accuracy and poor classification effect. This paper will combine PCA and OCSVM algorithm to build a multi-level intrusion detection model, using attack feature analysis method to preprocess data, while data cleaning and data feature selection of training set. It highlights the characteristics of abnormal data and normal data, and weakens the influence of irrelevant features on training model. PCA algorithm is used to process data to improve detection rate and reduce noise. Different models are trained by different data features to detect four attack types, namely Probe, DDOS, R2L and U2R. The optimal dimension of PCA is automatically obtained by calculating the contribution rate M of feature, which improves the traditional method that requires frequent input of K value. The model is trained by using OCSVM algorithm based on RBF core, and the disadvantage of poor classification effect of OCSVM algorithm is eliminated through improved multi-layer detection mechanism. Finally, the KDDCUP99 data set is used for experimental verification. The results show that the proposed method has more advantages than the traditional detection method.
{"title":"Research on Intrusion Detection Method Based on Hierarchical Self-convergence PCA-OCSVM Algorithm","authors":"Yanpeng Cui, Zichuan Jin, Jianwei Hu","doi":"10.6633/IJNS.202011_22(6).04","DOIUrl":"https://doi.org/10.6633/IJNS.202011_22(6).04","url":null,"abstract":"At present, traditional intrusion detection methods have some shortcomings, such as long detection time, low detection accuracy and poor classification effect. This paper will combine PCA and OCSVM algorithm to build a multi-level intrusion detection model, using attack feature analysis method to preprocess data, while data cleaning and data feature selection of training set. It highlights the characteristics of abnormal data and normal data, and weakens the influence of irrelevant features on training model. PCA algorithm is used to process data to improve detection rate and reduce noise. Different models are trained by different data features to detect four attack types, namely Probe, DDOS, R2L and U2R. The optimal dimension of PCA is automatically obtained by calculating the contribution rate M of feature, which improves the traditional method that requires frequent input of K value. The model is trained by using OCSVM algorithm based on RBF core, and the disadvantage of poor classification effect of OCSVM algorithm is eliminated through improved multi-layer detection mechanism. Finally, the KDDCUP99 data set is used for experimental verification. The results show that the proposed method has more advantages than the traditional detection method.","PeriodicalId":93303,"journal":{"name":"International journal of network security & its applications","volume":"26 1","pages":"916-924"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87466860","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}
Pub Date : 2020-11-01DOI: 10.6633/IJNS.202011_22(6).01
Yi-Hui Chen, Li-Chin Huang, I. Lin, M. Hwang
Due to the popularity of the Internet, people are increasingly accepting the integration of electronic service applications. Whether it is communication, trading, or transportation, these have gradually changed people's lifestyles. Electronic auctions have also become one of the popular e-commerce activities. Electronic auction systems usually include bidders, auctioneers, and third parties that allow bidders to bid via the Internet. It replaces the inconvenience and low efficiency of traditional tendering. Electronic auctions can be divided into two types: open bidding and sealed bidding. The public bidding method is to continuously increase the bidding price until no bidder is willing to pay a higher bid. The deadline has arrived. The highest bidder is the winner of the public tender. Since bidders can bid multiple times, this bidding method is also called multiple bidding. The bidding method for sealed bids is that the bidder can only send the bill once. Once the deadline arrives, the auctioneer will compare all bills. The bidder with the highest bid is the winner of the ＂sealed bid＂. Since bidders can only bid once, this bidding method is also called a single bid auction. Both bidding methods have their practicability. But no matter what kind of bidding. It should rely on intermediaries to allow buyers and sellers to conduct transactions. Lead to trust and transaction cost issues. In this regard, we will use blockchain technology to develop smart contracts for public bidding and sealed bidding. It uses the characteristics of blockchain decentralization and low transaction costs to improve the shortcomings of electronic auctions.
{"title":"Research on Blockchain Technologies in Bidding Systems","authors":"Yi-Hui Chen, Li-Chin Huang, I. Lin, M. Hwang","doi":"10.6633/IJNS.202011_22(6).01","DOIUrl":"https://doi.org/10.6633/IJNS.202011_22(6).01","url":null,"abstract":"Due to the popularity of the Internet, people are increasingly accepting the integration of electronic service applications. Whether it is communication, trading, or transportation, these have gradually changed people's lifestyles. Electronic auctions have also become one of the popular e-commerce activities. Electronic auction systems usually include bidders, auctioneers, and third parties that allow bidders to bid via the Internet. It replaces the inconvenience and low efficiency of traditional tendering. Electronic auctions can be divided into two types: open bidding and sealed bidding. The public bidding method is to continuously increase the bidding price until no bidder is willing to pay a higher bid. The deadline has arrived. The highest bidder is the winner of the public tender. Since bidders can bid multiple times, this bidding method is also called multiple bidding. The bidding method for sealed bids is that the bidder can only send the bill once. Once the deadline arrives, the auctioneer will compare all bills. The bidder with the highest bid is the winner of the ＂sealed bid＂. Since bidders can only bid once, this bidding method is also called a single bid auction. Both bidding methods have their practicability. But no matter what kind of bidding. It should rely on intermediaries to allow buyers and sellers to conduct transactions. Lead to trust and transaction cost issues. In this regard, we will use blockchain technology to develop smart contracts for public bidding and sealed bidding. It uses the characteristics of blockchain decentralization and low transaction costs to improve the shortcomings of electronic auctions.","PeriodicalId":93303,"journal":{"name":"International journal of network security & its applications","volume":"153 1","pages":"897-904"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86209090","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}
Pub Date : 2020-11-01DOI: 10.6633/IJNS.202011_22(6).10
Chen-Kuei Yang, Zhihong Li, Wenxia Cai, S. Weng, Li Liu, Anhong Wang
In 2014, Wu et al. proposed a reversible data hiding method with contrast enhancement (RDH-CE) that emphasized that the visual quality of the image was more important than having a high peak signal-to-noise ratio (PSNR). But this method focused only on global enhancements and ignored the details. There were more obvious distortions of the visual image as the embedding level increased, and embedding capacity was relatively low when the embedding level was small. Therefore, in this paper, we proposed a new RDH method with contrast enhancement based on Laplacian sharpening. First, the details of the edges of images and the clarity of images were emphasized by Laplacian sharpening, and the visual distortions of the images were reduced by sharpening scale factor. Then, the embedding capacity was increased by combining the difference expansion and digital inverse transformation to apply the operator to all of the pixels in the image. The experimental results demonstrate the effectiveness of the proposed scheme.
{"title":"Reversible Data Hiding with Contrast Enhancement Based on Laplacian Image Sharpening","authors":"Chen-Kuei Yang, Zhihong Li, Wenxia Cai, S. Weng, Li Liu, Anhong Wang","doi":"10.6633/IJNS.202011_22(6).10","DOIUrl":"https://doi.org/10.6633/IJNS.202011_22(6).10","url":null,"abstract":"In 2014, Wu et al. proposed a reversible data hiding method with contrast enhancement (RDH-CE) that emphasized that the visual quality of the image was more important than having a high peak signal-to-noise ratio (PSNR). But this method focused only on global enhancements and ignored the details. There were more obvious distortions of the visual image as the embedding level increased, and embedding capacity was relatively low when the embedding level was small. Therefore, in this paper, we proposed a new RDH method with contrast enhancement based on Laplacian sharpening. First, the details of the edges of images and the clarity of images were emphasized by Laplacian sharpening, and the visual distortions of the images were reduced by sharpening scale factor. Then, the embedding capacity was increased by combining the difference expansion and digital inverse transformation to apply the operator to all of the pixels in the image. The experimental results demonstrate the effectiveness of the proposed scheme.","PeriodicalId":93303,"journal":{"name":"International journal of network security & its applications","volume":"38 1","pages":"966-974"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73386537","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：