高级检索

    基于区块链索引的可验证布尔搜索加密方案

    Verifiable Boolean Searchable Encryption Based on Blockchain Index

    • 摘要: 针对现有可搜索加密方法中搜索表达能力不足以及验证机制不完善的问题,提出了一种基于区块链索引的可验证布尔搜索加密方案(verifiable boolean searchable encryption based on blockchain index,VBSE-BI). 该方案首先构建了支持可验证布尔搜索的安全模型,并在此基础上设计了一种基于区块链存储结构的增量型安全索引构造方法,在实现高效搜索的同时,确保索引结构的不可篡改性. 此外,方案还设计了安全索引的高效动态更新机制,有效避免了因构建辅助更新结构而导致的索引存储和更新开销过大的问题. 针对布尔搜索的完整性验证需求,方案定义了布尔搜索结果的不可伪造性,并提出了一种基于双线性映射累加器和扩展欧几里得算法的布尔运算完整性验证算法. 安全性分析表明,VBSE-BI方案在随机预言模型下可抵御动态选择关键字攻击,并在双线性q阶强 Diffie-Hellman 假设下满足不可伪造性. 与同类方案相比,VBSE-BI方案不仅支持更丰富的布尔搜索语句,还将用户端计算复杂度显著降低至log nn为关键字个数). 实验结果显示,通过优化验证算法,该方案使用户端验证时间始终保持在较低水平(1.0~1.8 s),仅为服务器端计算时间的 9.98%~14.03%. 上述结果表明,VBSE-BI方案非常适用于资源受限的移动设备,为可搜索加密的实际应用提供了坚实的理论基础和高效性保障.

       

      Abstract: To address the limitations in search expressiveness and the inadequacy of verification mechanisms in existing searchable encryption methods, this paper proposes a Verifiable Boolean Searchable Encryption scheme based on Blockchain Index (VBSE-BI). The scheme first constructs a security model supporting verifiable Boolean search and, based on this model, designs an incremental secure index construction method utilizing blockchain storage structures. This approach achieves efficient search while ensuring the tamper-proof nature of the index structure. Moreover, the scheme introduces an efficient dynamic update mechanism for the secure index, effectively avoiding the significant storage and update overhead caused by auxiliary update structures. It meet the integrity verification requirements of Boolean searches, the scheme defines the unforgeability of Boolean search results and proposes a Boolean operation integrity verification algorithm based on bilinear map accumulators and the extended Euclidean algorithm. Security analysis demonstrates that the VBSE-BI scheme can resist dynamic chosen keyword attacks in the random oracle model and satisfies unforgeability under the bilinear q-strong Diffie-Hellman assumption. Compared with similar schemes, VBSE-BI not only supports more expressive Boolean search statements but also significantly reduces the user's computational complexity to log n (where n is the number of keywords). Experimental results show that by optimizing the verification algorithm, the scheme keeps the user’s verification time consistently low (1.0-1.8 s), accounting for only 9.98%-14.03% of the server-side computation time. These findings indicate that VBSE-BI is highly suitable for resource-constrained mobile devices, providing a solid theoretical foundation and efficiency assurance for the practical application of searchable encryption.

       

    /

    返回文章
    返回