基于合数阶双线性群的多用户陷门不可区分可搜索加密方案
Multi-user Trapdoor Indistinguishable Searchable Encryption Scheme Based on Composite Order Bilinear Group
梁哲华 1佟国香1
作者信息
- 1. 上海理工大学光电信息与计算机工程学院 上海 200093
- 折叠
摘要
可搜索加密是云存储环境下密文检索的主要技术.针对以去除安全信道构造的公共密钥可搜索加密方案SCF-PEKS加密时依赖用户公钥导致搜索服务限于单一用户,及无安全信道的可搜索加密方式容易遭受外部敌手的关键字猜测攻击等问题,分析并证明了现有多用户可搜索加密方案存在关键字陷门易遭受攻击的安全缺陷,在使用合数阶双线性对基础上提出一种多用户可搜索加密方案,并基于判定性子群假设和DBDH假设证明论文算法满足关键字陷门不可区分性的安全要求,可以抵御外部敌手选择关键字攻击.对比文献分析显示,在没有明显增加计算复杂度的前提下,提出的加密方案陷门尺寸及密文尺寸良好、安全性更高.
Abstract
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.
关键词
可搜索加密/陷门/合数阶双线性对/多用户/无安全信道Key words
searchable encryption/trapdoor/bilinear pairs of composite order/multi-user/secure channel free引用本文复制引用
出版年
2024
国家科技期刊平台
NSTL
万方数据