Efficient Dynamic Searchable Encryption Scheme Based on Bitslicing
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.
NETL
NSTL
万方数据
