Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation

In this paper, the authors consider the problem of n agents wishing to perform a given computation on common inputs in a privacy preserving manner, in the sense that even if the entire memory contents of some of them are exposed, no information is revealed about the state of the computation, and where there is no a priori bound on the number of inputs. The problem has received ample attention recently in the context of swarm computing and Unmanned Aerial Vehicles (UAV) that collaborate in a common mission, and schemes have been proposed that achieve this notion of privacy for arbitrary computations, at the expense of one round of communication per input among the n agents.

Provided by: AT&T Labs-Research Topic: Mobility Date Added: Dec 2010 Format: PDF

Find By Topic