Author :
Dolev, Shlomi ; Garay, Juan ; Gilboa, Niv ; Kolesnikov, Vladimir
Author_Institution :
Dept. of Comput. Sci., Ben-Gurion Univ., Beer-Sheva, Israel
fDate :
Sept. 30 2009-Oct. 2 2009
Abstract :
Information-theoretically secure schemes for sharing and modifying a secret among a dynamic swarm of computing devices are presented. The schemes securely and distributively maintain a global state for the swarm, and support an unlimited number of changes to the state according to (global) inputs received. We present proactively secure schemes supporting players joining and leaving the swarm. The schemes also allow swarms to be merged, cloned and split. We use the above schemes as a basis to implement an oblivious universal Turing machine, capable of evaluating dynamically specified functions.
Keywords :
Turing machines; multi-robot systems; security of data; information-theoretically secure scheme; swarming secrets; universal Turing machine; Aerodynamics; Collaboration; Cryptography; Merging; Military computing; Pervasive computing; Robustness; Turing machines; Unmanned aerial vehicles; Vehicle dynamics;
Conference_Titel :
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual Allerton Conference on
Conference_Location :
Monticello, IL
Print_ISBN :
978-1-4244-5870-7
DOI :
10.1109/ALLERTON.2009.5394507
