关键词: 可搜索代理重加密, 多层计数布隆过滤器, 动态更新, 可验证, 区块链

Abstract: Traditional searchable proxy reencryption schemes typically assume that cloud servers are honestbutcurious, an assumption that is not applicable in realworld scenarios. Therefore, this paper designs a Dynamic Verifiable Searchable Proxy Reencryption Scheme. The scheme employs a threelayer counting Bloom filter to reduce users’ query costs and support deletion operations. Additionally, blockchain technology is introduced to verify search results, and an innovative verification tag leveraging the XOR property is proposed to further enhance the flexibility of the verification process. Furthermore, by exploiting the tamperproof characteristics of blockchain, the scheme ensures the fairness and credibility of the verification process. Experimental comparisons and security analysis confirm the feasibility and security of the proposed scheme.

Key words: searchable proxy reencryption, multilayer counting Bloom filter, dynamic updating, verifiable, blockchain