NetChain: Authenticated Blockchain Top-k Graph Data Queries and its Application in Asset Management
Hongguang Zhao, Xu Yang, Saiyu Qi, Qiuhao Wang, Ke Li

TL;DR
NetChain introduces an efficient, verifiable top-k graph data query framework on blockchain, significantly reducing storage, computation, and communication costs compared to prior solutions like vChain.
Contribution
The paper presents a novel authenticated two-layer index for top-k graph queries on blockchain, with an optimized variant NetChain+ that enhances efficiency and verifiability.
Findings
NetChain achieves up to 85X faster ADS construction than vChain.
NetChain+ reduces communication costs by 87%.
NetChain+ decreases verification costs by 96%.
Abstract
As a valuable digital resource, graph data is an important data asset, which has been widely utilized across various fields to optimize decision-making and enable smarter solutions. To manage data assets, blockchain is widely used to enable data sharing and trading, but it cannot supply complex analytical queries. vChain was proposed to achieve verifiable boolean queries over blockchain by designing an embedded authenticated data structure (ADS). However, for generating (non-)existence proofs, vChain suffers from expensive storage and computation costs in ADS construction, along with high communication and verification costs. In this paper, we propose a novel NetChain framework that enables efficient top-k queries over on-chain graph data with verifiability. Specifically, we design a novel authenticated two-layer index that supports (non-)existence proof generation in block-level and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Graph Theory and Algorithms · Data Quality and Management
