Privacy-Preserving Public Auditing for Regenerating-Code-Based Cloud Storage

         Privacy-Preserving Public Auditing for Regenerating-Code-Based Cloud Storage 1croreprojects.com

ABSTRACT:

             To protect outsourced data in cloud storage against corruptions, adding fault tolerance to cloud storage together with data integrity checking and failure reparation becomes critical. Recently, regenerating codes have gained popularity due to their lower repair bandwidth while providing fault tolerance. Existing remote checking methods for regenerating-coded data only provide private auditing, requiring data owners to always stay online and handle auditing, as well as repairing, which is sometimes impractical. In this paper, we propose a public auditing scheme for the regenerating-code-based cloud storage. To solve the regeneration problem of failed authenticators in the absence of data owners, we introduce a proxy, which is privileged to regenerate the authenticators, into the traditional public auditing system model. Moreover, we design a novel public verifiable authenticator, which is generated by a couple of keys and can be regenerated using partial keys. Thus, our scheme can completely release data owners from online burden. In addition, we randomize the encode coefficients with a pseudo random function to preserve data privacy. Extensive security analysis shows that our scheme is provable secure under random oracle model and experimental evaluation indicates that our scheme is highly efficient and can be feasibly integrated into the regenerating-code-based cloud storage.

EXISTING SYSTEM: 

• Many mechanisms dealing with the integrity of outsourced data without a local copy have been proposed under different system and security models up to now. The most significant work among these studies are the PDP (provable data possession) model and POR (proof of retrievability) model, which were originally proposed for the single-server scenario by Ateniese et al. and Juels and Kaliski, respectively.
• Considering that files are usually striped and redundantly stored across multi-servers or multi-clouds, explore integrity verification schemes suitable for such multi-servers or multi-clouds setting with different redundancy schemes, such as replication, erasure codes, and, more recently, regenerating codes.
• Chen et al. and Chen and Lee separately and independently extended the single-server CPOR scheme to the regeneratingcode- scenario; designed and implemented a data integrity protection (DIP) scheme for FMSR-based cloud storage and the scheme is adapted to the thin-cloud setting.

DISADVANTAGES OF EXISTING SYSTEM:

• They are designed for private audit, only the data owner is allowed to verify the integrity and repair the faulty servers.
• Considering the large size of the outsourced data and the user’s constrained resource capability, the tasks of auditing and reparation in the cloud can be formidable and expensive for the users 
• The auditing schemes in existing imply the problem that users need to always stay online, which may impede its adoption in practice, especially for long-term archival storage.

PROPOSED SYSTEM:

• In this paper, we focus on the integrity verification problem in regenerating-code-based cloud storage, especially with the functional repair strategy. To fully ensure the data integrity and save the users’ computation resources as well as online burden, we propose a public auditing scheme for the regenerating-code-based cloud storage, in which the integrity checking and regeneration (of failed data blocks and authenticators) are implemented by a third-party auditor and a semi-trusted proxy separately on behalf of the data owner.
• Instead of directly adapting the existing public auditing scheme to the multi-server setting, we design a novel authenticator, which is more appropriate for regenerating codes. Besides, we “encrypt” the coefficients to protect data privacy against the auditor, which is more lightweight than applying the proof blind technique and data blind method.
• We design a novel homomorphic authenticator based on BLS signature, which can be generated by a couple of secret keys and verified publicly.

ADVANTAGES OF PROPOSED SYSTEM: 

• Utilizing the linear subspace of the regenerating codes, the authenticators can be computed efficiently. Besides, it can be adapted for data owners equipped with low end computation devices (e.g. Tablet PC etc.) in which they only need to sign the native blocks.
• To the best of our knowledge, our scheme is the first to allow privacy-preserving public auditing for regenerating code- based cloud storage. The coefficients are masked by a PRF (Pseudorandom Function) during the Setup phase to avoid leakage of the original data. This method is lightweight and does not introduce any computational overhead to the cloud servers or TPA.
• Our scheme completely releases data owners from online burden for the regeneration of blocks and authenticators at faulty servers and it provides the privilege to a proxy for the reparation.
• Optimization measures are taken to improve the flexibility and efficiency of our auditing scheme; thus, the storage overhead of servers, the computational overhead of the data owner and communication overhead during the audit phase can be effectively reduced.
• Our scheme is provable secure under random oracle model against adversaries

SYSTEM ARCHITECTURE:

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System  : Pentium IV 2.4 GHz.
• Hard Disk           : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP/7.
• Coding Language : JAVA/J2EE
• IDE : Netbeans 7.4 
• Database : MYSQL

REFERENCE:

            Jian Liu, Kun Huang, Hong Rong, Huimei Wang, and Ming Xian, “Privacy-Preserving Public Auditing for Regenerating-Code-Based Cloud Storage”, IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 10, NO. 7, JULY 2015.

Identity-Based Encryption with Outsourced Revocation in Cloud Computing

                Identity-Based Encryption with Outsourced Revocation in Cloud Computing 1croreprojects.com

ABSTRACT:

              Identity-Based Encryption (IBE) which simplifies the public key and certificate management at Public Key Infrastructure (PKI) is an important alternative to public key encryption. However, one of the main efficiency drawbacks of IBE is the overhead computation at Private Key Generator (PKG) during user revocation. Efficient revocation has been well studied in traditional PKI setting, but the cumbersome management of certificates is precisely the burden that IBE strives to alleviate. In this paper, aiming at tackling the critical issue of identity revocation, we introduce outsourcing computation into IBE for the first time and propose a revocable IBE scheme in the server-aided setting. Our scheme offloads most of the key generation related operations during key-issuing and key-update processes to a Key Update Cloud Service Provider, leaving only a constant number of simple operations for PKG and users to perform locally. This goal is achieved by utilizing a novel collusion-resistant technique: we employ a hybrid private key for each user, in which an AND gate is involved to connect and bound the identity component and the time component. Furthermore, we propose another construction which is provable secure under the recently formulized Refereed Delegation of Computation model. Finally, we provide extensive experimental results to demonstrate the efficiency of our proposed construction.

EXISTING SYSTEM: 

• Identity-Based Encryption (IBE) is an interesting alternative to public key encryption, which is proposed to simplify key management in a certificate-based Public Key Infrastructure (PKI) by using human-intelligible identities (e.g., unique name, email address, IP address, etc) as public keys.
• Boneh and Franklin suggested that users renew their private keys periodically and senders use the receivers’ identities concatenated with current time period.
• Hanaoka et al. proposed a way for users to periodically renew their private keys without interacting with PKG.
• Lin et al. proposed a space efficient revocable IBE mechanism from non-monotonic Attribute-Based Encryption (ABE), but their construction requires times bilinear pairing operations for a single decryption where is the number of revoked users.

DISADVANTAGES OF EXISTING SYSTEM:

