scholarly journals Vector Map Random Encryption Algorithm Based on Multi-Scale Simplification and Gaussian Distribution

2019 ◽  
Vol 9 (22) ◽  
pp. 4889 ◽  
Author(s):  
Pham ◽  
Ngo ◽  
Bui ◽  
Tran ◽  
Lee ◽  
...  
Keyword(s):  
Gaussian Distribution ◽  
Computation Time ◽  
Geographical Information ◽  
Encryption Algorithm ◽  
Secret Key ◽  
Multi Scale ◽  
Vector Map ◽  
Vector Maps ◽  
Illegal Copying ◽  
Map Data

In recent years, GIS (Geographical Information System) vector maps are widely used in everyday life, science, and the military. However, the production process of vector maps is expensive, and a large volume of vector map data is easily stolen and illegally distributed. Therefore, original providers desire an encryption solution to encrypt GIS vector map data before being stored and transmitted in order to prevent pirate attacks and to ensure secure transmission. In this paper, we propose an encryption algorithm for GIS vector map data for preventing illegal copying, and ensuring secured storage and transmission. Polyline/polygon data of GIS vector maps are extracted to compute a backbone object. The backbone object is then selectively simplified by the multi-scale simplification algorithm in order to determine the feature vertices of the backbone object. The feature vertices of the backbone object are encrypted by the advanced encryption standard and the secret key. Finally, all vertices of the backbone object are randomized by the random Gaussian distribution algorithm to obtain the encrypted GIS vector map. Experimental results show that the entire map is altered completely after the encryption process. The proposed method is responsive to the various GIS vector map data formats, and also provides better security than previous methods. The computation time of the proposed method is also significantly shorter than that of previous methods.

scholarly journals Vector Map Encryption Algorithm Based on Double Random Position Permutation Strategy

2021 ◽  
Vol 10 (5) ◽  
pp. 311
Author(s):  
Xiaolong Wang ◽  
Haowen Yan ◽  
Liming Zhang
Keyword(s):  
Encryption Algorithm ◽  
Hyperchaotic System ◽  
Secret Key ◽  
Vector Map ◽  
Coordinate Position ◽  
Random Position ◽  
One To One ◽  
Map Objects ◽  
Geographic Information Sciences ◽  
The Relationship

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.

scholarly journals A Zero-Watermarking Scheme for Vector Map Based on Feature Vertex Distance Ratio

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Yuwei Peng ◽  
Mingliang Yue
Keyword(s):  
Digital Watermarking ◽  
Rapid Development ◽  
Vector Data ◽  
Distance Ratio ◽  
Vector Map ◽  
Zero Watermarking ◽  
Illegal Copying ◽  
Map Data ◽  
Watermarking Scheme ◽  
Geometrical Attacks

With the rapid development of GIS and computer techniques, vector map data has been widely used in many fields. Since the production of map data is very costly, illegal copying will result in huge loss for data owners. In order to protect the copyright of vector data, digital watermarking has been employed in recent years. In this paper, a zero-watermarking scheme for vector map data is proposed. In the proposed scheme, FVDR (feature vertex distance ratio) is constructed based on the feature vertices of objects. The feature data, FVDR, is combined with watermark to generate the zero-watermark. Due to the specially designed cover data, the proposed scheme is robust to geometrical attacks, vertex attacks, and object attacks. The results of extensive experiments also demonstrate the robustness of the proposed scheme.

scholarly journals Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

2019 ◽  
Vol 9 (4) ◽  
pp. 642 ◽  
Author(s):  
Xu Xi ◽  
Xinchang Zhang ◽  
Weidong Liang ◽  
Qinchuan Xin ◽  
Pengcheng Zhang
Keyword(s):  
Singular Value Decomposition ◽  
Singular Value ◽  
Two Dimensional ◽  
Triangle Mesh ◽  
Vector Map ◽  
Vector Maps ◽  
Feature Sequence ◽  
Zero Watermarking ◽  
Value Decomposition ◽  
Watermarking Scheme

