Constant Boolean search with arbitrary expressions in the Internet of Vehicles environment

Abstract

Searchable encryption is the best choice for secure retrieval solutions in Internet of Vehicles scenarios. However, the search time is positively correlated with the number of keywords among most of public-key searchable encryption schemes. Also, the traditional keyword search strategy cannot meet the specific search needs of users, that is, the needs of supporting any Boolean expression search strategy. In order to reduce the search time and improve the search flexibility, this paper proposes a Boolean search scheme that supports constant search overhead for Internet of Vehicles users. Boolean search expressions in the proposed scheme can support search strategy for arbitrary Boolean expressions. It uses vectorized search expressions and keyword values in the form of predicate vectors, and the cloud server only needs to pair once to complete the Boolean search operation. This scheme can effectively resist the chosen keyword attack, and experimental simulation shows that the proposed scheme can efficiently realize ciphertext retrieval in the Internet of Vehicles environment.