Skip to main content
Erschienen in: Soft Computing 19/2017

12.04.2016 | Methodologies and Application

Secure and efficient ECC speeding up algorithms for wireless sensor networks

verfasst von: Yunqi Dou, Jiang Weng, Chuangui Ma, Fushan Wei

Erschienen in: Soft Computing | Ausgabe 19/2017

Einloggen

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

search-config
loading …

Abstract

Wireless sensor networks have been widely used in several applications ranging from environmental and health-care monitoring to military uses. Since sensor networks are typically deployed in hostile environments, broadcast authentication is a fundamental security service in wireless sensor networks. The slow signature verification in existing schemes always causes high energy consumption and long verification delay for broadcast authentication. In this paper, we study the secure and efficient ECC speeding up algorithms for fast authentication in wireless sensor networks. We propose two fast algorithms based on constrained triple base number system to improve the efficiency for situations with and without precomputations. These new algorithms combine the sparsity of constrained TBNS with Yao algorithm to reduce the cost of scalar multiplication. Several experiments have been conducted using Magma software to assess the performance of the proposed algorithms. Our experiments show that the two algorithms are more efficient than existing algorithms. Furthermore, the improvement of efficiency will reduce the energy consumption and thus prolong the network lifetime due to the decrease of computation overhead in signature verification.

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 "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!

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!

