The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
documents related to a special keyword. Searchable encryption is a tool for data owners to encrypt their data in a searchable manner. Generally, there exist two kinds of searchable encryption, namely symmetric (secret key) and asymmetric (public key) ones. Most of the public key searchable encryption schemes are vulnerable to
Public key encryption with keyword search enables users to retrieve keywords from encrypted data, which can protect data confidentiality without losing the search operability. However, it is also vulnerable to keyword guessing attacks. In this paper, we propose a conjunctive keywords searchable encryption with
Since it is necessary to store data on different storage devices so to have privacy and security. It is desirable to encrypt the data before storing them. Since data is stored in a third party storage device in encrypted form it is very difficult to search data in its encrypted form. Thus making the retrieval process is difficult in large scale databases. In this paper we study and compare different...
Cloud computing has garnered much interest in recent years for its many advantages, but also for its security, privacy concerns. The storage, access of confidential documents has been identified as one of the central problems in the area. Many researchers investigated solutions to search over encrypted documents stored on remote cloud servers. Others proposed schemes for ensuring data integrity or...
Confidential data should be encrypted in out-souring services in cloud computing environment in order to minimise the risk of data revealing. There have been many schemes, classified as searchable encryption, which provides capabilities to securely search over encrypted data through keywords without decryption key. In
large number of comparisons and time to search the desired documents. In this paper, we propose a cluster based privacy preserving multi-keyword search scheme over encrypted cloud data. The proposed search scheme retains the security requirements as proposed in the existing approaches in literature but provides results
In keyword search over relational databases (KSORD), retrieval of user's initial query is often unsatisfying. User has to reformulate his query and execute the new query, which costs much time and effort. In this paper, a method of automatically reformulating user queries by relevance feedback is introduced, which is
advertised policies. In this paper, we focus in particular on the scenario where a data owner wishes to (i) outsource its public database to a cloud server; (ii) enable anyone to submit multi-keyword search queries to the outsourced database; and (iii) ensure that anyone can verify the correctness of the server's responses. To
warrant can be provided. However, sometimes, the investigators need to keep the investigation subject confidential due to the confidentiality of the crime or the server administrator may be one of the suspects. In this paper, we address how to solve this problem by multiple keyword search over encrypted data, so that the
it possible for users to securely conduct keyword search over encrypted data and finally retrieve the most relevant Top-N files among the whole data. In this paper, we systematically propose a scheme to solve the problem of how to securely and efficiently retrieve the Top-N files by keyword-based searching over
multiple users, i.e. multi-user multi-contributor case. Inspired by attribute-based encryption (ABE), we present the first attribute-based keyword search scheme with efficient user revocation (ABKS-UR) that enables scalable fine-grained (i.e. file-level) search authorization. Our scheme allows multiple owners to encrypt and
patterns. However, this implies an expensive computation or communication cost of all the data on the server. Existing solutions are not efficient due to their impractical communication and computation cost. Besides, most of them do not support keyword search. In this paper, we introduce the mechanism of pricing to solve the
access control must be provided. A common operation on the data is keyword search. Currently, search operation over encrypted search is performed at the cloud servers and access control for the in-cloud data is usually enforced by users. Separation of the two types of operations can lead to reduced efficiency and
cloud servers in practice do not just serve one owner, instead, they support multiple owners to share the benefits brought by cloud servers. In this paper, we propose schemes to deal with secure ranked multi-keyword search in a multi-owner model. To enable cloud servers to perform secure search without knowing the actual
As sensitive information is centralized into the cloud, how to effectively search over encrypted data is becoming a research bottleneck of Cloud Storage Security. Based on the original solution of secure ranked keyword search over encrypted cloud data, we exploit the concept of evaluation for relevance of index. We
confidentiality of sensitive data while supporting deduplication, the convergent encryption technique has been proposed to encrypt the data before outsourcing. However, the issue of keyword search over encrypted data in deduplication storage system has to be addressed for efficient data utilization. This paper firstly proposes two
Cloud computing provides abundant benefits including easy access, decreased costs and flexible resource management. For privacy concerns, sensitive data have to be encrypted before outsourcing, which obsoletes traditional data utilization based on plaintext keyword search. Therefore, developing a secure search service
The public key encryption scheme with conjunctive keyword search (PECKS) is one of the most important techniques used for sensitive users' data outsourced to the third party, especially the cloud storage. However, most existing PECKS schemes need to construct a secure channel, which is usually costly. To solve this
As a very attractive cryptographic primitive, the public key encryption with keyword search (PEKS) enables users to search on encrypted data, and hence is applicable to the setting of cloud computing. Although the existing PEKS schems can allow a user to search encrypted data confidentially, most of them failed to
only provide exact keyword search. Fuzzy keyword search improves the system usability because it allows users to make spelling errors or format inconsistencies. Besides, verifiable encryption schemes usually consider a semitrusted server and verify the authenticity of the search results. However, the server may be
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.