Advertisement

Secret Swarm Unit Reactive k −Secret Sharing

(Extended Abstract)
  • Shlomi Dolev
  • Limor Lahiani
  • Moti Yung
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4859)

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.

Keywords

secret sharing mobile computing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dolev, S., Gilbert, S., Lahiani, L., Lynch, N., Nolte, T.: Virtual Stationary Automata for Mobile Networks. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, Springer, Heidelberg (2006) Also invited paper in Forty-Third Annual Allerton Conference on Communication, Control, and Computing. Also, Brief announcement. In: PODC 2005. Proc. of the 24th Annual ACM Symp. on Principles of Distributed Computing, p. 323 (2005) Technical Report MIT-LCS-TR-979, Massachusetts Institute of Technology (2005)CrossRefGoogle Scholar
  2. 2.
    Dolev, S., Gilbert, S., Lynch, A.N., Schiller, E., Shvartsman, A., Welch, J.: Virtual Mobile Nodes for Mobile Ad Hoc Networks. In: DISC 2004. International Conference on Principles of DIStributed Computing, pp. 230–244 (2004) Also Brief announcement. In: PODC 2004. Proc. of the 23th Annual ACM Symp. on Principles of Distributed Computing (2004)Google Scholar
  3. 3.
    Dolev, S., Gilbert, S., Lynch, N.A., Shvartsman, A., Welch, J.: GeoQuorum: Implementing Atomic Memory in Ad Hoc Networks. Distributed Computing 18(2), 125–155 (2003)CrossRefGoogle Scholar
  4. 4.
    Dolev, S., Gilbert, S., Schiller, E., Shvartsman, A., Welch, J.: Autonomous Virtual Mobile Nodes. In: DIALM/POMC 2005. Third ACM/SIGMOBILE Workshop on Foundations of Mobile Computing, pp. 62–69 (2005) Brief announcement. In: SPAA 2005. Proc. of the 17th International Conference on Parallelism in Algorithms and Architectures, p. 215 (2005) Technical Report MIT-LCS-TR-992, Massachusetts Institute of Technology (2005)Google Scholar
  5. 5.
    Dolev, S., Lahiani, L., Lynch, N., Nolte, T.: Self-Stabilizing Mobile Location Management and Message Routing. In: Tixeuil, S., Herman, T. (eds.) SSS 2005. LNCS, vol. 3764, pp. 96–112. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    Dolev, S., Lahiani, L., Yung, M.: Technical Report TR-#2007-12, Department of Computer Science, Ben-Gurion University of the Negev (2007)Google Scholar
  7. 7.
    Dolev, S., Welch, L.J.: Self-Stabilizing Clock Synchronization in the Presence of Byzantine Faults. Journal of the ACM 51(5), 780–799 (2004)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Goldrich, O., Ron, D., Sudan, M.: Chinese Remaindering with Errors. In: Proc. of 31st STOC. ACM (1999)Google Scholar
  9. 9.
    Kivelevich, E., Gurfil, P.: UAV Flock Taxonomy and Mission Execution Performance. In: Proc. of the 45th Israeli Conference on Aerospace Sciences (2005)Google Scholar
  10. 10.
    Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and Completeness In Multi-Party Private Computations. In: FOCS 1994. Proceedings of Thirty-fifth Annual IEEE Symposium on the Foundations of Computer Science, Journal version in SIAM J. Comput. 29(4), 1189-1208 (2000)Google Scholar
  11. 11.
    Lynch, N., Tuttle, M.: An introduction to Input/Output automata, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 2(3), 219–246 (September 1989) Also Tech. Memo MIT/LCS/TM-373Google Scholar
  12. 12.
    Mandelbaum, D.: On a Class of Arithmetic and a Decoding Algorithm. IEEE Transactions on Information Theory 21(1), 85–88 (1976)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Shamir, A.: How to Share a Secret. CACM 22(11), 612–613 (1979)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Weiser, M.: The Computer for the 21th Century. Scientific American (September 1991)Google Scholar
  15. 15.
    Welch, L., Berlekamp, E.R.: Error Correcting for Algebraic Block Codes, U.S. Patent 4633470 (September 1983)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Shlomi Dolev
    • 1
  • Limor Lahiani
    • 1
  • Moti Yung
    • 2
  1. 1.Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84105Israel
  2. 2.Department of Computer Science, Columbia University, New York, and GoogleUSA

Personalised recommendations