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.
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
Keyword search is an effective paradigm for information discovery and has been introduced recently to query XML documents. In this paper, we address the problem of returning clustered results for keyword search on XML documents. We first propose a novel semantics for answers to an XML keyword query. The core of the
present a new approach to constructing efficient oblivious keyword search (OKS) protocol, which permits fast search (i.e., sub-linear time) and relatively short ciphertext, while providing provably strong privacy for both users and cloud storage service providers. Previous OKS protocols have ciphertext size linear in the
In this paper different searchable encryption techniques are studied along with some implementation of searchable encryption in a cloud environment. Symmetric searchable encryption is implemented through trapdoor function to selectively expose keyword for search. A new method of achieving searchable encryption in the
this paper we are provide the new architecture that help to find the blood donor information using Voice with some keyword and find the donor information when they required the blood. The objective of this paper to deal with the Vague Voice based donor information filter and make a particular blood group cluster with
scheme, which allows users to perform an encrypted keyword search on encrypted data stored in database server directly without decrypting it. In many applications, it requires to access the database by multiple users where data is written by different users using different encryption keys. In this paper, we propose schemes
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
connections, but also the nature of their relationship using representative keywords for nodes and edges. In this paper, we apply the technique to an interactive web-based visual analytics environment - Apropos - where a user can explore a text corpus using WordBridge. We validate the technique using several case studies based
applications in cloud deployment. First, the method obtains the SQL keywords through the analysis of lexical regulation for SQL statement. Then, it analyses the syntax regulation of SQL statement to create the rule tree. Finally, it traverses ternary tree on the basis of the model which established by SQL syntax regulation to
Aiming to discover the most suitable service cater to the discovery request of service consumer which includes functional requirements and nonfunctional requirements, this paper proposes a service registry model named as SRC (Service Registry on Cloud) which is an extension of the keywords based service registry model
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.