ScienceDirect
Random no. Set of integers under p KeGn(x)
Download 0.73 Mb. Pdf ko'rish
|
An Efficient Homomorphic Medical Image Encryption
- Bu sahifa navigatsiya:
- E(key,w,g)=a g (wq+i) mod p
- D(key,c,g)=(c×a -g mod p) mod q
- 3.3 Proof For Homomorphic Property
Random no. Set of integers under p KeGn(x) → (key,p). Encryption is also based on the probablistic algorithm. This shows that it secures the cipher text data from chosen cipher text attack [6] Table 2: Encryption parameters Parameter Type Constraints i Input Matrix g Small positive integer Cipher text degree. w Big random |w|+|q|<|p| Since, Encryption and decryption is performed once , the value of g is 1. E(key,w,g)=a g (wq+i) mod p Steps: Step 1 : Rasterize the input image and obtain the matrix elements. Step 2 : Pass those elements one by one to the above equation. Step 3 : The array of encrypted elements should be converted again to image. Step 4 : That image is the encrypted image to be stored in cloud. Decryption is based on the deterministic algorithm [6] Table 3: Decryption parameters Parameter Type Constraints c Cipher Encrypted matrix a -g Integer Multiplicative inverse of a g g Small int Positive integer… D(key,c,g)=(c×a -g mod p) mod q Step 1 : Rasterize the encrypted image and obtain the matrix elements. Step 2 : Pass those elements one by one to the above equation. Step 3 : The array of decrypted elements should be converted again to image. Step 4 : Thus the original image is obtained. 3.3 Proof For Homomorphic Property Let c 1 and c 2 are the two cipher texts for the messages i 1 and i 2. As mentioned above the parameter g 1 and g 2 are the small positive integres & w 1 and w 2 are the big random positive integer. p and q are the two big prime in which p>>q.Hence, c 1 = a g1 (w 1 q+i 1 ) mod p &c 2 = a g2 (w 2 q+i 2 ) mod p Homomorphic Multiplicative property (c 1 ×c 2 ) mod p = a g1 (w 1 q+i 1 ) mod p×a g2 (w 2 q+i 2 ) mod p =a g1+g2 (w 1 w 2 q 2 +w 1 qi 2 +i 1 w 2 q+i 1 ×i 2 )mod p = a g1+g2 ((w 1 w 2 q+w 1 i 2 +i 1 w 2 )q+i 1 ×i 2 ) mod p Homomorphic Additive property (c 1 +c 2 ) mod p = a g1 (w 1 q+i 1 ) mod p+a g2 (w 2 q+i 2 ) mod p =a g1 (w 1 +w 2 )q+i1+i2)modp (if g1=g2) Thus Homomorphic Multiplication, Homomorphic Addition , Homomorphic Subtraction and Homomorphic scalar multiplication shows that these are the operations that can be performed on cipher text data that are stored on cloud in order to secure the original data from unauthorized access. Thus finally the original image is obtained. A.M. Vengadapurvaja et al. / Procedia Computer Science 115 (2017) 643–650 647 A.M.Vengadapurvaja,G.Nisha,R.Aarthy,N,Sasikaladevi/ Procedia Computer Science 00 (2017) 000–000 5 Download 0.73 Mb. Do'stlaringiz bilan baham: |
Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©fayllar.org 2024
ma'muriyatiga murojaat qiling
ma'muriyatiga murojaat qiling