• Boneh and Franklin mechanism would result in an overhead load at PKG. In another word, all the users regardless of whether their keys have been revoked or not, have to contact with PKG periodically to prove their identities and update new private keys. It requires that PKG is online and the secure channel must be maintained for all transactions, which will become a bottleneck for IBE system as the number of users grows. 
• Boneh and Franklin’s suggestion  is more a viable solution but impractical.
• In Hanaoka et al system, however, the assumption required in their work is that each user needs to possess a tamper-resistant hardware device.
• If an identity is revoked then the mediator is instructed to stop helping the user. Obviously, it is impractical since all users are unable to decrypt on their own and they need to communicate with mediator for each decryption.

PROPOSED SYSTEM:

• In this paper, we introduce outsourcing computation into IBE revocation, and formalize the security definition of outsourced revocable IBE for the first time to the best of our knowledge. We propose a scheme to offload all the key generation related operations during key-issuing and keyupdate, leaving only a constant number of simple operations for PKG and eligible users to perform locally. 
• In our scheme, as with the suggestion, we realize revocation through updating the private keys of the unrevoked users. But unlike that work which trivially concatenates time period with identity for key generation/update and requires to re-issue the whole private key for unrevoked users, we propose a novel collusion-resistant key issuing technique: we employ a hybrid private key for each user, in which an AND gate is involved to connect and bound two sub-components, namely the identity component and the time component. 
• At first, user is able to obtain the identity component and a default time component (i.e., for current time period) from PKG as his/her private key in key-issuing. Afterwards, in order to maintain decryptability, unrevoked users needs to periodically request on keyupdate for time component to a newly introduced entity named Key Update Cloud Service Provider (KU-CSP).

ADVANTAGES OF PROPOSED SYSTEM:

• Compared with the previous work, our scheme does not have to re-issue the whole private keys, but just need to update a lightweight component of it at a specialized entity KU-CSP. 
• With the aid of KU-CSP, user needs not to contact with PKG in key-update, in other words, PKGis allowed to be offline after sending the revocation list to KU-CSP. 
• No secure channel or user authentication is required during key-update between user and KU-CSP.
• Furthermore, we consider to realize revocable IBE with a semi-honest KU-CSP. To achieve this goal, we present a security enhanced construction under the recently formalized Refereed Delegation of Computation (RDoC) model. 
• Finally, we provide extensive experimental results to demonstrate the efficiency of our proposed construction.

SYSTEM ARCHITECTURE:

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System  : Pentium IV 2.4 GHz.
• Hard Disk           : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour. 
• Mouse : Logitech.
• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP/7.
• Coding Language : JAVA/J2EE
• IDE : Netbeans 7.4
• Database : MYSQL

REFERENCE:

               Jin Li, Jingwei Li, Xiaofeng Chen, Chunfu Jia, and Wenjing Lou, Senior Member, IEEE, “Identity-Based Encryption with Outsourced Revocation in Cloud Computing”, IEEE TRANSACTIONS ON COMPUTERS, VOL. 64, NO. 2, FEBRUARY 2015.

Enabling Fine-grained Multi-keyword Search Supporting Classified Sub-dictionaries over Encrypted Cloud Data

                           Enabling Fine-grained Multi-keyword Search Supporting Classified Sub-dictionaries over Encrypted Cloud Data 1croreprojects.com

ABSTRACT:

                     Using cloud computing, individuals can store their data on remote servers and allow data access to public users through the cloud servers. As the outsourced data are likely to contain sensitive privacy information, they are typically encrypted before uploaded to the cloud. This, however, significantly limits the usability of outsourced data due to the difficulty of searching over the encrypted data. In this paper, we address this issue by developing the fine-grained multi-keyword search schemes over encrypted cloud data. Our original contributions are three-fold. First, we introduce the relevance scores and preference factors upon keywords which enable the precise keyword search and personalized user experience. Second, we develop a practical and very efficient multi-keyword search scheme. The proposed scheme can support complicated logic search the mixed “AND”, “OR” and “NO” operations of keywords. Third, we further employ the classified sub-dictionaries technique to achieve better efficiency on index building, trapdoor generating and query. Lastly, we analyze the security of the proposed schemes in terms of confidentiality of documents, privacy protection of index and trapdoor, and unlink ability of trapdoor. Through extensive experiments using the real-world dataset, we validate the performance of the proposed schemes. Both the security analysis and experimental results demonstrate that the proposed schemes can achieve the same security level comparing to the existing ones and better performance in terms of functionality, query complexity and efficiency.

EXISTING SYSTEM:

•  The searchable encryption has been recently developed as a fundamental approach to enable searching over encrypted cloud data, which proceeds the following operations.
• Wang et al. propose a ranked keyword search scheme which considers the relevance scores of keywords.
• Sun et al. propose a multi-keyword text search scheme which considers the relevance scores of keywords and utilizes a multidimensional tree technique to achieve efficient search query. 
• Yu et al. propose a multi-keyword top-k retrieval scheme which uses fully homomorphic encryption to encrypt the index/trapdoor and guarantees high security. 
• Cao et al. propose a multi-keyword ranked search (MRSE), which applies coordinate machine as the keyword matching rule, i.e., return data with the most matching keywords.

DISADVANTAGES OF EXISTING SYSTEM:

• Due to using order-preserving encryption (OPE) to achieve the ranking property, the existing scheme cannot achieve unlink ability of trapdoor.
• Although many search functionalities have been developed in previous literature towards precise and efficient searchable encryption, it is still difficult for searchable encryption to achieve the same user experience as that of the plain text search, like Google search.
• Most existing proposals can only enable search with single logic operation, rather than the mixture of multiple logic operations on keywords

PROPOSED SYSTEM:

• In this work, we address by developing two Fine-grained Multi-keyword Search (FMS) schemes over encrypted cloud data.
• In this system, we introduce the relevance scores and the preference factors of keywords for searchable encryption. The relevance scores of keywords can enable more precise returned results, and the preference factors of keywords represent the importance of keywords in the search keyword set specified by search users and correspondingly enables personalized search to cater to specific user preferences. It thus further improves the search functionalities and user experience.
• In this system, we realize the “AND”, “OR” and “NO” operations in the multi-keyword search for searchable encryption. Compared with schemes, the proposed scheme can achieve more comprehensive functionality and lower query complexity.
• In this system, we employ the classified sub-dictionaries technique to enhance the efficiency of the above two schemes. Extensive experiments demonstrate that the enhanced schemes can achieve better efficiency in terms of index building, trapdoor generating and query in the comparison with schemes

ADVANTAGES OF PROPOSED SYSTEM:

• Better search results with multi-keyword query by the cloud server according to some ranking criteria.
• To reduce the communication cost.
• Achieves lower query complexity.
• Achieves better efficiency in index building scheme of our proposed model.

SYSTEM ARCHITECTURE:

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS: 

