Brief announcement: Swarming secrets

Shlomi Dolev, Juan Garay, Niv Gilboa, Vladimir Kolesnikov

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

3 Scopus citations

Abstract

We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of changes to the swarm including players joining and leaving the swarm, while swarms may be merged, cloned or split. The schemes securely and distributively maintain a global state for the swarm, and support an unlimited number of changes to the state according to received input. Our schemes are based on a novel construction of a strongly oblivious universal TuringMachine and on a distributed evaluation of this TM that reveals nothing to an adversary beyond a bound on the space complexity of the TM.

Original languageEnglish
Title of host publicationPODC'10 - Proceedings of the 2010 ACM Symposium on Principles of Distributed Computing
Pages231-232
Number of pages2
DOIs
StatePublished - 8 Sep 2010
Event29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010 - Zurich, Switzerland
Duration: 25 Jul 201028 Jul 2010

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010
Country/TerritorySwitzerland
CityZurich
Period25/07/1028/07/10

Keywords

  • Multi-party computation
  • Strongly oblivious TM
  • Swarm

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Brief announcement: Swarming secrets'. Together they form a unique fingerprint.

Cite this