An improved scheme of searchable encryption algorithm based on NTRU

Abstract

R. Behnia et al proposed a NTRU-based searchable encryption scheme in 2017. Compared with the previous searchable encryption scheme, this scheme has a great improvement in security and efficiency, and can resist quantum computing. But this scheme will expose a lot of information to the server. If the server is not completely honest, an attacker can use the information to attack a user’s keywords. This paper proposes an improvement of Rouzbeh’s scheme, solves this problem and improves security.