• System  : Pentium IV 2.4 GHz.
• Hard Disk           : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP/7.
• Coding Language : JAVA/J2EE
• IDE : Netbeans 7.4
• Database : MYSQL

REFERENCE:

           Hongwei Li, Member, IEEE, Yi Yang, Student Member, IEEE, Tom H. Luan, Member, IEEE, Xiaohui Liang, Student Member, IEEE, Liang Zhou, Member, IEEE, and Xuemin (Sherman) Shen, Fellow, IEEE, “Enabling Fine-grained Multi-keyword Search Supporting Classified Sub-dictionaries over Encrypted Cloud Data”, IEEE Transactions on Dependable and Secure Computing, 2015.

Enabling Cloud Storage Auditing With Key-Exposure Resistance

                 Enabling Cloud Storage Auditing With Key-Exposure Resistance 1croreprojects.com

ABSTRACT:

                Cloud storage auditing is viewed as an important service to verify the integrity of the data in public cloud. Current auditing protocols are all based on the assumption that the client’s secret key for auditing is absolutely secure. However, such assumption may not always be held, due to the possibly weak sense of security and/or low security settings at the client. If such a secret key for auditing is exposed, most of the current auditing protocols would inevitably become unable to work. In this paper, we focus on this new aspect of cloud storage auditing. We investigate how to reduce the damage of the client’s key exposure in cloud storage auditing, and give the first practical solution for this new problem setting. We formalize the definition and the security model of auditing protocol with key-exposure resilience and propose such a protocol. In our design, we employ the binary tree structure and the preorder traversal technique to update the secret keys for the client. We also develop a novel authenticator construction to support the forward security and the property of blockless verifiability. The security proof and the performance analysis show that our proposed protocol is secure and efficient.

EXISTING SYSTEM:

