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.
Medicai and healthcare study programmes cover various curricula consisting of many theoretically focused courses and clinical teaching training. Curriculum attributes usually contains thousands of requirements on the form of knowledge and skills which fully define a complete graduate profile. It is not humanly
Broadcast Searchable Keywords Encryption (BSKE) is a novel scheme that allows searching in encrypted data without knowing a secret key. Consider Bob wants to encrypt the same data under master public key for a group of users and stores this encrypted data with Alice, Malice is one of those recipients he asks Alice
keyword in plaintext, which may leak privacy of users in cloud storage environment. In this paper we propose an efficient privacy preserving keyword search scheme in cloud storage, the scheme satisfies the multi-user requirement with low computational overhead and flexible key management., and it is proved to be secure and
With the growing of wireless communication and mobile applications, more and more users and contents are positioned by geographic locations. The importance of query objects involving both the location and textual proximity of content is highlighted. Existing studies mainly focus on keyword query for static objects or
Documents encrypted on the cloud servers can improve security, it also brings about a challenging question for secure query. We use the vector space model (VSM) to obtain the similarity of the documents. In this paper, we use a secure method to support multi-keyword parallel query, which the improved multi-tree [1
Efficient multi-keyword fuzzy search over encrypted data is a desirable technology for data outsourcing in cloud storage. The current solutions can only support part of these goals. In this paper, we propose a novel encrypted data searching scheme that can support multiples keywords fuzzy search with high efficiency
Cloud user intends to encrypt data before outsourcing sensitive data to the cloud which prevents data searching utility. Hence the necessity for searching through encrypted data appears. But in practice, it is very common for the user to misspell keywords while typing the words. Thus, fuzzy keyword search on encrypted
Searchable encryption is crucial for the encrypted data utilization, especially in the database generated by multiple owners. Many existing schemes support single keyword query, and assume that the search users are authorized and the returned results are correct. However, single keyword query wastes network bandwidth
Keyword-Driven Analytical Processing (KDAP) integrates the simplicity of keyword search with the aggregation power in OLAP (Online-Analytical Processing), which provides an easy-to-use solution to organize the data in a way that a business analyst needs for thinking about the data. For any user query, the system
is very different from the retrieval of plaintext. The traditional plaintext retrieval method is no longer suitable for the retrieval of the cipher text. In the previous fuzzy search strategy, although fuzzy keyword sets that building on keyword dictionary can realize the fuzzy search. But when the keyword set is
Public key encryption with keyword search applies only to the certain circumstances that keyword ciphertext can only be retrieved by a specific user and only supports single-keyword matching. In the existing searchable encryption schemes, either the communication mode is one-to-one, or only single-keyword search is
There exists a specific security issue in symmetric searchable encryption that, when doing CKS(Conjunctive Keywords Search), the trapdoors and search results may reveal the relationships between the keywords being searched. For example, if the search result of keywords set A is the superset of keywords set B's, it
The published papers on the journal of xi'an university of science and technology from 2007 to 2016 were collected from CNKI in this article. A total of 1511 papers were retrieved. These parameters were acquisited, such as title, author, organ, keyword, summary, PubTime, FirstDuty, fund, year, period, PageCount. Three
without decrypting the ciphertext or the searching keywords. In this paper, we propose a construction which can dramatically reduce the size of extra storage in the searchable symmetric encryption schemes and still remain efficiency. And security analysis shows that our construction can achieve non-adaptive secure. Further
OpenEHR is an open standard specification for developing flexible electronic health record (EHR) management system. It defines the standard service models and APIs, and offers a whole lifetime data storage method to the patient's record. As an important OpenEHR system component, EHRServer plays the role of back-end services repository for data storage and query. It complies with the openEHR specifications...
reduced. To reduce the communication overhead the server should send only the top-n files based on the keyword when the user asks for the data files. Since the owner need not maintain the copy of the files, it is all the more necessary to make check on the files available and also check the originality of the files stored in
will be able to identify concepts and relationships from the dataset based on keyword searches in their own workspace and collaborate visually with other analysts using visualization tools such as a concept map view and a timeline view. The system allows analysts to parallelize the work by dividing initial sets of
keyword based search. We model the search privacy threat as an information inference problem and show how to inject noise into user queries to minimize privacy breaches. The search privacy breach is measured as the mutual information between real user queries and the diluted queries seen by search engines. We give the lower
The analysis of the vast storehouse of email content accumulated or produced by individual users has received relatively little attention other than for specific tasks such as relationship. Current email analysis in standard client applications consists of keyword based matching techniques for relationship of email
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.