Cloud Computing:: WWW - Globalsoftsolutions.in
Cloud Computing:: WWW - Globalsoftsolutions.in
Cloud Computing:: WWW - Globalsoftsolutions.in
in
CLOUD COMPUTING:
1. CLOUD
COMPUTING
MULTICLOUDS.
SECURITY
FROM
SINGLE
TO
A key approach to secure cloud computing is for the data owner to store
encrypted data in the cloud, and issue decryption keys to authorized users.
Then, when a user is revoked, the data owner will issue re-encryption
commands to the cloud to re-encrypt the data, to prevent the revoked user
from decrypting the data, and to generate new decryption keys to valid
users, so that they can continue to access the data. However, since a cloud
computing environment is comprised of many cloud servers, such commands
may not be received and executed by all of the cloud servers due to
unreliable network communications. In this paper, we solve this problem by
proposing a time-based re-encryption scheme, which enables the cloud
servers to automatically re-encrypt data based on their internal clocks. Our
solution is built on top of a new encryption scheme, attribute-based
encryption, to allow fine-grain access control, and does not require perfect
clock synchronization for correctness.
www.globalsoftsolutions.in
NoSQL Cloud data stores provide scalability and high availability properties
for web applications, but at the same time they sacrifice data consistency.
However, many applications cannot afford any data inconsistency. CloudTPS
is a scalable transaction manager which guarantees full ACID properties for
multi-item transactions issued by Web applications, even in the presence of
server failures and network partitions. We implement this approach on top
of the two main families of scalable data layers: Bigtable and SimpleDB.
Performance evaluation on top of HBase (an open-source version of Bigtable)
in our local cluster and Amazon SimpleDB in the Amazon cloud shows that
our system scales linearly at least up to 40 nodes in our local cluster and 80
nodes in the Amazon cloud.
www.globalsoftsolutions.in
on-demand user/attribute revocation and break-glass access under
emergency scenarios. Extensive analytical and experimental results are
presented which show the security, scalability and efficiency of our
proposed scheme.
www.globalsoftsolutions.in
entrust their valuable data to cloud providers, there have been increasing security
and privacy concerns on outsourced data. Several schemes employing attributebased encryption (ABE) have been proposed for access control of outsourced data
in cloud computing; however, most of them suffer from inflexibility in implementing
complex access control policies. In order to realize scalable, flexible, and finegrained access control of outsourced data in cloud computing, in this paper, we
propose hierarchical attribute-set-based encryption (HASBE) by extending
ciphertext-policy attribute-set-based encryption (ASBE) with a hierarchical
structure of users. The proposed scheme not only achieves scalability due to its
hierarchical structure, but also inherits flexibility and fine-grained access control
in supporting compound attributes of ASBE. In addition, HASBE employs multiple
value assignments for access expiration time to deal with user revocation more
efficiently than existing schemes. We formally prove the security of HASBE based
on security of the ciphertext-policy attribute-based encryption (CP-ABE) scheme
by Bethencourt and analyze its performance and computational complexity. We
implement our scheme and show that it is both efficient and flexible in dealing with
access control for outsourced data in cloud computing with comprehensive
experiments.
www.globalsoftsolutions.in
8. DETECTING
AND
RESOLVING
ANOMALIES(Secure Computing)
FIREWALL
POLICY
www.globalsoftsolutions.in
further extend our result to enable the TPA to perform audits for multiple users
simultaneously and efficiently. Extensive security and performance analysis show
the proposed schemes are provably secure and highly efficient.
10.
Applications stored in the cloud enable users to access and perform tasks in real
time, reducing costs in the acquisition of computer resources. Although there
are benefits, this paradigm also brings security and privacy risks to users, such
as theft of information or identity. This paper proposes a mechanism able to
provide privacy protection for users to use applications that address issues of
identity, confidentiality and user preferences.
11.
Enhancing privacy and
consumer cloud computing
dynamic
federation
in
IdM
for
Consumer cloud computing paradigm has emerged as the natural evolution and integration of
advances in several areas including distributed computing, service oriented
architecture and consumer electronics. In this complex ecosystem, security and
identity management challenges have cropped up, given their dynamism and
heterogeneity. As a direct consequence, dynamic federated identity management with
privacy improvements has arisen as an indispensable mechanism to enable the global
scalability and usability that are required for the successful implantation of Cloud
technologies. With these requirements in mind, we present an IdM architecture based
on privacy and reputation extensions compliance with the SAMLv2/ID-FF standards 1.
12.
Enabling Secure and Efficient Ranked Keyword Search over
Outsourced Cloud Data(Parallel and Distributed System.)
Cloud computing economically enables the paradigm of data service
outsourcing. However, to protect data privacy, sensitive cloud data
have to be encrypted before outsourced to the commercial public
cloud, which makes effective data utilization service a very
challenging task. Although traditional searchable encryption
techniques allow users to securely search over encrypted data
through keywords, they support only Boolean search and are not yet
sufficient to meet the effective data utilization need that is
inherently demanded by large number of users and huge amount of
www.globalsoftsolutions.in
data files in cloud. In this paper, we define and solve the problem of
secure ranked keyword search over encrypted cloud data. Ranked
search greatly enhances system usability by enabling search result
relevance ranking instead of sending undifferentiated results, and
further ensures the file retrieval accuracy. Specifically, we explore
the statistical measure approach, i.e., relevance score, from
information retrieval to build a secure searchable index, and develop a
one-to-many order-preserving mapping technique to properly protect
those sensitive score information. The resulting design is able to
facilitate efficient server-side ranking without losing keyword
privacy. Thorough analysis shows that our proposed solution enjoys
as-strong-as-possible security guarantee compared to previous
searchable encryption schemes, while correctly realizing the goal of
ranked keyword search. Extensive experimental results demonstrate
the efficiency of the proposed solution.
13.
Cooperative Provable Data Possession for Integrity
Verification in Multi-Cloud Storage (Parallel and Distribution
System)
Provable data possession (PDP) is a technique for ensuring the integrity of
data in storage outsourcing. In this paper, we address the construction
of an efficient PDP scheme for distributed cloud storage to support the
scalability of service and data migration, in which we consider the
existence of multiple cloud service providers to cooperatively store and
maintain the clients’ data. We present a cooperative PDP (CPDP)
scheme based on homomorphic verifiable response and hash index
hierarchy. We prove the security of our scheme based on multi-prover
zero-knowledge proof system, which can satisfy completeness,
knowledge soundness, and zero-knowledge properties. In addition, we
articulate performance optimization mechanisms for our scheme, and in
particular present an efficient method for selecting optimal parameter
values to minimize the computation costs of clients and storage service
providers. Our experiments show that our solution introduces lower
computation and communication overheads in comparison with noncooperative approaches.
www.globalsoftsolutions.in