• These protocols focus on several different aspects of auditing, and how to achieve high bandwidth and computation efficiency is one of the essential concerns. For that purpose, the Homomorphic Linear Authenticator (HLAtechnique that supports blockless verification is explored to reduce the overheads of computation and communication in auditing protocols, which allows the auditor to verify the integrity of the data in cloud without retrieving the whole data.
• The privacy protection of data is also an important aspect of cloud storage auditing. In order to reduce the computational burden of the client, a third-party auditor (TPA) is introduced to help the client to periodically check the integrity of the data in cloud. However, it is possible for the TPA to get the client’s data after it executes the auditing protocol multiple times.
• Wang et al. have proposed an auditing protocol supporting fully dynamic data operations including modification, insertion and deletion.

DISADVANTAGES OF EXISTING SYSTEM:

• Though many research works about cloud storage auditing have been done in recent years, a critical security problem—the key exposure problem for cloud storage auditing, has remained unexplored in previous researches. While all existing protocols focus on the faults or dishonesty of the cloud, they have overlooked the possible weak sense of security and/or low security settings at the client.
• Unfortunately, previous auditing protocols did not consider this critical issue of how to deal with the client’s secret key exposure for cloud storage auditing, and any exposure of the client’s secret auditing key would make most of the existing auditing protocols unable to work correctly.

PROPOSED SYSTEM:

• In this paper, we focus on how to reduce the damage of the clients key exposure in cloud storage auditing. Our goal is to design a cloud storage auditing protocol with built-in key-exposure resilience. How to do it efficiently under this new problem setting brings in many new challenges to be addressed below. First of all, applying the traditional solution of key revocation to cloud storage auditing is not practical. This is because, whenever the client’s secret key for auditing is exposed, the client needs to produce a new pair of public key and secret key and regenerate the authenticators for the client’s data previously stored in cloud.
• Our goal is to design a practical auditing protocol with key-exposure resilience, in which the operational complexities of key size, computation overhead and communication overhead should be at most sub-linear to T. In order to achieve our goal, we use a binary tree structure to appoint time periods and associate periods with tree nodes by the pre-order traversal technique. The secret key in each time period is organized as a stack. In each time period, the secret key is updated by a forward-secure technique.
• The auditing protocol achieves key-exposure resilience while satisfying our efficiency requirements. As we will show later, in our protocol, the client can audit the integrity of the cloud data still in aggregated manner, i.e., without retrieving the entire data from the cloud.

ADVANTAGES OF PROPOSED SYSTEM:

• We initiate the first study on how to achieve the key-exposure resilience in the storage auditing protocol and propose a new concept called auditing protocol with key-exposure resilience. In such a protocol, any dishonest behaviors, such as deleting or modifying some client’s data stored in cloud in previous time periods, can all be detected, even if the cloud gets the client’s current secret key for cloud storage auditing.
• This very important issue is not addressed before by previous auditing protocol designs. We further formalize the definition and the security model of auditing protocol with key-exposure resilience for secure cloud storage.
• We design and realize the first practical auditing protocol with built-in key-exposure resilience for cloud storage. In order to achieve our goal, we employ the binary tree structure, seen in a few previous works on different cryptographic designs, to update the secret keys of the client. Such a binary tree structure can be considered as a variant of the tree structure used in the HIBE scheme. In addition, the pre-order traversal technique is used to associate each node of a binary tree with each time period. In our detailed protocol, the stack structure is used to realize the pre-order traversal of the binary tree. We also design a novel authenticator supporting the forward security and the property of blockless verifiability. 
• We prove the security of our protocol in the formalized security model, and justify its performance via concrete asymptotic analysis. Indeed, the proposed protocol only adds reasonable overhead to achieve the key-exposure resilience. We also show that our proposed design can be extended to support the TPA, lazy update and multiple sectors.

SYSTEM ARCHITECTURE:

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System  : Pentium IV 2.4 GHz.
• Hard Disk           : 40 GB.
• Floppy Drive : 1.44 Mb. 
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP/7.
• Coding Language : JAVA/J2EE
• IDE : Netbeans 7.4
•  Database : MYSQL

REFERENCE:

              Jia Yu, Kui Ren, Senior Member, IEEE, Cong Wang, Member, IEEE, and Vijay Varadharajan, Senior Member, IEEE, “Enabling Cloud Storage Auditing With Key-Exposure Resistance”, IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 10, NO. 6, JUNE 2015.

Control Cloud Data Access Privilege and Anonymity With Fully Anonymous Attribute-Based Encryption

                  Control Cloud Data Access Privilege and Anonymity With Fully Anonymous Attribute-Based Encryption 1croreprojects.com

ABSTRACT:

              Cloud computing is a revolutionary computing paradigm, which enables flexible, on-demand, and low-cost usage of computing resources, but the data is outsourced to some cloud servers, and various privacy concerns emerge from it. Various schemes based on the attribute-based encryption have been proposed to secure the cloud storage. However, most work focuses on the data contents privacy and the access control, while less attention is paid to the privilege control and the identity privacy. In this paper, we present a semi-anonymous privilege control scheme AnonyControl to address not only the data privacy, but also the user identity privacy in existing access control schemes. AnonyControl decentralizes the central authority to limit the identity leakage and thus achieves semianonymity. Besides, it also generalizes the file access control to the privilege control, by which privileges of all operations on the cloud data can be managed in a fine-grained manner. Subsequently, we present the AnonyControl-F, which fully prevents the identity leakage and achieve the full anonymity. Our security analysis shows that both AnonyControl and AnonyControl-F are secure under the decisional bilinear Diffie–Hellman assumption, and our performance evaluation exhibits the feasibility of our schemes.

EXISTING SYSTEM:

• Various techniques have been proposed to protect the data contents privacy via access control. Identity-based encryption (IBE) was first introduced by Shamir, in which the sender of a message can specify an identity such that only a receiver with matching identity can decrypt it.
• Few years later, Fuzzy Identity-Based Encryption is proposed, which is also known as Attribute-Based Encryption (ABE).
• The work by Lewko et al. and Muller et al. are the most similar ones to ours in that they also tried to decentralize the central authority in the CP-ABE into multiple ones. 
• Lewko et al. use a LSSS matrix as an access structure, but their scheme only converts the AND, OR gates to the LSSS matrix, which limits their encryption policy to boolean formula, while we inherit the flexibility of the access tree having threshold gates. 
• Muller et al. also supports only Disjunctive Normal Form (DNF) in their encryption policy.

DISADVANTAGES OF EXISTING SYSTEM:

• The identity is authenticated based on his information for the purpose of access control (or privilege control in this paper).
• Preferably, any authority or server alone should not know any client’s personal information.
• The users in the same system must have their private keys re-issued so as to gain access to the re-encrypted files, and this process causes considerable problems in implementation.

PROPOSED SYSTEM: 

• The data confidentiality, less effort is paid to protect users’ identity privacy during those interactive protocols. Users’ identities, which are described with their attributes, are generally disclosed to key issuers, and the issuers issue private keys according to their attributes. 
• We propose AnonyControl and AnonyControl-Fallow cloud servers to control users’ access privileges without knowing their identity information. In this setting, each authority knows only a part of any user’s attributes, which are not enough to figure out the user’s identity. The scheme proposed by Chase et al.  considered the basic threshold-based KP-ABE. Many attribute based encryption schemes having multiple authorities have been proposed afterwards.
• In our system, there are four types of entities: N Attribute Authorities (denoted as A), Cloud Server, Data Owners and Data Consumers. A user can be a Data Owner and a Data Consumer simultaneously. 
• Authorities are assumed to have powerful computation abilities, and they are supervised by government offices because some attributes partially contain users’ personally identifiable information. The whole attribute set is divided into N  is joint sets and controlled by each authority, therefore each authority is aware of only part of attributes.

ADVANTAGES OF PROPOSED SYSTEM:

• The proposed schemes are able to protect user’s privacy against each single authority. Partial information is disclosed in AnonyControl and no information is disclosed in AnonyControl-F. 
• The proposed schemes are tolerant against authority compromise, and compromising of up to (N −2) authorities does not bring the whole system down.
• We provide detailed analysis on security and performance to show feasibility of the scheme AnonyControl and AnonyControl-F.
• We firstly implement the real toolkit of a multiauthority based encryptioscheme AnonyControl and AnonyControl-F.

SYSTEM ARCHITECTURE:

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System  : Pentium IV 2.4 GHz.
• Hard Disk           : 40 GB. 
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP/7.
• Coding Language : JAVA/J2EE
• IDE : Netbeans 7.4
• Database : MYSQL

REFERENCE:

              Taeho Jung, Xiang-Yang Li, Senior Member, IEEE, Zhiguo Wan, and Meng Wan, Member, IEEE, “Control Cloud Data Access Privilege and Anonymity With Fully Anonymous Attribute-Based Encryption”, IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 10, NO. 1, JANUARY 2015.

CloudArmor: Supporting Reputation-based Trust Management for Cloud Services

                   Cloud Armor: Supporting Reputation-based Trust Management for Cloud Services 1croreprojects.com

ABSTRACT:

               Trust management is one of the most challenging issues for the adoption and growth of cloud computing. The highly dynamic, distributed, and non-transparent nature of cloud services introduces several challenging issues such as privacy, security, and availability. Preserving consumers’ privacy is not an easy task due to the sensitive information involved in the interactions between consumers and the trust management service. Protecting cloud services against their malicious users (e.g., such users might give misleading feedback to disadvantage a particular cloud service) is a difficult problem. Guaranteeing the availability of the trust management service is another significant challenge because of the dynamic nature of cloud environments. In this article, we describe the design and implementation of Cloud Armor, a reputation-based trust management framework that provides a set of functionalities to deliver Trust as a Service (TaaS), which includes i) a novel protocol to prove the credibility of trust feed backs and preserve users’ privacy, ii) an adaptive and robust credibility model for measuring the credibility of trust feed backs to protect cloud services from malicious users and to compare the trustworthiness of cloud services, and iii) an availability model to manage the availability of the decentralized implementation of the trust management service. The feasibility and benefits of our approach have been validated by a prototype and experimental studies using a collection of real-world trust feed backs on cloud services.

EXISTING SYSTEM:

              According to researchers at Berkeley, trust and security are ranked one of the top 10 obstacles for the adoption of cloud computing. Indeed, Service-Level Agreements (SLAs). Consumers’ feedback is a good source to assess the overall trustworthiness of cloud services. Several researchers have recognized the significance of trust management and proposed solutions to assess and manage trust based on feed backs collected from participants.

DISADVANTAGES OF EXISTING SYSTEM:

• Guaranteeing the availability of  TMS  is a difficult problem due to the unpredictable number of users and the highly dynamic nature of the cloud environment.
• A Self-promoting attack might have been performed on cloud service sy, which means sx should have been selected instead.
• Disadvantage a cloud service by giving multiple misleading trust feed backs (i.e., collusion attacks)
• Trick users into trusting cloud services that are not trustworthy by creating several accounts and giving misleading trust feed backs (i.e., Sybil attacks).

PROPOSED SYSTEM: 

• Cloud service users’ feedback is a good source to assess the overall trustworthiness of cloud services. In this paper, we have presented novel techniques that help in detecting reputation based attacks and allowing users to effectively identify trustworthy cloud services. 
• We introduce a credibility model that not only identifies misleading trust feed backs from collusion attacks but also detects Sybil attacks no matter these attacks take place in a long or short period of time (i.e., strategic or occasional attacks respectively). 
• We also develop an availability model that maintains the trust management service at a desired level. We also develop an availability model that maintains the trust management service at a desired level.

ADVANTAGES OF PROPOSED SYSTEM:

