Multi-user Trapdoor Indistinguishable Searchable Encryption Scheme Based on Composite Order Bilinear Group
Searchable encryption is the main technology of ciphertext retrieval in cloud storage environment.In the SCF-PEKS scheme architecture,encrypting keyword depends on the user's public key,which limited the service.As well,search-able encryption without secure channel is vulnerable to keyword guessing attacks from external adversaries.In view of the above problems,the existing multi-user searchable encryption schemes are analyzed,which proves that they have keyword trap and are vulnerable to attack.Based on combined order bilinear pairs,an multi-user searchable encryption scheme is proposed.It is proved that it meets the security requirements of indistinguishability of keyword trapdoors as well as resists keyword guessing attacks from external adversaries based on the determinant subgroup hypothesis and DBDH hypothesis.The comparative analysis shows that the proposed scheme has good trap size and ciphertext size,the computational complexity is close to the original scheme,and the securi-ty is higher.
searchable encryptiontrapdoorbilinear pairs of composite ordermulti-usersecure channel free
国家科技期刊平台
NSTL
万方数据
