Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams

Abstract

We consider a distributed computation setting in which a party, whom we refer to as the dealer, has a finite state automaton (FSA) $\mathcal{A}$ with m states,which accepts an (a priori unbounded) stream of inputs x ₁, x ₂,... received from an external source. The dealer delegates the computation to agents A ₁,...,A _n , by furnishing them with an implementation of $\mathcal{A}$. The input streamx ₁, x ₂,... is delivered to all agents in a synchronized manner during the online input-processing phase. Finally, given a signal from the dealer, the agents terminate the execution, submit their internal state to the dealer, who computes the state of $\mathcal{A}$ and returns it as output.

This research has been supported by the Ministry of Science and Technology, the Institute for Future Defense Technologies Research named for the Medvedi, Shwartzman and Gensler Families, the Israel Internet Association, the Lynne and William Frankel Center for Computer Science at Ben-Gurion University, Rita Altura Trust Chair in Computer Science, Israel Science Foundation (grant number 428/11), Cabarnit Cyber Security MAGNET Consortium and MAFAT. Extended version can be found in the Computing Research Repository (CoRR), August 2012.