research-article

Secret swarm unit

Authors:

Moti YungAuthors Info & Claims

Ad Hoc Networks, Volume 10, Issue 7

Pages 1291 - 1305

https://doi.org/10.1016/j.adhoc.2012.03.011

Published: 01 September 2012 Publication History

Abstract

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.

References

[1]

M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in: Proc. of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, 1988, pp. 1-10.

Digital Library

[2]

S. Dolev, S. Gilbert, L. Lahiani, N. Lynch, T. Nolte, Virtual stationary automata for mobile networks, in: Proc. of the 2005 International Conference On Principles Of Distributed Systems, (OPODIS), LNCS 3974, 2005 (Also invited paper in Forty-Third Annual Allerton Conference on Communication, Control, and Computing; Also, Brief announcement in Proc. of the 24th Annual ACM Symp. on Principles of Distributed Computing, (PODC 2005), 2005, pp. 323; Technical Report MIT-LCS-TR-979, Massachusetts Institute of Technology, 2005).

Digital Library

[3]

S. Dolev, S. Gilbert, A.N. Lynch, E. Schiller, A. Shvartsman, J. Welch, Virtual mobile nodes for mobile ad hoc networks, in: International Conference on Principles of DIStributed Computing (DISC 2004), 2004, pp. 230-244 (Also Brief announcement in Proc. of the 23th Annual ACM Symp. on Principles of Distributed Computing (PODC 2004), 2004).

Digital Library

[4]

Dolev, S., Gilbert, S., Lynch, N.A., Shvartsman, A. and Welch, J., GeoQuorum: implementing atomic memory in ad hoc networks. Distributed Computing. v18 i2. 125-155.

Digital Library

[5]

S. Dolev, S. Gilbert, E. Schiller, A. Shvartsman, J. Welch, Autonomous virtual mobile nodes, in: Third ACM/SIGMOBILE Workshop on Foundations of Mobile Computing (DIALM/POMC), 2005, pp. 62-69 (Brief Announcement in Proc. of the 17th International Conference on Parallelism in Algorithms and Architectures (SPAA 2005), 2005, pp. 215; Technical Report MIT-LCS-TR-992, Massachusetts Institute of Technology, 2005).

Digital Library

[6]

Dolev, S., Herman, T. and Lahiani, L., Polygonal broadcast, secret maturity and the firing sensors. Ad Hoc Networks Journal. v4 i4. 447-486.

[7]

S. Dolev, L. Lahiani, N. Lynch, T. Nolte, Self-stabilizing mobile location management and message routing, in: Proc. of the 7th International Symposium on Self-Stabilizing Systems (SSS 2005), LNCS 3764, 2005, pp. 96-112 (Also Technical Report MIT-LCS-TR-999, Massachusetts Institute of Technology, 2005).

Digital Library

[8]

