<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Homomorphic Encryption as a Solution of Trust Issues in Cloud</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Abdellah EZZATI</string-name>
          <email>abdezzati@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Khalid EL MAKKAOUI</string-name>
          <email>kh.elmakkaoui@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>A. Definition:</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>B. Essential characteristics:</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>LAROSERI laboratory, Computer Science Department Sciences Faculty, Chouaïb Doukkali University El Jadida</institution>
          ,
          <country country="MA">Morocco</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>LAVETE laboratory, Mathematics and Computer Science Department, Sciences and Techniques Faculty</institution>
          ,
          <addr-line>Hassan 1</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2015</year>
      </pub-date>
      <fpage>40</fpage>
      <lpage>45</lpage>
      <abstract>
        <p>-With the emergence of cloud computing, the concept of trust has become a major issue. Indeed, the key challenge is to ensure to customers that the selected cloud provider may store and process the raw data safely. If this is a storage service, data can be encrypted before sending them to the cloud server; in this case, data confidentiality is assured. However, before performing treatments, these data must be decrypted. It is this step that can be considered a breach of security. Indeed, the fear of seeing sensitive data be processed in crude is a major obstacle in adopting cloud services. To overcome this obstacle and strengthen confidence in the cloud services, in this article we will propose the adoption of Homomorphic Encryption methods that are able to perform operations on encrypted data without knowing the key secret.</p>
      </abstract>
      <kwd-group>
        <kwd>Cloud Computing</kwd>
        <kwd>Security</kwd>
        <kwd>Trust</kwd>
        <kwd>Confidentiality</kwd>
        <kwd>Homomorphic Encryption</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>INTRODUCTION</p>
      <p>Cloud computing is becoming more and more a magic
solution, thanks to the gains it presents at the level of cost of
software, maintenance computer park and servers maintenance.
However, safety concerns, including the fear of seeing
confidential information processed in plain, is usually the main
obstacle to the adoption of cloud services.</p>
      <p>In this article, we will propose to the cloud providers using
the homomorphic encryption technique to ensure the
confidentiality of confidential data storage and processing in
order to overcome the problem with the confidentiality of
information and to build confidence in the adoption of cloud
services.</p>
      <p>The principle of this technique is to encrypt data before
sending them to the cloud provider, which allows to perform
encrypted data operations without having the secret key, and
return a result that is the same as if we had worked directly on
the raw data.</p>
      <p>The rest of this paper is organized as follows: In Section II,
we willl define cloud computing, we will present its service
and deployment models, and its essential characteristics. In
Section III, we will illustrate some applications of the
technique of homomorphic encryption in various areas of the
real world. In Section IV, we will define homomorphic
encryption and present its operation and the categories that
Abderrahim BENI HSSANE</p>
      <p>
        Broad network access: Services are available on the
network and accessible through standard mechanisms
that promote use of client platforms (eg, mobile phones,
tablets, laptops and desktops) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Resource pooling: The provider’s computing resources
are pooled to serve multiple consumers using a
multitenant model, with different physical and virtual
resources dynamically assigned and reassigned
according to consumer demand. There is a sense of
location independence in that the customer generally has
no control or knowledge over the exact location of the
provided resources but may be able to specify location at


