Yuan Wei
Research Subjects
Research Interests
Yuan Wei has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
Bo Li
Information System and Security & Countermeasures Experimental Center, Beijing Institute of Technology, Beijing, China
1 shared publication- Bo Li
School of Information and Electronics, Beijing Institute of Technology, Beijing, China
1 shared publication Ennan Zheng
Department of Information Technology, University of International Relations, Beijing, China
1 shared publicationJianwei Zhuge
Beijing National Research Center for Information Science and Technology (BNRist), Beijing, China
1 shared publicationJing Gao
Beijing Gehua CATV Network Co., Ltd., Beijing, China
1 shared publication- Junling Wang
Beijing Institute of Technology
1 shared publication
Latest Publications
- 12 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-17
Estimating the Hotspot Area Observed by Earth Imaging Satellite via ISAR Image Sequence
Compared with directly estimating the stable attitude of space targets, estimating the hotspot area observed by an Earth imaging satellite using inverse synthetic aperture radar (ISAR) imaging is a more practical and challenging task. In this article, by parameterizing the time-varying attitude of an Earth imaging satellite in spotlight mode into a fixed hotspot area location in the geodetic coordinates, a novel method is proposed. First, the migrations of the scatterers on the rotating component with respect to reference scatterers on the satellite body in the range and Doppler dimensions (MRCRSRDs) are analyzed, which are used for recognizing the scatterers on the rotating component. Next, it is proven that for the same scatterer on the rotating component, the vector difference sequences of the projection vectors normalized using the range and Doppler coordinates are orthogonal to the position vector of the scatterer. Based on this characteristic, an objective function for estimating the hotspot area is constructed. Then, based on the error principle, expressions of the estimated hotspot area longitude and latitude are derived, along with expressions of the estimation accuracy. Finally, the effects of different factors on the MRCRSRD are analyzed by traversal, under the assumption that the scatterer coordinates obtained by radar are error-free, the feasibility of the proposed method is validated and the estimation error caused by the grid quantization is evaluated, and then the robustness of the proposed method is validated by comparative experiments using parameter search method (PSM) and indirect adjustment method (IAM) under different Gaussian noise conditions.
- 12 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 62 (01962892) , 1-17
Estimating the Hotspot Area Observed by Earth Imaging Satellite via ISAR Image Sequence
Compared with directly estimating the stable attitude of space targets, estimating the hotspot area observed by an Earth imaging satellite using inverse synthetic aperture radar (ISAR) imaging is a more practical and challenging task. In this article, by parameterizing the time-varying attitude of an Earth imaging satellite in spotlight mode into a fixed hotspot area location in the geodetic coordinates, a novel method is proposed. First, the migrations of the scatterers on the rotating component with respect to reference scatterers on the satellite body in the range and Doppler dimensions (MRCRSRDs) are analyzed, which are used for recognizing the scatterers on the rotating component. Next, it is proven that for the same scatterer on the rotating component, the vector difference sequences of the projection vectors normalized using the range and Doppler coordinates are orthogonal to the position vector of the scatterer. Based on this characteristic, an objective function for estimating the hotspot area is constructed. Then, based on the error principle, expressions of the estimated hotspot area longitude and latitude are derived, along with expressions of the estimation accuracy. Finally, the effects of different factors on the MRCRSRD are analyzed by traversal, under the assumption that the scatterer coordinates obtained by radar are error-free, the feasibility of the proposed method is validated and the estimation error caused by the grid quantization is evaluated, and then the robustness of the proposed method is validated by comparative experiments using parameter search method (PSM) and indirect adjustment method (IAM) under different Gaussian noise conditions.
- Open Access
- 26 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 120152-120163
ARG: Automatic ROP Chains Generation
Return Oriented Programming (ROP) chains attack has been widely used to bypass Data Execution Prevention (DEP) and Address Space Layout Randomization (ASLR) protection. However, the generation technology for ROP chains is still in a state of manual coding. While, current techniques for automatically generating ROP chains are still insufficiently researched and have few successful applications. On the other hand, the existing methods are based on using Intermediate Language (IL) which is in order to translate the semantics of original instructions for symbolic execution, and then fill in a predefined gadget arrangement to automatically construct a gadget list. This kind of methods may bring following problems: (1) when converting semantics of original to IL, there is a large amount of overhead time, critical instructions may be discarded; (2) the process of populating a predetermined gadget arrangement is inflexible and may fail to construct ROP chains due to address mismatching. In this paper, we propose the Automatic ROP chains Generation (ARG) which is the first fully automatic ROP chains generation tool without using IL. Tested with data from 6 open-source international Capture The Flag (CTF) competitions and 3 Common Vulnerabilities & Exposures (CVE)s, this technology successfully generated ROP chains for all of them. According to the obtained results, our technique can automatically create ROP payloads and reduce up to 80% of ROP exploit payloads. It takes only 3-5 seconds to exploit successfully, compared to manual analysis for at least 60 minutes, as well as it can effectively bypass both Write XOR Execute (W⊕X) and ASLR.
- 26 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 120152-120163
Open AccessARG: Automatic ROP Chains Generation
Return Oriented Programming (ROP) chains attack has been widely used to bypass Data Execution Prevention (DEP) and Address Space Layout Randomization (ASLR) protection. However, the generation technology for ROP chains is still in a state of manual coding. While, current techniques for automatically generating ROP chains are still insufficiently researched and have few successful applications. On the other hand, the existing methods are based on using Intermediate Language (IL) which is in order to translate the semantics of original instructions for symbolic execution, and then fill in a predefined gadget arrangement to automatically construct a gadget list. This kind of methods may bring following problems: (1) when converting semantics of original to IL, there is a large amount of overhead time, critical instructions may be discarded; (2) the process of populating a predetermined gadget arrangement is inflexible and may fail to construct ROP chains due to address mismatching. In this paper, we propose the Automatic ROP chains Generation (ARG) which is the first fully automatic ROP chains generation tool without using IL. Tested with data from 6 open-source international Capture The Flag (CTF) competitions and 3 Common Vulnerabilities & Exposures (CVE)s, this technology successfully generated ROP chains for all of them. According to the obtained results, our technique can automatically create ROP payloads and reduce up to 80% of ROP exploit payloads. It takes only 3-5 seconds to exploit successfully, compared to manual analysis for at least 60 minutes, as well as it can effectively bypass both Write XOR Execute (W⊕X) and ASLR.