Literatur
Zurück zum Zitat Abarzúa R, Thériault N (2012) Complete atomic blocks for elliptic curves in Jacobian coordinates over prime fields. In: Hevia A, Neven G (eds) LATINCRYPT 2012, LNCS, vol 7533. Springer, Heidelberg, pp 37–55CrossRef Abarzúa R, Thériault N (2012) Complete atomic blocks for elliptic curves in Jacobian coordinates over prime fields. In: Hevia A, Neven G (eds) LATINCRYPT 2012, LNCS, vol 7533. Springer, Heidelberg, pp 37–55CrossRef
Zurück zum Zitat Bellare M, Namprempre C, Neven G (2004) Security proofs for identitybased identification and signature schemes. In: Cachin C, Camenisch J (eds) EUROCRYPT 2004, LNCS, vol 3027. Springer-Verlag, Heidelberg, pp 268–286CrossRef Bellare M, Namprempre C, Neven G (2004) Security proofs for identitybased identification and signature schemes. In: Cachin C, Camenisch J (eds) EUROCRYPT 2004, LNCS, vol 3027. Springer-Verlag, Heidelberg, pp 268–286CrossRef
Zurück zum Zitat Bernstein DJ, Lange T (2007) Faster addition and doubling on elliptic curves. In: Kurosawa K (ed) ASIACRYPT, LNCS, vol 4833. Springer, Heidelberg, pp 29–50 Bernstein DJ, Lange T (2007) Faster addition and doubling on elliptic curves. In: Kurosawa K (ed) ASIACRYPT, LNCS, vol 4833. Springer, Heidelberg, pp 29–50
Zurück zum Zitat Berthé V, Imbert L (2004) On converting numbers to the double-base number system. In: Luk FT (ed) Advanced signal processing algorithms, architecture and implementations XIV 2004, vol 5559. pp 70–78 Berthé V, Imbert L (2004) On converting numbers to the double-base number system. In: Luk FT (ed) Advanced signal processing algorithms, architecture and implementations XIV 2004, vol 5559. pp 70–78
Zurück zum Zitat Blake IF, Seroussi G, Smart NP (eds) (2005) Advances in elliptic curve cryptography. Cambridge University Press, Cambridge Blake IF, Seroussi G, Smart NP (eds) (2005) Advances in elliptic curve cryptography. Cambridge University Press, Cambridge
Zurück zum Zitat Brier E, Joye M (2002) Weierstraß elliptic curves and side-channel attacks. In: Naccache D, Paillier P (eds) PKC 2002, LNCS, vol 2274. Springer, Heidelberg, pp 335–345 Brier E, Joye M (2002) Weierstraß elliptic curves and side-channel attacks. In: Naccache D, Paillier P (eds) PKC 2002, LNCS, vol 2274. Springer, Heidelberg, pp 335–345
Zurück zum Zitat Cao X, Kou W, Dang L, Zhao B (2008) IMBAS: identity-based multi-user broadcast authentication in wireless sensor networks. Comput Commun 31(4):659–667CrossRef Cao X, Kou W, Dang L, Zhao B (2008) IMBAS: identity-based multi-user broadcast authentication in wireless sensor networks. Comput Commun 31(4):659–667CrossRef
Zurück zum Zitat Chevallier-Mames B, Ciet M, Joye M (2004) Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity. IEEE Trans Comput 53(6):760–768CrossRefMATH Chevallier-Mames B, Ciet M, Joye M (2004) Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity. IEEE Trans Comput 53(6):760–768CrossRefMATH
Zurück zum Zitat Ciet M, Joye M (2003) (Virtually) Free randomization techniques for elliptic curve cryptography. In: Qing S, Gollmann D, Zhou J (eds) ICICS 2003, LNCS, vol 2836. Springer, Heidelberg, pp 348–359 Ciet M, Joye M (2003) (Virtually) Free randomization techniques for elliptic curve cryptography. In: Qing S, Gollmann D, Zhou J (eds) ICICS 2003, LNCS, vol 2836. Springer, Heidelberg, pp 348–359
Zurück zum Zitat Coron JS (1999) Resistance against differential power analysis for elliptic curve cryptosystems. In: Koç ÇK, Paar C (eds) CHES 1999, LNCS, vol 1717. Springer, Heidelberg, pp 292–302 Coron JS (1999) Resistance against differential power analysis for elliptic curve cryptosystems. In: Koç ÇK, Paar C (eds) CHES 1999, LNCS, vol 1717. Springer, Heidelberg, pp 292–302
Zurück zum Zitat Dimitrov V, Imbert L, Mishra PK (2005) Efficient and secure elliptic curve point multiplication using double-base chains. In: Roy B (ed) ASIACRYPT 2005, LNCS, vol 3788. Springer, Heidelberg, pp 59–78CrossRef Dimitrov V, Imbert L, Mishra PK (2005) Efficient and secure elliptic curve point multiplication using double-base chains. In: Roy B (ed) ASIACRYPT 2005, LNCS, vol 3788. Springer, Heidelberg, pp 59–78CrossRef
Zurück zum Zitat Dimitrov V, Imbert L, Mishra PK (2008) The double-base number system and its application to elliptic curve cryptography. Math Comput 77(262):1075–1104MathSciNetCrossRefMATH Dimitrov V, Imbert L, Mishra PK (2008) The double-base number system and its application to elliptic curve cryptography. Math Comput 77(262):1075–1104MathSciNetCrossRefMATH
Zurück zum Zitat Dimitrov V, Cooklev T (1995) Two algorithms for modular exponentiation using nonstandard arithmetics. IEICE Trans Fundam Electron Commun Comput Sci 78(1):82–87 Dimitrov V, Cooklev T (1995) Two algorithms for modular exponentiation using nonstandard arithmetics. IEICE Trans Fundam Electron Commun Comput Sci 78(1):82–87
Zurück zum Zitat Fan X, Gong G (2012) Accelerating signature-based broadcast authentication for wireless sensor networks. Ad Hoc Netw 10:723–736CrossRefMATH Fan X, Gong G (2012) Accelerating signature-based broadcast authentication for wireless sensor networks. Ad Hoc Netw 10:723–736CrossRefMATH
Zurück zum Zitat Guo P, Wang J, Geng XH, Kim CS, Kim J-U (2014) A variable threshold-value authentication architecture for wireless mesh networks. J Internet Technol 15(6):929–936 Guo P, Wang J, Geng XH, Kim CS, Kim J-U (2014) A variable threshold-value authentication architecture for wireless mesh networks. J Internet Technol 15(6):929–936
Zurück zum Zitat Hisil H, Wong K, Carter G, Dawson E (2008) An intersection form for jacobi-quartic curves. Personal communication Hisil H, Wong K, Carter G, Dawson E (2008) An intersection form for jacobi-quartic curves. Personal communication
Zurück zum Zitat Joye M, Yen S-M (2003) The montgomery powering ladder. In: Kaliski BS, Koç ÇK, Paar C (eds) CHES 2002, LNCS, vol 2523. Springer, Heidelberg, pp 291–302 Joye M, Yen S-M (2003) The montgomery powering ladder. In: Kaliski BS, Koç ÇK, Paar C (eds) CHES 2002, LNCS, vol 2523. Springer, Heidelberg, pp 291–302
Zurück zum Zitat Khan MK, Zhang J, Tian L (2004) Protecting biometric data for personal identification. In: Li SZ et al (eds) SINOBIOMETRICS 2004, LNCS, vol 3383. Springer, Heidelberg, pp 629–638 Khan MK, Zhang J, Tian L (2004) Protecting biometric data for personal identification. In: Li SZ et al (eds) SINOBIOMETRICS 2004, LNCS, vol 3383. Springer, Heidelberg, pp 629–638
Zurück zum Zitat Khan MK, Zhang J (2006) An efficient and practical fingerprint-based remote user authentication scheme with smart cards. In: Chen K et al (eds) ISPEC 2006, LNCS, vol 3903. Springer, Heidelberg, pp 260–268 Khan MK, Zhang J (2006) An efficient and practical fingerprint-based remote user authentication scheme with smart cards. In: Chen K et al (eds) ISPEC 2006, LNCS, vol 3903. Springer, Heidelberg, pp 260–268
Zurück zum Zitat Khan MK, Zhang J (2008) Multimodal face and fingerprint biometrics authentication on space-limited tokens. Neurocomputing 71(13–15):3026–3031CrossRef Khan MK, Zhang J (2008) Multimodal face and fingerprint biometrics authentication on space-limited tokens. Neurocomputing 71(13–15):3026–3031CrossRef
Zurück zum Zitat Liu A, Ning P (2008) TinyECC: A configurable library for elliptic curve cryptography in wireless sensor networks. In: International conference on information processing in sensor networks (IPSN 2008). IEEE Computer Society Press, St. Louis, pp 245–256 Liu A, Ning P (2008) TinyECC: A configurable library for elliptic curve cryptography in wireless sensor networks. In: International conference on information processing in sensor networks (IPSN 2008). IEEE Computer Society Press, St. Louis, pp 245–256
Zurück zum Zitat Longa P, Gebotys C (2009) Fast multibase methods and other several optimization for elliptic curve scalar multiplication. In: Jarecki S, Tsudik G (eds) PKC 2009, LNCS, vol 5443. Springer, Heidelberg, pp 443–462 Longa P, Gebotys C (2009) Fast multibase methods and other several optimization for elliptic curve scalar multiplication. In: Jarecki S, Tsudik G (eds) PKC 2009, LNCS, vol 5443. Springer, Heidelberg, pp 443–462
Zurück zum Zitat Lu CY, Jen SM, Laih CS (2013) A general framework of side-channel atomicity for elliptic curve scalar multiplication. IEEE Trans Comput 62(3):428–438MathSciNetCrossRefMATH Lu CY, Jen SM, Laih CS (2013) A general framework of side-channel atomicity for elliptic curve scalar multiplication. IEEE Trans Comput 62(3):428–438MathSciNetCrossRefMATH
Zurück zum Zitat Mishra D, Mukhopadhyay S, Khan MK, Chaturvedi A (2014) Security enhancement of a biometric based authentication scheme for telecare medicine information systems with nonce. J Med Syst 38(5):1–11CrossRef Mishra D, Mukhopadhyay S, Khan MK, Chaturvedi A (2014) Security enhancement of a biometric based authentication scheme for telecare medicine information systems with nonce. J Med Syst 38(5):1–11CrossRef
Zurück zum Zitat Mishra PK, Dimitrov V (2007) Efficient quintuple formulas for elliptic curves and efficient scalar multiplication using multibase number representation. In: Garay J et al (eds) ISC 2007, LNCS, vol 4779. Springer, Heidelberg, pp 390–406 Mishra PK, Dimitrov V (2007) Efficient quintuple formulas for elliptic curves and efficient scalar multiplication using multibase number representation. In: Garay J et al (eds) ISC 2007, LNCS, vol 4779. Springer, Heidelberg, pp 390–406
Zurück zum Zitat Perrig A, Canetti R, Tygar J, Song D (2000) Efficient authentication and signing of multicast streams over lossy channels. In: 2000 IEEE symposium on security and privacy. IEEE Computer Society Press, Berkeley, pp 56–73 Perrig A, Canetti R, Tygar J, Song D (2000) Efficient authentication and signing of multicast streams over lossy channels. In: 2000 IEEE symposium on security and privacy. IEEE Computer Society Press, Berkeley, pp 56–73
Zurück zum Zitat Ren K, Lou W, Zeng K, Moran PJ (2007) On broadcast authentication in wireless sensor networks. IEEE Trans Wireless Commun 6(11):4136–4144CrossRef Ren K, Lou W, Zeng K, Moran PJ (2007) On broadcast authentication in wireless sensor networks. IEEE Trans Wireless Commun 6(11):4136–4144CrossRef
Zurück zum Zitat Ren K, Yu S, Lou W, Zhang Y (2009) Multi-user broadcast authentication in wireless sensor networks. IEEE Trans Veh Technol 58(8):4554–4564CrossRef Ren K, Yu S, Lou W, Zhang Y (2009) Multi-user broadcast authentication in wireless sensor networks. IEEE Trans Veh Technol 58(8):4554–4564CrossRef
Zurück zum Zitat Ren Y, Shen J, Wang J, Han J, Lee S (2015) Mutual verifiable provable data auditing in public cloud storage. J Internet Technol 16(2):317–323 Ren Y, Shen J, Wang J, Han J, Lee S (2015) Mutual verifiable provable data auditing in public cloud storage. J Internet Technol 16(2):317–323
Zurück zum Zitat Shen J, Tan H, Wang J, Wang J, Lee S (2015) A novel routing protocol providing good transmission reliability in underwater sensor networks. J Internet Technol 16(1):171–178 Shen J, Tan H, Wang J, Wang J, Lee S (2015) A novel routing protocol providing good transmission reliability in underwater sensor networks. J Internet Technol 16(1):171–178
Zurück zum Zitat Wenger E, Großschädl J (2012) An 8-bit AVR-based elliptic curve cryptographic RISC processor for the Internet of things. In: Proceedings of the 45th annual IEEE ACM international symposium on microarchitecture workshops MICROW 2012). IEEE Computer Society Press, Vancouver, pp 39–46 Wenger E, Großschädl J (2012) An 8-bit AVR-based elliptic curve cryptographic RISC processor for the Internet of things. In: Proceedings of the 45th annual IEEE ACM international symposium on microarchitecture workshops MICROW 2012). IEEE Computer Society Press, Vancouver, pp 39–46
Zurück zum Zitat Xia Z, Wang X, Sun X, Wang Q (2016) Secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340–352CrossRef Xia Z, Wang X, Sun X, Wang Q (2016) Secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340–352CrossRef
Zurück zum Zitat Xie S, Wang Y (2014) Construction of tree network with limited delivery latency in homogeneous wireless sensor networks. Wireless Pers Commun 78(1):231–246CrossRef Xie S, Wang Y (2014) Construction of tree network with limited delivery latency in homogeneous wireless sensor networks. Wireless Pers Commun 78(1):231–246CrossRef
Zurück zum Zitat Yu W, Wang K, Li B, Tian S (2013) Triple-base number system for scalar multiplication. In: Youssef A, Nitaj A, Hassanien AE (eds) AFRICACRYPT 2013, LNCS, vol 7918. Springer, Heidelberg, pp 443–451 Yu W, Wang K, Li B, Tian S (2013) Triple-base number system for scalar multiplication. In: Youssef A, Nitaj A, Hassanien AE (eds) AFRICACRYPT 2013, LNCS, vol 7918. Springer, Heidelberg, pp 443–451
Metadaten
Titel
Secure and efficient ECC speeding up algorithms for wireless sensor networks
verfasst von
Yunqi Dou
Jiang Weng
Chuangui Ma
Fushan Wei
Publikationsdatum
12.04.2016
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 19/2017
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-016-2142-x

Weitere Artikel der Ausgabe 19/2017

Soft Computing 19/2017 Zur Ausgabe