Digital watermarking is important for the copyright protection of electronic data, but embedding watermarks into vector maps could easily lead to changes in map precision. Zero-watermarking, a method that does not embed watermarks into maps, could avoid altering vector maps but often lack of robustness. This study proposes a dual zero-watermarking scheme that improves watermark robustness for two-dimensional (2D) vector maps. The proposed scheme first extracts the feature vertices and non-feature vertices of the vector map with the Douglas-Peucker algorithm and subsequently constructs the Delaunay Triangulation Mesh (DTM) to form a topological feature sequence of feature vertices as well as the Singular Value Decomposition (SVD) matrix to form intrinsic feature sequence of non-feature vertices. Next, zero-watermarks are obtained by executing exclusive disjunction (XOR) with the encrypted watermark image under the Arnold scramble algorithm. The experimental results show that the scheme that synthesizes both the feature and non-feature information improves the watermark capacity. Making use of complementary information between feature and non-feature vertices considerably improves the overall robustness of the watermarking scheme. The proposed dual zero-watermarking scheme combines the advantages of individual watermarking schemes and is robust against such attacks as geometric attacks, vertex attacks and object attacks.

scholarly journals Quantum Dual Signature with Coherent States Based on Chained Phase-Controlled Operations

2020 ◽  
Vol 10 (4) ◽  
pp. 1353 ◽  
Author(s):  
Jinjing Shi ◽  
Shuhui Chen ◽  
Jiali Liu ◽  
Fangfang Li ◽  
Yanyan Feng ◽  
...  
Keyword(s):  
Coherent States ◽  
Security Analysis ◽  
Encryption Algorithm ◽  
High Fidelity ◽  
Signature Scheme ◽  
Secret Key ◽  
Simulation Experiments ◽  
Quantum Devices ◽  
Shared Secret ◽  
Cnot Operation

A novel encryption algorithm called the chained phase-controlled operation (CPCO) is presented in this paper, inspired by CNOT operation, which indicates a stronger correlation among message states and each message state depending on not only its corresponding key but also other message states and their associated keys. Thus, it can prevent forgery effectively. According to the encryption algorithm CPCO and the classical dual signature protocols, a quantum dual signature scheme based on coherent states is proposed in this paper. It involves three participants, the customer Alice, the merchant Bob and the bank Trent. Alice expects to send her order message and payment message to Bob and Trent, respectively. It is required that the two messages must be linked to guarantee the payment is paid for the corresponding order. Thus, Alice can generate a quantum dual signature to achieve the goal. In detail, Alice firstly signs her two messages with the shared secret key. Then She connects the two signatures into a quantum dual signature. Finally, Bob and Trent severally verify the signatures of the order message and the payment message. Security analysis shows that our scheme can ensure its security against forgery, repudiation and denial. In addition, simulation experiments based on the Strawberry Fields platform are performed to valid the feasibility of CPCO. Experimental results demonstrate that CPCO is viable and the expected coherent states can be acquired with high fidelity, which indicates that the encryption algorithm of the scheme can be implemented on quantum devices effectively.

Security Based Processed Video Distribution on Multi-Core System

2014 ◽  
Vol 984-985 ◽  
pp. 1357-1363
Author(s):  
M. Vinothini ◽  
M. Manikandan
Keyword(s):  
Computation Time ◽  
Communication Process ◽  
Secret Key ◽  
Core System ◽  
Ip Address ◽  
Video Distribution ◽  
Encryption And Decryption ◽  
Security Guarantees ◽  
Secured Communication ◽  
Parallel Fashion

During real time there are problems in transmitting video directly to the client. One of the main problems is, intermediate intelligent proxy can easily hack the data as the transmitter fails to address authentication, and fails to provide security guarantees. Hence we provide steganography and cryptography mechanisms like secure-code, IP address and checksum for authentication and AES algorithm with secret key for security. Although the hacker hacks the video during transmission, he cannot view the information. Based on IP address and secure-code, the authenticated user only can get connected to the transmitter and view the information. For further improvement in security, the video is converted into frames and these frames are split into groups and separate shared key is applied to each group of frames for encryption and decryption. This secured communication process is applied in image processing modules like face detection, edge detection and color object detection. To reduce the computation time multi-core CPU processing is utilized. Using multi-core, the tasks are processed in parallel fashion.

scholarly journals System to Safeguard the Identity of Persons in Photographs through Cryptography and Steganography Techniques Using Chaos

