Abstract
We describe a lightweight algorithm performing whole-network authentication in a distributed way. This protocol is more efficient than one-to-one node authentication: it results in less communication, less computation and overall lower energy consumption. The proposed algorithm is provably secure and achieves zero-knowledge authentication of a network in a time logarithmic in the number of nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
This can be fixed by requiring \(\mathcal V\) to commit on the ai before \(\mathcal P\) has sent anything, but this modification will not be necessary for our purpose.
- 2.
This is for clarity. It is straightforward to give each node several private keys and adapt the algorithm accordingly.
References
D. Anshul, S. Roy, A ZKP-based identification scheme for base nodes in wireless sensor networks, in Proceedings of the 2005 ACM Symposium on Applied Computing, SAC ’05 (ACM, New York, 2005), pp. 319–323
D. Boneh, C. Gentry, B. Lynn, H. Shacham, Aggregate and verifiably encrypted signatures from bilinear maps, in Advances in Cryptology – EUROCRYPT 2003, ed. by E. Biham. Lecture Notes in Computer Science, vol. 2656 (Springer, Heidelberg, 2003), pp. 416–432
T.H. Cormen, C. Stein, R.L. Rivest, C.E. Leiserson, Introduction to Algorithms, 2nd edn. (McGraw-Hill Higher Education, New York, 2001)
U. Feige, A. Fiat, A. Shamir, Zero-knowledge proofs of identity. J. Cryptol. 1(2), 77–94 (1988)
A. Fiat, A. Shamir, How to prove yourself: practical solutions to identification and signature problems, in Advances in Cryptology – CRYPTO’86, ed. by A.M. Odlyzko. Lecture Notes in Computer Science, vol. 263 (Springer, Heidelberg, 1987), pp. 186–194
M. Girault, J. Stern, On the length of cryptographic hash-values used in identification schemes, in Advances in Cryptology – CRYPTO’94. ed. by Y. Desmedt. Lecture Notes in Computer Science, vol. 839 (Springer, Heidelberg, 1994), pp. 202–215
S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof-systems (extended abstract), in Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6–8, 1985, Providence, Rhode Island, USA, ed. by R. Sedgewick (ACM, New York, 1985), pp. 291–304. http://doi.acm.org/10.1145/22145.22178
L.C. Guillou, J.J. Quisquater, A practical zero-knowledge protocol fitted to security microprocessor minimizing both trasmission and memory, in Advances in Cryptology – EUROCRYPT’88, ed. by C.G. Günther. Lecture Notes in Computer Science, vol. 330 (Springer, Heidelberg, 1988), pp. 123–128
C. Lavault, M. Valencia-Pabon, A distributed approximation algorithm for the minimum degree minimum weight spanning trees. J. Parallel Distrib. Comput. 68(2), 200–208 (2008)
A.J. Mooij, N. Goga, J.W. Wesselink, A distributed spanning tree algorithm for topology-aware networks. Technische Universiteit Eindhoven, Department of Mathematics and Computer Science (2003)
A. Perrig, R. Szewczyk, J.D. Tygar, V. Wen, D.E. Culler, Spins: security protocols for sensor networks. Wirel. Netw. 8(5), 521–534 (2002)
M. Singh, L.C. Lau, Approximating minimum bounded degree spanning trees to within one of optimal, in Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing (ACM, New York, 2007), pp. 661–670
S.K. Udgata, A. Mubeen, S.L. Sabat, Wireless sensor network security model using zero knowledge protocol, in 2011 IEEE International Conference on Communications (IEEE, Piscataway, 2011), pp. 1–5
M. Hashim, G. Santhosh Kumar, A. Sreekumar, Authentication in wireless sensor networks using zero knowledge protocol, in Computer Networks and Intelligent Computing. vol. 157 (Springer, Berlin, 2011), pp. 416–421
L. Zhang, B. Qin, Q. Wu, F. Zhang, Efficient many-to-one authentication with certificateless aggregate signatures. Comput. Netw. 54(14), 2482–2491 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Cogliani, S. et al. (2018). Public Key-Based Lightweight Swarm Authentication. In: Koç, Ç.K. (eds) Cyber-Physical Systems Security. Springer, Cham. https://doi.org/10.1007/978-3-319-98935-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-98935-8_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98934-1
Online ISBN: 978-3-319-98935-8
eBook Packages: Computer ScienceComputer Science (R0)