计算机与数字工程2024，Vol.52Issue(1)：190-194,226,6.DOI:10.3969/j.issn.1672-9722.2024.01.031
基于合数阶双线性群的多用户陷门不可区分可搜索加密方案
Multi-user Trapdoor Indistinguishable Searchable Encryption Scheme Based on Composite Order Bilinear Group
梁哲华 1佟国香1
作者信息
- 1. 上海理工大学光电信息与计算机工程学院 上海 200093
- 折叠
摘要
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分类
信息技术与安全科学引用本文复制引用
梁哲华,佟国香..基于合数阶双线性群的多用户陷门不可区分可搜索加密方案[J].计算机与数字工程,2024,52(1):190-194,226,6.
