Robust Secret Sharing for Image Encryption in Fractional Fourier Transform Domain
Sumit Kumar, Rashi Sharma, Md. Akhlaqur Rahman, Rajib Kumar Jha, Neha, Shreya Shreya, Amit Verma, Yashvir Singh · 2019 International Conference on Computing, Power and Communication Technologies (GUCON) · 2019
The protection of real-time data such as image, audio etc., plays a huge role in the digital era. In the literature, the encryption of these data by using the share generation matrix has been revealed in considerable depth. The thought of sharing matrix constitutes a vast potential to encrypt the image. The statistical investigation for S(k,n) matrix reveals the very much strength and protection of the image. However, recently, the majority of the works were accomplished in the spatial domain. Here, we expose the idea of fractional Fourier transform with two keys [α 1 , α 2 ]. For the demonstration, we consider the simplest case with two orders. To increase the keyspace, we can choose many blocks of the image. For different blocks, we may consider distinct orders. We also show how our encryption technique, along with the shares, can make the decryption process more robust. With the help of an example, we have performed and listed all the steps in our proposed technique. A slight or significant change in α 1 and α 2 produces a large discrepancy in the decrypted output. Comparative analysis with state-of-the-art techniques shows the feasibility of the proposed technique.