Vous êtes sur la page 1sur 7

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)

Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com


Volume 3, Issue 3, May-June 2014 ISSN 2278-6856

Volume 3, Issue 3 May June 2014 Page 278


Abstract: The cloud computing becomes morepopular,
especially with large companies as they share resources in a
cost effective way. It provides an advanced computing
platform in which the users can access computing services on
demand anytime and anywhere.It integrates, optimizes and
provides computing ability, aiming to simplify the clients
computincomputingg jobs by the way of renting resources
and services. Due to this increasingdemand for more cloud
services, there is an ever growing threat of security becoming
a major issue. The Advanced Encryption Standard (AES),
and the Rivest-Shamir-Adleman (RSA) algorithms are the
main popular encryption schemes that guarantee
confidentiality and authenticity. According to the work in this
paper, a hybrid encryption algorithm based on these two
security algorithms is introduced and implemented on a cloud
platform called eyeOS. This hybrid encryption algorithm
optimizes the results for both computation time and security.

Keywords; cloud computing, Encryption, key encryption,
eyeOS ,eyeOS advanced, advanced standard encryption ,
Rivest-Shamir-Adleman.

1. Introduction
Cloud Computing is a set of IT Services that are provided
to a customer over a network and these services are
delivered by third party provider who owns the
infrastructure. It is often provided "as a service" over the
Internet, typically in the form of infrastructure as a
service (IaaS), platform as a service (PaaS) and software
as a service (SaaS) [23].

Cloud computing is a technology that keeps up data and
its applications by using theInternet and central remote
servers [1]. It introduces a new supplement, consumption,
and delivery model for IT services based on Internet
protocols, and involves provisioning of dynamically
scalable and often virtualized resources. This may take
the form of web-based tools or applications that the users
can access and use through a web browser [2]. Also,
Cloud Computing provides much more efficient
computing by centralizing storage, memory, processing
and bandwidth. Resources are accessible from the Cloud
at any time and from any place across the globe using the
Internet, and the Cloud users only pay for the resources
allocated to them [3,4,5].Among the development of
distributed computing, parallel computing and grid
computing, Cloud Computing is considered the business
realization of all these concepts [6].

Three services could be provided by Cloud Computing;
SaaS (Software as a service), PaaS (Platform as a service),
and IaaS (Infrastructure as a service). A cloud computing
system must make a copy of all its clients information
and store it on other devices. These copies are enabling to
the central server to access backup machines to retrieve
the data. Also, the Cloud Service Provider (CSP)
maintains database and applications for the users on a
remote server and provides independence of accessing
them from any place through a network [9].
In spite of Cloud computing advantages in cost reduction,
resource sharing, and time saving for new service
deployment, most data and software are resided on the
Internet. This would introduce some new challenges for
the system, especially security and privacy. Because each
application may use resources from multiple servers, and
the servers are potentially based at multiple locations and
the services provided by the cloud may use different
infrastructures across organizations, all these
characteristics make Cloud Computing to be complicated
to guarantee security [7,8].

On the other hands, Cloud Computing security refers to a
broad set of policies, technologies, and controlsdeployed
to protect data, applications, and the associated
infrastructure of cloud computing. It should be noted that
Cloud Computing security is not cloud-based security
softwareproducts such as cloud-based anti-virus, anti-
spam, anti-DDoS,and so on [12].

Cloud computing security includes a number of issues
like multi tenancy, data loss and leakage, easy
accessibility of cloud, identity management, unsafe APIs,
Service Level Agreement, inconsistencies, patch
management, internal threats etc. It is not easy to enforce
all the security measures that meet the security needs for
all the users, because different users may have different
security demands based upon their objective of using the
Cloud services [13].

There are many security issues associated with Cloud
Computing and they can be grouped into any number of
dimensions (see Figure 1) [12].

The cloud users can remotely store their data and enjoy
the on-demand high-quality applications and services
from cloud resources. The data security is one of the
major concerns as the users of cloud storage services no
longer physically maintain direct control over their data
in cloud. Thus shifting of all data over the cloud has
implications for privacy and security.[24]

An Optimized Technique for Secure
Data Over Cloud OS

R. H. Sakr1, F. Omara2, O. Nomir3

1,3
Mansoura University,Faculty of Computers and Information,
2
Cairo University, Faculty of Computer Science and Information
International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 3, May-June 2014 ISSN 2278-6856

Volume 3, Issue 3 May June 2014 Page 279


