With the development of unmanned platforms, there are large numbers of unmanned aerial vehicles(UAVs), due to UAVs’ new features such as lightweight, high speed mobility and heterogeneous, UAVs are facing great challenges of data security. As a key means to protect data security, cryptography is of great significance. Traditional mature and complete cryptography schemes need to be adjusted to meet the new features of UAVs. We start with the security challenges faced by UAV architecture, then analyze the cryptographic technologies that can be applied. By comparing with existing researching schemes, we shows the advantages of different cryptographic technologies in the security protection of unmanned platforms and looks forward to the future.
{"title":"Research on Data Security of Unmanned Aerial Vehicles","authors":"Yuxiang Chen, Yao Hao, Kaijun Wu, Zhongqiang Yi, Haiyang Peng, Sijie Liao","doi":"10.1109/NaNA53684.2021.00039","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00039","url":null,"abstract":"With the development of unmanned platforms, there are large numbers of unmanned aerial vehicles(UAVs), due to UAVs’ new features such as lightweight, high speed mobility and heterogeneous, UAVs are facing great challenges of data security. As a key means to protect data security, cryptography is of great significance. Traditional mature and complete cryptography schemes need to be adjusted to meet the new features of UAVs. We start with the security challenges faced by UAV architecture, then analyze the cryptographic technologies that can be applied. By comparing with existing researching schemes, we shows the advantages of different cryptographic technologies in the security protection of unmanned platforms and looks forward to the future.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128519069","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-10-01DOI: 10.1109/NaNA53684.2021.00038
Pin Chen, Naijie Gu
A non-cooperative game model is established in this paper for equilibrium analysis on common IP routing protocols, i.e., RIP, OSPF, IS-IS, and EIGRP, and the possible causes of non-equilibrium are demonstrated, such as the existence of the same link in the selected paths, and all the packets tending to avoid the link with a high delay. To improve routing, a method of decreasing the variance of routing basis between different links is proposed. Experimental results show that this method reduces the proportion of packets with non-minimized costs by 20% on average, and reduces the average actual cost per packet by 36%.
{"title":"A Game Theory Perspective on IP Routing Protocols Evaluation","authors":"Pin Chen, Naijie Gu","doi":"10.1109/NaNA53684.2021.00038","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00038","url":null,"abstract":"A non-cooperative game model is established in this paper for equilibrium analysis on common IP routing protocols, i.e., RIP, OSPF, IS-IS, and EIGRP, and the possible causes of non-equilibrium are demonstrated, such as the existence of the same link in the selected paths, and all the packets tending to avoid the link with a high delay. To improve routing, a method of decreasing the variance of routing basis between different links is proposed. Experimental results show that this method reduces the proportion of packets with non-minimized costs by 20% on average, and reduces the average actual cost per packet by 36%.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123235396","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-10-01DOI: 10.1109/NaNA53684.2021.00018
Muhammad Fawad Khan, Limei Peng
This paper considers planning a UAV trajectory when the UAV collects data for ground access points (APs), aiming to minimize the overall UAV power consumption in executing the data-collection tasks. We explore to achieve this by selecting an optimal data rate for each hovering point of the UAV when it communicates with the ground APs. Specifically, we mainly consider the UAV power consumption caused by traveling, hovering, and communications with APs. Appropriate data rates can reduce the communication and data collection time and thus can reduce the hovering and communication power consumption. Regarding this, we propose an integer linear programming (ILP) model which minimizes the total UAV power consumption by selecting optimal data rates for different hovering points.
{"title":"Energy-efficient UAV Trajectory Planning Based On Flexible Data Rate","authors":"Muhammad Fawad Khan, Limei Peng","doi":"10.1109/NaNA53684.2021.00018","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00018","url":null,"abstract":"This paper considers planning a UAV trajectory when the UAV collects data for ground access points (APs), aiming to minimize the overall UAV power consumption in executing the data-collection tasks. We explore to achieve this by selecting an optimal data rate for each hovering point of the UAV when it communicates with the ground APs. Specifically, we mainly consider the UAV power consumption caused by traveling, hovering, and communications with APs. Appropriate data rates can reduce the communication and data collection time and thus can reduce the hovering and communication power consumption. Regarding this, we propose an integer linear programming (ILP) model which minimizes the total UAV power consumption by selecting optimal data rates for different hovering points.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125642738","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-10-01DOI: 10.1109/NaNA53684.2021.00029
Jiahui Sun, Ningchun Liu, Shuai Gao, Wei Su
In recent years, the rapid development of Programmable Data Plane(PDP) technology provides the possibility for the large-scale deployment of Smart Identifier Network(SINET). As a revolutionary network architecture, SINET supports terminal mobility and network extensibility natively by adopting the separation of identifier and locator. At the beginning of the SINET design, the security of the mapping information in the mapping publish/query protocol was not considered. At the same time, because of the PDP-based SINET using a separate control and forwarding architecture, the mapping information between the control plane and the data plane is more vulnerable to eavesdropping attacks and man-in-the-middle attacks.In this paper, we proposed a secure Identifier-to-Locator mapping mechanism in the PDP-based SINET. We designed a bCPA(bit-wise CPA) algorithm to protect the mapping information in the mapping publish/query protocol. We implemented the mechanism and evaluated its performance in the prototype system. The experimental results show that the method we designed guarantees the security of the mapping information without affecting the mapping publish/query performance and has less time increment compared to existing methods.
{"title":"A Secure Identifier-to-Locator Mapping Mechanism in Smart Identifier Network","authors":"Jiahui Sun, Ningchun Liu, Shuai Gao, Wei Su","doi":"10.1109/NaNA53684.2021.00029","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00029","url":null,"abstract":"In recent years, the rapid development of Programmable Data Plane(PDP) technology provides the possibility for the large-scale deployment of Smart Identifier Network(SINET). As a revolutionary network architecture, SINET supports terminal mobility and network extensibility natively by adopting the separation of identifier and locator. At the beginning of the SINET design, the security of the mapping information in the mapping publish/query protocol was not considered. At the same time, because of the PDP-based SINET using a separate control and forwarding architecture, the mapping information between the control plane and the data plane is more vulnerable to eavesdropping attacks and man-in-the-middle attacks.In this paper, we proposed a secure Identifier-to-Locator mapping mechanism in the PDP-based SINET. We designed a bCPA(bit-wise CPA) algorithm to protect the mapping information in the mapping publish/query protocol. We implemented the mechanism and evaluated its performance in the prototype system. The experimental results show that the method we designed guarantees the security of the mapping information without affecting the mapping publish/query performance and has less time increment compared to existing methods.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133927362","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-10-01DOI: 10.1109/NaNA53684.2021.00011
Ranran Sun, Bin Yang, Shenghui Zhao
This paper investigates the fundamental issues of power control for achieving covert communication in the D2D underlaying cellular networks consisting of a cellular user, a base station, a D2D pair and an active warden who always sends noise to interferes the possible covert communication just in case and the D2D pair acts as a friendly jammer to add uncertainty on warden. We consider a power control scheme where a randomly and independently changing transmit power is employed at D2D receiver to send jamming signal to warden. We first develop theoretical frameworks to model the detection error probability (DEP) at warden, and achievable covert rate performance at cellular user. Then we explore the corresponding optimal power control of jamming signal maximizing the achievable covert rate. Finally, extensive numerical results are provided to illustrate the covert performances of the D2D underlaying cellular networks.
{"title":"Covert Communication in D2D Underlaying Cellular Network","authors":"Ranran Sun, Bin Yang, Shenghui Zhao","doi":"10.1109/NaNA53684.2021.00011","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00011","url":null,"abstract":"This paper investigates the fundamental issues of power control for achieving covert communication in the D2D underlaying cellular networks consisting of a cellular user, a base station, a D2D pair and an active warden who always sends noise to interferes the possible covert communication just in case and the D2D pair acts as a friendly jammer to add uncertainty on warden. We consider a power control scheme where a randomly and independently changing transmit power is employed at D2D receiver to send jamming signal to warden. We first develop theoretical frameworks to model the detection error probability (DEP) at warden, and achievable covert rate performance at cellular user. Then we explore the corresponding optimal power control of jamming signal maximizing the achievable covert rate. Finally, extensive numerical results are provided to illustrate the covert performances of the D2D underlaying cellular networks.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114704092","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-10-01DOI: 10.1109/NaNA53684.2021.00048
Xin Song, Yichuan Wang, Lei Zhu, Wenjiang Ji, Yanning Du, Feixiong Hu
An easy to implement and effective outlier detection method is proposed in this paper, which is a two-stage process combining the kd-tree structure and the Isolation Forest (Forest) method. We use kd-tree to split high dimensional data into groups, and then apply Forest to each group to calculate anomaly scores which help to identify outliers. This method is fast since it decides anomaly on groups of a dataset instead of the whole dataset, meanwhile the accuracy is assured by Forest. We tested our method with synthetic and real-world data set to illustrates its application to data base access logs.
{"title":"A Method for Fast Outlier Detection in High Dimensional Database Log","authors":"Xin Song, Yichuan Wang, Lei Zhu, Wenjiang Ji, Yanning Du, Feixiong Hu","doi":"10.1109/NaNA53684.2021.00048","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00048","url":null,"abstract":"An easy to implement and effective outlier detection method is proposed in this paper, which is a two-stage process combining the kd-tree structure and the Isolation Forest (Forest) method. We use kd-tree to split high dimensional data into groups, and then apply Forest to each group to calculate anomaly scores which help to identify outliers. This method is fast since it decides anomaly on groups of a dataset instead of the whole dataset, meanwhile the accuracy is assured by Forest. We tested our method with synthetic and real-world data set to illustrates its application to data base access logs.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122031516","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-10-01DOI: 10.1109/NaNA53684.2021.00041
Guozhu Zhao, Pinchang Zhang, Lisheng Ma
By exploiting characteristics from channel state information (CSI) profiles and the behavioral habits of users during their routine work processes in IIoT systems, this paper proposes a passive multi-characteristics user authentication framework for continuous user authentication. We first characterize user physical layer identities using a well-known eXtreme Gradient Boosting (XGBoost) machine learning algorithm, and then depict user behavioral characteristics by formulating the authentication decision process as a Hidden Markov Model (HMM) to further confirm user identities. Extensive experiments are performed to show the authentication performance of the proposed user authentication framework in terms of ROC curves and accuracy in various IIoT scenarios. We also investigate the performance of the proposed framework for resisting impersonation attacks in the IIoT scenario.
{"title":"On the Applicability of Multi-Characteristics for the Continuous Authentication in IIoT Scenarios","authors":"Guozhu Zhao, Pinchang Zhang, Lisheng Ma","doi":"10.1109/NaNA53684.2021.00041","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00041","url":null,"abstract":"By exploiting characteristics from channel state information (CSI) profiles and the behavioral habits of users during their routine work processes in IIoT systems, this paper proposes a passive multi-characteristics user authentication framework for continuous user authentication. We first characterize user physical layer identities using a well-known eXtreme Gradient Boosting (XGBoost) machine learning algorithm, and then depict user behavioral characteristics by formulating the authentication decision process as a Hidden Markov Model (HMM) to further confirm user identities. Extensive experiments are performed to show the authentication performance of the proposed user authentication framework in terms of ROC curves and accuracy in various IIoT scenarios. We also investigate the performance of the proposed framework for resisting impersonation attacks in the IIoT scenario.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131350755","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-10-01DOI: 10.1109/NaNA53684.2021.00013
Yangyang Liu, Pinchang Zhang, Xufei Li
This paper proposes an intelligent physical layer authentication scheme to learn the time-varying features of physical layer for mmWave MIMO communications. Explicitly, we design the physical layer authentication system as a binary classification model based on the kernel machine. We derive the updating methods of the system parameters iteratively. The convergence and performance of the proposed physical layer authentication model are validated by exploiting a mmWave MIMO channel model. Numerical results demonstrate that the proposed intelligent physical layer authentication scheme performs well in mmWave MIMO communications.
{"title":"Physical Layer Authentication Using MmWave Channel State Information","authors":"Yangyang Liu, Pinchang Zhang, Xufei Li","doi":"10.1109/NaNA53684.2021.00013","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00013","url":null,"abstract":"This paper proposes an intelligent physical layer authentication scheme to learn the time-varying features of physical layer for mmWave MIMO communications. Explicitly, we design the physical layer authentication system as a binary classification model based on the kernel machine. We derive the updating methods of the system parameters iteratively. The convergence and performance of the proposed physical layer authentication model are validated by exploiting a mmWave MIMO channel model. Numerical results demonstrate that the proposed intelligent physical layer authentication scheme performs well in mmWave MIMO communications.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127763921","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-10-01DOI: 10.1109/NaNA53684.2021.00049
Liumei Zhang, Xinyuan Deng, Yichuan Wang
The enhancement of Internet connectivity and the increase of information transmission speed yield the increasing frequency of network attacks. The Shellshock attackers often exploit bash vulnerability to read the content behind the function definition when importing environment variable functions. Then, malicious scripts can be executed in systems and servers, which compromises everything. Therefore, this paper proposes a formal modeling analysis method for the Shellshock Bash basis and automates the analysis of the patched position of the model. The relationship between the established model and the actual attack process is also discussed, which is a feasible reference for exploring unknown vulnerabilities and the location of corresponding patches.
{"title":"Shellshock Bash Vulnerability Modeling Analysis Based on Petri Net","authors":"Liumei Zhang, Xinyuan Deng, Yichuan Wang","doi":"10.1109/NaNA53684.2021.00049","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00049","url":null,"abstract":"The enhancement of Internet connectivity and the increase of information transmission speed yield the increasing frequency of network attacks. The Shellshock attackers often exploit bash vulnerability to read the content behind the function definition when importing environment variable functions. Then, malicious scripts can be executed in systems and servers, which compromises everything. Therefore, this paper proposes a formal modeling analysis method for the Shellshock Bash basis and automates the analysis of the patched position of the model. The relationship between the established model and the actual attack process is also discussed, which is a feasible reference for exploring unknown vulnerabilities and the location of corresponding patches.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132906494","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-10-01DOI: 10.1109/NaNA53684.2021.00086
Tianci Zhou, Yong Zeng, Yixin Li, Zhongyuan Jiang, Zhihong Liu, Teng Li
Nowadays, recommendation systems are widely used, and it is a very difficult issue to solve the cold-start problem. Recent studies shows that the introduction of social network relationships can alleviate the cold-start problem of the recommendation system. However, some of these algorithms have higher requirements for implementation scenarios, and some cannot guarantee user information security. In our study, we propose a matrix factorization recommendation system method based on homomorphic encryption and social network. The method introduces the sum of preference information of cold-start user neighbors as prior knowledge into the recommendation system to solved the problem of insufficient information for cold start users. In addition, the method uses Pallier homomorphic encryption algorithm to ensure the security of user information and improve computational efficiency. Experiments on three real-world data sets shows that the method has produced a significant improvement in the prediction effect of cold-start users.
{"title":"Cold-start Recommendation Method Based on Homomorphic Encryption","authors":"Tianci Zhou, Yong Zeng, Yixin Li, Zhongyuan Jiang, Zhihong Liu, Teng Li","doi":"10.1109/NaNA53684.2021.00086","DOIUrl":"https://doi.org/10.1109/NaNA53684.2021.00086","url":null,"abstract":"Nowadays, recommendation systems are widely used, and it is a very difficult issue to solve the cold-start problem. Recent studies shows that the introduction of social network relationships can alleviate the cold-start problem of the recommendation system. However, some of these algorithms have higher requirements for implementation scenarios, and some cannot guarantee user information security. In our study, we propose a matrix factorization recommendation system method based on homomorphic encryption and social network. The method introduces the sum of preference information of cold-start user neighbors as prior knowledge into the recommendation system to solved the problem of insufficient information for cold start users. In addition, the method uses Pallier homomorphic encryption algorithm to ensure the security of user information and improve computational efficiency. Experiments on three real-world data sets shows that the method has produced a significant improvement in the prediction effect of cold-start users.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134512430","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
扫码关注我们
求助内容：
应助结果提醒方式：