A novel image encryption scheme based on an elliptic curve

Hayat, Umar; Azam, Naveed Ahmed

doi:10.1016/j.sigpro.2018.10.011

Cited by 140 publications

(146 citation statements)

References 24 publications

Supporting

Mentioning

137

Contrasting

Order By: Relevance

“…Figure 8 shows the results. For the experiment results, the given embedding rate are 0.5 bpp and 0.9 bpp, and the optimal parameters (m*, T*) are (7,5) and (6,4), respectively. Figure 8a is the original image Lena.…”

Section: A Detailed Example For the Proposed Methodsmentioning

confidence: 99%

“…Image encryption and data hiding are two main means for data security. The former aims to transform the meaningful image into a noise-like one to prevent image content leakage [1][2][3][4], while the latter embeds secret data into a cover image imperceptibly. In image encryption, the original image is the one to be protected, while, in data hiding, the secret data is the information that should be undisclosed.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Reversible Data Hiding in Encrypted Image Based on Multi-MSB Embedding Strategy

Wang

Zhang

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

In this paper, a reversible data hiding method in encrypted image (RDHEI) is proposed. Prior to image encryption, the embeddable pixels are selected from an original image according to prediction errors due to adjacent pixels with strong correlation. Then the embeddable pixels and the other pixels are both rearranged and encrypted to generate an encrypted image. Secret bits are directly embedded into the multiple MSBs (most significant bit) of the embeddable pixels in the encrypted image to generate a marked encrypted image during the encoding phase. In the decoding phase, secret bits can be extracted from the multiple MSBs of the embeddable pixels in the marked encrypted image. Moreover, the original embeddable pixels are restored losslessly by using correlation of the adjacent pixels. Thus, a reconstructed image with high visual quality can be obtained only when the encryption key is available. Since exploiting multiple MSBs of the embeddable pixels, the proposed method can obtain a very large embedding capacity. Experimental results show that the proposed method is able to achieve an average embedding rate as large as 1.7215 bpp (bits per pixel) for the BOW-2 database.Nowadays, RDHEI has received increasing attention in the research community, in which both the original image and secret data need to be protected. In RDHEI, image encryption and data embedding are accomplished by different users separately. The content-owner first encrypts the original image to a noise-like one according to encryption key, then the data hider embeds secret data into the encrypted image using a data-hiding key without knowing its original content. The receiver can perform different operations according to the available keys. This can be applied in many scenarios such as Cloud storage, medical image management system.In general, RDHEI can be divided into two categories, namely, vacating room after encryption (VRAE) [22][23][24][25][26][27][28][29][30][31] or reserving room before encryption (RRBE) [32][33][34][35][36][37][38][39]. Puech et al. [22] used an AES (advanced encryption standard) encryption algorithm to encrypt the original image, and then randomly selected a location in each 4×4 pixel block to embed the secret bits. In order to extract secret bits during the decryption phase, they performed a local standard deviation analysis of the marked image. The embedding rate (ER) of this method is very small, i.e., only 0.0625 bpp. Zhang [23] encrypted the original image using the stream cipher firstly and then divided the encrypted image into blocks and each pixel block was divided into two parts. In one part, the three LSBs of each pixel were flipped to embed a secret bit. On the receiver side, a fluctuation function was designed for data extraction and image recovery. Yu et al. [24] improves the method of Zhang et al. [23], so that the visual quality of decrypted images is improved. Wu et al.[25] adopted a prediction error to introduce two RDH methods in the encryption domain, namely, joint method and separable method. In or...

show abstract

Section: A Detailed Example For the Proposed Methodsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Reversible Data Hiding in Encrypted Image Based on Multi-MSB Embedding Strategy

Wang

Zhang

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…This scheme can overcome security flaw of the well-known chaotic image encryption called Baptista's algorithm and its improved versions. In [10], Hayat and Azam proposed a useful image encryption technique using a dynamic Sbox and pseudo-random numbers over an elliptic curve. This technique can resist known plaintext attack and chosen plaintext attack.…”

Section: Introductionmentioning

confidence: 99%

Image Encryption with Double Spiral Scans and Chaotic Maps

Tang

Yang

Shijie

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

Image encryption is a useful technique of image content protection. In this paper, we propose a novel image encryption algorithm by jointly exploiting random overlapping block partition, double spiral scans, Henon chaotic map, and Lü chaotic map. Specifically, the input image is first divided into overlapping blocks and pixels of every block are scrambled via double spiral scans. During spiral scans, the start-point is randomly selected under the control of Henon chaotic map. Next, image content based secret keys are generated and used to control the Lü chaotic map for calculating a secret matrix with the same size of input image. Finally, the encrypted image is obtained by calculating XOR operation between the corresponding elements of the scrambled image and the secret matrix. Experimental result shows that the proposed algorithm has good encrypted results and outperforms some popular encryption algorithms.

show abstract

“…Chen et al described an S-box based on three-dimensional chaotic baker maps in [13]. Hayat and Azam [14] used elliptic curves to construct an S-box by considering the ordinate of the curve for this construction. e construction of an S-box by using the projective general linear group was investigated by Altaleb et al in [15].…”

Section: Introductionmentioning

confidence: 99%

Construction of New S-Box Using Action of Quotient of the Modular Group for Multimedia Security

Shahzad

Mushtaq

Razaq

2019

Security and Communication Networks

View full text Add to dashboard Cite

Substitution box (S-box) is a vital nonlinear component for the security of cryptographic schemes. In this paper, a new technique which involves coset diagrams for the action of a quotient of the modular group on the projective line over the nite eld is proposed for construction of an S-box. It is constructed by selecting vertices of the coset diagram in a special manner. A useful transformation involving Fibonacci sequence is also used in selecting the vertices of the coset diagram. Finally, all the analyses to examine the security strength are performed. e outcomes of the analyses are encouraging and show that the generated S-box is highly secure.

show abstract

A novel image encryption scheme based on an elliptic curve

Cited by 140 publications

References 24 publications

Reversible Data Hiding in Encrypted Image Based on Multi-MSB Embedding Strategy

Reversible Data Hiding in Encrypted Image Based on Multi-MSB Embedding Strategy

Image Encryption with Double Spiral Scans and Chaotic Maps

Construction of New S-Box Using Action of Quotient of the Modular Group for Multimedia Security

Contact Info

Product

Resources

About