There are different types of cloud operating systems
including Glide , Amoeba , My Goya , Kohive, Zimdesk
, Ghost , Joli, Cloudo, Corneli , Lucid , EyeOS ,
Startforce, etc .The most used one as Web Operating
system is EyeOS [11].

According to the work in this paper, the EyeOS is
installed on ubuntu server which is installed on VMware
(cloud services). Two security algorithms are applied; the
advanced encryption standard (AES) which is a
symmetric algorithm, and the Rivest-Shamir-
Adleman(RSA)which is asymmetric[3].

This paper is organized as follows; encryption algorithms
are discussed in section 2, the Proposed Hybrid Security
Algorithm is presented in section 3. Also, the Simulator
Environment, the Evaluating parameters and The
Implementation Results are presented in section 4;
conclusion is presented in section 5.


Figure 1: Cloud Computing Security [12]

2. Encryption Algorithms
In Cloud Computing technology, there are a set of
important policy issues like privacy, security, anonymity,
telecommunications capacity, and reliability. The most
important issue is security and how the Cloud provider
assures it [14].

On the other hands, encryption algorithm is a
mathematical procedure that is used to encrypt the data.
According to the encryption algorithm, the data is
encoded into cipher text and requires the use of a key to
transform the data back into its original form.

There are two types of cryptographic schemes are
available [15]:
Symmetric Key Cryptography uses a common key for
both encryption and decryption of themessage. Common
symmetric encryption algorithms include Data Encryption
Standard (DES), Triple Data Encryption Standard
(3DES), Advanced Encryption Standard (AES), and RC4.
In this paper, the AES is concerned rather than others
because of its excellent security [15].

Asymmetric Key Cryptography uses two different keys
called public key and private key; one is used for
encryption andanother for decryption.

Common asymmetric encryption algorithms include The
Rivest-Shamir-Adleman (RSA),ElGamal and Rabin. RSA
algorithm is the first asymmetric algorithm that was
discovered in 1978, and it is still one of the mostefficient
and used algorithm this day. The RSA cipher represented
a real turning point for practical applications with high
quality, guaranteed security and reliability. In fact, the
expression "strong encryption" was invented exactly with
the RSA algorithm [4].

2.1 The Advanced Encryption Standard(AES) Algorithm
The AES algorithm was known as Rijndael. Rijndael has
named after two Belgian cryptographers, Dr. Joan
Daemen and Dr. Vincent Rijmen, have developed and
submitted it [15]. AES, Like DES, AES, is a symmetric
block cipher. This means that it uses the same Key for
both encryption and decryption.
Rijndael Algorithm allows for a variety of block and key
size to be used rather than 64 and 56 bits of DES block
and key size. The block and key can be chosen
independently from 128, 160, 192, 224, 256 bits and need
not be the same. However, the AES standard states that
the algorithm can only accept a block size of 128 bits and
a choice of three keys , 128, 192, and 256 bits. Also, the
AES algorithm differs from the DES algorithm where it
is not a Feistel structure, but it is based on substitution-
permutation network.
In most ciphers, the iterated transform (or round) usually
has a Feistel Structure. Typically in this structure, some
of the bits of the intermediate state are transposed
unchanged to another position (permutation). AES does
not have a Feistel structure but is composed of three
distinct invertible transforms based on the Wide Trial
Strategy design method.

Wide Trail Strategy
The Wide Trial Strategy design method provides
resistance against linear and differential cryptanalysis
such that, every layer has its own function [21]:
The linear mixing layer: guarantees high diffusion over
multiply rounds
The non-linear layer: parallel application of S-boxes that
have the optimum worst-case non-linearity properties.
The key addition layer: a simple XOR of the round key to
the intermediate state
On the other words, in a Feistel structure, half of the data
block is used to modify the other half of the data block
and then the halves are swapped. In this case the entire
data block is processed in parallel during each round
using substitutions and permutations.

The AES algorithm provides flexibility, simplicity for
hardware and software sustainability. This algorithm can
be used in a variety of platforms andapplications.

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 3, May-June 2014 ISSN 2278-6856

Volume 3, Issue 3 May June 2014 Page 280


