Version 1
: Received: 22 June 2024 / Approved: 23 June 2024 / Online: 24 June 2024 (08:44:20 CEST)
How to cite:
Dai, Q.; Wu, B.; Liu, F.; Bu, Z.; Zhang, H. Commutative Encryption and Reversible Watermarking Algorithm for Vector Maps Based on Virtual Coordinates. Preprints2024, 2024061615. https://doi.org/10.20944/preprints202406.1615.v1
Dai, Q.; Wu, B.; Liu, F.; Bu, Z.; Zhang, H. Commutative Encryption and Reversible Watermarking Algorithm for Vector Maps Based on Virtual Coordinates. Preprints 2024, 2024061615. https://doi.org/10.20944/preprints202406.1615.v1
Dai, Q.; Wu, B.; Liu, F.; Bu, Z.; Zhang, H. Commutative Encryption and Reversible Watermarking Algorithm for Vector Maps Based on Virtual Coordinates. Preprints2024, 2024061615. https://doi.org/10.20944/preprints202406.1615.v1
APA Style
Dai, Q., Wu, B., Liu, F., Bu, Z., & Zhang, H. (2024). Commutative Encryption and Reversible Watermarking Algorithm for Vector Maps Based on Virtual Coordinates. Preprints. https://doi.org/10.20944/preprints202406.1615.v1
Chicago/Turabian Style
Dai, Q., Zixuan Bu and Haodong Zhang. 2024 "Commutative Encryption and Reversible Watermarking Algorithm for Vector Maps Based on Virtual Coordinates" Preprints. https://doi.org/10.20944/preprints202406.1615.v1
Abstract
The combination of encryption and digital watermarking technologies is a trend to achieve full lifecycle data protection. Recently, reversible data hiding in encrypted domain (RDHED) has greatly aroused the interests of many scholars. But the fixed order of first encryption and then watermarking makes this kind of algorithms unsuitable to many applications. Commutative encryption and watermarking (CEW) technology realizes the flexible combination of encryption and watermarking, and suits more applications. However, most existing CEW schemes for vector maps are not reversible and unsuitable to high precision maps. To solve this problem, here we propose a commutative encryption and reversible watermarking (CERW) algorithm for vector maps based on virtual coordinates which are uniformly distributed on the number axis. The CERW algorithm consists of virtual interval step based encryption scheme and coordinate difference based reversible watermarking scheme. In the encryption scheme, the map coordinates are moved randomly by multiples of virtual interval step defined as distance between two adjacent virtual coordinates. In the reversible watermarking scheme, difference expansion (DE) technique is used to embed the watermark bit into the coordinate difference computed based on the relative position of a map coordinate in a virtual interval. Since the relative position of a map coordinate in a virtual interval keeps unchanged during the coordinate scrambling encryption process, the watermarking operation and the encryption operation don’t interfere with each other and the commutativity between encryption and watermarking achieves. Results show that: proposed method has high security, high capacity and good invisibility. In addition, the algorithm is not only applicable to polyline and polygon vector data, but also can be applied to sparsely distributed point data which the traditional DE watermarking algorithm often fails to watermark.
Computer Science and Mathematics, Security Systems
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
