通过Web集合搜索结果
Verifying Search Results Over Web Collections
摘要:
搜索是互联网上最频繁执行的计算之一,也是外包计算最重要的应用之一,产生的结果严重影响用户的决策行为。因此,对大量网络内容进行基于互联网的搜索的完整性验证至关重要。我们提供了这个一般安全问题的第一个解决方案。我们介绍了一个认证的网络爬虫的概念,并提出了这个新概念的设计和原型实现。经过认证的网络爬虫是一个可信的程序,它计算它访问的网络内容集合的特殊“签名”$s$。根据此签名,可以验证Web搜索在其产生的结果的完整性方面是正确的。该签名还允许验证网页上的复杂查询,例如合取关键字搜索。在我们的解决方案中,除了满足任何给定搜索查询的网页外,搜索引擎还返回加密证明。该证明与签名$s$一起使得任何用户能够有效地验证没有合法网页被从由搜索引擎计算的结果中省略,并且没有不符合查询的页面被包括在结果中。我们的解决方案的一个重要属性是,证明的大小和验证时间都只依赖于查询描述和查询结果的大小,但不依赖于搜索执行的网页的数量或大小。我们的认证协议是基于标准的Merkle树和更复杂的双线性映射树。正如我们的实验证明,我们的系统的原型实现提供了一个低的通信开销之间的搜索引擎和用户,并允许在用户端的返回结果的快速验证。
英文摘要:
Searching accounts for one of the most frequently performed computations over the Internet as well as one of the most important applications of outsourced computing, producing results that critically affect users' decision-making behaviors. As such, verifying the integrity of Internet-based searches over vast amounts of web contents is essential. We provide the first solution to this general security problem. We introduce the concept of an authenticated web crawler and present the design and prototype implementation of this new concept. An authenticated web crawler is a trusted program that computes a special "signature" $s$ of a collection of web contents it visits. Subject to this signature, web searches can be verified to be correct with respect to the integrity of their produced results. This signature also allows the verification of complicated queries on web pages, such as conjunctive keyword searches. In our solution, along with the web pages that satisfy any given search query, the search engine also returns a cryptographic proof. This proof, together with the signature $s$, enables any user to efficiently verify that no legitimate web pages are omitted from the result computed by the search engine, and that no pages that are non-conforming with the query are included in the result. An important property of our solution is that the proof size and the verification time both depend solely on the sizes of the query description and the query result, but not on the number or sizes of the web pages over which the search is performed. Our authentication protocols are based on standard Merkle trees and the more involved bilinear-map accumulators. As we experimentally demonstrate, the prototype implementation of our system gives a low communication overhead between the search engine and the user, and allows for fast verification of the returned results on the user side.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。