• Trust Cloud framework for accountability and trust in cloud computing. In particular, Trust Cloud consists of five layers including workflow,
• Propose a multi-faceted Trust Management (TM) system architecture for cloud computing to help the cloud service users to identify trustworthy cloud service providers.

SYSTEM ARCHITECTURE:

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System  : Pentium IV 2.4 GHz.
• Hard Disk  : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : WindowsXP/7. 
• Coding Language : JAVA/J2EE
• IDE : Net beans 7.4
• Database : MYSQL

REFERENCE:

             Talal H. Noor, Quan Z. Sheng, Member, IEEE, Lina Yao, Schahram Dustdar, Senior Member, IEEE, and Anne H.H. Ngu, “CloudArmor: Supporting Reputation-based Trust Management for Cloud Services”,  IEEE Transactions on Parallel and Distributed Systems, 2015.

ADDRESS:

              1crore projects,

              No. 214/215, 2nd Floor, Raahat Plaza

              Vadapalani, Chennai,Tamilnadu, india.-600026

Circuit Ciphertext-policy Attribute-based Hybrid Encryption with Verifiable Delegation in Cloud Computing

                        Circuit Cipher text-policy Attribute-based Hybrid Encryption with Verifiable Delegation in Cloud Computing1croreprojects.com

ABSTRACT:

                   In the cloud, for achieving access control and keeping data confidential, the data owners could adopt attribute-based encryption to encrypt the stored data. Users with limited computing power are however more likely to delegate the mask of the decryption task to the cloud servers to reduce the computing cost. As a result, attribute-based encryption with delegation emerges. Still, there are caveats and questions remaining in the previous relevant works. For instance, during the delegation, the cloud servers could tamper or replace the delegated cipher text and respond a forged computing result with malicious intent. They may also cheat the eligible users by responding them that they are ineligible for the purpose of cost saving. Furthermore, during the encryption, the access policies may not be flexible enough as well. Since policy for general circuits enables to achieve the strongest form of access control, a construction for realizing circuit cipher text-policy attribute-based hybrid encryption with verifiable delegation has been considered in our work. In such a system, combined with verifiable computation and encrypt- then-mac mechanism, the data confidentiality, the fine-grained access control and the correctness of the delegated computing results are well guaranteed at the same time. Besides, our scheme achieves security against chosen-plaint ext attacks under the k-multi linear  Decisional Diffie-Hellman assumption. Moreover, an extensive simulation campaign confirms the feasibility and efficiency of the proposed solution.

EXISTING SYSTEM:

                  The servers could be used to handle and calculate numerous data according to the user’s demands. As applications move to cloud computing platforms, cipher text-policy attribute-based encryption (CP-ABE)  and verifiable delegation (VD)  are used to ensure the data confidentiality and the verifiability of delegation on dishonest cloud servers. the increasing volumes of medical images and medical records, the healthcare organizations put a large amount of data in the cloud for reducing data storage costs and supporting medical cooperation. There are two complementary forms of attribute based encryption. One is key-policy attribute-based encryption (KP-ABE)  and the other is cipher text-policy attribute-based encryption (CPABE).

DISADVANTAGES OF EXISTING SYSTEM:

• The cloud server might tamper or replace the data owner’s original cipher text for malicious attacks, and then respond a false transformed cipher text. 
• The cloud server might cheat the authorized user for cost saving. Though the servers could not respond a correct transformed cipher text to an unauthorized user, he could cheat an authorized one that he/she is not eligible.

PROPOSED SYSTEM:

             We firstly present a circuit cipher text-policy attribute-based hybrid encryption with verifiable delegation scheme. General circuits are used to express the strongest form of access control policy. the proposed scheme is proven to be secure based on k-multi linear Decisional Diffie-Hellman assumption. On the other hand, we implement our scheme over the integers. During the delegation computing, a user could validate whether the cloud server responds a correct transformed cipher text to help him/her decrypt  the cipher text immediately and correctly.

ADVANTAGES OF PROPOSED SYSTEM:

• The generic KEM/DEM construction for hybrid encryption which can encrypt messages of arbitrary length.
• They seek to guarantee the correctness of the original cipher text by using a commitment.
• We give the anti-collusion circuit CP-ABE construction in this paper for the reason that CPABE is conceptually closer to the traditional access control methods.

SYSTEM ARCHITECTURE:

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System  : Pentium IV 2.4 GHz.
• Hard Disk : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP/7.
• Coding Language : JAVA/J2EE
• IDE : Netbeans 7.4
• Database : MYSQL

REFERENCE:

Jie Xu, Qiaoyan Wen, Wenmin Li and Zhengping Jin, “Circuit Ciphertext-policy Attribute-based Hybrid Encryption with Verifiable Delegation in Cloud Computing”, IEEE Transactions on Parallel and Distributed Systems 2015.

Address:

1crore projects,

Door No: 214/215,2nd Floor,

No. 172, Raahat Plaza, (Shopping Mall)

Arcot Road, Vadapalani, Chennai,

Tamil Nadu, INDIA - 600 026

Phone : +91 77081 50152 / +91 97518 00789 / +91 72999 51536

Audit-Free Cloud Storage via Deniable Attribute-based Encryption

                            Audit-Free Cloud Storage via Deniable Attribute-based Encryption

ABSTRACT:

          Cloud storage services have become increasingly popular. Because of the importance of privacy, many cloud storage encryption schemes have been proposed to protect data from those who do not have access. All such schemes assumed that cloud storage providers are safe and cannot be hacked; however, in practice, some authorities (i.e., coercers) may force cloud storage providers toreveal user secrets or confidential data on the cloud, thus altogether circumventing storage encryption schemes. In this paper, we present our design for a new cloud storage encryption scheme that enables cloud storage providers to create convincing fake user secrets to protect user privacy. Since coercers cannot tell if obtained secrets are true or not, the cloud storage providers ensure that user privacy is still securely protected.

EXISTING SYSTEM:

         There are numerous ABE schemes that have been proposed. Most of the proposed schemes assume cloud storage service providers or trusted third parties handling key management are trusted and cannot be hacked; however, in practice, some entities may intercept communications between users and cloud storage providers and then compel storage providers to release user secrets by using government power or other means. In this case, encrypted data are assumed to be known and storage providers are requested to release user secrets. 

         Sahai and Waters first introduced the concept of ABE in which data owners can embed how they want to share data in terms of encryption.

        There are two types of ABE, CP-ABE and Key-Policy ABE (KP-ABE)Goyal et al. proposed the first KPABE. They constructed an expressive way to relate any monotonic formula as the policy for user secret keys. Bethencourt et al. proposed the first CP-ABE. This scheme used a tree access structure to express any monotonic formula over attributes as the 

policy in the ciphertext.

DISADVANTAGES OF EXISTING SYSTEM:

