Selective Encryption Scheme for Vector Map Data in DCT Domain using Shape Components
- Alternative Title
- Selective Encryption Scheme for Vector Map Data in DCT Domain using Shape Components
- Abstract
- Recently years, vector map has developed, used in many domains, and in
most cases vector map data contains confidential information which must be
kept away from unauthorized users. Moreover, the producing process of a
vector map is considerably complex and the maintenance of a digital map
requires substantial monetary and human resources. In addition, widespread
of vector map applications, and the rapid development of vector map
contents, a large volume of valuable vector map dataset has been
distributed illegally. Therefore the problem focuses on how to protect the
vector map data for multimedia applications, storage and transmission. At
this point, security techniques for vector map focusing on secure network,
copyright and data encryption have been studied. This paper presents the
selective encryption scheme in DCT domain for vector map security for
multimedia applications, storage, transmission and distribution to authorized
users. In proposed scheme, polylines and polygons in vector map are
targets of selective encryption. Vector map is separated to select polylines and
polygons, and then they are randomized vertices by random algorithms
before changing them in DCT domain. Here, I present two ways to perform
selective encryption in DCT domain. First way, polylines/polygons are
classified into groups and then 1D-DCT. Second way, I arrange all
coordinates of vertices of polylines/polygons into a two dimensional array
and then 2D-DCT. In DCT domain, I select DC values of polylines/polygons
to encrypt by random algorithm and cryptography. Experimental results
verified that proposed algorithm is effectively and security. Maps are
changed whole after encryption process, and unauthorized users cannot
access to copy or use them. Encrypted maps do not alter the size of file and
it does not have loss accuracy. The error between original map and
decrypted map is approximate zero.
- Author(s)
- Pham Ngoc Giao
- Issued Date
- 2014
- Awarded Date
- 2014. 8
- Type
- Dissertation
- Publisher
- Pukyong National University
- URI
- https://repository.pknu.ac.kr:8443/handle/2021.oak/12339
http://pknu.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000001967204
- Alternative Author(s)
- Pham Ngoc Giao
- Affiliation
- Department of IT Convergence & Application Engineering
- Department
- 대학원 IT융합응용공학과
- Advisor
- Ki-Ryong Kwon
- Table Of Contents
- Contents
I. Introduction ............................................................................................ 1
II. Vector map security ................................................................................ 4
2.1 GIS vector map ............................................................................... 4
2.2 Vector map security ........................................................................ 7
2.2.1 Vector map watermarking ....................................................... 7
2.2.2 Vector map encryption ............................................................. 8
2.3 Content based selective encryption ................................................. 9
III. Vector map selective encryption .......................................................... 11
3.1 Definition ...................................................................................... 12
3.2 1D vector clustering method ......................................................... 13
3.2.1 Selective encryption ............................................................... 14
3.2.2 Selective decryption ............................................................... 17
3.3 2D vector method .......................................................................... 18
3.3.1 Selective encryption ............................................................... 19
3.3.2 Selective decryption ............................................................... 22
IV. Experimental results ............................................................................. 24
4.1 Visualization ................................................................................. 25
4.2 Algorithm evaluation .................................................................... 32
4.2.1 Security evaluation ................................................................ 32
4.2.2 Uniqueness evaluation ........................................................... 35
4.3 Decryption error ............................................................................ 36
4.4 Computation time .......................................................................... 38
V. Conclusion & Future work ................................................................... 41
- Degree
- Master
-
Appears in Collections:
- 대학원 > IT융합응용공학과
- Authorize & License
-
- Files in This Item:
-
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.