Brief announcement: Efficient private distributed computation on unbounded input streams

Shlomi Dolev, Juan Garay, Niv Gilboa, Vladimir Kolesnikov, Yelena Yuditsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider a distributed computation setting in which a party, whom we refer to as the dealer, has a finite state automaton (FSA) 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 A. The input stream x 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 A and returns it as output.

Original languageAmerican English
Title of host publicationDistributed Computing - 26th International Symposium, DISC 2012, Proceedings
EditorsM.K. Aguilera
Pages431-432
Number of pages2
ISBN (Electronic)978-3-642-33651-5
DOIs
StatePublished - 9 Nov 2012
Event26th International Symposium on Distributed Computing, DISC 2012 - Salvador, Brazil
Duration: 16 Oct 201218 Oct 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7611 LNCS

Conference

Conference26th International Symposium on Distributed Computing, DISC 2012
Country/TerritoryBrazil
CitySalvador
Period16/10/1218/10/12

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Brief announcement: Efficient private distributed computation on unbounded input streams'. Together they form a unique fingerprint.

Cite this