The number of AES parameters is depending on the key
length. For example, if the used key sizeis 128, then the
number of rounds is 10. The number of round for 192 and
256 bits are 12 and 14 respectively.
The AES is a block cipher with a block length of 128 bits.
According to the work in this paper, the AES algorithm
with 128 bit key length is concerned. The encryption
process consists of 10 rounds of processing for 128-bit
keys. Except for the last round in each case, all other
rounds are identical.
For encryption, each round consists of the following four
phases [16]:
SubBytes a non-linear substitution step where each byte
is replaced with another according to a lookup table or
substitution table(S-box).
ShiftRows a transposition step where each row of the
state is shifted cyclically a certain number of times
MixColumns a mixing operation which operates on the
columns of the state, combining the four bytes in each
column.
AddRoundKey XORs a key that is the same length as
the block, using an Expanded Key derived from the
original Cipher Key
For the final round only three steps are performed
;SubBytes, ShiftRows and AddRoundKey (See Figure 2).


Figure 2: Four steps in each round in AES encryption
and decryption

2.1.1 SubBytesPhase
The Substitution table (S-box) matrix consists of all the
possible combinations of an 8 bit sequence (28= 16 16
= 256). However, the S-box is not just a random
permutation of these values and there is a well-defined
method for creating the S-box tables.


SubByte transformation is a nonlinear substitution that
operates on individual bytes using a S-box, controls the
transformation.. Each individual byte of state (input
matrix) is mapped into a new byte as the following way:
These row and column value serve as indexes into the S-
box to select a unique 8-bit output value. For example, the
hexadecimal value {95} references row 9, column 5 of the
S-box, which contains the value {2A}. Accordingly, the
value {95} is mapped into the value {2A} (See Figure
3)[20].
The S-box, then, is a function on a byte in State s so that:
s'i,j = S-box (si,j)

Figure 3 : SubBytes Transformation Step [20]

2.1.2 ShiftRows Phase
The purpose of this phase is to provide diffusion of the
bits over multiple rounds. ShiftRows essentially consists
of shifting the bytes in the row. It is a transposition step
on the row of the state where each row of the state is
shifted cyclically by certain number of steps. The first row
(row 0) is not shifted. The second row (row 1) is shifted
by one byte, the third row is shifted by two bytes and final
row is shifted by three bytes. It also ensures that each byte
in each row does not interact solely with their
corresponding bytes. The transformation is shown in
Figure 4.


Figure 4: ShiftRows Transformation Step

2.1.3 MixColumns Phase
Like ShiftRows phase, the purpose of this step is to
provide diffusion of the bits over multiple rounds. This is
achieved by performing multiplication one column at a
time. During this operation, each column is multiplied by
the known matrix Galois field GF and is shown in Figure
5.
Each value in the column is multiplied against every row
value of a standard matrix. The results of this
multiplication are XORed together. The multiplication
operation continues against one matrix row at a time for
each value of a state column.
International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 3, May-June 2014 ISSN 2278-6856

Volume 3, Issue 3 May June 2014 Page 281


The multiplication operation is defined as; Multiplication
by 1 means leaving unchanged, multiplication by 2 means
shifting byte to the left by 1 position and multiplication by
3 means shifting to the left by 1 position and then
performing XOR with the initial unshifted value.

Figure.5: MixColumns Phase
Transformation Step

2.1.4 AddRoundKey Phase
In this phase, the 128 bits of State matrix is XORed with
the 128 bits round key. The original key consists of 128
bits/16 bytes which are represented as a 4x4 matrix. This
4 words key where each word is of 4 bytes is converted to
a 43 words key. The first four words represent W0, W1,
W2, and W3. The rest of expanded key, W[4] to W[43] is
generated as follows:-
for (i = 4; i<44; i++)
{
T = W[i-1];
if (i mod 4 = = 0)
T = Substitute (Rotate (T)) XOR RConstant [i/4];
W[i] = W[i-4] XOR T;
}
Expanded Key: W0 W1 W2 W3 W4 W5 W6 W7
... W48 W49 W50 W51
Round keys: Round key 0 Round key 1 ... Round key
12

Where, Rotate means perform a one byte left circular
rotation on the 4-byte word, Substitute means perform a
byte substitution for each byte of the word, using S-box,
also used in the SubBytes step, and RConstant means
Round Constant (size of 4 bytes) which is XORed with
the bytes. The rightmost three bytes of the round constant
are zero. In this way, W [4] to W [43] of the key schedule
isgenerated from the initial four words.
Although, overall, the same steps are used in decryption,
as in encryption, the order in which the steps are carried
out is different (See Figure 6).

Figure 6: AES key expansion
2.2 The Rivest-Shamir-Adleman (RSA) Algorithm
The RSA is an algorithm for public-key cryptography. It
is the first suitable algorithm to be used for encryption.
TheRSAalgorithm is widely used in the electronic
commerce protocols, and is consideredto be secure by
given sufficiently long keys and the use of up-to-date
implementations [4].

