Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
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
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
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
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
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...
Public key encryption scheme with keyword searchable (PEKS) enables one to search for encrypted keywords without compromising the confidentiality of the original data. A practical PEKS scheme should have the following properties: quickly and efficiently searchable method, ciphertext integrity, a small amount of
, which will allow them to utilize cloud services without the risks of leaking private data to outsiders and even service providers. In this paper, we propose an exclusive-or (XOR) homomorphism encryption scheme to support secure keyword searching on encrypted data. First, this scheme specifies a new data protection method
(CP-ABE) is a promising technique to solve this issue, but it also faces several challenges, such as the inefficiency of decrypt able files search, attributes verification and decryption. In this paper, we propose a multiuser searchable encryption scheme with efficient access control for cloud storage, where the keyword
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
Searchable symmetric encryption (SSE) enables us to search encrypted data with an arbitrarily chosen keyword without leaking information on the data and keyword. SSE is expected to be used in, for example, cloud computing and genome analyses. In particular, privacy of genome data must be guaranteed for long periods
orchestrates the user data into sets of keywords which are again encrypted. We further provide an unique measurement technique to identify unfaithful execution of user requested services by the cloud service provider. Our experiments demonstrate the practical applicability of such a sophisticated system. Though we logically
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.