a higher level of abstraction (e.g., country, state, or
datacenter) [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Rapid elasticity: Possibility to change very quickly the
capacity provided, either more or less [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>
        Measured service: Cloud systems automatically control
and optimize resource use by leveraging a metering
capability at some level of abstraction appropriate to the
type of service (e.g., storage, processing, bandwidth,
and active user accounts). Resource usage can be
monitored, controlled, and reported, providing
transparency for both the provider and consumer of
the utilized service [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>III.</p>
      <p>RELATED WORKS</p>
      <p>Applications using the homomorphic encryption technique
in the real world are very diverse and numerous. We will
present here some.</p>
      <p>The cloud private system of storage of electronic medical
records of patients, has been proposed. In this system, all data
in these files are encrypted by health care providers, before
being transferred to the cloud storage system. Secret keys for
access to the raw data folders are shared between the patient
and the specific suppliers. However, this system does not allow
the cloud to perform processing on the data without search by
keywords. With the implementation of fully homomorphic
encryption, cloud allows to perform operations on encrypted
data, and send patient updates, alerts and relevant information
based on the received data [2].</p>
      <p>In the financial sector, there is a potential application
scenario, with the objective of safeguarding confidential data
and business customers and functions calculated on the data.
Dissemination of relevant information such as data on
companies, the stock price etc., are essential in making
investment decisions. These data should be disse possible. The
functions which make calculations on these data must be
owners. They are based on new predictive models of the
performance of share prices, which can be the result of costly
research carried out by financial analysts. Most companies
want to hide these private models to their competitors in order
to preserve their investments. With the use of fully
homomorphic encryption, some of these functions will be
evaluated in private mode. The client will thus transfer an
encrypted version of the function to the cloud, for example a
program where some of the evaluations are specified encrypted
entries. Streaming data is encrypted by the client's public key
before being transferred to the cloud. Then the cloud service
evaluates the private function on encrypted inputs using the
encrypted program description. After the performance of
operations on these data, cloud returns a result itself encrypted
to the client [2].</p>
      <p>
        Also, Sutar and Patil proposed an authentication framework
in the Cloud, considering three parts, namely: Server Cloud,
the cloud user and third parties. Then, using homomorphic
encryption mechanism, the exchange of information between
the parties mentioned will be preserved. Here, the
authentication process is carried out by a third party after
comparing the information of two other parties (user and the
server cloud). This system has reduced the cloud server
calculations and at the same time has preserved the confidential
information of the user [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>IV.</p>
    </sec>
    <sec id="sec-2">
      <title>HOMOMORPHIC ENCRYPTION</title>
      <sec id="sec-2-1">
        <title>A. History</title>
        <p>
          In 1978, Ronald Rivest, Leonard Adleman and Michael
Dertouzos suggested for the first time homomorphic encryption
concept [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. RSA is a public key cryptosystem, which is a
multiplicative homomorphic encryption system. The Shafi
Goldwasser and Silvio Micali (GM) encryption system was
proposed in 1982, it was an additive homomorphic encryption,
but it can encrypt just a single bit [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]. In 1984, Taher ElGamal
proposed a public-key cryptosystem, which is a multiplicative
homomorphic encryption system [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. In 1999, the French
mathematician, Pascal Pailler proposed a new encryption
algorithm, named cryptosystem Pailler, who was also an
additive homomorphic encryption system [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. In 2005, Dan
Boneh, Eu-Jin Goh and Kobi Nissim invented an encryption
system (BGN), with which we can perform an unlimited
number of additions, but with only one multiplication [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. In
2006, Xing Guangli et al have proposed a homomorphic
encryption scheme which is extended to real numbers. In this
system, the operations of addition, subtraction, multiplication
and division are possible [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. In 2008, Chen Liang and
Chengmin Gao proposed Algebra Homomorphic Encryption
Scheme Based On Updated ElGamal (AHEE) [
          <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
          ]. In
2009, Craig Gentry implemented the fully homomorphic
encryption scheme that was able to make many additions and
multiplications using ideal lattices and with the bootstrap
method [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. In 2013, Gorti VNKV Subba Rao proposed
Enhanced homomorphic Encryption Scheme (EHES) for
homomorphic encryption / decryption with the IND-CCA
secure system. This system allows you to perform operations
of addition, multiplication and mixed operations [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>B. Homomorphic Encryption (HE)</title>
        <p>
          Homomorphic encryption systems are capable of
performing operations on encrypted data without knowing the
secret key. These operations generate a result, which is
itself encrypted (i.e. incomprehensible even to cloud provider).
The result obtained is the same as if we performed these
operations on the raw data [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
        </p>
        <p>
          Mathematically speaking, we say that a system is
homomorphic encryption if: from Enc(x) and Enc(y), it is
possible to calculate Enc(f(x, y)), where f can be : +, ×, ⊕
[
          <xref ref-type="bibr" rid="ref15">15</xref>
          ].
        </p>
        <p>
          The principles of the operation of the Homomorphic
Encryption are as follows, and as shown in Figure 3[
          <xref ref-type="bibr" rid="ref10 ref14">10, 14</xref>
          ]:
1) Key generation: The client generates the public key
2) (pk) and the secret key (sk).
3) Encryption: The client encrypts the data with pk. And
sends the encrypted data and pk to the Cloud server.
4) Storage: The encrypted data and pk are stored in
the cloud database.
5) Request: The client sends a request to the server to
perform operations on encrypted data.
6) Evaluation: The processing server processes the
request and performs the operations requested by the
client.
7) Response: Cloud provider returns to the client the
processed result.
8) Decryption: The client decrypts the returned result,
using sk.





        </p>
        <p>Among the homomorphic encryption systems are
distinguished, depending on the operations that evaluates raw
data, multiplicative homomorphic encryption and additive
homomorphic encryption.</p>
      </sec>
      <sec id="sec-2-3">
        <title>Multiplicative Homomorphic Encryption: A</title>
        <p>
          homomorphic encryption is multiplicative, if there is an
algorithm that can calculate Enc (x × y) from Enc (x)
and Enc (y) without knowing x and y [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Additive Homomorphic Encryption: A homomorphic</title>
        <p>
          encryption is additive, if there is an algorithm that can
calculate Enc (x + y) from Enc (x) and Enc (y) without
knowing x and y [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
        </p>
        <p>Among Homomorphic Encryption systems, we
distinguish three categories, depending on the operations
performed on the data :</p>
        <p>
          Partially Homomorphic Encryption (PHE) : allows
to perform operations on encrypted data, let
multiplication or addition, but not both [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ].
        </p>
        <p>
          Somewhat Homomorphic Encryption (SWHE) :
allows to perform more than one operation, but a
limited number of multiplication and addition
operations [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ].
        </p>
        <p>
          Fully Homomorphic Encryption (FHE): This is a
cryptographic system that supports an unlimited
number of both additions and multiplications [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-5">
        <title>HE scheme RSA GM</title>
      </sec>
      <sec id="sec-2-6">
        <title>ElGamal</title>
      </sec>
      <sec id="sec-2-7">
        <title>Pailler</title>
        <p>BGN</p>
      </sec>
      <sec id="sec-2-8">
        <title>AHEE</title>
      </sec>
      <sec id="sec-2-9">
        <title>Graig's</title>
      </sec>
      <sec id="sec-2-10">
        <title>EHFS</title>
      </sec>
      <sec id="sec-2-11">
        <title>1) ElGamal cryptosystem</title>
        <p>Let x, y ∈ Zp, pk = (n) and sk =(p, q)</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Multiplicative:</title>
      <p>Enc (x y) ≡ (Enc (x) Enc (y)) ( mod n), or
x y = Dec (Enc (x) Enc (y))</p>
      <p>≡ (Enc (x) Enc (y)) (mod p)</p>
    </sec>
    <sec id="sec-4">
      <title>Additive:</title>
      <p>Enc (x + y) ≡ Enc (x) + Enc (y) ( mod n), or
x + y = Dec (Enc (x) + Enc (y))
≡ (Enc (x) + Enc (y)) (mod p)
V.</p>
      <p>TRUST ISSUES IN CLOUD COMPUTING</p>
      <p>
        With the services offered by the cloud providers,
companies can increase their productivity in the shortest
possible time, with fewer staff and reduced costs. However, the
adoption of such a service can only be done if security is
ensured. Indeed, the major challenge is to strengthen the trust
of customers by assuring them that the cloud providers may
store and process data securely [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
      </p>
      <p>Indeed, ensuring optimum level of security has become a
necessity to preserve the integrity, confidentiality and
availability of services associated with the Cloud. for
strengthen the trust of customers. We will classify this trust
into two levels, according to the requirements of customers
(businesses, consumers, etc.):
</p>
      <p>
        At this level, customers can trust the cloud service
providers if privacy, data integrity and service availability are
ensured. The following figure shows level one of the trust.
Availability: is the property of information to be
accessible and usable upon demand by an authorized
entity[
        <xref ref-type="bibr" rid="ref19">19</xref>
        ].
      </p>
      <p>
        Integrity: is the property of information not to be altered.
This means that the system must prevent undue
modification of information (i.e, of a modification by
unauthorized users or incorrect modification by
authorized users) [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>
        Privacy: refers to the will of a user to control the
disclosure of private information (authentication,
authorization and access control) communication of
encrypted data, and management of user identity [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ].
      </p>
      <sec id="sec-4-1">
        <title>B. Level two of the trust:</title>
        <p>
          Even security associated with level one of the trust is
assured, in the case of confidential data, customers require to
ensure the confidentiality of storing and processing data.
Figure 5 presents level two of the trust.
Confidentiality: ensures that data remains confidential
and invisible to the cloud provider, and even if the
provider data centers have been attacked, customer data
can neither be stolen nor reused [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
        </p>
        <p>In an unreliable environment , like in the public cloud , the
confidentiality of the storage of confidential data and their
treatment must be ensured. Thus, researchers noted a useful
encryption method in this type of environment: homomorphic
encryption. Homomorphic encryption methods are able to
perform operations on encrypted data without decrypting them
and to give us results that are the same as if we had performed
these operations on the raw data. This would allow us to
outsource the calculation and storage of confidential data to the
cloud, while keeping the secret keys that are essential to
decrypting the results of operations performed on encrypted
data.</p>
        <p>VI.</p>
        <p>LIMITS OF HE CRYPTOSYSTEMS</p>
        <p>Today, HE technique appears as the most effective and the
safest for outsourcing the calculation and storage of
confidential data to the cloud. However, HE systems have
certain limitations. In the following we will present the limits
of the ElGamal and EHES algorithms.</p>
      </sec>
      <sec id="sec-4-2">
        <title>A. Limits of ElGamal and EHES</title>
        <p>The table below presents the limits of cryptosystems:
ElGamal and EHES.
Π mi &lt; p , with i={1,2,...,k}.
pk=(n), sk=(d), et x1, x2,..., xk ∊ ℤp</p>
        <sec id="sec-4-2-1">
          <title>Multiplicative is true iff:</title>
          <p>Π xi &lt; p , with i={1,2,...,k}.</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>Additive is true iff:</title>
          <p>∑ xi &lt; p , with i={1,2,...,k}.</p>
        </sec>
      </sec>
      <sec id="sec-4-3">
        <title>B. Exception of EHES</title>
        <p>In some cases the encrypted message by EHES algorithm is
itself that the clear message.</p>
        <p>As indicated in Figure 3, the EHES encryption algorithm is
as follows:</p>
        <p>Enc(x) = x + r×pq (mod n), with pk=(n) and sk=(p, q).
if r×pq = α×n, with α ∊ ℕ* therefore, Enc(x) = x</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Demonstration:</title>
      <p>if r×pq = α×n = α×pq ⇔
r×pq-1 = α ×q
we get: p, q ∊ ℙ so now, q divides r.</p>
      <p>Therefore, ∃ r ∊ ℕ* such that r×pq = α×n</p>
      <sec id="sec-5-1">
        <title>C. Enhanced EHES:</title>
        <p>We improved EHES encryption algorithm, in in a way that
the encrypted message is always different from the clear
message. The new encryption algorithm of Enhanced EHES is
as followings:</p>
        <p>Enc(x) = x + prq (mod n)</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Demonstration:</title>
      <p>If prq = α×n = α×pq ⇔
p
r(q-1)
= α ×q
we get: p, q ∊ ℙ so now, ∄ α ∊ ℕ* such that p
rq
= α×n</p>
    </sec>
    <sec id="sec-7">
      <title>Therefore, always: Enc(x) ≠ x VII.</title>
    </sec>
    <sec id="sec-8">
      <title>CONCLUSION AND FUTURE WORKS</title>
      <p>In this article, we discussed the importance of adopting the
homomorphic encryption technology for cloud providers. This
technique allows them to preserve the confidentiality of
sensitive data in order to strengthen the trust of their clients.
Also, we have presented the limits of the ElGamal and EHES
cryptosystems and we proposed an improved version of the
EHES algorithm.</p>
      <p>In our future work, we will focus on the analysis and
improvement of homomorphic encryption algorithms of
different systems, and we will determine their limits and
performance.</p>
    </sec>
    <sec id="sec-9">
      <title>ACKNOWLEDGMENT</title>
      <p>I would like to thank my supervisor Mr. Abdellah EZZATI
and my framing Mr. Abderrahim BENI HSSANE for the help,
encouragement and guidance they have given me, in order to
achieve this modest work.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P.</given-names>
            <surname>Mell</surname>
          </string-name>
          , T. Grance, “
          <article-title>The NIST Definition of Cloud Computing,” National Institute of Standards and Technology</article-title>
          , U. S. Department of Commerce,
          <year>September 2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>M.</given-names>
            <surname>Ogburn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Turner</surname>
          </string-name>
          , P. Dahal, “Homomorphic Encryption,”
          <source>In Complex Adaptive Systems, Publication</source>
          <volume>3</volume>
          ,
          <string-name>
            <surname>Cihan</surname>
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Dagli</surname>
          </string-name>
          , Editor in Chief Conference Organized by Missouri University of Science and Technology 2013 - Baltimore, MD, Elsevier,
          <year>2013</year>
          , pp.
          <fpage>502</fpage>
          -
          <lpage>509</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sutar</surname>
          </string-name>
          , G. Patil, “
          <article-title>Privacy Management in Cloud by making use of homomorphic Functions,”</article-title>
          <source>International Journal of Computer Applications</source>
          ,
          <year>2012</year>
          ,
          <volume>37</volume>
          (
          <issue>2</issue>
          ), pp.
          <fpage>13</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Rivest</surname>
          </string-name>
          , Ronald L.,
          <string-name>
            <surname>Len</surname>
            <given-names>Adleman</given-names>
          </string-name>
          , and Michael L. Dertouzos, “
          <article-title>On data banks and privacy homomorphisms,” Foundations of secure computation 4</article-title>
          , N°.
          <volume>11</volume>
          (
          <year>1978</year>
          ), pp
          <fpage>169</fpage>
          -
          <lpage>180</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Goldwasser</surname>
          </string-name>
          , S. Micali, “
          <article-title>Probabilistic encryption and how to play mental poker keeping secret all partial information</article-title>
          ,”
          <source>in Proceedings of 14th Symposium on Theory of Computing</source>
          ,
          <year>1982</year>
          , pp.
          <fpage>365</fpage>
          -
          <lpage>377</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>T. ElGamal</surname>
          </string-name>
          , “
          <article-title>A public key cryptosystem and a signature scheme based on discrete logarithms</article-title>
          ,
          <source>” IEEE Transactions on Information Theory</source>
          ,
          <year>1985</year>
          , pp.
          <fpage>469</fpage>
          -
          <lpage>472</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>Pascal</given-names>
            <surname>Paillier</surname>
          </string-name>
          , “
          <article-title>Public-key cryptosystems based on composite degree residuosity classes,”</article-title>
          <source>In 18th Annual Eurocrypt Conference (EUROCRYPT'99)</source>
          , Prague, Czech Republic , volume
          <volume>1592</volume>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>D.</given-names>
            <surname>Boneh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Goh</surname>
          </string-name>
          , K. Nissim, “
          <article-title>Evaluating 2-DNF formulas on ciphertexts,”</article-title>
          <source>In Theory of Cryptography Conference, TCC'05</source>
          , pp.
          <fpage>325</fpage>
          -
          <lpage>341</lpage>
          ,Springer,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Xing</given-names>
            <surname>Guangli</surname>
          </string-name>
          , CHEN Xinmeng, ZHU Ping, MA Jie.
          <article-title>“A method of homomorphic encryption</article-title>
          ,” Wuhan University Journal of Natural Sciences, Vol.
          <volume>11</volume>
          , No.
          <issue>1</issue>
          , pp.
          <fpage>181</fpage>
          -
          <lpage>184</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Payal</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Parmar</surname>
          </string-name>
          , Shraddha B.
          <string-name>
            <surname>Padhar</surname>
            ,
            <given-names>Shafika N.</given-names>
          </string-name>
          <string-name>
            <surname>Patel</surname>
            ,
            <given-names>Niyatee I. Bhatt</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rutvij H. Jhaveri</surname>
          </string-name>
          , “
          <article-title>Survey of Various Homomorphic Encryption algorithms</article-title>
          and Schemes,” In
          <source>International Journal of Computer Applications (0975 - 8887)</source>
          , Volume
          <volume>91</volume>
          -No. 8,
          <string-name>
            <surname>April</surname>
            <given-names>2014</given-names>
          </string-name>
          , pp.
          <fpage>26</fpage>
          -
          <lpage>32</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Chen</surname>
            , Liang and
            <given-names>Chengmin</given-names>
          </string-name>
          <string-name>
            <surname>Gao</surname>
          </string-name>
          , “
          <article-title>Public Key Homomorphism Based on Modified ElGamal in Real Domain,”</article-title>
          <source>In International Conference on Computer Science and Software Engineering</source>
          , Vol.
          <volume>3</volume>
          , pp.
          <fpage>802</fpage>
          -
          <lpage>805</lpage>
          .
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Graig</surname>
            <given-names>Gentry</given-names>
          </string-name>
          , “
          <article-title>A fully homomorphic encryption scheme</article-title>
          ,”
          <string-name>
            <surname>Ph</surname>
          </string-name>
          .D. dissertration, Stanford University,
          <year>2009</year>
          . http://crypto.stanford.edu/craig/craig-thesis.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>G. VNKV Subba</given-names>
            <surname>Rao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Md.Sameeruddhin</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.Yashwanth</given-names>
            <surname>Reddy</surname>
          </string-name>
          , K.Narayana, “Data Security in Bioinformatics,” In
          <source>International Journal of Advanced Research in Computer Science and Software Engineering</source>
          <volume>3</volume>
          (
          <issue>11</issue>
          ), November - 2013, pp.
          <fpage>590</fpage>
          -
          <lpage>598</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>M.</given-names>
            <surname>TEBAA</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. EL HAJJI</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. EL GHAZI</surname>
          </string-name>
          , “
          <article-title>Homomorphic Encryption Applied to the Cloud Computing Security,”</article-title>
          <source>In Proceedings of the World Congress on Engineering 2012 Vol I, WCE 2012, July 4 - 6</source>
          , 2012 London, U.K.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Ronald</surname>
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Rivest</surname>
          </string-name>
          , Leonard Adleman, and Michael L. Dertouzos, “
          <article-title>On Data Banks and Privacy Homomorphisms”</article-title>
          ,
          <source>chapter On Data Banks and Privacy Homomorphisms</source>
          , pages
          <fpage>169</fpage>
          -
          <lpage>180</lpage>
          . Academic Press,
          <year>1978</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Xing</surname>
            <given-names>Guangli</given-names>
          </string-name>
          , CHEN Xinmeng, ZHU Ping, MA Jie.
          <article-title>“A method of homomorphic encryption</article-title>
          ,” Wuhan University Journal of Natural Sciences, Vol.
          <volume>11</volume>
          , No.
          <issue>1</issue>
          , pp.
          <fpage>181</fpage>
          -
          <lpage>184</lpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ogburn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Turner</surname>
          </string-name>
          , P. Dahal, “Homomorphic Encryption,”
          <source>In Complex Adaptive Systems, Publication</source>
          <volume>3</volume>
          ,
          <string-name>
            <surname>Cihan</surname>
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Dagli</surname>
          </string-name>
          , Editor in Chief Conference Organized by Missouri University of Science and Technology 2013 - Baltimore, MD, Elsevier,
          <year>2013</year>
          , pp.
          <fpage>502</fpage>
          -
          <lpage>509</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Reem</surname>
            <given-names>Alattas</given-names>
          </string-name>
          , “Cloud Computing Algebraic Homomorphic Encryption Scheme,” In
          <source>International Journal of Innovation and Scientific Research, ISSN 2351-8014 Vol. 8 No. 2 Sep</source>
          .
          <year>2014</year>
          , pp.
          <fpage>191</fpage>
          -
          <lpage>195</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Cloud</given-names>
            <surname>Select Industry Group (C-SIG</surname>
          </string-name>
          )
          <article-title>of European Union, “ Cloud Service Level Agreement Standardisation Guidelines</article-title>
          ,”
          <year>June 2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>Mazhar</surname>
            <given-names>Ali</given-names>
          </string-name>
          , Samee U. Khan , Athanasios V. Vasilakos, “
          <article-title>Security in cloud computing: Opportunities and challenges</article-title>
          ,” Elsevier,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>Sweta</given-names>
            <surname>Agrawal</surname>
          </string-name>
          and Aakanksha Choubey, “
          <article-title>Survey of Fully Homomorphic Encryption</article-title>
          and Its Potential to Cloud Computing Security,” In
          <source>International Journal of Advanced Research in Computer Science and Software Engineering</source>
          , Volume
          <volume>4</volume>
          ,
          <string-name>
            <surname>Issue</surname>
            <given-names>7</given-names>
          </string-name>
          ,
          <string-name>
            <surname>July</surname>
          </string-name>
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>