• It is also impractical to encrypt data many times for many people. With ABE, data owners decide only which kind of users can access their encrypted data. Users who satisfy the conditions are able to decrypt the encrypted data.
• Use translucent sets or simulatable public key systems to implement deniability.
• Most deniable public key schemes are bitwise, which means these schemes can only process one bit a time; therefore, bitwise deniable encryption schemes are inefficient for real use, especially in the cloud storage service case.
• Most of the previous deniable encryption schemes are inter-encryption independent. That is, the encryption parameters should be totally different for each encryption operation. If two deniable encryptions are performed in the same environment, the latter encryption will lose deniability after the first encryption is coerced, because each coercion will reduce flexibility.
• Most deniable encryption schemes have decryption error problems. These errors come from the designed decryption mechanisms.

PROPOSED SYSTEM:

           In this work, we describe a deniable ABE scheme for cloud storage services. We make use of ABE characteristics for securing stored data with a fine-grained access control mechanism and deniable encryption to prevent outside auditing. Our scheme is based on Waters ciphertext policy-attribute based encryption (CP-ABE) scheme. We enhance the Waters scheme from prime order bilinear groups to composite order bilinear groups. By the subgroup decision problem assumption, our scheme enables users to be able to provide fake secrets that seem legitimate to outside coercers.

          In this work, we construct a deniable CP-ABE scheme that can make cloud storage services secure and auditfree. In this scenario, cloud storage service providers are just regarded as receivers in other deniable schemes.

ADVANTAGES OF PROPOSED SYSTEM:

• Unlike most previous deniable encryption schemes, we do not use translucent sets or simulatable public key systems to implement deniability. Instead, we adopt the idea proposed with some improvements. We construct our deniable encryption scheme through a multidimensional space. All data are encrypted into the multidimensional space. 
• Only with the correct composition of dimensions is the original data obtainable. With false composition, ciphertexts will be decrypted to predetermined fake data. The information defining the dimensions is kept secret. We make use of composite order bilinear groups to construct the multidimensional space. We also use chameleon hash functions to make both true and fake messages convincing.
• In this work, we build a consistent environment for our deniable encryption scheme. By consistent environment, we means that one encryption environment can be used for multiple encryption times without system updates. The opened receiver proof should look convincing for all ciphertexts under this environment, regardless of whether a cipher text is normally encrypted or deniably encrypted. The deniability of our scheme comes from the secret of the subgroup assignment, which is determined only once in the system setup phase. By the canceling property and the proper subgroup assignment, we can construct the released fake key to decrypt normal ciphertexts correctl

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System  : Pentium IV 2.4 GHz.
• Hard Disk : 40 GB.
• Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
•  Mouse : Logitech.
• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP/7.
• Coding Language : JAVA/J2EE
• IDE : Netbeans 7.4
• Database : MYSQL

REFERENCE:

Po-Wen Chi and Chin-Laung Lei, Member, IEEE, “Audit-Free Cloud Storage via Deniable Attribute-based Encryption”, IEEE Transactions on Cloud Computing, 2015.

Address:

1croreprojects,

Door No: 214/215,2nd Floor,

No. 172, Raahat Plaza, (Shopping Mall)

Arcot Road, Vadapalani, Chennai,

Tamin Nadu, INDIA - 600 026

Website: www.freeinternshipinchennai.co.in 

Phone : +91 77081 50152 / +91 97518 00789 / +91 72999 51536

A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud

                      A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud

ABSTRACT:1croreprojects.com

          Benefited from cloud computing, users can achieve an effective and economical approach for data sharing among group members in the cloud with the characters of low maintenance and little management cost. Meanwhile, we must provide security guarantees for the sharing data files since they are outsourced. Unfortunately, because of the frequent change of the membership, sharing data while providing privacy-preserving is still a challenging issue, especially for an untrusted cloud due to the collusion attack. Moreover, for existing schemes, the security of key distribution is based on the secure communication channel, however, to have such channel is a strong assumption and is difficult for practice. n this paper, we propose a secure data sharing scheme for dynamic members. Firstly, we propose a secure way for key distribution without any secure communication channels, and the users can securely obtain their private keys from group manager. Secondly, our scheme can achieve fine-grained access control, any user in the group can use the source in the cloud and revoked users cannot access the cloud again after they are revoked. Thirdly, we can protect the scheme from collusion attack, which means that revoked users cannot get the original data file even if they conspire with the untrusted cloud.   In our approach, by leveraging polynomial function, we can achieve a secure user revocation scheme. Finally, our scheme can achieve fine efficiency, which means previous users need not to update their private keys for the situation either a new user joins in the group or a user is revoked from the group.

EXISTING SYSTEM:

•  Kallahalla et al presented a cryptographic storage system that enables secure data sharing on untrustworthy servers based on the techniques that dividing files into file groups and encrypting each file group with a file-block key.
• Yu et al exploited and combined techniques of key policy attribute-based encryption, proxy re-encryption and lazy re-encryption to achieve fine-grained data access control without disclosing data contents.

DISADVANTAGES OF EXISTING SYSTEM:

• The file-block keys need to be updated and distributed for a user revocation; therefore, the system had a heavy key distribution overhead. 
•  The complexities of user participation and revocation in these schemes are linearly increasing with the number of data owners and the revoked users.
• The single-owner manner may hinder the implementation of applications, where any member in the group can use the cloud service to store and share data files with others.

PROPOSED SYSTEM:

• In this paper, we propose a secure data sharing scheme, which can achieve secure key distribution and data sharing for dynamic group. 
• We provide a secure way for key distribution without any secure communication channels. The users can securely obtain their private keys from group manager without any Certificate Authorities due to the verification for the public key of the user.
•  Our scheme can achieve fine-grained access control, with the help of the group user list, any user in the group can use the source in the cloud and revoked users cannot access the cloud again after they are revoked.
• We propose a secure data sharing scheme which can be protected from collusion attack. The revoked users can not be able to get the original data files once they are revoked even if they conspire with the untrusted cloud. Our scheme can achieve secure user revocation with the help of polynomial function.
• Our scheme is able to support dynamic groups efficiently, when a new user joins in the group or a user is revoked from the group, the private keys of the other users do not need to be recomputed and updated.
• We provide security analysis to prove the security of our scheme.

ADVANTAGES OF PROPOSED SYSTEM:

• The computation cost is irrelevant to the number of revoked users in RBAC scheme. The reason is that no matter how many users are revoked, the operations for members to decrypt the data files almost remain the same. 
• The cost is irrelevant to the number of the revoked users. The reason is that the computation cost of the cloud for file upload in our scheme consists of two verifications for signature, which is irrelevant to the number of the revoked users. The reason for the small computation cost of the cloud in the phase of file upload in RBAC scheme is that the verifications between communication entities are not concerned in this scheme. 
• In our scheme, the users can securely obtain their private keys from group manager Certificate Authorities and secure communication channels. Also, our scheme is able to support dynamic groups efficiently, when a new user joins in the group or a user is revoked from the group, the private keys of the other users do not need to be recomputed and updated.

