Abstract
Wireless sensor network has drawn increasing attentions in recent years due to its wide range of applications. Often deployed in hostile environments, wireless sensor network is particularly vulnerable to malicious attacks. Thus security becomes a critical issue. This paper studies the security support for source authentication for broadcasting in wireless sensor networks. Our problem is motivated by a real sensor network application scenario – Dirty Bomb Detection and Localization, which requires efficient broadcast source authentication service in real-time. Although there exist broadcast source authentication solutions developed for wireless sensor networks, they either require significate latency in key release from a one-way hash key chain, or need a large memory space and/or involve high communication overhead. None of these solutions could meet the strict requirements from real-time communication and the limited memory space in our application
To address this issue, we present a broadcast source authentication mechanism based on multiple message authentication codes (MultiMAC). The novel contribution of this work is that it proposes a deterministic combinatorial key distribution scheme that provides scalable authentication service with limited key storage need. This authentication service is implemented as a security component in TinyOS as part of the Dirty Bomb Detection and Localization application, where its performance is validated
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
Preview
Unable to display preview. Download preview PDF.
References
I. F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cyirci, “Wireless Sensor Networks: A Survey,” Computer Networks, vol. 38, no. 4, pp. 393–422, 2002.
C. Karlof and D. Wagner, “Secure routing in wireless sensor networks: Attacks and countermeasures,” Elsevier’s AdHoc Networks Journal, Special Issue on Sensor Network Applications and Protocols, vol. 1, no. 2–3, pp. 293–315, September 2003.
BIBentryALTinterwordspacing Y. C. Hu, A. Perrig, and D. B. Johnson, “Packet leashes: a defense against wormhole attacks in wireless networks,” in INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, vol. 3, 2003, pp. 1976–1986 vol.3. [Online]. Available: urlhttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1209219 BIBentrySTDinterwordspacing
C. Karlof, N. Sastry, and D. Wagner, “Tinysec: a link layer security architecture for wireless sensor networks,” in SenSys ’04: Proceedings of the 2nd international conference on Embedded networked sensor systems.skip 1em plus 0.5em minus 0.4em New York, NY, USA: ACM Press, 2004, pp. 162–175.
W. Du, J. Deng, Y. S. Han, and P. K. Varshney, “A pairwise key pre-distribution scheme for wireless sensor networks,” in CCS ’03: Proceedings of the 10th ACM conference on Computer and communications security.skip 1em plus 0.5em minus 0.4em New York, NY, USA: ACM Press, 2003, pp. 42–51.
H. Chan, A. Perrig, and D. Song, “Random key predistribution schemes for sensor networks,” in SP ’03: Proceedings of the 2003 IEEE Symposium on Security and Privacy.skip 1em plus 0.5em minus 0.4em Washington, DC, USA: IEEE Computer Society, 2003, p. 197.
“Dirty bomb detection and localization,” urlhttp://www.isis.vanderbilt.edu/Projects/rips/.
D. J. Malan, M. Welsh, and M. D. Smith, “A public-key infrastructure for key distribution in tinyos based on elliptic curve cryptography,” in SECON 2004. First IEEE International Conference on Sensor and Ad Hoc Communications and Networks, October 2004.
N. Gura, A. Patel, A. Wander, H. Eberle, and S. Shantz, “Comparing elliptic curve cryptography and rsa on 8-bit cpus,” in CHES’s 2004 Workshop on Cryptographic Hardware and Embedded Systems, Aug 2004, pp. 119–132.
A. Perrig, R. Szewczyk, J. D. Tygar, V. Wen, and D. E. Culler, “Spins: security protocols for sensor networks,” Wirel. Netw., vol. 8, no. 5, pp. 521–534, 2002.
Y. Zhou and Y. Fang, “Babra: Batch-based broadcast authentication in wireless sensor networks,” in Proc. of IEEE GLOBECOM, Nov 2006.
R. Blom, “An optimal class of symmetric key generation systems,” in Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques.skip 1em plus 0.5em minus 0.4em New York, NY, USA: Springer-Verlag New York, Inc., 1985, pp. 335–338.
L. Zhou, J. Ni, and C. V. Ravishankar, “Efficient key establishment for group-based wireless sensor deployments,” in WiSe ’05: Proceedings of the 4th ACM workshop on Wireless security, 2005.
J. Lee and D. R. Stinson, “Deterministic key predistribution schemes for distributed sensor networks,” in Selected Areas in Cryptography, 2004, pp. 294–307.
D. Liu and P. Ning, “Location-based pairwise key establishments for static sensor networks,” in SASN ’03: Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks.skip 1em plus 0.5em minus 0.4em New York, NY, USA: ACM Press, 2003, pp. 72–82.
L. Eschenauer and V. D. Gligor, “A key-management scheme for distributed sensor networks,” in CCS ’02: Proceedings of the 9th ACM conference on Computer and communications security.skip 1em plus 0.5em minus 0.4em New York, NY, USA: ACM Press, 2002, pp. 41–47.
W. Du, J. Deng, Y. S. Han, S. Chen, and P. K. Varshney, “A key management scheme for wireless sensor networks using deployment knowledge,” in INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, vol. 1, 2004.
R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, “Multicast security: A taxonomy and some efficient constructions,” in Proc. IEEE INFOCOM’99, vol. 2.skip 1em plus 0.5em minus 0.4em New York, NY: IEEE, Mar. 1999, pp. 708–716.
P. Rohatgi, “A compact and fast hybrid signature scheme for multicast packet authentication,” in CCS ’99: Proceedings of the 6th ACM conference on Computer and communications security.skip 1em plus 0.5em minus 0.4em New York, NY, USA: ACM Press, 1999, pp. 93–100.
M. Manzo, T. Roosta, and S. Sastry, “Time synchronization attacks in sensor networks,” in SASN ’05: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks.skip 1em plus 0.5em minus 0.4em New York, NY, USA: ACM Press, 2005, pp. 107–116.
C. J. Colbourn and J. H. Dinitz, “Graphical designs,” in The CRC Handbook of Combinatorial Designs.skip 1em plus 0.5em minus 0.4em Boca Raton: CRC Press, 1996, pp. 367–369.
L. Morales, I. H. Sudborough, M. Eltoweissy, and M. H. Heydari, “Combinatorial optimization of multicast key management,” in HICSS ’03: Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS’03) - Track 9.skip 1em plus 0.5em minus 0.4em Washington, DC, USA: IEEE Computer Society, 2003, p. 332.2.
F. Ye, H. Luo, S. Lu, and L. Zhang, “Statistical en-route filtering of injected false data in sensor networks,” in INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 4, 2004, pp. 2446–2457.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this chapter
Cite this chapter
Wu, T. et al. (2007). A Fast and Efficient Source Authentication Solution for Broadcasting in Wireless Sensor Networks. In: Labiod, H., Badra, M. (eds) New Technologies, Mobility and Security. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-6270-4_5
Download citation
DOI: https://doi.org/10.1007/978-1-4020-6270-4_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-6269-8
Online ISBN: 978-1-4020-6270-4
eBook Packages: EngineeringEngineering (R0)