Abstract: The public key searchable encryption algorithm suffers from the problem of low computational efficiency due to the increase of plaintext length. To solve the above problems, an identity-based searchable encryption scheme without pairings is proposed in combination with key encapsulation techniques. The scheme used symmetric key to encrypt plaintext data, and used public key encryption technique to encapsulate the symmetric key and send it to the search server. The search server verified the search trapdoor information submitted by the user, and if the verification was valid, sent the key encapsulation value to the corresponding data user and sent the keyword index to the storage server. After receiving the ciphertext from the storage server, the data user decrypted the encapsulated value to obtain the symmetric key and then decrypted the ciphertext. The proposed scheme was proved to satisfy the IND-ID-CCA security under the random prediction model based on the trapdoor deterministic Diffie-Hellman difficulty problem. After the experimental comparison, the proposed scheme has some advantages in time overhead.