Cooperative private searching in clouds

2011

Abstract It is a common requirement in real world applications for untrusting parties to be able to share sensitive information securely. We describe a secure anonymous database search scheme (SADS) that provides exact match capability. Using a new primitive, re-routable encryption, and the ideas of Bloom Filters and deterministic encryption, SADS allows multiple parties to efficiently execute exact match queries over distributed encrypted database in a controlled manner.

Cloud computing has emerged as a major driver in reducing the information technology costs incurred by organizations. In a costsensitive environment, an organization is willing tolerate a certain threshold of delay while retrieving information from the cloud. In this paper, we focus on the fundamental issues of cost efficiency and privacy. We review three keyword-based secure search protocols, namely Ostrovsky protocol, COPS protocol and EIRQ protocol. Each protocol offers an improvement over the basic keyword search used by today's cloud users. In Ostrovsky, encryption offers privacy. In COPS, aggregation results in a limited amount of cost efficiency. In EIRQ, users can retrieve the desired percentage of files by assigning ranks to queries. This feature is useful if the user is only interested in a subset of all the matched files. We present a comparison of the performance of these protocols and conclude by listing the future work that could be carried out in this area.

Proceedings of the 35th Annual ACM Symposium on Applied Computing, 2020

With the emergence of connected objects and the development of Artiicial Intelligence (AI) mechanisms and algorithms, personalized applications are gaining an expanding interest, providing services tailored to each single user needs and expectations. They mainly rely on the massive collection of personal data generated by a large number of applications hosted from diferent connected devices. In this paper, we present CoWSA, a privacy preserving Cooperative computation framework for personalized Web Search peripheral Applications. The proposed framework is multi-fold. First, it provides the empowerment to end-users to control the disclosed personal data to third parties, while leveraging the trade-of between privacy and utility. Second, as a decentralized solution, CoWSA mitigates single points of failures, while ensuring the security of queries, the anonymity of submitting users, and the incentive of contributing nodes. Third, CoWSA is scalable as it provides acceptable computation and communication costs compared to most closely related schemes. CCS CONCEPTS • Security and privacy → Security services; Privacy-preserving protocols; • Computer systems organization → Peer-to-peer architectures;

Cloud computing has developed from various technologies such as autonomic computing, virtualization, grid computing, and other technologies, and the secure storage is essential and important for it due to it provides virtualized resources on Internet. Therefore, Data owner must encrypt his documents locally before uploading it in the public cloud storage to prevent unauthorized access to his data. Sometimes, the data owner wants to share some of his encrypted documents that stored in the cloud with other authorized users, so, he must send the secret key for each document for all authorized users, but this way has many limitations due to the difficulty of key management and key distribution. To overcome drawback of this approach we proposed system to generate a single key used for multiple number of documents and users depending on two techniques asymmetric cryptography and symmetric cryptography. Asymmetric cryptography used the IBC of the data owner to generate his private key and split the private key into two parts give one part to all authorized users and the other part send to Semi-Trusted Third Party (STTP). While symmetric cryptography used by combined secret key with the encrypted file properties and decrypted the result by the public key of the data owner by using asymmetric cryptography (RSA algorithm). Finally, many results were obtain from implementing the proposed system, among these results; the data owner could add or revoke any user without change the master secret key, also the data owner not need to share multi keys with authorized users. As well as, the system overcame the problem on difficulty of searching over encrypted data through encryption key in a public cloud.

Parallel and Distributed Computing and Systems, 2011