SYSTEM ARCHITECTURE:

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

•  System  : Pentium IV 2.4 GHz.
•  Hard Disk    : 40 GB. 
•  Floppy Drive : 1.44 Mb.
•  Monitor : 15 VGA Colour.
• Mouse : Logitech.
• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP/7.
• Coding Language : JAVA/J2EE
•  IDE : Netbeans 7.4
• Database : MYSQL

REFERENCE:

Zhongma Zhu, Rui Jiang, “A Secure Anti-Collusion Data Sharing Scheme for Dynamic Groups in the Cloud”, IEEE Transactions on Parallel and Distributed Systems, 2015.

Address:

1croreprojects,

Door No: 214/215,2nd Floor,

No. 172, Raahat Plaza, (Shopping Mall)

Arcot Road, Vadapalani, Chennai,

Tamin Nadu, INDIA - 600 026

Website: www.freeinternshipinchennai.co.in 

Phone : +91 77081 50152 / +91 97518 00789 / +91 72999 51536

co-extracting opinion targets and opinions - 1croreprojects

                        co-extracting opinion targets and opinions

INTRODUCTION :

The proliferation of Web applications, users are expressing their opinion and experiences on blogs, discussion boards, reviews, social networking websites etc. this trend has increased the demand of analyzing this online content resulting into increase in the sentiment analysis research .Sentiment analysis is important for companies and users to know what people think about specific topic. Companies can improve their products, based on users opinion. Users can take purchasing decision based on reviews about the product .Sentiment analysis is to recognize whether a given text express positive or negative polarity.

               Phrases are intuitively very effective in incorporating contextual and syntactic information. This paper explores the methods for extracting phrases that are important for sentiment classification.In this paper, initially phrases are extracted using POS based rules and dependency relations. POS based rules are able to extract sentiment-rich phrases which incorporates contextual information and dependency relation based phrases are capable of incorporating syntactic information of document. After extraction of sentiment-rich phrases, semantic orientation of all these phrases is computed using PMI method. Finally, overall semantic orientation of the document is determined by aggregating the semantic orientation of all the phrases.

                   Document-level sentiment analysis mainly makes simplestatistics for orientation values to obtain the whole tendency of texts. It shows high-speed operation and simple to achieve. However, it is just applied to document sentiment classification, such as polarity analysis for news reports or political reviews, since analysis results are too coarse and lack of extraction of sentiment analysis for related attribute.Sentence-level sentiment analysis mainly classifying sentences/clauses as subjective or objective, and classifying subjective sentences/clauses as positive or negative. Many researchers aim to solve the general problem in sentence-level polarity analysis. However they ignore to analyze the items of sentence so that sentence-level analysis has not good performance when the structure of sentence is more complex.

Abstract :

         Sentiment Analysis determines the polarity of text whether it belongs to positive or negative polarity. One motivation for sentiment analysis research is the need for user and e-commercecompanies to know the public opinion from blogs, online forums, reviews about certain products, services, topics etc. Phrases are important in extracting contextual information which is important for sentiment classification. Phrases can convey sentiment information more efficiently than individual words. In this paper, sentiment-rich phrases are extracted using Part-of-speech (POS) based rules and dependency relation in the document that are capable of extracting contextual and syntactic information from the document. Next, semantic orientations of these phrases are calculated using Point-wise Mutual Information (PMI) based method. Finally, review document is classified after aggregating the semantic orientation of all the phrases into positive or negative polar document.

EXISTING SYSTEM:

·         In previous methods, mining the opinion relations between opinion targets and opinion words was the key to collective extraction. To this end, the most adopted techniques have been nearest-neighbor rules and syntactic patterns.

·         Nearest neighbor rules regard the nearest adjective/verb to a noun/noun phrase in a limited window as its modifier.

·         Syntactic information, in which the opinion relations among words are decided according to their dependency relations in the parsing tree.

DISADVANTAGES OF EXISTING SYSTEM:

• Nearest neighbor rules strategy cannot obtain precise results because there exist long-span modified relations and diverse opinion expressions.
• Syntactic patterns are prone to errors. Online reviews usually have informal writing styles, including grammatical errors, typographical errors, and punctuation errors. This makes the existing parsing tools, which are usually trained on formal texts such as news reports, prone to generating errors.
• The collective extraction adopted by most previous methods was usually based on a bootstrapping framework, which has the problem of error propagation

PROPOSED SYSTEM:

·         To precisely mine the opinion relations among words, we propose a method based on a monolingual word alignment model (WAM). An opinion target can find its corresponding modifier through word alignment.

·         We further notice that standard word alignment models are often trained in a completely unsupervised manner, which results in alignment quality that may be unsatisfactory. We certainly can improve alignment quality by using supervision. However, it is both time consuming and impractical to manually label full alignments in sentences. Thus, we further employ a partially-supervised word alignment model (PSWAM).

·         We believe that we can easily obtain a portion of the links of the full alignment in a sentence. These can be used to constrain the alignment model and obtain better alignment results. To obtain partial alignments, we resort to syntactic parsing.

·         To alleviate the problem of error propagation, we resort to graph co-ranking. Extracting opinion targets/ words is regarded as a co-ranking process. Specifically, a graph, named as Opinion Relation Graph, is constructed to model all opinion target/word candidates and the opinion relations among them.

ADVANTAGES OF PROPOSED SYSTEM:

• ·Compared to previous nearest-neighbor rules, the WAM does not constrain identifying modified relations to a limited window; therefore, it can capture more complex relations, such as long-span modified relations.
• ·Compared to syntactic patterns, the WAM is more robust because it does not need to parse informal texts. In addition, the WAM can integrate several intuitive factors, such as word co-occurrence frequencies and word positions, into a unified model for indicating the opinion relations among words. Thus, we expect to obtain more precise results on opinion relation identification.
• ·  The alignment model used has proved to be effective for opinion target extraction.

 Conclusion :

This paper proposes a novel method for co-extracting opinion targets and opinion words by using a word alignment

model. Our main contribution is focused on detecting opinion relations between opinion targets and opinion words.

Compared to previous methods based on nearest neighbour rules and syntactic patterns, in using a word alignment

model, our method captures opinion relations more precisely and therefore is more effective for opinion target and

opinion word extraction. Next, we construct an Opinion Relation Graph to model all candidates and the detectedopinion relations among them, along with a graph co-rankingalgorithm to estimate the confidence of each candidate.

The items with higher ranks are extracted out. Theexperimental results for three datasets with different languages

and different sizes prove the effectiveness of the

proposed method.

In future work, we plan to consider additional types of relations between words, such as topical relations, in Opinion

Relation Graph. We believe that this may be beneficial for co-extracting opinion targets and opinion words

References :

