Secret swarm unit reactive k-secret sharing

Shlomi Dolev, Limor Lahiani, Moti Yung

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

17 Scopus citations


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,

Original languageEnglish
Title of host publicationProgress in Cryptology - INDOCRYPT 2007 - 8th International Conference on Cryptology in India, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540770251
StatePublished - 1 Jan 2007
Event8th Annual International Conference on Cryptolology in India, INDOCRYPT 2007 - Chennai, India
Duration: 9 Dec 200713 Dec 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4859 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference8th Annual International Conference on Cryptolology in India, INDOCRYPT 2007


  • Mobile computing
  • Secret sharing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Secret swarm unit reactive k-secret sharing'. Together they form a unique fingerprint.

Cite this