Streaming Verification in Data Analysis

DOI10.1007/978-3-662-48971-0_60MaRDI QIDQ3459909zbMATH OpenOpenAlexFDO

Authors Samira Daruki, Justin Thaler, Suresh Venkatasubramanian

Publication date 11 January 2016

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.05514

Mathematics Subject Classification ID

Computational aspects of data analysis and big data (68T09) Online algorithms; streaming algorithms (68W27) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Abstract: Streaming interactive proofs (SIPs) are a framework to reason about outsourced computation, where a data owner (the verifier) outsources a computation to the cloud (the prover), but wishes to verify the correctness of the solution provided by the cloud service. In this paper we present streaming interactive proofs for problems in data analysis. We present protocols for clustering and shape fitting problems, as well as an improved protocol for rectangular matrix multiplication. The latter can in turn be used to verify $k$ eigenvectors of a (streamed) $nimesn$ matrix. In general our solutions use polylogarithmic rounds of communication and polylogarithmic total communication and verifier space. For special cases (when optimality certificates can be verified easily), we present constant round protocols with similar costs. For rectangular matrix multiplication and eigenvector verification, our protocols work in the more restricted annotated data streaming model, and use sublinear (but not polylogarithmic) communication.

Recommendations

• Testing and spot-checking of data streams
• Nearly optimal verifiable data streaming
• Publication:4952613
• scientific article; zbMATH DE number 2112474
• Streaming verification of graph properties
• scientific article; zbMATH DE number 1424324
• Real-time processing of streaming big data
• Streaming Algorithms for Data in Motion

Cited in

(8)

• Non-interactive proofs of proximity
• Streaming computations with a loquacious prover
• Testing and spot-checking of data streams
• A hierarchy theorem for interactive proofs of proximity
• Practical verified computation with streaming interactive proofs
• Lightweight query authentication on streams
• Verifiable stream computation and Arthur-Merlin communication
• Streaming verification of graph properties

This page was built for publication: Streaming Verification in Data Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459909)