Secret swarm unit: reactive k-secret sharing

Authors:
Shlomi Dolev;Limor Lahiani;Moti Yung
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Department of Computer Science, Columbia University, New York, and Google
Venue:
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Year:
2007

Citing 9
Cited 6

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
How to share a secret

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
Self-stabilizing clock synchronization in the presence of Byzantine faults

Journal of the ACM (JACM)
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
Self-stabilizing mobile node location management and message routing

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems

Self-stabilizing and self-orgenizing mobile networks

Proceedings of the fifth international workshop on Foundations of mobile computing
Tutorial Abstract Virtual Infrastructure

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Swarming secrets

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
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
Secret swarm unit

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Secret sharing is a basic 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 components 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 reveal the secret and no k - 1 or fewer reveal the secret. 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.