Xiaolong Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiaolong Wang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Liming Zhang
Lanzhou Jiaotong University
2 shared publications - Haowen Yan
Lanzhou Jiaotong University
1 shared publication - Qihang Zhang
Faculty of Geomatics, Lanzhou Jiaotong University, Lanzhou 730070, China
1 shared publication - Xingang Zhang
Nanjing University
1 shared publication - Yu Li
Faculty of Geomatics, Lanzhou Jiaotong University, Lanzhou 730070, China
1 shared publication
Latest Publications
- Open Access
- 25 October 2021
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 10 (11) , 718
A Novel Invariant Based Commutative Encryption and Watermarking Algorithm for Vector Maps
Commutative encryption and watermarking (CEW) is an emerging method that combines encryption technology with digital watermarking technology. It has the dual capability of secure transmission and copyright protection. However, the existing CEW methods for vector maps have good robustness in resisting geometric attacks but poor resistance to vertex attacks (e.g., addition, deletion, etc.). To solve this problem, here we propose a novel invariant-based CEW algorithm for vector maps, which consists of permutation-based encryption scheme and coordinates-based watermarking scheme. In the encryption scheme, the encryption key is generated via the Gaussian distribution method combined with the SHA-512 hash method; then, the double random position permutation strategy is applied to the vector map encryption. In watermarking embedding scheme, the original watermark image is scrambled via logistic chaotic encryption before embedding, and the coordinates of all the vertices are normalized. Then, the scrambled watermark image is embedded into the normalized coordinates. Results show that: proposed method is more robust to conventional attacks (e.g., vertex addition and deletion, reordering and data format conversion) and geometric attacks (e.g., scaling and translation). In addition, compared with the existing CEW methods for vector maps, the proposed method has higher security and stronger robustness against vertex attacks.
- 25 October 2021
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 10 (11) , 718
Open AccessA Novel Invariant Based Commutative Encryption and Watermarking Algorithm for Vector Maps
Commutative encryption and watermarking (CEW) is an emerging method that combines encryption technology with digital watermarking technology. It has the dual capability of secure transmission and copyright protection. However, the existing CEW methods for vector maps have good robustness in resisting geometric attacks but poor resistance to vertex attacks (e.g., addition, deletion, etc.). To solve this problem, here we propose a novel invariant-based CEW algorithm for vector maps, which consists of permutation-based encryption scheme and coordinates-based watermarking scheme. In the encryption scheme, the encryption key is generated via the Gaussian distribution method combined with the SHA-512 hash method; then, the double random position permutation strategy is applied to the vector map encryption. In watermarking embedding scheme, the original watermark image is scrambled via logistic chaotic encryption before embedding, and the coordinates of all the vertices are normalized. Then, the scrambled watermark image is embedded into the normalized coordinates. Results show that: proposed method is more robust to conventional attacks (e.g., vertex addition and deletion, reordering and data format conversion) and geometric attacks (e.g., scaling and translation). In addition, compared with the existing CEW methods for vector maps, the proposed method has higher security and stronger robustness against vertex attacks.
- Open Access
- 7 May 2021
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 10 (5) , 311
Vector Map Encryption Algorithm Based on Double Random Position Permutation Strategy
Encryption of vector maps, used for copyright protection, is of importance in the community of geographic information sciences. However, some studies adopt one-to-one mapping to scramble vertices and permutate the coordinates one by one according to the coordinate position in a plain map. An attacker can easily obtain the key values by analyzing the relationship between the cipher vector map and the plain vector map, which will lead to the ineffectiveness of the scrambling operation. To solve the problem, a vector map encryption algorithm based on a double random position permutation strategy is proposed in this paper. First, the secret key sequence is generated using a four-dimensional quadratic autonomous hyperchaotic system. Then, all coordinates of the vector map are encrypted using the strategy of double random position permutation. Lastly, the encrypted coordinates are reorganized according to the vector map structure to obtain the cipher map. Experimental results show that: (1) one-to-one mapping between the plain vector map and cipher vector map is prevented from happening; (2) scrambling encryption between different map objects is achieved; (3) hackers cannot obtain the permutation key value by analyzing the pairs of the plain map and cipher map.
- 7 May 2021
- Published by MDPI AG in ISPRS International Journal of Geo-Information
- Vol. 10 (5) , 311
Open AccessVector Map Encryption Algorithm Based on Double Random Position Permutation Strategy
Encryption of vector maps, used for copyright protection, is of importance in the community of geographic information sciences. However, some studies adopt one-to-one mapping to scramble vertices and permutate the coordinates one by one according to the coordinate position in a plain map. An attacker can easily obtain the key values by analyzing the relationship between the cipher vector map and the plain vector map, which will lead to the ineffectiveness of the scrambling operation. To solve the problem, a vector map encryption algorithm based on a double random position permutation strategy is proposed in this paper. First, the secret key sequence is generated using a four-dimensional quadratic autonomous hyperchaotic system. Then, all coordinates of the vector map are encrypted using the strategy of double random position permutation. Lastly, the encrypted coordinates are reorganized according to the vector map structure to obtain the cipher map. Experimental results show that: (1) one-to-one mapping between the plain vector map and cipher vector map is prevented from happening; (2) scrambling encryption between different map objects is achieved; (3) hackers cannot obtain the permutation key value by analyzing the pairs of the plain map and cipher map.