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.
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
simple combinations of keywords, for example, disjunction of keywords. The recent breakthrough in fully homomorphic encryption has allowed us to construct arbitrary searching criteria theoretically. In this paper, we consider a new private query, which searches for documents from streaming data on the basis of keyword
In this paper we introduce Password Authenticated Keyword Search (PAKS), a cryptographic scheme where any user can use a single human-memorizable password to outsource encrypted data with associated keywords to a group of servers and later retrieve this data through the encrypted keyword search procedure. PAKS ensures
Outsource encrypted data has attracted attentions from industry and academics for storing sensitive data in third party clouds. Many cloud applications need privacy preserving multiple keywords search services over encrypted data with dual capabilities. On one hand, they need to keep the query keywords and associated
Prior Searchable Symmetric Encryption (SSE) works focus on single keyword search. Conjunctive Keyword Searches (CKS) schemes enhance system usability by retrieving the matching files. Most of existing conjunctive keyword works that use conjunctive keyword searches with fixed position keyword fields are not useful for
problem, the data won't be leaked to the others. However, no operation can be performed if data are encrypted. To overcome such problem, a cryptographic protocol called SSE-1 was proposed where SSE-1 allows user to search with keyword over encrypted data. However, it is difficult to put SSE-1 to practical use since SSE-1
database to the cloud server. In this context, privacy is a primary challenge and it is necessary to fulfill main privacy requirements of database owners and clients. This paper presents protocols for executing keyword search and aggregate SQL queries that preserve the privacy of both the client and the database owner. Client
This paper proposes a new double-private protocol for fuzzy matching and $\epsilon$-fuzzy matching. Many works have been done for private database search in which the keyword that a user inputs for the search is concealed to the database owner. In these database searches, the exactly matched data are returned
In encrypted search, a server holds an encrypted database of documents but not the keys under which the documents are encrypted. The server answer keyword queries from a client with the list of documents matching the query.
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
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.