Secure conjunctive keyword searches for unstructured text

Florian Kerschbaum
2011 2011 5th International Conference on Network and System Security  
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(m n ) search tokens for n keywords in a text of length m. In this paper we present a searchable encryption scheme that allows conjunctive keyword searches without specifying the position
more » ... quiring only one search token with constant ciphertext length. We prove the security of our scheme using the external Diffie-Hellman assumption in the random oracle model.
doi:10.1109/icnss.2011.6060016 dblp:conf/nss/Kerschbaum11 fatcat:lq7dyg37ibgadmd547ac4npqe4