Airborne display software WCET assessment relies on actual scenario and traditional static analysis and dynamic test methods can not reflect actual scenario requirements. To achieve WCET value closing to actual scenario for resource saving purpose, firstly the typical architecture of airborne display unit is described; secondly, the worst scenario analysis principles for WCET are identified; thirdly, WCET assessment flow and steps are proposed respectively for non-A661 partition and A661 service partition; lastly, the WCET acceptance principles are given in both software level and system level. This research can help to support airborne display software resource assessment and allocation in the early stage of software design.
{"title":"Research on WCET assessment method of airborne display software","authors":"Junfeng Xu","doi":"10.1117/12.3032008","DOIUrl":"https://doi.org/10.1117/12.3032008","url":null,"abstract":"Airborne display software WCET assessment relies on actual scenario and traditional static analysis and dynamic test methods can not reflect actual scenario requirements. To achieve WCET value closing to actual scenario for resource saving purpose, firstly the typical architecture of airborne display unit is described; secondly, the worst scenario analysis principles for WCET are identified; thirdly, WCET assessment flow and steps are proposed respectively for non-A661 partition and A661 service partition; lastly, the WCET acceptance principles are given in both software level and system level. This research can help to support airborne display software resource assessment and allocation in the early stage of software design.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":"183 2","pages":"131751D - 131751D-6"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141375809","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}
Kaichen Zhou, Tianlun Huang, Weijun Wang, Haowen Luo, Fawad Khan, Ziqian Du, Wei Feng
Neural Radiation Field (NeRF) is driving the development of 3D reconstruction technology. Several NeRF variants have been proposed to improve rendering accuracy and reconstruction speed. One of the most significant variants, TensoRF, uses a 4D tensor to model the radiation field, resulting in improved accuracy and speed. However, reconstruction quality remains limited. This study presents an improved TensoRF that addresses the aforementioned issues by reconstructing its multilayer perceptron network. Increasing the number of neurons in the input and network layers improves the render accuracy. To accelerate the reconstruction speed, we utilized the Nadam optimization algorithm and the RELU6 activation function. Our experiments on various classical datasets demonstrate that the PSNR value of the improved TensoRF is higher than that of the original TensoRF. Additionally, the improved TensoRF has a faster reconstruction speed (≤30min). Finally, we applied the improved TensoRF to a self-made industrial dataset. The results showed better global accuracy and local texture in the reconstructed image.
{"title":"3D reconstruction in industrial environments based on an improved neural radiation field method research","authors":"Kaichen Zhou, Tianlun Huang, Weijun Wang, Haowen Luo, Fawad Khan, Ziqian Du, Wei Feng","doi":"10.1117/12.3031943","DOIUrl":"https://doi.org/10.1117/12.3031943","url":null,"abstract":"Neural Radiation Field (NeRF) is driving the development of 3D reconstruction technology. Several NeRF variants have been proposed to improve rendering accuracy and reconstruction speed. One of the most significant variants, TensoRF, uses a 4D tensor to model the radiation field, resulting in improved accuracy and speed. However, reconstruction quality remains limited. This study presents an improved TensoRF that addresses the aforementioned issues by reconstructing its multilayer perceptron network. Increasing the number of neurons in the input and network layers improves the render accuracy. To accelerate the reconstruction speed, we utilized the Nadam optimization algorithm and the RELU6 activation function. Our experiments on various classical datasets demonstrate that the PSNR value of the improved TensoRF is higher than that of the original TensoRF. Additionally, the improved TensoRF has a faster reconstruction speed (≤30min). Finally, we applied the improved TensoRF to a self-made industrial dataset. The results showed better global accuracy and local texture in the reconstructed image.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":"43 1","pages":"1317513 - 1317513-8"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141377874","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}
The urban water supply network affects residents' water use experience and the economic benefits of water supply enterprises, and is an important component of the urban underground pipeline network. With the continuous changes in the pipeline network, the urban water supply network has formed a very complex spatial information system. Due to the difficulty in accurately obtaining information about the water supply network and the traditional manual drawing, manual statistics, and manual analysis management mode which cannot handle the gradually complex information of the network, it is currently very difficult to maintain the network. This article analyzes the current situation of China's urban water supply network. Based on the problems of low information query efficiency and errors in network analysis processes, a water supply network WebGIS management system was developed based on database and GIS technology. The system has a total of 17 functions divided into five modules according to function type: display configuration, data queries, information statistics, network analysis, and map printing. The system uses a spatial database to solve the problem of processing complex network information, and its query function can quickly search for network information. By setting conditions, data filtering can be achieved, greatly improving the efficiency of information retrieval. This system uses GIS technology to visualize the water supply network and provides various click events, making the system interactive and improving the efficiency of information retrieval. In terms of spatial analysis, this article found that the water supply network can be represented by a graph, and algorithms from graph theory can be used to search for pipelines and nodes in the network. Therefore, this system has implemented two major functions of connectivity analysis and valve closing analysis in the network analysis module using Dijkstra's algorithm and breadth-first search algorithm respectively. This system can bring great convenience to the daily maintenance of the water supply network and reduce the error rate of maintenance work. Relevant departments of the government can achieve efficient management of the urban water supply network through the system's data query and network analysis functions.
{"title":"Research and implementation of urban water supply pipe network management system based on WebGIS","authors":"Xinpei Cai, Sen Lin, sihan cai, Yuxuan Chen","doi":"10.1117/12.3032002","DOIUrl":"https://doi.org/10.1117/12.3032002","url":null,"abstract":"The urban water supply network affects residents' water use experience and the economic benefits of water supply enterprises, and is an important component of the urban underground pipeline network. With the continuous changes in the pipeline network, the urban water supply network has formed a very complex spatial information system. Due to the difficulty in accurately obtaining information about the water supply network and the traditional manual drawing, manual statistics, and manual analysis management mode which cannot handle the gradually complex information of the network, it is currently very difficult to maintain the network. This article analyzes the current situation of China's urban water supply network. Based on the problems of low information query efficiency and errors in network analysis processes, a water supply network WebGIS management system was developed based on database and GIS technology. The system has a total of 17 functions divided into five modules according to function type: display configuration, data queries, information statistics, network analysis, and map printing. The system uses a spatial database to solve the problem of processing complex network information, and its query function can quickly search for network information. By setting conditions, data filtering can be achieved, greatly improving the efficiency of information retrieval. This system uses GIS technology to visualize the water supply network and provides various click events, making the system interactive and improving the efficiency of information retrieval. In terms of spatial analysis, this article found that the water supply network can be represented by a graph, and algorithms from graph theory can be used to search for pipelines and nodes in the network. Therefore, this system has implemented two major functions of connectivity analysis and valve closing analysis in the network analysis module using Dijkstra's algorithm and breadth-first search algorithm respectively. This system can bring great convenience to the daily maintenance of the water supply network and reduce the error rate of maintenance work. Relevant departments of the government can achieve efficient management of the urban water supply network through the system's data query and network analysis functions.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":"25 13","pages":"131751X - 131751X-9"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141378934","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}
Nowadays, privacy data has widely stored and shared through the cloud storage services from numerous users and organizations. However, existing cloud services are concentrating on improving the data storage amount and ignore the privacy data protection for data owners. In order to protect the privacy data, data owners may encrypt the information and then upload to the cloud servers. Cloud server cannot guarantee the encryption data are not at-tacked or modified by malicious attackers. In this paper, we propose a novel symmetric encryption algorithm to encrypt the privacy data for users and generate the checks for cloud servers and guarantee the privacy cannot be modified and lost by system errors. From our extensive experimental, we can conclude that our proposed model can achieve the protection of privacy by simulating the different attacks with reasonable response period. Furthermore, we compare our model with existing encryption methods and evaluate the effectiveness performance.
{"title":"Research on privacy data processing based on symmetric encryption algorithm","authors":"Haotong Guo","doi":"10.1117/12.3031900","DOIUrl":"https://doi.org/10.1117/12.3031900","url":null,"abstract":"Nowadays, privacy data has widely stored and shared through the cloud storage services from numerous users and organizations. However, existing cloud services are concentrating on improving the data storage amount and ignore the privacy data protection for data owners. In order to protect the privacy data, data owners may encrypt the information and then upload to the cloud servers. Cloud server cannot guarantee the encryption data are not at-tacked or modified by malicious attackers. In this paper, we propose a novel symmetric encryption algorithm to encrypt the privacy data for users and generate the checks for cloud servers and guarantee the privacy cannot be modified and lost by system errors. From our extensive experimental, we can conclude that our proposed model can achieve the protection of privacy by simulating the different attacks with reasonable response period. Furthermore, we compare our model with existing encryption methods and evaluate the effectiveness performance.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":"112 4","pages":"131750T - 131750T-5"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141376414","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}
In order to address the obstacles posed by the growing security issues of the Internet of Things to the development of big data, this paper conducts in-depth research on the defense of the most harmful DDoS attack. This paper designs a deep learning model for DDoS detection - CBAN. The CBAN model integrates technologies such as 1D-CNN, BiGRU, and attention mechanism for structural design. This model can effectively extract spatial and temporal features of network traffic data for efficient detection of potential DDoS attacks. The CBAN model has shown excellent performance on the CIC-DDoS-2019 dataset.
{"title":"CBAN: A DDoS detection method based on CNN, BiGRU, and attention mechanism","authors":"Bing Wang, Yankun Yu, Chunlan Zhao, Jing Jiang","doi":"10.1117/12.3032053","DOIUrl":"https://doi.org/10.1117/12.3032053","url":null,"abstract":"In order to address the obstacles posed by the growing security issues of the Internet of Things to the development of big data, this paper conducts in-depth research on the defense of the most harmful DDoS attack. This paper designs a deep learning model for DDoS detection - CBAN. The CBAN model integrates technologies such as 1D-CNN, BiGRU, and attention mechanism for structural design. This model can effectively extract spatial and temporal features of network traffic data for efficient detection of potential DDoS attacks. The CBAN model has shown excellent performance on the CIC-DDoS-2019 dataset.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":"64 2","pages":"131750I - 131750I-5"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141381564","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}
Image encryption has become one of the key techniques for information protection in today's context of increasing number and rising importance of digital communication. The purpose of this paper is to explore a creative image encryption method based on Rijndael algorithm and chaos algorithm, which disambiguates the image, hash value calculation. Then encrypted by Rijndael algorithm and generates a secure ciphertext. Compared to traditional encryption, this algorithm greatly improves the security and speed of encryption by combining multiple encryption techniques, and by conducting several encryption and decryption experiments on this algorithm, we prove that this method has a great prospect for security applications.
{"title":"Research on a more safe image encryption communication algorithm","authors":"Lu Liu, Yuhui Li, Ting Wang, Yuhan Qin, Yuhan Ren","doi":"10.1117/12.3032082","DOIUrl":"https://doi.org/10.1117/12.3032082","url":null,"abstract":"Image encryption has become one of the key techniques for information protection in today's context of increasing number and rising importance of digital communication. The purpose of this paper is to explore a creative image encryption method based on Rijndael algorithm and chaos algorithm, which disambiguates the image, hash value calculation. Then encrypted by Rijndael algorithm and generates a secure ciphertext. Compared to traditional encryption, this algorithm greatly improves the security and speed of encryption by combining multiple encryption techniques, and by conducting several encryption and decryption experiments on this algorithm, we prove that this method has a great prospect for security applications.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":"54 3‐4","pages":"131750R - 131750R-6"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141376372","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}
To meet the trust requirements of complex environments such as cloud platforms, physical trust modules are often virtualized into virtual Trusted Platform Module (vTPM) to function as the root of trust for each virtual machine or container. In remote attestation, vTPM utilize hardware-TPM-based certificate chain extension schemes to ensure its trustworthiness. Existing vTPM certificate chain extension schemes must turn to Privacy Certificates Authority (PCA) for new certificate during every attestation, however, result in excessive computational and communication overheads. To address this issue, this paper proposes a vTPM certificate chain extension scheme based on Multi-Certificate Public Key Infrastructure (MCPKI). This scheme allows unsigned sub-certificates to have the same legitimacy and identity as the root certificate through certificates correlation. In this way, vTPM can have multiple certificates with valid identity and only need to apply to PCA once, which reduces the performance loss caused by repetitive validation in traditional certificate chain extension schemes and enhances the efficiency of Privacy CA certificate issuance. Furthermore, certificate generation is handled by the local vTPM, reducing communication overheads. A new trusted third-party Verification Certificate Authority (VCA) is introduced to share the validation workload of Privacy CA and reduce the reliance on Privacy CA in certificate chain extension. The experiment results demonstrate that this scheme outperforms traditional certificate chain extension schemes in scenarios with multiple certificates requirement.
为满足云平台等复杂环境的信任要求,物理信任模块通常被虚拟成虚拟可信平台模块(vTPM),作为每个虚拟机或容器的信任根。在远程验证中,vTPM 利用基于硬件-TPM 的证书链扩展方案来确保其可信度。现有的 vTPM 证书链扩展方案必须在每次验证时向隐私证书颁发机构(PCA)申请新证书,但这会导致过高的计算和通信开销。为解决这一问题,本文提出了一种基于多证书公钥基础设施(MCPKI)的 vTPM 证书链扩展方案。该方案通过证书关联,使未签名的子证书具有与根证书相同的合法性和身份。这样,vTPM 可以拥有多个有效身份的证书,只需向 PCA 申请一次,减少了传统证书链扩展方案中重复验证造成的性能损失,提高了隐私 CA 证书签发的效率。此外,证书生成由本地 vTPM 处理,减少了通信开销。该方案引入了一个新的可信第三方验证证书机构(VCA),以分担隐私 CA 的验证工作量,减少证书链扩展对隐私 CA 的依赖。实验结果表明,在需要多个证书的情况下,该方案优于传统的证书链扩展方案。
{"title":"MCPKI-based certificate chain extension scheme for vTPM","authors":"zhentao xiao, Pan Dong","doi":"10.1117/12.3031946","DOIUrl":"https://doi.org/10.1117/12.3031946","url":null,"abstract":"To meet the trust requirements of complex environments such as cloud platforms, physical trust modules are often virtualized into virtual Trusted Platform Module (vTPM) to function as the root of trust for each virtual machine or container. In remote attestation, vTPM utilize hardware-TPM-based certificate chain extension schemes to ensure its trustworthiness. Existing vTPM certificate chain extension schemes must turn to Privacy Certificates Authority (PCA) for new certificate during every attestation, however, result in excessive computational and communication overheads. To address this issue, this paper proposes a vTPM certificate chain extension scheme based on Multi-Certificate Public Key Infrastructure (MCPKI). This scheme allows unsigned sub-certificates to have the same legitimacy and identity as the root certificate through certificates correlation. In this way, vTPM can have multiple certificates with valid identity and only need to apply to PCA once, which reduces the performance loss caused by repetitive validation in traditional certificate chain extension schemes and enhances the efficiency of Privacy CA certificate issuance. Furthermore, certificate generation is handled by the local vTPM, reducing communication overheads. A new trusted third-party Verification Certificate Authority (VCA) is introduced to share the validation workload of Privacy CA and reduce the reliance on Privacy CA in certificate chain extension. The experiment results demonstrate that this scheme outperforms traditional certificate chain extension schemes in scenarios with multiple certificates requirement.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":"115 12","pages":"131751I - 131751I-9"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141377662","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}
This paper tackles the challenges inherent in existing Multi-View Stereo (MVS) methods, which often struggle with scenes that have repetitive textures and complex scenarios, leading to reconstructions that lack quality, completeness, and accuracy. To address these issues, we introduce a novel deep learning network, Clo-PatchmatchNet, which leverages context-aware Transformers for enhanced performance. The network's architecture starts with a feature extraction module that processes image features. These features are then input into a learnable Patchmatch algorithm, creating an initial depth map. This map undergoes further refinement to yield the final, detailed depth map. A key innovation in our approach is the integration of a context-aware Transformer block, known as Cloblock, into the feature extraction stage. This allows the network to effectively capture both global contextual information and high-frequency local details, enhancing feature matching across various views. Our experimental evaluations, conducted on the Technical University of Denmark (DTU) dataset, reveal that Clo-PatchmatchNet outperforms the traditional PatchmatchNet by achieving a 2.5% improvement in reconstruction completeness and a 1.2% increase in accuracy, resulting in an overall enhancement of 1.7%. Moreover, when compared to other contemporary methods, our proposed solution demonstrates superior performance in terms of both completeness and overall quality, marking a significant advancement in the field of 3D reconstruction.
{"title":"Multiview stereo reconstruction based on context-aware transformer","authors":"Zhaoxu Tian","doi":"10.1117/12.3032052","DOIUrl":"https://doi.org/10.1117/12.3032052","url":null,"abstract":"This paper tackles the challenges inherent in existing Multi-View Stereo (MVS) methods, which often struggle with scenes that have repetitive textures and complex scenarios, leading to reconstructions that lack quality, completeness, and accuracy. To address these issues, we introduce a novel deep learning network, Clo-PatchmatchNet, which leverages context-aware Transformers for enhanced performance. The network's architecture starts with a feature extraction module that processes image features. These features are then input into a learnable Patchmatch algorithm, creating an initial depth map. This map undergoes further refinement to yield the final, detailed depth map. A key innovation in our approach is the integration of a context-aware Transformer block, known as Cloblock, into the feature extraction stage. This allows the network to effectively capture both global contextual information and high-frequency local details, enhancing feature matching across various views. Our experimental evaluations, conducted on the Technical University of Denmark (DTU) dataset, reveal that Clo-PatchmatchNet outperforms the traditional PatchmatchNet by achieving a 2.5% improvement in reconstruction completeness and a 1.2% increase in accuracy, resulting in an overall enhancement of 1.7%. Moreover, when compared to other contemporary methods, our proposed solution demonstrates superior performance in terms of both completeness and overall quality, marking a significant advancement in the field of 3D reconstruction.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":"128 5","pages":"131750U - 131750U-5"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141377024","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}
Shuang Sun, Xiangbo Zhu, Weiyu Wang, Xuesen Zhang, Huan He
In the "dual carbon" goal background, massive, dispersed, and ubiquitous distributed resources are becoming an important component of China's power system. However, distributed flexible resources faced with security issues, such as data loss, data tampering, and privacy breaches, during the process of participating in power trading by aggregation method. Therefore, this article proposes key privacy protection technologies to support flexible resource hierarchical aggregation transactions. Through fully analyzing the current situation of flexible resource hierarchical aggregation transaction and the existing privacy leakage problems, this paper designs a collaborative interaction process of flexible resource hierarchical aggregation transactions, and implements privacy protection for electricity enterprises participating in aggregation and benefit distribution in a trustworthy and autonomous manner.
{"title":"Research on key privacy protection technologies supporting flexible distributed resource layered aggregation transactions","authors":"Shuang Sun, Xiangbo Zhu, Weiyu Wang, Xuesen Zhang, Huan He","doi":"10.1117/12.3031931","DOIUrl":"https://doi.org/10.1117/12.3031931","url":null,"abstract":"In the \"dual carbon\" goal background, massive, dispersed, and ubiquitous distributed resources are becoming an important component of China's power system. However, distributed flexible resources faced with security issues, such as data loss, data tampering, and privacy breaches, during the process of participating in power trading by aggregation method. Therefore, this article proposes key privacy protection technologies to support flexible resource hierarchical aggregation transactions. Through fully analyzing the current situation of flexible resource hierarchical aggregation transaction and the existing privacy leakage problems, this paper designs a collaborative interaction process of flexible resource hierarchical aggregation transactions, and implements privacy protection for electricity enterprises participating in aggregation and benefit distribution in a trustworthy and autonomous manner.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":"10 7","pages":"131750W - 131750W-12"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141378759","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}
Border Gateway Protocol (BGP) is the Internet standard inter-domain routing protocol, has become an important infrastructure of the Internet. Due to the limitation of the initial design, BGP prefix hijacking is a kind of BGP security problem that needs to be solved urgently. This paper proposes a BGP prefix hijack detection algorithm based on Multiple Origin AS (MOAS) event feature, discovering and restoring MOAS events from BGP packets, and creating an event matrix for MOAS events based on the changes of source AS observed from different observation points over time. According to the MOAS event matrix, the eigenvalue of the event is calculated from the perspective of the overall probability of the event and the local visibility of the observation point. Finally, the characteristic value of the MOAS event is compared with the exception event threshold to determine whether the event is an exception event, and then the BGP prefix hijacking is found. Compared with the prefix hijacking detection algorithm based on source AS validity, the detection results of this algorithm have higher accuracy. This method is more practical in detecting prefix hijacking according to the characteristics of the event itself.
{"title":"BGP prefix hijack detection algorithm based on MOAS event feature","authors":"Kaiyu Chen","doi":"10.1117/12.3032047","DOIUrl":"https://doi.org/10.1117/12.3032047","url":null,"abstract":"Border Gateway Protocol (BGP) is the Internet standard inter-domain routing protocol, has become an important infrastructure of the Internet. Due to the limitation of the initial design, BGP prefix hijacking is a kind of BGP security problem that needs to be solved urgently. This paper proposes a BGP prefix hijack detection algorithm based on Multiple Origin AS (MOAS) event feature, discovering and restoring MOAS events from BGP packets, and creating an event matrix for MOAS events based on the changes of source AS observed from different observation points over time. According to the MOAS event matrix, the eigenvalue of the event is calculated from the perspective of the overall probability of the event and the local visibility of the observation point. Finally, the characteristic value of the MOAS event is compared with the exception event threshold to determine whether the event is an exception event, and then the BGP prefix hijacking is found. Compared with the prefix hijacking detection algorithm based on source AS validity, the detection results of this algorithm have higher accuracy. This method is more practical in detecting prefix hijacking according to the characteristics of the event itself.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":"14 2","pages":"131750P - 131750P-9"},"PeriodicalIF":0.0,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141379271","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}