图连通性和几何搜索问题的有效认证数据结构
Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems
摘要：
经过认证的数据结构提供密码学证明，证明其答案与作者预期的一样准确，即使该数据结构正由远程不受信任的主机控制。我们提出了有效的技术，用于验证数据结构，表示图形和集合的几何对象。我们介绍了路径散列累加器，一个新的原语的基础上加密散列有效地验证各种属性的结构化数据表示为路径，包括任何可分解的查询序列的元素。我们展示了如何使用我们的原语来验证查询的路径在图中的属性和多目录上的搜索查询。这使得设计新的，有效的认证数据结构的网络上的基本问题，如路径和连通性查询图，和复杂的查询二维几何对象，如交叉和包容查询。
英文摘要：
Authenticated data structures provide cryptographic proofs that their answers are as accurate as the author intended, even if the data structure is being controlled by a remote untrusted host. We present efficient techniques for authenticating data structures that represent graphs and collections of geometric objects. We introduce the path hash accumulator, a new primitive based on cryptographic hashing for efficiently authenticating various properties of structured data represented as paths, including any decomposable query over sequences of elements. We show how to employ our primitive to authenticate queries about properties of paths in graphs and search queries on multi-catalogs. This allows the design of new, efficient authenticated data structures for fundamental problems on networks, such as path and connectivity queries over graphs, and complex queries on two-dimensional geometric objects, such as intersection and containment queries.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
