Simultaneous optimization of the resistance and transparency of image encryption based on psycho-visual techniques

Number of pages: 156 File Format: word File Code: 31051
Year: 2014 University Degree: Master's degree Category: Computer Engineering
  • Part of the Content
  • Contents & Resources
  • Summary of Simultaneous optimization of the resistance and transparency of image encryption based on psycho-visual techniques

    Dissertation for M.Sc degree

    Trend: Software Engineering

    Abstract

    The process of inserting information into a multimedia signal so that the effect of insertion is not obvious and the information can be extracted when needed is called encryption. To implement a cryptography idea, one should focus on the features of power[1], reliability and reliability[2] and invisibility[3]. Most of the existing methods of hiding color images are designed in such a way that inserting the hiding image is done only in the brightness component of the image. The most important disadvantages of these methods are: 1) These methods are sensitive to color attacks because they ignore the communication between different color channels. 2) Due to the lack of detection of inconsistency in the image, these methods are not resistant to geometric attacks. Therefore, the main challenge is to design a color image encryption idea that is resistant to geometric attacks. For this reason, by using quadruple Fourier transform, singular value matrices [4] and least squares support vector machine [5], we have proposed a blind and robust color image hiding idea in the field of quadruple Fourier transform, which has good visual quality. In this idea, first the original color image is divided into sub-blocks and then, on each of the sub-blocks, the fast fourier transform is performed. Finally, the digital image is inserted by adaptive modulation in the individual values ??of the real coefficients of the quadruple Fourier transform of the image blocks. In order to extract the latent image, according to the values ??of the pseudo-instantaneous moments (primary rows of the matrix), using the least squares support vector machine algorithm, correction is done on the latent image. The results of the simulations show that the proposed idea of ??hiding in color images, in addition to resisting common image processing operations such as adding noise, filtering and JPEG compression, is also resistant to geometric distortion.

    Key words: image hiding, quad Fourier transform, singular value matrix, LS-SVM, geometric attacks

    Chapter 1: general research

    In this chapter, the concept of hiding first Digital images and their importance are discussed and then the objectives of the plan are explained. In the following, the research questions and hypotheses and innovations of the proposed algorithm are stated and explanations are provided about the keywords of the research. At the end, the structure of the plan is mentioned.

    1-1- Introduction

    Today, with the expansion of the Internet and computer networks, the issue of unauthorized copying of digital multimedia contents (such as image, video, audio, etc.) has become a more serious challenge. In this regard, digital encryption has been introduced as the best solution to detect the embedding, reproduction and unauthorized distribution of these multimedia contents (Cox and Miller[6], 2001). Encryption makes it impossible to access the desired product without knowing the correct encryption key, but after decoding, it is easy to make unauthorized changes to it or to reproduce and distribute it illegally. To enforce copyright laws and prevent unauthorized reproduction, interpolation and distribution of multimedia, the use of encryption is suggested as the best solution (Patra et al.[7], 2010).

    Digital encryption is a method of including copyright information or other information in the original multimedia data. In other words, the insertion of information in a multimedia signal in such a way that the effect of the insertion is not evident and that information can be retrieved when necessary is called encryption (Ebrahimi Moghadam and Nemati [8], 2013). In encryption, the signal quality of the host should not drop more than a certain amount. In a cryptography system with copyright law enforcement applications, the following requirements must be met (Kogianos et al. [9], 2009):

    1- Transparency[10]: The inclusion of the cryptography should not significantly affect the quality of the original signal. In fact, the latent image should be unrecognizable (invisible and inaudible) from the point of view of the human perceptual system.

    2- Resistance[11] against attacks: intruders should not be able to delete or change the latent image, therefore, the latent image should be resistant to normal signal processing changes such as filtering, compression, etc.

    3- The size of the thumbnail[12]: the number of bits that can be included in a specific number of host signal samples.

    4- Security[13]: This means that the detection of the latent image is possible only through the authorized user.

    5- The latent image can be extracted without the need for the original signal.

    6- The latent image cannot be recovered without the knowledge of how to insert it.

    7- It should be possible to insert the latent image directly into the signal, not the latent image only at the beginning of the signal.

    Usually, most of these requirements are in conflict with each other and a compromise should be made according to the application, for example, increasing the encryption rate (the size of the image) causes a decrease in the quality of the host signal, so it is possible to increase the encryption rate to a certain extent so that the quality of the host signal is acceptable (Lin et al. [14], 2011). In most cryptographic applications, it is very important to provide the characteristics of transparency and resistance, and the conflict between these characteristics causes a fundamental challenge in the design of robust cryptography systems. Of course, most researches and applications are focused on resistant cryptography. Generally, due to resistance to most signal processing operations, resistant cryptography systems are used for copyright protection and ownership verification applications (Rahman et al. [17], 2011). 1-1-1- General framework of cryptography systems. Data (cryptography) in an image, audio, text or video signal is called cryptography. The general framework and procedure of a cryptography system is shown in Figure (1-2). In any cryptographic system, when necessary, it is possible to extract the cryptographic image from the encrypted signal. The thumbnail may contain data such as copyright information, license number, patent number, etc. be Signing paintings is a simple example of cryptography to prove ownership. Each encryption algorithm consists of three parts (Wu and Sun[18], 2013):

    A- The cipher which contains unique information of the owner of the signal.

    B-Encoder- to insert the cipher into the host signal.

    1-1-2- types of cryptography

         According to the type of signal, human understanding, field of work and extraction procedure, cryptographic systems are divided into different categories, which are listed below for each of these divisions. According to the type of host signal, encryption systems are divided into the following four categories (Kogianos et al., 2009):

    Image encryption

    Audio encryption

    Video encryption

    Text encryption

    From the point of view of human perception, encryption systems are divided into three categories:

    Overt concealment

    Covert concealment

    Dual concealment

    are divided (Lin et al., 2011). In open encryption, encryption is seen as opaque or even transparent in the host signal, open encryption is used in copyright protection and ownership proof applications (Khodai and Faez [19], 2010). While in hidden encryption, in the insertion procedure, the values ??of the host signal samples are changed in such a way that the effect cannot be understood by humans. Hidden cryptography is used as a witness and evidence for the ownership of the signal and also to detect unauthorized change in it (Criver et al. [20], 1998). Double cryptography is also a combination of overt and covert cryptography, where the hidden cryptography is used as the supporting information of the overt cryptography. Encrypting systems are divided into two categories based on the working domain:

    space (time) domain encoding methods

    frequency domain encoding methods

    are divided (Patra et al., 2010). In the location domain stealth methods, the stealth information is inserted directly into the host signal samples, but in the frequency domain methods, after the signal is converted to the desired frequency domain, the stealth information is inserted into the frequency coefficients. In general, the frequency domain cryptography methods have much more resistance than the methods based on the time domain.

    According to how the cryptographic extraction procedure works, these systems can be divided into three categories:

    Seeing[21]

    Pseudo[22]

    Blind[23]

    (Lin et al., 2011). In Bina systems, the main host signal and cryptographic key are needed to extract the ciphertext

  • Contents & References of Simultaneous optimization of the resistance and transparency of image encryption based on psycho-visual techniques

    List:

    Abstract 1

    Chapter One: Research overview. 3

    1-1- Introduction. 3

    1-1-1- General framework of encryption systems. 5

    1-1-2- types of encryption. 5

    1-1-3- Attack on cryptography 7

    1-1-4- Applications of digital cryptography. 8

    1-2- statement of the problem. 9

    1-3- Necessity and importance of research. 10

    1-4- research objectives. 12

    1-5- Research questions. 12

    1-6- research hypotheses. 12

    1-7- Research innovation. 13

    1-8- Key words and terms. 13

    1-9- Thesis structure. 15

    The second chapter. 17

    A review of research literature. 17

    Chapter two: Review of research literature. 18

    2-1- Part I- The generalities of cryptography. 18

    2-1-1- Introduction. 19

    2-1-2- The concept, types and applications of encryption. 20

    2-1-2-1- The basis of cryptography. 20

    2-1-2-1-1 encoder 21

    2-1-2-1-2- decoder 21

    2-1-2-2- types of digital encryption. 22

    2-1-2-2-1- Time domain encryption versus frequency domain encryption. 22

    2-1-2-2-2- host multimedia signal type. 22

    2-1-2-2-3- Algorithms based on human perception. 23

    2-1-2-2-4- Cryptography from the point of view of application. 23

    2-1-2-2-5- types of cryptography based on the embedding method of cryptography 24

    2-1-2-2-6- reversibility and irreversibility of cryptography. 24

    2-1-2-2-7- hardware-based encryption systems 24

    2-1-2-2-8- desirable characteristics of hardware encryption systems. 24

    2-1-3- Attacks on cryptography and cryptography systems and their evaluation 25

    2-1-3-1- Attacks. 25

    2-1-3-1-1- elimination and interference attacks. 26

    2-1-3-1-2- geometric attacks. 26

    2-1-3-1-3- Security attacks (encryption) 27

    2-1-3-1-4- Protocol attacks. 27

    2-1-3-1-5- physical attacks. 27

    2-1-3-2- Test systems. 27

    2-1-3-2-1- Stirmark. 28

    2-1-3-2-2- Unsigned. 28

    2-1-3-2-3- Checkmark. 28

    2-1-3-2-4- Certimark. 29

    2-1-4- Problems and limitations in cryptographic ideas. 29

    2-1-4-1- Characteristics of visual signals. 29

    2-1-4-1-1- non-stationary (non-stationary) 30

    2-1-4-1-2- periodic. 30

    2-1-4-1-3- power spectrum density. 30

    2-1-4-1-4- characteristics of color signals. 30

    2-1-4-2- Characteristics of human vision system (HVS) 30

    2-1-4-2-1- brightness sensitivity. 31

    2-1-4-2-2- frequency sensitivity. 31

    2-1-4-2-3- sensitivity of the pattern (texture of the image) 31

    2-1-4-2-4- high distortions (JND) and small distortions (MND) 32

    2-1-4-3- how much and in what place can the hidden image be inserted? 32

    2-1-4-4- Broad Spectrum Communications 32

    2-1-4-5- Design Problems of Hardware-Based Ideas 33

    2-1-4-6- Limitations of Hijacking 34

    2-2- Second Part- Hijacking. 35

    2-2-1- The classic model of cryptography. 35

    2-2-1-1- The issue of prisoners 36

    2-2-1-2- Definitions. 38

    2-2-1-3- types of guards. 39

    2-2-1-4- Kerkaf principle in cryptography. 40

    2-2-1-5- The three main network security standards (CIA) 40

    2-2-2- The difference between encryption and encryption. 41

    2-2-3- Limitations of encryption. 42

    2-2-4- Uses of cryptography. 43

    2-2-5- The weakness of cryptography. 43

    2-2-6- Secrecy and security. 44

    2-2-7- The security of encryption systems. 45

    2-2-8- Classification of cryptography methods in terms of resistance. 46

    2-2-9- An overview of cryptography. 47

    2-2-10- Types of encryption methods in terms of secret information exchanged between sender and receiver 49

    2-2-10-1- Pure encryption. 50

    2-2-10-2- Encryption with secret key. 52

    2-2-10-3- Encryption with public key. 53

    2-2-11- Evaluation of covert recording methods. 56

    2-2-12- Hiding information in noisy data. 56

    2-2-13- Common criteria for evaluating the effectiveness of covert recording methods. 57

    2-2-13-1- Encryption security. 57

    2-2-13-2- Information security in terms of information theory. 58

    2-2-13-3- Capacity. 59

    2-2-13-4- Inconspicuousness. 59

    2-2-12- Nahan Kavi.60

    2-2-12-1- Types of hidden mining 61

    2-2-12-2- Hidden mining based on supervised learning. 62

    2-2-12-3- Latent mining based on blind detection 63

    2-2-12-4- Latent parametric statistical mining. 65

    2-2-12-5- Combined hidden mining methods. 66

    2-2-12-6- types of hidden mining attacks. 66

    2-2-12-7- Criteria for evaluating the efficiency of hidden mining methods. 67

    2-2-12-8- Evaluation of the hidden cave based on the defined criteria based on the disturbance matrix. 68

    2-2-12-9- Latent Kav evaluation based on ROC curve. 68

    2-3- The third part- Categorizing the methods of hidden photography in the image. 69

    2-3-1- Hijacking in the image. 69

    2-3-1-1- Image definition. 69

    2-3-1-2- image compression. 70

    2-3-1-3- marking. 72

    2-3-1-4- Differences between encryption and marking. 72

    2-3-1-5-types of marking systems. 73

    2-3-1-6- General classification of encryption methods. 74

    2-3-2- Categorization of image encryption methods according to domain 76

    2-3-2-1- Location domain. 77

    2-3-2-2-LSB. 77

    2-3-2-3- LSB and images with color box. 79

    2-3-2-4- conversion field. 80

    2-3-2-5- JPEG compression. 80

    2-3-2-6- JPEG encryption. 82

    2-3-2-7- LSB method in 24-bit color images. 85

    2-3-2-8- LSB replacement method. 85

    2-3-2-9- LSB matching method. 86

    2-3-2-10- Wavelet transform. 87

    2-4- Part IV- Background of the research. 87

    2-4-1- Introduction. 87

    2-4-2- Introduction of effective methods of hiding images. 88

    2-4-2-1- An overview of the required calculations 88

    2-4-2-1-1- Principles of the residual number system (RNS) 88

    2-4-2-1-2- An introduction to Singular Value Decomposition (SVD) 89

    2-4-2-2- Encrypting SVD1. 90

    2-4-2-3 – SVD2 encryption. 91

    2-4-2-4-CRT-based encryption. 91

    2-4-2-5- DCT-CRT-based encryption. 93

    2-4-2-6- FQFT (Fast Quaternion Fourier Transform) based cryptography 97

    2-5- Summarizing the studies done 99

    Chapter three. 101

    Materials and methods 101

    Chapter three - Materials and methods 102

    3-1- Advance income. 102

    3-2- Works related to cryptography resistant to geometric attacks. 103

    3-3- Quadruple Fourier transform. 105

    3-3-1- Quaternion display of color images. 105

    3-3-2- Fast Fourier transform on color images. 106

    3-4- Least squares support vector machine. 107

    3-4-1- History of support vector machine. 107

    3-4-2- Applications of SVM. 108

    3-4-3-The main idea of ??SVM. 109

    3-4-4- Linear discrimination problem. 110

    3-4-4-1- Familiarity with basic concepts. 110

    3-4-4-2- linear support vector machine. 111

    3-4-4-3- support vector machine for integral input vectors. 112

    3-4-4-4- non-linear support vector machine. 113

    3-4-4-5- Least squares support vector machine. 113

    3-5-Arnold transformation. 114

    3-6- Proposed encryption system. 115

    3-6-1- Inserting a hidden image 115

    3-6-2- LS-SVM training. 119

    3-6-3- Latent image extraction 119

    Figure 3-4 block diagram of the latent image extraction procedure in the proposed algorithm 3-7- System evaluation. 120

    3-7-1- Implementation of the algorithm. 122

    3-7-2- Database used 122

    3-7-3- Computational complexity. 125

    3-7-4- The quality of the encoded signal (transparency of the encoded image) 127

    3-7-4-1- Investigating the quality of the encoded signal from the perspective of the properties of the human visual system. 127

    3-7-4-2- Examining the quality of the encoded signal from the perspective of mathematical relationships. 128

    3-7-5- extracting the hidden image without attacking. 130

    3-7-6- resistance to attacks. 130

    3-7-6-1- Examining resistance against common attacks. 131

    3-7-6-2- Examining resistance against geometric attacks. 132

    Chapter IV. 136

    Conclusion and suggestions 136

    Chapter 4 - Conclusion and suggestions 137

    List of references. 139

     

     

    Source:

     

    AbulKayum, H., Moniruzzaman, M. and F

Simultaneous optimization of the resistance and transparency of image encryption based on psycho-visual techniques