A Novel Multiple Watermarking Algorithm Based on Correlation Detection for Vector Geographic Data

Wang, Yingying; Yang, Cheng‐Hong; Zhu, Chenchen; Ren, Na; Chen, Peng

doi:10.1007/978-981-10-3966-9_49

Cited by 8 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the vector geographic data is very sensitive to sharing, most of current work on vector map security has neglected to efficiently protect it. Much of such work focuses on digital watermarking Peng et al (2018); Wang et al (2016), access control Ma et al (2010), data scrambling Van et al (2017); Jang et al (2014); Anbo et al (2016), and data encryption Jiang and Zhou (2018); Pham et al (2017b). These existing solutions can provide better confidentiality and integrity protection.…”

Section: Introductionmentioning

confidence: 99%

VMPS: A Vector Map Protection Framework Supporting Dynamic Game and Local Desensitization

Hua

Duan

et al. 2022

Preprint

View full text Add to dashboard Cite

Secure sharing of geospatial information has attracted widespread attention in recent years. As a typical geospatial data, vector maps can be used in many fields of national economic and social development. However, there are many security threats to data sharing of vector digital map, such as tampering, forgery, infringement, data leakages. Due to the complex spatial relation nature, existing data protection solutions are either infeasible or ineffective in such scenarios, especially for the exchange, sharing, and publishing of map data. To address these real security problems, in this paper, we propose a novel vector map protection framework, which introduces the idea of dynamic game and local desensitization. Two basic models and a specific scheme, including an important information protection model, an optimal data desensitization model, and a game-based local desensitization scheme, are presented in this framework. Dynamic game strategies can be used to effectively measure the utility of players under different decisions. Furthermore, important or sensitive map elements in vector maps can be desensitized locally in a controlled and reversible manner , thereby achieving more efficient data protection and secure sharing. A comprehensive evaluation, including desensitization strategies, performance and time consumption, accuracy control and reversibility, is given to show the security and feasibility of the proposed framework.

show abstract

Section: Introductionmentioning

confidence: 99%

VMPS: A Vector Map Protection Framework Supporting Dynamic Game and Local Desensitization

Hua

Duan

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Although the vector geographic data is very sensitive to sharing, most of current work on vector map security has neglected to efficiently protect it. Much of such work focuses on digital watermarking [8,9], access control [10], data scrambling [11][12][13], and data encryption [14,15]. These existing solutions can provide better confidentiality and integrity protection.…”

Section: Introductionmentioning

confidence: 99%

VMPS: A Vector Map Protection Framework Supporting Dynamic Game and Local Desensitization

Hua

Duan

et al. 2022

Preprint

View full text Add to dashboard Cite

Secure sharing of geospatial information has attracted widespread attention in recent years. As a typical geospatial data, vector maps can be used in many fields of national economic and social development. However, there are many security threats to data sharing of vector digital maps, such as tampering, forgery, infringement, data leakages. Due to the complex spatial relation nature, existing data protection solutions are either infeasible or ineffective in such scenarios, especially for the exchange, sharing, and publishing of map data. To address these real security problems, in this paper, we propose a novel vector map protection framework, which introduces the idea of dynamic game and local desensitization. Two basic models and a specific scheme, including an important information protection model, an optimal data desensitization model, and a game-based local desensitization scheme, are presented in this framework. Dynamic game strategies are adopted to effectively measure the utility of players under different decisions. Furthermore, important or sensitive map elements in vector maps are desensitized locally in a controlled and reversible manner, thereby achieving more efficient data protection and secure sharing. A comprehensive evaluation, including desensitization strategies, performance and time consumption, accuracy control and reversibility, is given to show the security and feasibility of the proposed framework.

show abstract

“…However, the algorithm in [7] has a limited applicability because it is weakness against cropping attacks. In [26], several watermarks are embedded in the same coordinates one by one by using additive embedding rule. In addition, the original data are required in detection process.…”

Section: Introductionmentioning

confidence: 99%

A multiple watermarking algorithm for vector geographic data based on coordinate mapping and domain subdivision

Wang

Yang

Zhu

2017

Multimed Tools Appl

Self Cite

View full text Add to dashboard Cite

A lot of watermarking algorithms for vector geographic data are presented in the literature. Due to widely application of digital watermarking, more demands are required, such as multiple watermarking algorithm. However, vector geographic data attracted less research focus on multiple watermarking. Consequently, a multiple watermarking algorithm for vector geographic data is proposed. In particular, the vertices are mapped to the logic domains firstly based on the constructed function. Then every domain is subdivided into blocks according to dichotomy and the number of embedding watermarks. Then, every watermark is embedded in the corresponding block. During the watermark detection, the watermarks are detected without the original vector geographic data. Finally, the experiments are made to test the multiple watermark capacity and robustness against attacks, with an emphasis on cropping attacks. The experimental results show that the proposed algorithm has good robustness against common attacks, such as, data simplification, vertex addition, vertex deletion, feature deletion, and cropping attacks. Moreover, the algorithm provides high multiple watermark capacity.

show abstract

A Novel Multiple Watermarking Algorithm Based on Correlation Detection for Vector Geographic Data

Cited by 8 publications

References 8 publications

VMPS: A Vector Map Protection Framework Supporting Dynamic Game and Local Desensitization

VMPS: A Vector Map Protection Framework Supporting Dynamic Game and Local Desensitization

VMPS: A Vector Map Protection Framework Supporting Dynamic Game and Local Desensitization

A multiple watermarking algorithm for vector geographic data based on coordinate mapping and domain subdivision

Contact Info

Product

Resources

About