The RSA algorithm includes three phases.
Key generation
Encryption, and
Decryption

2.2.1 Key GenerationPhase
The RSA algorithm includesa public key and a private
key. The public key can be known to everyone and it is
used for encrypting messages. The encrypted Messages by
the public key can only be decrypted using the private
key. The keys for the RSA algorithm are generated by the
following steps:
Select two prime numbers.
Calculate n = p*q.
Calculate f(n) = (p-1)(q-1)
Select e such that e is relatively prime to f(n) and less
than f(n).
Determine d such that congruent modulo 1 (mod f(n))
and d<f(n).
Public key = {e, n}, Private Key = {d, n}.

2.2.2 EncryptionPhase
Ciphertext c = message e mod n

2.2.3 Decryption Phase
Plaintext p = Ciphertextd mod n

Symmetric Encryption Advantages:
Provides authentication, as long as the key to be secret.
The encryption process is fast.
Symmetric-key ciphers can be designed to have high rates
of datathroughput.
Keys for symmetric-key ciphers are relatively short.
Symmetric-key ciphers can be employed as primitives to
construct various cryptographic mechanisms including
pseudorandom number generators, hash functions, and
computationally efficient digital signature schemes, to
name just a few.
Symmetric-key ciphers can be composed to produce
stronger ciphers. Simple transformations which are easy
to analyze, but on their own weak, can be used to
construct strong product ciphers.

Symmetric Encryption Disadvantages:
In a two-party communication, the key must remain
secret at both ends.
In a large network, there are many key pairs to be
managed. Consequently, effective key management
requires the use of an unconditionally trusted TTP.
In a two-party communication between entities A and B,
sound cryptographic practice dictates that the key has be
International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 3, May-June 2014 ISSN 2278-6856

Volume 3, Issue 3 May June 2014 Page 282


changed frequently and perhaps for each communication
session.
Digital signature mechanisms arising from symmetric-
key encryption especially if keys change
frequentlytypically require either large keys for the public
verification function or the use of a TTP,because they
allow accessing all the encrypted Information
Advantages of Using Asymmetric Encryption
Only the private key must be kept secret (authenticity of
public keys must,
however, be guaranteed).
For any number of users (represented as n), only 2*n,
(N=2*n) keys are required instead of n*(n-1)/2 by using
symmetric encryption. For example if the number of users
n=3, then they use N=6keys,.Using asymmetric
encryption, each user has only 1 key pair. This means that
only a users public key is exchanged and each group of
people does not need separate keys.
Depending on the mode of usage, a private key/public key
pair may remain unchanged for considerable periods of
time, e.g., many sessions even several years).
The problem of distributing keys is solved because a user
s public key can be
Shared by anyone
Many public-key schemes yield relatively efficient digital
signaturemechanisms. The key used to describe the public
verification function is typically much smaller than for
the symmetric-key counterpart.
In a large network, the number of keys necessary may be
considerablysmaller than in the symmetric-key scenario.
.
Disadvantages of Using Asymmetric Encryption:
Asymmetric encryption algorithm is slower than that
symmetric one
Some algorithms are only suitable for key distribution
Throughput rates for the most popular public-key
encryption methods are
several orders of magnitude slower than the best-known
symmetric-key .
Key sizes are typically much larger than those required
for symmetric-keyencryption, and the size of public-key
signatures is larger than that of tags
Providing data origin authentication from symmetric-key
techniques.

Summary of comparison
1. Public-key cryptography facilitates efficient signatures
(particularly non repudiation) and key management, and
2. Symmetric-key cryptography is efficient for encryption
and some data Integrity applications.
3. The Proposed Hybrid Security Algorithm
The asymmetric algorithms are much slower than that the
symmetric algorithms, especially with large amounts of
data. On the other hands, using the symmetric algorithm
as key distribution is considered a problem because it
can't prove the authenticity and non-repudiation.
Therefore, by amalgamating both the symmetric and
asymmetric encryption algorithms, the drawbacks of these
algorithms would be eliminated (i.e., the speed of the
asymmetric algorithm, and the key distribution
complexity of the symmetric algorithm).
The phases of the proposed hybrid security algorithm are
implemented as follows:
3.1 Session key Phase
Session key is not an asymmetric key, but it is only used
during the session life cycle. In fact, a symmetric key is
produced by two entities every time they create a new
session. After the session life cycle, the key is destroyed.
This provides more robust level of security, where if a
hacker captures a session key, he would only be able to
use this key during that session but not any future
sessions, because it is destroyed after the session life
cycle.