[1] M. Hu and B. Liu, “Mining and summarizing customer reviews,”in Proc. 10th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, Seattle, WA, USA, 2004, pp. 168–177.

[2] F. Li, S. J. Pan, O. Jin, Q. Yang, and X. Zhu, “Cross-domain coextractionof sentiment and topic lexicons,” in Proc. 50th Annu.

Meeting Assoc. Comput. Linguistics, Jeju, Korea, 2012, pp. 410–419.

[3] L. Zhang, B. Liu, S. H. Lim, and E. O’Brien-Strain, “Extracting and ranking product features in opinion documents,” in Proc. 23th Int.

Conf. Comput. Linguistics, Beijing, China, 2010, pp. 1462–1470.

[4] K. Liu, L. Xu, and J. Zhao, “Opinion target extraction using wordbasedtranslation model,” in Proc. Joint Conf. Empirical Methods

Natural Lang. Process.Comput. Natural Lang. Learn., Jeju, Korea, Jul. 2012, pp. 1346–1356.

[5] M. Hu and B. Liu, “Mining opinion features in customer reviews,”in Proc. 19th Nat. Conf. Artif.Intell., San Jose, CA, USA, 2004,

pp. 755–760.

[6] A.-M. Popescu and O. Etzioni, “Extracting product features and opinions from reviews,” in Proc. Conf. Human Lang. Technol. EmpiricalMethods Natural Lang. Process., Vancouver, BC, Canada, 2005, pp. 339–346.

[7] G. Qiu, L. Bing, J. Bu, and C. Chen, “Opinion word expansion and target extraction through double propagation,” Comput. Linguistics,

vol. 37, no. 1, pp. 9–27, 2011.

[8] B. Wang and H. Wang, “Bootstrapping both product features and opinion words from chinese customer reviews with crossinducing,”

inProc. 3rd Int. Joint Conf. Natural Lang. Process., Hyderabad, India, 2008, pp. 289–295.

[9] B. Liu, Web Data Mining: Exploring Hyperlinks, Contents, and Usage

Data, series Data-Centric Systems and Applications. New York,

NY, USA: Springer, 2007.

[10] G. Qiu, B. Liu, J. Bu, and C. Che, “Expanding domain sentiment lexicon through double propagation,” in Proc. 21st Int. Jont Conf.

Secure Auditing and Deduplicating Data in Cloud - 1croreprojects

SecureAuditing and Deduplicating Data in Cloud

ABSTRACT:

As the cloud computing technology develops during the last decade, outsourcing data to cloud service for storage becomes an attractive trend, which benefits in sparing efforts on heavy data maintenance and management. Nevertheless, since the outsourced cloud storage is not fully trustworthy, it raises security concerns on how to realize data deduplication in cloud while achieving integrity auditing. In this work, we study the problem of integrity auditing and secure deduplication on cloud data. Specifically, aiming at achieving both data integrity and deduplication in cloud, we propose two secure systems, namely SecCloud and SecCloud+. SecCloud introduces an auditing entity with a maintenance of a MapReduce cloud, which helps clients generate data tags before uploading as well as audit the integrity of data having been stored in cloud. Compared with previous work, the computation by user in SecCloud is greatly reduced during the file uploading and auditing phases. SecCloud+ is designed motivated by the fact that customers always want to encrypt their data before uploading, and enables integrity auditing and secure deduplication on encrypted data.

EXISTING SYSTEM:

• Ateniese et al. proposed a dynamic PDP schema but without insertion operation.
• Erway et al. improved Ateniese et al.’s work and supported insertion by introducing authenticated flip table.
• Wang et al.proposed proxy PDP in public clouds.
• Zhu et al. proposed the cooperative PDP in multi-cloud storage.
• Wang et al. improved the POR model by manipulating the classic Merkle hash tree construction for block tag authentication.
• Xu and Chang proposed to improve the POR schema with polynomial commitment for reducing communication cost.
• Stefanov et al. proposed a POR protocol over authenticated file system subject to frequent changes.
• Azraoui et al. combined the privacy-preserving word search algorithm with the insertion in data segments of randomly generated short bit sequences, and developed a new POR protocol.
• Li et al. considered a new cloud storage architecture with two independent cloud servers for integrity auditing to reduce the computation load at client side.

DISADVANTAGES OF EXISTING SYSTEM:

• The first problem is integrity auditing. The cloud server is able to relieve clients from the heavy burden of storage management and maintenance. The most difference of cloud storage from traditional in-house storage is that the data is transferred via Internet and stored in an uncertain domain, not under control of the clients at all, which inevitably raises clients great concerns on the integrity of their data.
• The second problem is secure deduplication. The rapid adoption of cloud services is accompanied by increasing volumes of data stored at remote cloud servers. Among these remote stored files, most of them are duplicated: according to a recent survey by EMC, 75% of recent digital data is duplicated copies.
• Unfortunately, this action of deduplication would lead to a number of threats potentially affecting the storage system, for example, a server telling a client that it (i.e., the client) does not need to send the file reveals that some other client has the exact same file, which could be sensitive sometimes. These attacks originate from the reason that the proof that the client owns a given file (or block of data) is solely based on a static, short value (in most cases the hash of the file).

PROPOSED SYSTEM:

• In this paper, aiming at achieving data integrity and deduplication in cloud, we propose two secure systems namely SecCloud and SecCloud+.
• SecCloud introduces an auditing entity with maintenance of a MapReduce cloud, which helps clients generate data tags before uploading as well as audit the integrity of data having been stored in cloud.
• Besides supporting integrity auditing and secure deduplication, SecCloud+ enables the guarantee of file confidentiality.
• We propose a method of directly auditing integrity on encrypted data.

ADVANTAGES OF PROPOSED SYSTEM:

• This design fixes the issue of previous work that the computational load at user or auditor is too huge for tag generation. For completeness of fine-grained, the functionality of auditing designed in SecCoud is supported on both block level and sector level. In addition, SecCoud also enables secure deduplication.
• The challenge of deduplication on encrypted is the prevention of dictionary attack.
• Our proposed SecCloud system has achieved both integrity auditing and file deduplication.

SYSTEM ARCHITECTURE:

SYSTEM REQUIREMENTS:

HARDWARE REQUIREMENTS:

• System : Pentium IV 2.4 GHz.

• Hard Disk : 40 GB.

• Floppy Drive : 1.44 Mb.

• Monitor : 15 VGA Colour.

• Mouse : Logitech.

• Ram : 512 Mb.

SOFTWARE REQUIREMENTS:

• Operating system : Windows XP/7.
• Coding Language : JAVA/J2EE
• IDE : Netbeans 7.4
• Database : MYSQL

REFERENCE:

Jingwei Li, Jin Li, Dongqing Xie and Zhang Cai, “Secure Auditing and Deduplicating Data in Cloud”, IEEE Transactions on Computers 2015.