Offline/online attribute-based searchable encryption scheme from ideal lattices

The security of traditional attribute-based searchable encryption schemes relies on traditional number-theoretic assumptions, and thus they are not able to resist the threat of quantum algorithms. Existing lattice-based searchable encryption schemes have two main problems: one is the low efficiency of the execution of encryption, key generation and search algorithms. The second is the large space required for storing search trapdoors.

algorithms computer sciences efficiency encryption key low main offline problems quantum quantum algorithms search searchable security threat