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)
Communications of the ACM
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Autonomous virtual mobile nodes
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks
IEEE Transactions on Mobile Computing
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Distributed Computing - Special issue: DISC 03
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Secret swarm unit: reactive k-secret sharing
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Self-stabilizing mobile node location management and message routing
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Brief announcement: swarming secrets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Dynamic multi-party computation forever for swarm and cloud computing and code obfuscation
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Towards efficient private distributed computation on unbounded input streams
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
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.