3.2 Encryption Phase
According to the hybrid algorithm, the sender's plaintext
document is compressed to reduce its size and
strengthening its cryptographic security. The proposed
hybrid algorithm would create a symmetric key (e.g.,
random number session key).Then, the session key is
processed using asymmetric encryption algorithm such as
AES which generates a one-time-only secret key
[Rijndael].


Figure 8: The Encryption Phase

The session key is used by symmetric encryption
algorithm to encrypt the plaintext; the result is ciphertext.
Once the data is encrypted, the session key is then
encrypted to the recipients public key, using asymmetric
encryption such as RSA

This public key-encrypted session key is transmitted
along with the ciphertext to the Recipient. The main
components of the proposed hybrid algorithm are seen in
Figure8
3.3 Decryption Phase
Decryption process is done in the reverse way of the
encryption process. The recipients copy of the proposed
hybrid algorithm uses his or her private key to recover the
session key, and then the hybrid algorithm uses the
session key to decrypt the symmetrically encrypted
ciphertext (See Figure 9).

International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 3, May-June 2014 ISSN 2278-6856

Volume 3, Issue 3 May June 2014 Page 283




Figure 9: Decryption phase

4 The Implementation
The hybrid algorithm has been implemented on cloud
platform (eyeOS) which is installed on ubuntu linux that
is installed on VMware(cloud service).
4.1 The Simulator Environment
The eyeOS simulator is used to implement the proposed
hybrid algorithm. On the other hands, eyeOS is
considered cloud computing platform and enabled
thecollaboration and communication among users. It is
mainly written in PHP, XML, and JavaScript. Generally,
it considered a private-cloud application platform with a
web-based desktop interface[11].
On the other hands, eyeOS is one of the most used
WebOSes which only needs Apache + PHP5 + MySQL to
run. With eyeOS you can build your private Cloud
Desktop. Using eyeOS Web Runner you can open your
eyeOS files from your browser with your local apps and
save them automatically on your cloud. In eyeOS 2.0 you
can work collaboratively with other users simultaneously
in the same document, it is the Safe Cloud Computing
system because you can host it in your own company or
organization. You will get privacy and cloud computing
at its best.[22]

4.2 The Evaluating Parameter:
The performance of the encryption algorithm is evaluated
by calculating the encryption time parameter. The
Encryption time is the time that an encryption algorithm
takes to produce a cipher text from a plain text in the case
of encryption. Also, the time will be taken to produce
plain text from cipher text in case of decryption is used as
a parameter to evaluate the proposed hybrid security
algorithm performance.


4.3 The Implementation Results:
The encryption phase of the proposed hybrid algorithm,
as well as, the RSA and AES algorithms, have been
implemented on eyeOS simulator using different data
input sizeas24 byte, 36 byte, and 61 byte. The encrypted
time of these algorithms are listed in Table 1.

Table 1: Encryption Times of RSA, AES, and Proposed
Hybrid Algorithms


Input Data Size RSA AES Hybrid Improved %
With respect to RSA Improved %With respect to
AES
24 bytes
8 ms 6 ms 0.062 ms 99.2 98.96
36 bytes
6 ms 2 ms 0.049 ms 99 97.55
61 bytes
30 ms 12 ms 0.05
ms 99.8 99.58

According to the results in Table 1, it is found that the
encryption phase using the hybrid algorithm outperforms
the AES, RSA algorithms (See Figures 10).

By analyzing Figure 10, it is found that the proposed
hybrid security algorithm improves the speed of the
computation time.

Figure 10: Encryption time of The AES, RSA and Hybrid
Algorithms

5. Conclusions
The goal of encrypted storage in the cloud is to create a
virtual private storage system that maintains
confidentiality and data integrity which are provided by
AES algorithm, but RSA algorithm provides
authentication, encryption and key distribution.
The public-key encryption RSA algorithm provides a
solution to the key distribution and data transmission
issues of the AES symmetric encryption algorithm. On
International Journal of Emerging Trends & Technology in Computer Science (IJETTCS)
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com
Volume 3, Issue 3, May-June 2014 ISSN 2278-6856

Volume 3, Issue 3 May June 2014 Page 284


the other hands, by using the symmetric encryption
algorithm (i.e., AES algorithm) is satisfied about 100 to
1,000 times faster than that the public-key encryption
RSA algorithm, which solves the problem of speed of the
encryption asymmetric algorithms.

