王金风1,
王伯彬1,
贾向东1,
杜小妮2
1.西北师范大学计算机科学与工程学院 兰州 730070
2.西北师范大学数学与统计学院 ??兰州 ??730070
基金项目:国家自然科学基金(61562077, 61462077, 61662071, 61662069)，西北师范大学青年教师科研提升计划(NWNU-LKQN-14-7)，甘肃省****项目(1308RJDA007)
详细信息
作者简介:牛淑芬：女，1976年生，博士，副教授，研究方向为云计算、大数据和区块链上的数据安全
王金风：女，1992年生，硕士，研究方向为区块链上的数据检索
王伯彬：男，1992年生，硕士，研究方向为车联网隐私保护
贾向东：男，1971年生，博士，教授，研究方向为无线传感器
杜小妮：女，1972年生，博士，教授，研究方向为流密码和分组密码
通讯作者:牛淑芬 sfniu76@nwnu.edu.cn
中图分类号:TP309.7计量
文章访问数:2439
HTML全文浏览量:999
PDF下载量:108
被引次数:0
出版历程
收稿日期:2019-01-15
修回日期:2019-06-05
网络出版日期:2019-06-12
刊出日期:2019-10-01
Ciphertext Sorting Search Scheme Based on B+ Tree Index Structure on Blockchain
Shufen NIU1,,,Jinfeng WANG1,
Bobin WANG1,
Xiangdong JIA1,
Xiaoni DU2
1. School of Computer Science and Engineering, Northwest Normal University, Lanzhou 730070, China
2. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, china
Funds:The National Natural Science Foundation of China (61562077, 61462077, 61662071, 61662069), The Young Teacher’s Scientific Research Ability Promotion Program of Northwest Normal University (NWNU-LKQN-14-7), The Natural Science Foundation of Gansu Province for Distinguished Young Scholars (1308RJDA007)
摘要
摘要:为了克服云存储不可信及云存储中密文检索效率低的问题，该文提出区块链上基于B+树的密文排序可搜索加密方案。该方案结合区块链技术解决了在互不了解的多方建立可靠信任的问题；使用向量空间模型降低了文本的复杂性实现了高效的文本检索系统；采用B+树的索引结构提高了区块链上密文交易的检索速度；利用加权统计(TF-IDF)算法实现了多关键词查询结果的排序。在随机预言机模型下，证明该方案是适应性不可区分安全的，通过效率对比分析，表明该方案在区块链上实现了高效的密文检索。
关键词:云存储/
区块链/
B+树/
排序搜索
Abstract:In order to overcome the problem that cloud storage is not trusted and the low efficiency of ciphertext retrieval in cloud storage, a searchable ciphertext sorting encryption scheme based on B+ tree on the block chain is proposed. Combined with the blockchain technology, the problem of establishing reliable trust in multiple parties that do not understand each other is solved. A vector space model is used to reduce the complexity of the text and an efficient text retrieval system is implemented. The index structure of the B+ tree is used to improve the retrieval of ciphertext transactions on the blockchain. The ranking of multi-keyword query results is realized by the Term?Frequency–Inverse?Document?Frequency (TF-IDF) algorithm. Under the random oracle model, it is proved that the scheme is adaptive and indistinguishable. Through the comparative analysis of efficiency, it is shown that the scheme achieves efficient ciphertext retrieval on the blockchain.
Key words:Cloud storage/
Blockchain/
B+ tree/
Sorting search
PDF全文下载地址:
https://jeit.ac.cn/article/exportPdf?id=b5eb8225-f7c7-46ec-a606-ff98573582fb
