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.
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
Cloud computing has emerged as a major way of reducing the information technology costs incurred by organizations. For a cost-sensitive organization which stores its data in the cloud and retrieves files via keyword search, the primary focus is on the issues of cost effectiveness as well as privacy. Three keyword
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
-efficiency and privacy. Three secure search protocols, namely Ostrovsky protocol, COPS protocol and EIRQ protocol are discussed in this paper. Each of these protocols incrementally improves upon the basic keyword search. Ostrovsky protocol offers privacy. COPS protocol aggregates the search results and achieves cost efficiency
simple combinations of keywords, e.g., 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 (t, n) threshold query, which searches for documents containing more than t out of n keywords. This form
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.