Brief announcement: swarming secrets

Authors:
Shlomi Dolev;Juan Garay;Niv Gilboa;Vladimir Kolesnikov
Affiliations:
Ben-Gurion University, Beer-Sheva, Israel;AT&T Labs-Research, Florham Park, NJ, USA;Ben-Gurion University, Beer-Sheva, Israel;Bell Laboratories, Murray Hill, NJ, USA
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 8
Cited 0

Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
How to withstand mobile virus attacks (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Relations Among Complexity Measures

Journal of the ACM (JACM)
How to share a secret

Communications of the ACM
Survey on Security Challenges for Swarm Robotics

ICAS '09 Proceedings of the 2009 Fifth International Conference on Autonomic and Autonomous Systems
Secret swarm unit: reactive k-secret sharing

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Swarming secrets

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Quantified Score

Hi-index	0.00

Visualization

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 Turing Machine and on a distributed evaluation of this TM that reveals nothing to an adversary beyond a bound on the space complexity of the TM.