首页 | 本学科首页   官方微博 | 高级检索  
     

基于区块链的公平可验证的多关键词密文排序检索
引用本文:庞晓琼,王云婷,陈文俊,姜攀,高亚楠.基于区块链的公平可验证的多关键词密文排序检索[J].计算机应用,2023,43(1):130-139.
作者姓名:庞晓琼  王云婷  陈文俊  姜攀  高亚楠
作者单位:中北大学 大数据学院,太原 030051
中国人民银行 太原中心支行,太原 030001
基金项目:山西省自然科学基金资助项目(201901D111164)
摘    要:针对区块链环境下已有的可搜索加密方案实现结果验证和公平支付的成本过高、检索功能局限的问题,提出基于区块链的支持验证与公平支付的多关键词排序检索方案。该方案通过云服务器(CSP)存储加密索引树和执行搜索操作,并且构建了包含验证证明的查找表来辅助智能合约完成检索结果的验证以及公平支付,从而降低智能合约执行操作的复杂性,节约时间和费用成本。此外,结合向量空间模型与词频逆文档频率(TF-IDF)技术构建平衡二叉树结构的索引,并使用安全K邻近对索引和查询向量进行加密,从而实现支持动态更新的多关键词排序检索。安全性和性能分析表明,所提方案在区块链环境下和已知密文模型下是安全可行的;仿真实验结果表明,所提方案能够以可接受的开销实现结果验证与公平支付。

关 键 词:区块链  对称可搜索加密  公平支付  可验证  多关键词排序检索
收稿时间:2021-11-12
修稿时间:2022-05-10

Fair and verifiable multi-keyword ranked search over encrypted data based on blockchain
Xiaoqiong PANG,Yunting WANG,Wenjun CHEN,Pan JIANG,Yanan GAO.Fair and verifiable multi-keyword ranked search over encrypted data based on blockchain[J].journal of Computer Applications,2023,43(1):130-139.
Authors:Xiaoqiong PANG  Yunting WANG  Wenjun CHEN  Pan JIANG  Yanan GAO
Affiliation:College of Data Science and Technology,North University of China,Taiyuan Shanxi 030051,China
Taiyuan Central Sub?branch,The People’s Bank of China,Taiyuan Shanxi 030001,China
Abstract:In view of the high cost as well as the limitation of retrieval function of the existing searchable encryption schemes based on blockchain to realize result verification and fair payment, a multi-keyword ranked search scheme supporting verification and fair payment was proposed based on blockchain. In the proposed scheme, the Cloud Service Provider (CSP) was used to store the encrypted index tree and perform search operations, and a lookup table including verification certificates was constructed to assist the smart contract to complete the verification of retrieval results and fair payment, which reduced the complexity of smart contract execution and saved time as well as expensive cost. In addition, the index of balanced binary tree structure was constructed by combining vector space model and Term Frequency-Inverse Document Frequency (TF-IDF), and the index and query vectors were encrypted by using secure K-nearest neighbor, which realized the multi-keyword ranked search supporting dynamic update. Security and performance analysis show that the proposed scheme is secure and feasible in the blockchain environment and under the known ciphertext model. Simulation results show that the proposed scheme can achieve result verification and fair payment with acceptable cost.
Keywords:blockchain  symmetric searchable encryption  fair payment  verifiable  multi-keyword ranked search  
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号