Study On Searchable Encryption Schemes

The sharp development of network storage service has been witnessed by the migration of massive data into third-party servers. Consequently, privacy of personal and enterprise data becomes an urgent issue. Most available encryption schemes handle protection of data perfectly, but fail to hide users' access patterns. This kind of information leak may be unacceptable in particular situations. Moreover, in order to facilitate massive data retrieval, the storage service providers must support search operations. Thus, whether to encrypt keywords becomes a paradox, since unencrypted keywords may disclose information while encrypted keywords cannot be sought directly. Therefore, in recent years searchable encryption has been researched extensively.Corresponding to private key cryptography and public key cryptography, searchable encryption schemes are classified as private-key searchable encryption and public-key searchable encryption, which have been proposed and constructed by Song and Boneh etc. Based upon their research, in this thesis we did the following work:Typical searchable encryption schemes were summed up and analyzed. Some faults of these schemes are fixed.Searchable encryption over range was discussed. No currently available searchable encryption support search over range, which could be of utmost importance in many applications. We brought forward an enhanced searchable encryption scheme with such feature in thesis and proved its security.An implementation of the scheme was put forward. In addition, the benchmark of performance was listed and analyzed. Moreover, the results on different platforms and under different implementation policies were compared with each other. In addition, possible optimization was proposed.