Research in peer-to-peer file sharing systems has focused on tackling the design constraints encountered in distributed systems, while little attention has been devoted to the user experience: these systems always assume the user knows the public key of the file they are searching. Yet average users rarely even apprehend that file public keys exist. File sharing systems which do consider the user experience and allow users to search for files by their name, generally present centralized control and they show several severe vulnerabilities, that make the system unreliable and insecure. The purpose of this investigation is to design a more complete distributed file sharing system that is not only trustable, scalable and secure, but also leverages the user's cognitive workload. We present a novel algorithm that by mining a file's information designates relevant keywords for the file automatically. These keywords are later utilized for the file search and retrieval. We also designed a metric for assigning relevancy to the files retrieved in a search, bettering the search results. We also create a modern mechanism for enabling file searches based on categories. Search on the Cloud is built on Pastry. Our system integrates these components, as well as good design principals from previous distributed file sharing systems to offer a trustable, scalable, secure and novel distributed file sharing system that an average user could utilize for file search. Our system is named -Search on the Cloud‖. The novelty of our approach is that our system provides an intuitive search modality, while still preserving an entirely distributed approach.

The advent of cloud computing has dramatically changed the IT scene, as it offers cost savings and improvements to major operations. Nevertheless, the major obstacle relies on the effort on how to secure sensitive data files that are outsourced to the cloud environment. To ensure confidentiality, the sensitive data are usually encrypted prior to being outsourced. Nevertheless, effective data utilization remains a challenging task and there is a clear need for a secure and efficient searching mechanism over the encrypted data in the cloud, to increase the us-ability of the secure cloud environment. Unfortunately, existing work in the area of secure searching in the outsourcing scenario usually incur high computational complexity, which makes the approach impractical. In this paper, we take one step ahead by proposing an efficient keyword search scheme for cloud computing. Our solution is very lightweight, and it enables efficient multiuser keyword search over outsourced data files in the cloud environment, without leaking any private information about both the data owner and users in the search query. We formally define the security requirements and prove that our scheme is secure under a simple assumption in the standard model.

Int. J. Auton. Adapt. Commun. Syst., 2017

Search over encrypted data is a hot topic. In this paper, we propose a secure scheme for searching the encrypted servers. Such scheme enables the authorised user to search multiple servers with multi-keyword queries and retrieve the most relevant documents in a descending order with respect to their relevance to the query, without compromising the privacy of his query and the contents of documents he retrieved. In such a setting, each data owner builds his own searchable index, and associates with each document in that index its weight score, which facilitates document ranking. To protect the privacy of these weights, we utilise the privacy preserving mapping (PPM) primitive, while preserving their capability to perform the ranking process. We have conducted several empirical analyses on a real dataset to demonstrate the performance of our proposed scheme.

Lecture Notes in Computer Science, 2012

We present PRISM, a privacy-preserving scheme for word search in cloud computing. In the face of a curious cloud provider, the main challenge is to design a scheme that achieves privacy while preserving the efficiency of cloud computing. Solutions from related research, like encrypted keyword search or Private Information Retrieval (PIR), fall short of meeting real-world cloud requirements and are impractical. PRISM's idea is to transform the problem of word search into a set of parallel instances of PIR on small datasets. Each PIR instance on a small dataset is efficiently solved by a node in the cloud during the "Map" phase of MapReduce. Outcomes of map computations are then aggregated during the "Reduce" phase. Due to the linearity of PRISM, the simple aggregation of map results yields the final output of the word search operation. We have implemented PRISM on Hadoop MapReduce and evaluated its efficiency using real-world DNS logs. PRISM's overhead over non-private search is only 11%. Thus, PRISM offers privacy-preserving search that meets cloud computing efficiency requirements. Moreover, PRISM is compatible with standard MapReduce, not requiring any change to the interface or infrastructure.

2016

Cloud computing a big buzzword now-a-days and IT Industry talks about it a lot and they started to move to Cloud. Cloud is mainly for Storage, Elasticity, Sharing, and Fast Access. Mainly for storage purpose Private Cloud (pCloud) is preferable to store secure information. In this paper we work on storage of information securely and retrieval of data efficiently. Our main objective is how efficiently we reduce time in retrieving of data in storing secure information. We have implemented a proxy re-encryption and data striping technique for storage and retrieving purpose. The results are been taken placed by using.NET technology and output is shown in graph analysis.