Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Reducibility and Completeness in Private Computations
SIAM Journal on Computing
Communications of the ACM
Brief announcement: virtual mobile nodes for mobile ad hoc networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Brief announcement: virtual stationary automata for mobile networks
Proceedings of the twenty-fourth 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
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Distributed Computing - Special issue: DISC 03
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
On a class of arithmetic codes and a decoding algorithm (Corresp.)
IEEE Transactions on Information Theory
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 |
Secret sharing is a fundamental cryptographic task. Motivated by the virtual automata abstraction and swarm computing, we investigate an extension of the k-secret sharing scheme, in which the secret shares are changed on the fly, independently and without (internal) communication, as a reaction to a global external trigger. The changes are made while maintaining the requirement that k or more secret shares may reconstruct the secret and no k-1 or fewer can do so. The application considered is a swarm of mobile processes, each maintaining a share of the secret which may change according to common outside inputs, e.g., inputs received by sensors attached to the process. The proposed schemes support addition and removal of processes from the swarm, as well as corruption of a small portion of the processes in the swarm.