Skip to main content

2018 | OriginalPaper | Buchkapitel

Public Key-Based Lightweight Swarm Authentication

verfasst von : Simon Cogliani, Bao Feng, Houda Ferradi, Rémi Géraud, Diana Maimuţ, David Naccache, Rodrigo Portella do Canto, Guilin Wang

Erschienen in: Cyber-Physical Systems Security

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
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.
 
Literatur
1.
Zurück zum Zitat 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. 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
2.
Zurück zum Zitat 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 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
3.
Zurück zum Zitat T.H. Cormen, C. Stein, R.L. Rivest, C.E. Leiserson, Introduction to Algorithms, 2nd edn. (McGraw-Hill Higher Education, New York, 2001)MATH T.H. Cormen, C. Stein, R.L. Rivest, C.E. Leiserson, Introduction to Algorithms, 2nd edn. (McGraw-Hill Higher Education, New York, 2001)MATH
5.
Zurück zum Zitat 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 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
6.
Zurück zum Zitat 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 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
7.
Zurück zum Zitat 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 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
8.
Zurück zum Zitat 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 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
9.
Zurück zum Zitat 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)CrossRef 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)CrossRef
10.
Zurück zum Zitat 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.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)
11.
Zurück zum Zitat 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)CrossRef 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)CrossRef
12.
Zurück zum Zitat 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 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
13.
Zurück zum Zitat 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 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
14.
Zurück zum Zitat 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 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
15.
Zurück zum Zitat L. Zhang, B. Qin, Q. Wu, F. Zhang, Efficient many-to-one authentication with certificateless aggregate signatures. Comput. Netw. 54(14), 2482–2491 (2010)CrossRef L. Zhang, B. Qin, Q. Wu, F. Zhang, Efficient many-to-one authentication with certificateless aggregate signatures. Comput. Netw. 54(14), 2482–2491 (2010)CrossRef
Metadaten
Titel
Public Key-Based Lightweight Swarm Authentication
verfasst von
Simon Cogliani
Bao Feng
Houda Ferradi
Rémi Géraud
Diana Maimuţ
David Naccache
Rodrigo Portella do Canto
Guilin Wang
Copyright-Jahr
2018
Verlag
Springer International Publishing
DOI
https://doi.org/10.1007/978-3-319-98935-8_12