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.
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
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
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
authorized ones. In this paper, we propose a novel searchable encryption scheme, named PEKS-PM, based on pseudo inverse matrix, which enables a trusted party to give the service provider's server the ability to test whether a given keyword appears in log records but the server learns nothing about the keyword and the log
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...
mechanism based on format-preserving encryption (FPE), which protects the privacy of the sensitive data and keeps the data structure. The mechanism generates keywords for every possible keyword of the corresponding data, and results in a longer keyword string. It performs fuzzy query at a cost of O(n^2) times of AES and
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
encrypted data when a majority of research is limited to exact-keyword-search only. We propose a novel scheme for proximity-based-search on encrypted databases hosted in untrusted service environments. This scheme involves a trusted proxy which facilitates a trapdoor to execute search queries over encrypted data while
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
to be the best approach in the literature. In this paper, however, we show that their proposal seems unlikely to be implementable with the latest technology, due to a large amount of computation cost involved. Then, we provide an improved method to turn the keyword search more practical, which cannot only avoid the
This paper proposes a new double-private protocol for fuzzy matching and $\epsilon$-fuzzy matching. Many works have been done for private database search in which the keyword that a user inputs for the search is concealed to the database owner. In these database searches, the exactly matched data are returned
In encrypted search, a server holds an encrypted database of documents but not the keys under which the documents are encrypted. The server answer keyword queries from a client with the list of documents matching the query.
This paper analyzes the meaning and significance of key authentic degree of cryptosystem under the threat of the rubber-hose attack and ciphertext only attack. A novel cryptosystem of low key authentic degree is designed. The inner encryption is an extension like multiple-choice questions with keywords similar and
approach implements a text file with searches based on keywords. The second approach uses subfields and homophonic representations to create a secure database with fairly broad capabilities.
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.