2018 ◽  
Vol 2018 ◽  
pp. 1-16
Author(s):  
Octavio Flores Siordia ◽  
Juan Carlos Estrada Gutiérrez ◽  
Carlos Eduardo Padilla Leyferman ◽  
Jorge Aguilar Santiago ◽  
Maricela Jiménez Rodríguez
Keyword(s):  
High Sensitivity ◽  
Encryption Algorithm ◽  
Coding System ◽  
Secret Key ◽  
Least Significant Bit ◽  
Large Space ◽  
Plain Text ◽  
Chaotic Orbits ◽  
Diffusion Technique ◽  
Plain Image

Safeguarding the identity of people in photographs or videos published through social networks or television is of great importance to those who do not wish to be recognized. In this paper, a face detecting and coding system is designed with the goal of solving this problem. Mathematical models to generate chaotic orbits are deployed. One of them applies the diffusion technique to scramble the pixels of each face while another implements the confusion technique to alter the relation between plain text and ciphered text. Afterward, another two orbits are utilized for the steganography technique to modify the least significant bit (LSB) to conceal data that would allow authorized users to decipher the faces. To verify the robustness of the proposed encryption algorithm, different tests are performed with the Lena standard image, such as correlation diagrams, histograms, and entropy. In addition, occlusion, noise, and plain image attacks are performed. The results are compared with those of other works, and the proposed system provided high sensitivity at secret key and a large space for the encryption keys, good speed for ciphering, disorder in the cryptogram, security, data integrity, and robustness against different attacks.

scholarly journals An Efficient Method of Image Encryption Using Rossler Chaotic System

2021 ◽  
Vol 10 (2) ◽  
pp. 11
Author(s):  
Yasir Ahmed Hamza ◽  
Marwan Dahar Omer
Keyword(s):  
Image Encryption ◽  
Chaotic System ◽  
Initial Conditions ◽  
Computation Time ◽  
Encryption Algorithm ◽  
Brute Force ◽  
Symmetric Encryption ◽  
New Approach ◽  
System Parameters ◽  
Plain Image

In this study, a new approach of image encryption has been proposed. This method is depends on the symmetric encryption algorithm RC4 and Rossler chaotic system. Firstly, the encryption key is employed to ciphering a plain image using RC4 and obtains a ciphered-image. Then, the same key is used to generate the initial conditions of the Rossler system. The system parameters and the initial conditions are used as the inputs for Rossler chaotic system to generate the 2-dimensional array of random values. The resulted array is XORed with the ciphered-image to obtain the final encrypted-image. Based on the experimental results, the proposed method has achieved high security and less computation time. Also, the proposed method can be resisted attacks like (statistical, brute-force, and differential).

scholarly journals Integrated Time-Fractional Diffusion Processes for Fractional-Order Chaos-Based Image Encryption

Sensors ◽  
2021 ◽  
Vol 21 (20) ◽  
pp. 6838
Author(s):  
Fudong Ge ◽  
Zufa Qin ◽  
YangQuan Chen
Keyword(s):  
Boundary Conditions ◽  
Image Encryption ◽  
Fractional Order ◽  
Diffusion Processes ◽  
Fractional Diffusion ◽  
Spatiotemporal Chaos ◽  
Diffusion System ◽  
Encryption Algorithm ◽  
Secret Key ◽  
Image Encryption Algorithm

The purpose of this paper is to explore a novel image encryption algorithm that is developed by combining the fractional-order Chua’s system and the 1D time-fractional diffusion system of order α∈(0,1]. To this end, we first discuss basic properties of the fractional-order Chua’s system and the 1D time-fractional diffusion system. After these, a new spatiotemporal chaos-based cryptosystem is proposed by designing the chaotic sequence of the fractional-order Chua’s system as the initial condition and the boundary conditions of the studied time-fractional diffusion system. It is shown that the proposed image encryption algorithm can gain excellent encryption performance with the properties of larger secret key space, higher sensitivity to initial-boundary conditions, better random-like sequence and faster encryption speed. Efficiency and reliability of the given encryption algorithm are finally illustrated by a computer experiment with detailed security analysis.

Sign in / Sign up

Export Citation Format

Share Document