当前位置: X-MOL 学术Inf. Process. Manag. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A secure heuristic semantic searching scheme with blockchain-based verification
Information Processing & Management ( IF 8.6 ) Pub Date : 2021-03-06 , DOI: 10.1016/j.ipm.2021.102548
Wenyuan Yang , Boyu Sun , Yuesheng Zhu , Dehao Wu

Secure semantic searching provides privacy-preserving information retrieval for arbitrary queries semantically related to keywords. However, current verification mechanisms cannot verify the correctness of search results for semantically related queries in mutual distrust scenarios. Moreover, most secure semantic searching schemes still perform exact matching on ciphertext after query expansion, then directly accumulate the weights of the matched keywords as similarity measurements to rank the documents, resulting in the search results with unsatisfied ranking. In this paper, we propose a secure heuristic semantic searching scheme, in which a privacy-preserving word nonlinear matching (PPWNM) method is developed, and a blockchain-based verification is designed to obtain trustworthy search results with high retrieval accuracy. Specifically, we describe several retrieval heuristics and formulate them as a word nonlinear matching problem, then transform it to the PPWNM problem for calculating the similarity measurement between the query and document so that the highly accurate ranked results can be obtained. Also we design a blockchain-based verification mechanism in which the blockchain nodes utilize the proofs generated during the matching process to verify the correctness of the search results and reach a consensus to ensure the trustworthy results and fair payment between the participants in a mutual distrust model. Our security analysis and experimental results show that the proposed scheme is secure and has higher accuracy compared with the existing other schemes.



中文翻译:

一种基于区块链验证的安全启发式语义搜索方案

安全语义搜索为语义上与关键字相关的任意查询提供了保护隐私的信息。但是,当前的验证机制无法在互不信任的情况下验证语义相关查询的搜索结果的正确性。而且,大多数安全的语义搜索方案在查询扩展后仍对密文进行精确匹配,然后直接将匹配关键词的权重作为相似性度量来对文档进行排名,导致搜索结果的排名不满意。在本文中,我们提出了一种安全的启发式语义搜索方案,其中开发了一种保护隐私的词非线性匹配(PPWNM)方法,并设计了基于区块链的验证来获得具有高检索精度的可信赖的搜索结果。具体来说,我们描述了几种检索启发式方法,并将它们表达为单词非线性匹配问题,然后将其转换为PPWNM问题,以计算查询和文档之间的相似性度量,从而可以获得高度准确的排名结果。我们还设计了一种基于区块链的验证机制,其中区块链节点利用匹配过程中生成的证据来验证搜索结果的正确性并达成共识,以确保互信模型中参与者之间的可信结果和公平支付。我们的安全性分析和实验结果表明,与现有的其他方案相比,该方案是安全的,并且具有较高的准确性。然后将其转换为PPWNM问题,以计算查询和文档之间的相似性度量,从而可以获得高度准确的排名结果。我们还设计了一种基于区块链的验证机制,其中区块链节点利用匹配过程中生成的证据来验证搜索结果的正确性并达成共识,以确保互信模型中参与者之间的可信结果和公平支付。我们的安全性分析和实验结果表明,与现有的其他方案相比,该方案是安全的,并且具有较高的准确性。然后将其转换为PPWNM问题,以计算查询和文档之间的相似性度量,从而可以获得高度准确的排名结果。我们还设计了一种基于区块链的验证机制,其中区块链节点利用匹配过程中生成的证据来验证搜索结果的正确性并达成共识,以确保互信模型中参与者之间的可信结果和公平支付。我们的安全性分析和实验结果表明,与现有的其他方案相比,该方案是安全的,并且具有较高的准确性。我们还设计了一种基于区块链的验证机制,其中区块链节点利用匹配过程中生成的证明来验证搜索结果的正确性并达成共识,以确保互信模型中参与者之间的可信结果和公平支付。我们的安全性分析和实验结果表明,与现有的其他方案相比,该方案是安全的,并且具有较高的准确性。我们还设计了一种基于区块链的验证机制,其中区块链节点利用匹配过程中生成的证据来验证搜索结果的正确性并达成共识,以确保互信模型中参与者之间的可信结果和公平支付。我们的安全性分析和实验结果表明,与现有的其他方案相比,该方案是安全的,并且具有较高的准确性。

更新日期:2021-03-07
down
wechat
bug