Streaming Verification in Data Analysis

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 keigenvectors of a (streamed) \(n \times n\) matrix.

[1]  Ran Raz,et al.  Arthur-Merlin streaming complexity , 2013, Inf. Comput..

[2]  Hartmut Klauck,et al.  On Arthur Merlin Games in Communication Complexity , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[3]  Alexandr Andoni,et al.  Eigenvalues of a matrix in the streaming model , 2013, SODA.

[4]  Elaine Shi,et al.  Streaming Authenticated Data Structures , 2013, EUROCRYPT.

[5]  Ashish Goel,et al.  Reductions among high dimensional proximity problems , 2001, SODA '01.

[6]  Graham Cormode,et al.  Annotations in Data Streams , 2009, ICALP.

[7]  Pankaj K. Agarwal,et al.  Streaming Algorithms for Extent Problems in High Dimensions , 2010, SODA '10.

[8]  Timothy M. Chan.  Faster core-set constructions and data-stream algorithms in fixed dimensions , 2006, Comput. Geom..

[9]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[10]  Graham Cormode,et al.  Annotations for Sparse Data Streams , 2013, SODA.

[11]  Dominique Schröder,et al.  Verifiable data streaming , 2012, CCS.

[12]  Graham Cormode,et al.  Streaming Graph Computations with a Helpful Advisor , 2010, ESA.

[13]  Graham Cormode,et al.  Verifying Computations with Streaming Interactive Proofs , 2011, Proc. VLDB Endow..

[14]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[15]  Sariel Har-Peled,et al.  No, Coreset, No Cry , 2004, FSTTCS.

[16]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[17]  Yael Tauman Kalai,et al.  Delegating computation: interactive proofs for muggles , 2008, STOC.

[18]  Suresh Venkatasubramanian,et al.  On Interactivity in Arthur-Merlin Communication and Stream Computation , 2013, Electron. Colloquium Comput. Complex..

[19]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[20]  Graham Cormode,et al.  Practical verified computation with streaming interactive proofs , 2011, ITCS '12.

[21]  Hartmut Klauck,et al.  An Improved Interactive Streaming Algorithm for the Distinct Elements Problem , 2014, ICALP.

[22]  Kasturi R. Varadarajan,et al.  No Coreset, No Cry: II , 2005, FSTTCS.

[23]  Yael Tauman Kalai,et al.  Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..