Academic
Publications
Secret Swarm UnitReactive k-Secret Sharing

Secret Swarm UnitReactive k-Secret Sharing,10.1007/978-3-540-77026-8_10,Shlomi Dolev,Limor Lahiani,Moti Yung

Secret Swarm UnitReactive k-Secret Sharing   (Citations: 7)
BibTex | RIS | RefWorks Download
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Finally, the efficient blind selection of few encryption keys can be used in secure communications over radio channels [11], as well as in k-Secret sharing between swarm mobile devices [12]...

    Sotiris E. Nikoletseaset al. Combinatorial properties for efficient communication in distributed ne...

    • ...Finally, the RIG modeling can be useful in the efficient blind selection of few encryption keys for secure communications over radio channels ([10]), as well as in k-Secret sharing between swarm mobile devices (see [11])...

    Sotiris E. Nikoletseaset al. Colouring Non-sparse Random Intersection Graphs

    • ...The monitoring is based on the fact that expanders have a rapid mixing time and the possibility of examining the rapid mixing time by O(nlogn) short (O(log 4 n) length) random walks even for non regular expanders. Secret swarm units [8]...
    • ...Motivated by the virtual automata abstraction and swarm computing, an extension of the k-secret sharing scheme is investigated in [8]; in the suggested extension the secret shares are changed on the y, independently and without (internal) communication, as a reaction to a global external trigger...

    Shlomi Dolev. Self-stabilizing and self-orgenizing mobile networks

    • ...One would like to avoid the possibility of an host to know or corrupt the state of the virtual automaton, reactive secret sharing techniques are suggested for this sake [10]...

    Shlomi Dolev. Tutorial Abstract Virtual Infrastructure

Sort by: