Homomorphic Encrypted Algorithms to Achieve Security in Cloud

Computing

Talasila Sasidhar, MannamBhargavi, Pavuluri Uma Maheswari, Mogallapalli Sai Sushmitha

Koneru Lakshmaiah Educational Foundation
Vaddeswaram, Guntur District
Computer Science and Engineering
[email protected], [email protected],
[email protected], [email protected]

Abstract

Cloud computing is an emerging technology and the use of cloud computing offers many benefits. In
cloud we can store large amount of data. But while storing data in cloud we bother about security.
There are many security related algorithms in cloud computing. In other algorithms like Hybrid
algorithm, AES and DES we need to provide two keys: Public key and Private key. To perform any
operations on data in above algorithms we need to decrypt data. While Decryption if we know the
keys then we can hack the data easily. So there may be a chance of losing the data using these
algorithms. So we consider Homomorphic Encryption algorithm because homomorphic encryption
algorithm does not require any keys to perform operations on data.In other algorithms our data will
be stored in the cloud but encoded data will be stored in the cloud by using the homomorphic
encryption algorithm. If any attack occurs also our data will be secure. Homomorphic Encryption is
divided into Single and Fully Homomorphic Encryption.

Keywords: Paillier Encryption Algorithm, Security, Homomorphic Encryption, Decryption,

Encryption, Keys.

1. Introduction
Homomorphic Encryption Algorithm is one type of encryption algorithm that is used to
analyse encrypted data without revealing our original data to anyone. The data is stored in the
encoded format in the homomorphic encryption algorithm. Homomorphic encryption is an
asymmetrical algorithm. Homomorphic Encryption algorithm is used in voting Systems. In present
society elections place a crucial role in which voting system is the decision making system. In voting
system each voter has a right to vote for any candidate as per his/her wish. The vote of the particular
voter will be stored but his/her information is kept secret and no modifications will be done to the
vote. The personal information of the voter will not be revealed to anyone.
 Original Encryption Encryption
Data Key Result

Store in
Cloud

Encrypted
Data is Safe Decrypt the
and
Result
decrypted
result same

Data is Corrupted

Figure 1.1: Homomorphic Encryption Process Flow Diagram

2. Elements of Homomorphic Encryption

Homomorphic Encryption HE has four capacities

HE = {Key, Encryption,Assesment,Decoding}

1. Key age: customer will be generating key pairs open key is pk and the other hidden key is sk for
plaintext encyption.

2. Encryption: By using mystery key sk customer encodes the plain content PT and generate Esk(PT)
and this figure material CT is sent to the server alongside open key pk.

3. Assessment: The server has capacity f for assessing the figure content CT and played out this as
per the necessary capacity utilizing pk.

4. Decoding: It will generate Eval(f(PT)) that will be decoded by customer utilizing their sk and it
will gets the unique outcome.

3. Practical applications of Homomorphic:

1.The Millionaires’ Problem :This problem states that there were two parties consider A and B .They
wan find out who is millionair among them but the won’t reveal their assests.This problem can be
solved b using homomorphically encrypted binary adders.

1. A contains x ∈{0 ,1 }k , containing a (k-1)-bits representing the revenue in binary as x 0.. , x k−2 x k−1
for 0 with a hidden SK code..

2. B has y { 0,1 } ^k, close to x, y k−1 for 0

3. A will choose a random η-bit integers t i∈ N in such a way that t i ≡ x i % 2 and encrypts x i←
+¿ ¿ '

E(t i)SK wih in a range x between {0,k-1}

4. B will choose a random n-bit of integers y i∈ N + in such a way that y i ≡ yi % 2 for range of i
' '

' '
between {0,k-1}). He will computes y i← y i+ 1 for a range of i between {0,k-1}, choosing at random
an n-bit int t '∈ N + posessingt ' ≡ 1%2, calculates l 0)) ← y 0+t ' and z 0← y 0 · t ' and furtherl i+ ← y i +
' ' ' ' ' '

' ' '

z i−1, z i ← y i· z i−1 for i range between{1,k-1} . Now he will have the 2’s complement of y ′ in l ′ . He
' ' ' ' ' ' ' ' ' ' ' ' '
calculates s0 ← x 0 +l 0and z 0← x 0· l 0. Finally, he computes si ← x i+l i)+ z i−1and z i ← ( x i· l i))) + z i−1
' '
*( x i+l i))for i in range between {1,k-1}
'
5. A will decode s ← D( sk−1 )SK and final for both A and B states that x<y if s ≡ 1% 2 and x ≥ by
otherwise.

B will start calculating the 2’s complement of his/her argument and then add A’s x. The MSB of
the sign indicating that the relation between x and y: if the result is not positive, i.e. the signed bit is 1,
then obviously y > x.

4. Single/Partial Homomorphic Encryption Algorithm:

A cryptosystem is said to be partial if it supports either addition or multiplication operations.
Before homomorphic algorithm a lot of the algorithms full-fill some of the requirements of
homomorphic algorithm. For example Hill Cipher whereas after homomorphic encryption many
number of the homomorphic algorithm techniques are provided such as RSA algorithm, Paillier
algorithm and Elgamal. In Partially homomorphic encrypted algorithms one can perform only certain
mathematical operations. RSA algorithm supports multiplication operations. Paillier algorithms
supports addition operations. Among all single/Partial homomorphic encryption algorithms in this
paper we are discussing about the Paillier homomorphic encryption algorithm.

Paillier Homomorphic Encryption Algorithm:

Paillier algorithm was proposed in the year 1999 by Pascal Paillier. Paillier Homomorphic
Encryption Algorithm supports additive homomorphic operations but it does not support
multiplicative homomorphic operations. Paillier homomorphic encryption algorithm is an
Asymmetric algorithm.

Algorithm:

Step 1. Key Generating:

Stage 1: n = x*y, which is the modulus of RSA

Stage 2: lambda = lcm (x − 1, y − 1)

Stage 3:g belongs to Z/n2 Z s.t. n|or d n2(g)

Stage 4: Public-key: (n, g), mystery key: lambda, μ

Step 2. Encrypting message m :

Stage 1: msg belongs to {0, 1,2,3…... n − 1}, which is a message

Stage 2: h belongs to R Z/n Z

Stage 3: c = gmsg hn%n2 , which is a cipher text

Step 3. Decrypting c :

msg = L (c ‫ ג‬% n2 ) L( g ‫ ג‬% n2)−1 % n

The consistent variable,

L (g ‫ ג‬% n2)−1 %n or L( gα % n 2)−1 %n

where g=1+ n % n2 can likewise be recalculate again forall.

5. Fully Homomorphic Encryption Algorithm:

A cryptosystem that supports both additive and multiplicative operations in one algorithm is
known as fully homomorphic encryption algorithm. Some algorithms that support Fully
Homomorphic Encryption Algorithms are: Gentry’s Homomorphic Algorithm, BGV (Brakerski-
Gentry-Vaikuntanathan) and NTRU-based Encryption Algorithm. From above all fully homomorphic
Encryption algorithms we are discussing about NTRU based homomorphic encryption algorithm.

NTRU based Multi-key Fully Homomorphic Encryption Scheme:

For encryption and decryption of the data we used lattice based cryptography in NTRU where
NTRU is an open-source public key cryptography. In NTRU we are having two different type of
algorithms: NTRUEncrypt and NTRUSign. NTRUEncrypt is an algorithm which is used for the
encryption process and NTRUSign algorithm is used for digital signatures. In other fully
homomorphic encryption algorithms we will be using the same public key to perform the
homomorphic encryption operations and encryption whereas in some cases when we perform
homomorphic operations for many users then the key of every user will be differen. So in the year
2012 NTRU based multi-key fully homomorphic encryption technique is proposed.

Algorithm:

Step 1. Key Generation:

Stage 1: User Bob randomly chooses 2 small polynomials x and y in the range of truncated
polynomials (x, y € R).

Stage 2: The reverse of x mod q and the reverse of x mod p will be determined.

x*xq^-1=1(modulo q) and

x*xp^-1=1(modulo p)

Stage 3: Product of polynomials will be computed : h=p*((xq)*y)mod q.

Private key of Bob: the pair of polynomials of x and xp.

Public key of Bob: the polynomial h

Step 2. Encryption:

User Alex wanted to transmit the message:

Stage 1: The message to be sent is stored in polynomial m and ratio between –p/2 and p/2.

Stage 2: Choose a small random polynomial r

Stage 3: The encrypted message is: e=r*h+m(modulo q)

Step 3. Decryption:
A message e was received by bob from Alex and decrypt it:

Stage 1: He computed a polynomial by using his private polynomial x where polynomial is

a=x*e(mod q). bob needs to choose the coefficient of a that lie in an interval of length q.

Stage 2: With the assistance of the previous polynomial b=a(mod p) he computed another polynomial.
Bob reduces each of the coffecientof a module p.

Stage 3: Bob uses another private polynomial xp for calculating ciphertext c=xp*b(module p) where
this is alex’s original text.

Table 1. Performance Comparison of NTRU and Paillier Algorithms

Algorithm NTRU Paillier

Mathematical Problem RLWE problem Determining data redundancy

on N-order

Homomorphic Encryption Type Fully Additive

Encryption time for 50MB file 12.25 299

Decryption time for 50MB file 7.25 350

Comparison of Encryption and Decryption Time

400
350
300
250
200
150
100
50
0
NTRU Paillier
Encryption Decryption

Figure 1: Time Comparison of Encryption and Decryption

6. Conclusion:
Homomorphic encryption algorithm is used to hide original data and it stores the encrypted
data in the cloud instead of original data. There are 2 types of homomorphic encryption algorithms:
Single and fully homomorphic encrypted algorithm. Single homomorphic encryption supports either
additive or multiplicative operations for each algorithm. But if we need to perform both operations at
the same algorithm then single homomorphic encryption algorithm may not be useful. So to perform
both operations in the same algorithm fully homomorphic encryption algorithm is proposed. By using
homomorphic encryption algorithms our data will be more secure. As per the fig[02] execution time
of paillier algorithm is more when compared to NTRU algorithm. So, we prefer fully homomorphic
encryption rather than single encryption algorithm.

Acknowledgement
We would say thank you for faculty of engineering state University of Koneru Lakshmaiah
Educational Foundation. Specially our guide for supporting facility and finance during this research.

References:
[1] https://www.sciencedirect.com/science/article/pii/S1877050919307811

[2] Tharam Dillon, Chen Wu and Elizabeth Chang, “Cloud Computing: Issues and Challenges,” in
Proceeding of 2010 24th IEEE International Conference on Advanced Information Networking and
Applications, pp. 27-33, 20-23 April 2010.

[3] http://people.scs.carleton.ca/~maheshwa/courses/4109/Seminar11/NTRU_presentation.pdf

[4] https://www.sciencedirect.com/science/article/pii/S187705091600154X

[5]
https://www.researchgate.net/publication/308277139_Paillier's_encryption_Implementation_and_clou
d_applications

[6]
https://www.researchgate.net/publication/261528316_A_Scalable_Implementation_of_Fully_Homom
orphic_Encryption_Built_on_NTRU

[7] V. Varadharajan and U. Tupakula, “Security as a Service Model for Cloud Environment,” IEEE
Trans. Netw. Serv. Manag ., 2014.

[8]https://www.sciencesmaths-paris.fr/upload/Contenu/Horizon%20Maths/HM2015/hm2015-
coron.pdf

[9] Paruchuri, V. L., Anantha, N. L., Konagala, V. L., & Bhattacharyya, D. (2016). Ciphertext-policy
attribute-based encryption for access control of data in cloud. International Journal of Software
Engineering and its Applications, 10(8), 13-22. doi:10.14257/ijseia.2016.10.8.02

[10] https://arxiv.org/ftp/arxiv/papers/1409/1409.0829.pdf

[11] SunandaRavindran ,ParsiKalpana,"Data storage security using partially homomorphic Encryption

in cloud", International Journal of Advanced Research in Computer Science and Software
Engineering, Volume 3, Issue 4.

[12]D. Jamil and H. Zaki, “Security Issues in Cloud Computing and Countermeasures,” Int. J. Eng.
Sci. Technol., 2011.

[13]S. Singh, Y. S. Jeong, and J. H. Park, “A survey on cloud computing security: Issues, threats, and
solutions,” J. Netw. Comput. Appl., vol. 75, pp. 200–222, 2016.

[14] https://arxiv.org/pdf/1912.09034.pdf

[15] Srinivas Kumar, P., &Thirumala Rao, B. (2016). An efficient cloud based key aggregate data
sharing. Journal of Theoretical and Applied Information Technology, 83(3), 337-344. Retrieved from
www.scopus.com

[16] https://acadffhjpubl.eu/jhsi/2018-119-7/articles/7a/3.pdf
[17] Vurukonda, N., & Rao, B. T. (2016). A study on data storage security issues in cloud computing.
Paper presented at the Procedia Computer Science, , 92 128-135. doi:10.1016/j.procs.2016.07.335
Retrieved from www.scopus.com

[18]https://www.google.co.in/search?
q=encryption+and+decryption&safe=strict&source=lnms&tbm=isch&sa=X&ved=0ahUKEwiii7u0oL
PhAhUNFHIKHXxqB5QQ_AUIDigB&biw=1517&bih=730#imgrc=4jb2eldRwj2AIM:

[19]https://www.google.co.in/search?
q=symmetric+and+asymmetric+encryption&safe=strict&source=lnms&tbm=isch&sa=X&ved=0ahU
KEwjW07PzoLPhAhWVfn0KHc7zA1EQ_AUIDigB&biw=1517&bih=730#imgrc=S_HBEljhd7Kks
M:

[20] Improving security issues and security attacks in Cloud

Computing,Dr.V.VenkatesaKumar,M.Nithy a 2014.

[21] ElbasheerMO,Mohammed T. Signing and verifying certificates by NTRU and RSA algorithms
[C] 2015 International Conference on CloudComputing,2015:7149655.

[22]https://www.google.com/search?
q=encryption+and+decryption&amp;source=lnms&amp;tbm=isch&amp;sa=X&amp;ved=0ahUKEwj
EnY2_orPhAhUNEnIKHXTJAa8Q_AUIDigB#imgrc=uCcn_7GzjNejvM:

[23] Amudhavel, J., Kathavate, P., Reddy, L. S. S., &Satyanarayana, K. V. V. (2017). Effects,
challenges, opportunities and analysis on security based cloud resource virtualization. Journal of
Advanced Research in Dynamical and Control Systems, 9(Special Issue 12), 1458-1463. Retrieved
from www.scopus.com [24]https://www.google.com/search?
q=homomorphic+algorithm&amp;source=lnms&amp;tbm=isch&amp;s=X&amp;ved=0ahUKEwjww
M7xp7PhAhW6nMBHSXQBiMQ_AUIDygC#imgrc=OFodhWzdirnCuM
,