[Speaker] Prof. Shlomi Dolev
[Title] Swarming Secrets
[Date] Sep 30th (Wed) 2009
[Time] TBA

[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 repeatedly
and infinitely many 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
capabilities to implement an oblivious universal Turing machine,
supporting on the fly change of the computation task.
The talk may give a description of other results of my group, if time
allows.

Joint work with Juan Garay, Niv Gilboa, Vladimir Kolesnikov