TY - GEN
T1 - Swarming secrets
AU - Dolev, Shlomi
AU - Garay, Juan
AU - Gilboa, Niv
AU - Kolesnikov, Vladimir
PY - 2009/1/1
Y1 - 2009/1/1
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/77949622816
U2 - 10.1109/ALLERTON.2009.5394507
DO - 10.1109/ALLERTON.2009.5394507
M3 - Conference contribution
AN - SCOPUS:77949622816
SN - 9781424458714
T3 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
SP - 1438
EP - 1445
BT - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
PB - Institute of Electrical and Electronics Engineers
T2 - 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009
Y2 - 30 September 2009 through 2 October 2009
ER -