Advertisement

Brief Announcement: Efficient Private Distributed Computation on Unbounded Input Streams

  • Shlomi Dolev
  • Juan Garay
  • Niv Gilboa
  • Vladimir Kolesnikov
  • Yelena Yuditsky
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7611)

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 1, x 2,... received from an external source. The dealer delegates the computation to agents A 1,...,A n , by furnishing them with an implementation of \(\mathcal{A}\). The input streamx 1, x 2,... 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.

References

  1. 1.
    Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V.: Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation. In: ICS (2011)Google Scholar
  2. 2.
    Shamir, A.: How to Share a Secret. CACM 22(11), 612–613 (1979)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Shlomi Dolev
    • 1
  • Juan Garay
    • 2
  • Niv Gilboa
    • 3
  • Vladimir Kolesnikov
    • 4
  • Yelena Yuditsky
    • 1
  1. 1.Dept. of Computer ScienceBen-Gurion University of the NegevIsrael
  2. 2.AT&T Labs – ResearchFlorham ParkUSA
  3. 3.Dept. of Communication Systems EngineeringBen-Gurion University of the NegevIsrael
  4. 4.Bell LaboratoriesMurray HillUSA

Personalised recommendations