返回
Verifiable Graph Processing
DOI:10.1145/3233181.png)
摘要
En 中文
We consider a scenario in which a data owner outsources storage of a large graph to an untrusted server; the server performs computations on this graph in response to queries from a client (whether the data owner or others), and the goal is to ensure verifiability of the returned results. Applying generic verifiable computation (VC) would involve compiling each graph computation to a circuit or a RAM program and would incur large overhead, especially in the proof-computation time. In this work, we address the above by designing, building, and evaluating ALITHEIA, a VC system tailored for graph queries such as computing shortest paths, longest paths, and maximum flows. The underlying principle of ALITHEIA is to minimize the use of generic VC techniques by leveraging various algorithmic approaches specific for graphs. This leads to both theoretical and practical improvements. Asymptotically, it improves the complexity of proof computation by at least a logarithmic factor. On the practical side, our system achieves significant performance improvements over current state-of-the-art VC systems (up to a 10-orders-of-magnitude improvement in proof-computation time, and a 99.9% reduction in server storage), while scaling to 200,000-node graphs.
Keyword:
Verifiable computation
graph processing
cloud computing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
A
IF:
2.8
论文数:
291
被引数:
770
机构
引用论文
Number and structure of Balbiani ring 75 S RNA transcription units in Chironomus tentansBalbiani环75S RNA转录单位的数量和结构在Chironomus tentans中
Different repetition frequencies of a 120 base-pair DNA-element and its arrangement in Chironomus thummi thummi and Chironomus thummi piger120碱基对DNA元件的不同重复频率及其在Chironomus thummi thummi和Chironomus thummi piger中的排列
Chromosoma
IF0