According to the hybrid algorithm, using the faster
algorithm (i.e., Symmetric algorithm) to encrypt the bulk
data and the slower but scalable algorithm (i.e.,
Asymmetric algorithm) is used to encrypt the small
amount of data (the key). According to the proposed
hybrid algorithm, a secure system has been satisfied
which would provide scalability, speed and more security
(confidentiality, data integrity,and authentication).

REFERENCES
[1] PriyankaArora, Arun Singh, HimanshuTyagi,
Analysis of performance by using security
algorithm on cloud network Proc. of the
international conference on Emerging trends in
engineering and management (ICETM2012),PP179-
183,2012
[2] Joshi AshayMukundrao , GalandePrakashVikram
Enhancing Security in Cloud Computing in
Information and Knowledge Management
www.iiste.org ISSN PP 2224-2258 , ISSN 2224-
896X (Online),Vol 1, No.1, 2011)
[3] Google App Engine.
http://code.google.com/appengine/, July 2008.
[4] Cloud Computing For Web Applications. April
2009.
[5] Farhan Bashir Shaikh, SajjadHaider , Security
Threats in Cloud Computing, proc. of the 6th
international conference internet technology and
secured transtion,11-14 december,2011,Abu
Dhabi,UnitedAreb Emirates, PP., 2011
[6] Shuai Zhang, Xuebin Chen, The Comparison
between Cloud Computing and Grid
Computing,Proc. of the 2010 International
Conference on Computer Application and System
Modeling (ICCASM 2010), PP. 110-115, 2010.
[7] R. Buyya, "Cloud computing: The next revolution in
information technology," Proc. of the lst
International Conference on Parallel Distributed and
Grid Computing, IEEE Computer Society, Los
Alamitos, PP 230-235, 2010.
[8] K. Chen and W. M. Zheng, Cloud computing:
System instances and current research, J. Softw, PP.
1337-1348, 2009.
[9] Sriram Ramanujam ,Data Security in Cloud
Computing J.Comp. &Math.Sci vol 2(1), 2011.
[10] LamiaYouseff, Maria Butrico, Dilma Da Silva,
Toward a Unified Ontology of Cloud Computing,
2008 .
[11] DouglasMcKechie, eyeOS2.x Developer Manual ,PP
4,October 2010
[12] http://en.wikipedia.org/wiki/Cloud_computing_securi
ty.
[13] SachdevAbhaThakral, and MohitBhansali.
"Addressing the Cloud Computing Security
Menace." IJRET, Volume 2, Issue 2, PP. 126-130,
Feb 2013.
[14] Mandeep Kaur, Manish Mahajan,"Implementing
various encryption algorithms to enhance the data
security of cloud in cloud computing" VSRD
International Journal of Computer Science &
Information Technology, Vol. 2 No. 10 October 2012
[15] William Stallings, Cryptography and Network
Security Principles and Practices, 4th ed., Prentice
Hall, PP. 134-173. November 2005.
[16] Bruce Schneier, Applied Cryptography, Protocols,
Algorithms and Source Code in C, 2nd ed., John
Wiley& Sons, 1996.
[17] Sanyal, D Gada, R Gogri, P Rathod, Z Dedhia, N
Mody, Security scheme for distributed DoS in
mobile ad hoc networks arXiv preprint arXiv:
1005.0109, 2010.
[18] Barrie Sosinsky, Cloud Computing Bible, Wiley
India Pvt. Ltd. ISBN:978-81-265-2980-3
[19] Fei Wu, Liang Wang, Jiguang Wan A low cost and
inner-round pipelined design of ECB-AES-256
crypto engine for Solid State Disk, 2010 Fifth IEEE
International Conference on Networking,
Architecture, and Storage.
[20] AbhaSachdev ,MohitBhansali ,Enhancing Cloud
Computing Security using AES Algorithm,
International Journal of Computer Applications
(0975 8887) Volume 67 No.9, PP 21-22, April
2013.
[21] http://www.vocal.com/cryptography/advanced-
encryption-standard-aes/
[22] http://www.tripwiremagazine.com/2011/04/12-
excellent-cloud-computing-operating-systems.html
[23] K.S.Suresh M.Tech, Prof K.V.Prasad , "Security
Issues and Security Algorithms in Cloud
Computing" , International Journal of Advanced
Research in Computer Science and Software
Engineering , Volume 2, Issue 10, October 2012
[24] http://www.ijettcs.org/

Vous aimerez peut-être aussi