Act, activity; dep, dependent; GO, GO terms; KEGG, kegg pathways, KEY, keywords, reg, regulation.
While viewing results, Voxgov.com suggests new searches and highlights key people, keywords, places and organizations that may be helpful to review.
Byun et al. [10] raised a serious vulnerability of public key-based keyword search schemes, which are susceptible to an off-line keyword guessing attack through much smaller space than passwords.
Two 128-bit AES keys (i.e., keyword encryption key, (K_{1}) and document encryption key, (K_{2})) are generated and stored.
Previous searchable encryption methods such as "public key encryption with keyword search (PEKS)" restricted the data access to certain users, because only the assigned users were able to search the encrypted data.
Public key encryption with keyword search (PEKS) schemes, first proposed in [4], can be useful in this respect.
This can be achieved using a Public key encryption with keyword search (PEKS) scheme, first proposed by Boneh et al., which enables to search publicly encrypted messages for keywords without revealing any information about the message.
The building blocks used for searching follow those described in Definition 3. Furthermore, they apply a different AES key for each keyword when generating the trapdoor, requiring the client to store counters, as explained in the next paragraph.
Chooses a random value (r in mathbb Z ^*_P) and outputs (C=langle A,B rangle =langle (pk_R)^r, H_2(e y, H_1(w||v)^r)) rangle.) Trapdoor((sk_R, w)): Takes as input a receiver's secret key (sk_R,) a keyword (w).
dPEKS pk_R, pk_S, w)): Chooses a random value (r in mathbb Z ^_{P}) and outputs (C=langle A,B rangle =langle (pk_R)^r, H_2(e y, H_1 w)^r)) rangle,) where (w in mathcal KS.) Trapdoor((sk_R, w)): Takes as input a receiver's secret key (sk_R,) a keyword (w).
