
Research Article
Revocable and Verifiable Key Aggregate Searchable Encryption for Flexible Data Sharing
@INPROCEEDINGS{10.1007/978-3-032-23453-7_25, author={Jiahao Huang and Shiwen Zhang and Xinlian Zhou and Zhixue Li and Feixiang Ren}, title={Revocable and Verifiable Key Aggregate Searchable Encryption for Flexible Data Sharing}, proceedings={Security and Privacy in Communication Networks. 21st EAI International Conference, SecureComm 2025, Xiangtan, China, July 4--6, 2025, Proceedings, Part III}, proceedings_a={SECURECOMM}, year={2026}, month={11}, keywords={Cloud computing Key-aggregate cryptosystem Revocation Verification}, doi={10.1007/978-3-032-23453-7_25} }- Jiahao Huang
Shiwen Zhang
Xinlian Zhou
Zhixue Li
Feixiang Ren
Year: 2026
Revocable and Verifiable Key Aggregate Searchable Encryption for Flexible Data Sharing
SECURECOMM
Springer
DOI: 10.1007/978-3-032-23453-7_25
Abstract
With an increasing number of users storing vast amounts of data in cloud servers, effectively protecting and utilizing these private data has become a primary challenge today. In this context, Key Aggregation Searchable Encryption (KASE) achieves efficient sharing of various file types using a single key, thereby protecting data privacy while reducing user storage overhead and communication costs. However, existing schemes still face certain challenges. On the one hand, it is challenging to revoke search privileges for specific users when changes are required. On the other hand, semi-trusted cloud servers may return tampered search results, which seriously affects the user’s search experience. To address these issues, we propose a revocable and verifiable key aggregation searchable encryption scheme for flexible data sharing. The scheme utilizes the Shamir secret sharing technique and proposes a dynamic key sharing algorithm to achieve efficient privilege revocation through user key updates. In addition, we combine cryptographic accumulator and blockchain technology to propose a search result verification algorithm. The algorithm efficiently verifies the returned search results. Finally, we performed a comprehensive security analysis and performance evaluation of the proposed solution. The results demonstrate that our solution excels in both security and efficiency.

