Performance evaluation and optimizations of hidden vector encryption

As security is an important concern, the usage of encrypted communication is increasing. As a result, techniques that allow complex operations on such data streams are of importance. Searchable encryption allows entities to evaluate predicates on encrypted data without disclosing any other information except the outcome of the operation. We focus on Hidden Vector Encryption, which allows the usage of a wide set of predicate types on cyphertext of small length. This paper presents an evaluation of this technique in order to assess its practicability. We also provide optimizations that reduce the computational requirements for each operation at the cost of extra memory usage.