S. Dolev, L. Lahiani, M. Yung, Secret swarm unit - reactive k-secret sharing, in: Proc. of the 8th International Conference on Cryptology, LNCS 4859, (INDOCRYPT 2007), December 2007, pp. 123-137 (Technical Report #12 2007, Department of Computer Science, Ben-Gurion University, September 2007).

Digital Library

[9]

Goldrich, O., Ron, D. and Sudan, M., Chinese remaindering with errors. In: Proc. of 31st STOC, ACM.

Digital Library

[10]

E. Kivelevich, P. Gurfil, UAV flock taxonomy and mission execution performance, in: Proc. of the 45th Israeli Conference on Aerospace Sciences, 2005.

[11]

J. Kilian, E. Kushilevitz, S. Micali, R. Ostrovsky, Reducibility and completeness in multi-party private computations, in: Proceedings of Thirty-fifth Annual IEEE Symposium on the Foundations of Computer Science (FOCS-94), 2000, pp. 1189-1208 (Journal version in SIAM J. Comput. 29(4)).

Digital Library

[12]

N. Lynch, M. Tuttle, An introduction to input/output automata, in: Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, vol. 2(3), September 1989, pp. 219-246 (Also Tech. Memo MIT/LCS/TM-373).

[13]

Mandelbaum, D., On a class of arithmetic and a decoding algorithm. IEEE Transactions on Information Theory. v21 i1. 85-88.

Digital Library

[14]

Shamir, A., How to share a secret. CACM. v22 i11. 612-613.

Digital Library

[15]

Weiser, M., The Computer for the 21th Century. 1991. Scientific American.

[16]

L. Welch, E.R. Berlekamp, Error Correcting for Algebraic Block Codes, U.S. Patent 4633470, September 1983.

Cited By

Syed FGupta SHamood Alsamhi SRashid MLiu X(2021)A survey on recent optimal techniques for securing unmanned aerial vehicles applicationsTransactions on Emerging Telecommunications Technologies10.1002/ett.413332:7Online publication date: 5-Jul-2021
https://dl.acm.org/doi/10.1002/ett.4133
Buckley NNagar AArumugam S(2016)On the use of secret sharing as a secure multi-use padInnovations in Systems and Software Engineering10.1007/s11334-016-0273-y12:3(215-225)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1007/s11334-016-0273-y
Dolev SGilboa NLi XBao FMiller SChow SYao D(2015)Accumulating Automata and Cascaded Equations Automata for Communicationless Information Theoretically Secure Multi-Party ComputationProceedings of the 3rd International Workshop on Security in Cloud Computing10.1145/2732516.2732526(21-29)Online publication date: 14-Apr-2015
https://dl.acm.org/doi/10.1145/2732516.2732526
Show More Cited By

Recommendations

Secret swarm unit: reactive k-secret sharing
INDOCRYPT'07: Proceedings of the cryptology 8th international conference on Progress in cryptology

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 ...
Fair secret reconstruction in (t, n) secret sharing

In Shamir's (t, n) threshold secret sharing scheme, one secret s is divided into n shares by a dealer and all shares are shared among n shareholders, such that knowing t or more than t shares can reconstruct this secret; but knowing fewer than t shares ...
Strong (n,t,n) verifiable secret sharing scheme

A (t,n) secret sharing divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret; but fewer than t shares cannot reconstruct the secret. In this paper, we extend the idea of a (t,n) secret sharing scheme ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Ad Hoc Networks

Ad Hoc Networks Volume 10, Issue 7

September, 2012

351 pages

ISSN:1570-8705

Issue’s Table of Contents

Copyright © Elsevier B.V.

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 September 2012

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 17 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Syed FGupta SHamood Alsamhi SRashid MLiu X(2021)A survey on recent optimal techniques for securing unmanned aerial vehicles applicationsTransactions on Emerging Telecommunications Technologies10.1002/ett.413332:7Online publication date: 5-Jul-2021
https://dl.acm.org/doi/10.1002/ett.4133
Buckley NNagar AArumugam S(2016)On the use of secret sharing as a secure multi-use padInnovations in Systems and Software Engineering10.1007/s11334-016-0273-y12:3(215-225)Online publication date: 1-Sep-2016
https://dl.acm.org/doi/10.1007/s11334-016-0273-y
Dolev SGilboa NLi XBao FMiller SChow SYao D(2015)Accumulating Automata and Cascaded Equations Automata for Communicationless Information Theoretically Secure Multi-Party ComputationProceedings of the 3rd International Workshop on Security in Cloud Computing10.1145/2732516.2732526(21-29)Online publication date: 14-Apr-2015
https://dl.acm.org/doi/10.1145/2732516.2732526
Dolev SGaray JGilboa NKolesnikov VYuditsky Y(2013)Towards efficient private distributed computation on unbounded input streamsProceedings of the 11th international conference on Applied Cryptography and Network Security10.1007/978-3-642-38980-1_5(69-83)Online publication date: 25-Jun-2013
https://dl.acm.org/doi/10.1007/978-3-642-38980-1_5

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents