arrow
返回

Verifiable Graph Processing

delete2018-10-01
delete2
PRE
AI
Y
Yupeng Zhang *
C
Charalampos Papamanthou
J
Jonathan Katz
DOI:10.1145/3233181delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

A
ACM Transactions on Privacy and Security
IF:
2.8
论文数:
291
被引数:
770

机构

University System of Maryland 封面图
University System of Maryland
学者数:
6.4W
论文数: 5.6W
被引数: 113
引用论文

引用论文

err分享
err收藏
d.pi.-p.pi. Bonding and conjugation involving Group IV elements
err2002-05-01
err0
PREAI
errDonald R. Eaton; William R. McClellan
err分享
err收藏
学者 查看更多内容