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.
properly encrypt data in a way that the encrypted and remotely stored data can still be queried has become a challenging issue. Though keyword searches over encrypted textual data have been extensively studied, approaches for encrypting graph-structured data with support for answering graph queries are still lacking in the
The public key encryption scheme with conjunctive keyword search (PECKS) is one of the most important techniques used for sensitive users' data outsourced to the third party, especially the cloud storage. However, most existing PECKS schemes need to construct a secure channel, which is usually costly. To solve this
There are a number of searchable encryption schemes that allow secure conjunctive keyword searches over encrypted data, but all of them assume that the position of the keywords is known. This is a pity, since in unstructured text, e.g. the body of an e-mail, this position is unknown and one has to construct O
To realize ubiquitous computing, data should be able to be accessed from anywhere at anytime. However, for security purpose, we need to encrypt the data so that the attackers cannot obtain any information from the server. Nevertheless, the user should be able to use keywords to search and retrieve required data. To
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
directly. Regular encryption algorithms such as AES, RC4 and DES mechanisms have searching limitation, in which the whole ciphertext needs to be retrieved and then decrypt before search procedure can be performed. Recently a lot of research has been done to enable search capabilities for users. Generally, keyword based search
Anonymous identity-based encryption systems can be used to protect users' privacy and construct Public key Encryption with Keyword Search (PEKS) schemes where the ciphertext does not leak the identity of the recipient. Currently, there is no anonymous IBE scheme that is fully secure under simple assumptions without
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
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
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.