基于比特切片的高效动态可搜索加密方案
Efficient Dynamic Searchable Encryption Scheme Based on Bitslicing
周健聪 1朱晓杰 2陈驰1
作者信息
- 1. 中国科学院信息工程研究所,北京 100085;中国科学院大学网络空间安全学院,北京 100049
- 2. 阿卜杜拉国王科技大学,吉达 23955-6900
- 折叠
摘要
可搜索加密作为提升云存储中数据安全性的重要技术,得到学界和产业界的持续关注.动态可搜索加密方案指支持数据集合更新的可搜索加密方案.在大型数据集场景中,由于更新操作会造成大量数据的重加密及索引重构,因此更新效率低下成为制约该技术应用的关键瓶颈.文章提出了一种基于比特切片的高效动态可搜索加密方案(BSSE),该方案采用分块并行加密的思想,利用比特切片技术将每个数据块加密单元由字转置为比特,消除了加密过程中的移位操作,并通过将S盒化简为逻辑电路,提升了大数据集场景下的并行效率.实验结果表明,BSSE方案较现有方案更新速度提升 59 倍,有效地提升了可搜索加密方案的更新效率,具有广泛的应用前景.
Abstract
Searchable encryption,as a crucial technology for enhancing data security in cloud storage,attracts continuous attention both from both academia and industry.Dynamic searchable encryption schemes refer to those schemes that enable updating datasets while maintaining searchability.However,the inefficiency of updates remains a critical bottleneck that prevents the technology from practical application,particularly in large dataset scenarios,due to the expensive data re-encryption and index reconstruction overhead.Therefore,based on bitslicing,the paper proposed an efficient dynamic searchable encryption scheme called BSSE(BitSlicing-based Dynamic Searchable Encryption Scheme).The core idea of BSSE is to grouping entries into equal-sized blocks,converting such blocks from words into bits representation and encrypting them in parallel.By eliminating shift operations during the encryption process and simplifying S-box into boolean logic circuit,BSSE significantly improves update efficiency.The experimental result demonstrates that the BSSE scheme exhibits 59 times faster than existing schemes and show great potential in practical applications for updating large datasets.
关键词
可搜索加密/比特切片/并行Key words
searchable encryption/bitslicing/parallel引用本文复制引用
基金项目
中国科学院战略性先导科技专项(B)类课题(XDB0690303)
出版年
2024
NETL
NSTL
万方数据