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.
Confidential data should be encrypted in out-souring services in cloud computing environment in order to minimise the risk of data revealing. There have been many schemes, classified as searchable encryption, which provides capabilities to securely search over encrypted data through keywords without decryption key. In
preserve the functionality, we observe that a protocol of integration with searchable encryption and keyword search via distributed hash table allows the nodes in a network to search over encrypted and distributed data. However, this protocol does not address a practical threat in a fully distributed scenario. Malicious nodes
this paper, we propose an encrypted decentralized storage architecture that can support trustworthy and private keyword search functions. We start from searchable encryption to achieve search on encrypted data. Yet, only adopting this primitive is not sufficient to address particular threats in our target decentralized
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
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
searchable encryption points, it was done using Plaintext keyword search or Single keyword search or Boolean keyword search. When large amount of data users and documents in the cloud taken into concern, it is necessary to allow multiple keywords in the search request and return documents in the order of their relevance to
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
given to demonstrate scheme has effectiveness. Lastly, we respectively construct a (t, p)–threshold multi-server PIR and secure keyword search protocol, and a (t, p)–threshold incremental secret sharing protocol, both based on the proposed (t, p)–PFSS scheme, and simple analysis the correctness and the
its 1-bits. A pattern (e.g., Bloom filter) summarizes the properties (e.g., keywords, service description) associated with a shared object (e.g., document, service). Plexus has a partially decentralized architecture involving super-peers. It adopts a novel structured routing mechanism derived from the theory of error
In structured peer-to-peer (P2P) overlay networks, similar documents are randomly distributed over peers with their data identifiers consistently hashed, which makes complex search challenging. Current state-of-the-art complex query approaches in structured P2P systems are mainly based on inverted list intersection. When the identifiers are distributed among peers, a complex query may involve many...
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.