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.
the commercial cloud environment, makes effective data utilization. In this paper, define and solve the problem of ranked keyword search over encrypted cloud data. Enhance system usability through enabling search result relevance, instead of sending undifferentiated results and further ensures file retrieval accuracy by
keyword search, and search over structured data. Although these functionalities are already prevalent in information retrieval in the plaintext domain, realizing them in the encrypted domain requires non-trivial effort and is relatively new. In light of this, we first describe several existing technical approaches proposed
information about the underlying keyword. Meanwhile, the client cannot derive more than one token from one trapdoor generated by the data owner according to the latter security notion. Furthermore, we present a concrete hiddentoken searchable public-key encryption scheme together with the security proofs in the random oracle
, a new data structure is designed to fit our purpose. The new scheme provides the confidentiality of keyword to be searched, and achieves the access controllability of the files, and is a multi user searchable scheme, it has the property of unforgeability of the search trapdoor, and is of dynamic addition and revocation
In this paper, we describe a new primitive for error-tolerant searchable encryption and a security model for it. This generic scheme permits to make searches on encrypted data with only an approximation of some keyword. It enables to efficiently query secure databases in order to get the exact data with a close
One of the major limitations of index based encrypted string search on big dataset is the inherent problem of big index generation, maintenance and update which stops it from being dynamic in a sense that one could not modify data or add or remove keywords. Also for a resource constraint client, to generate an index
Current Symmetric Searchable Encryption schemes do not fulfill the expectations of users that are used to web search engines. Although users are now able to search for multiple keywords, Boolean retrieval returns all results to a client regardless of how relevant the results are for the user. For searches in large
Searchable encryption is a new developing information security technique and it enables users to search over encrypted data through keywords without having to decrypt it at first. In the last decade, many researchers are engaging in the field of searchable encryption and have proposed a series of efficient search
keywords trapdoors in either cases that the agent is online or offline. Performance analysis is also provided to show this scheme is suitable to be used in mobile environments.
functions, is efficient and does not leak the search pattern. For instance, a secure search in an index over one million documents and 500 keywords is executed in less than 1 second.
Searchable encryption (SE) technique enables the users to search for the encrypted documents by keywords. As an implicit assumption, the documents are always treated as unstructured texts. However, in the real world, there are many structured documents such as metadata, XML etc. To further utilize the internal
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.