Abstract
Key predistribution schemes for distributed sensor networks have received significant attention in the recent literature. In this paper we propose a new construction method for these schemes based on combinations of duals of standard block designs. Our method is a broad spectrum one which works for any intersection threshold. By varying the initial designs, we can generate various schemes and this makes the method quite flexible. We also obtain explicit algebraic expressions for the metrics for local connectivity and resiliency. These schemes are quite efficient with regard to connectivity and resiliency and at the same time they allow a straightforward shared-key discovery.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blackburn S.R., Etzion T., Martin K.M., Paterson M.B.: Distinct difference configurations: multihop paths and key predistribution in sensor networks. IEEE Trans. Inform. Theory 56, 3961–3972 (2010)
Carmen D., Kruus P., Matt B.: Constraints and approaches for distributed sensor network security. Tech. Rep. 00-010, NAI Labs. (2000).
Camtepe S., Yener B.: Combinatorial design of key predistribution mechanisms for wireless sensor networks. In: ESORICS 2004 Proceedings. Lecture Notes in Computer Science, vol. 3193, pp. 293–308. Springer, New York (2004).
Camtepe S., Yener B.: Combinatorial design of key predistribution mechanisms for wireless sensor networks. IEEE/ACM Trans. Netw. 15, 346–358 (2007)
Chakrabarti D., Maitra S., Roy B.: A key-predistribution scheme for wireless sensor networks: merging blocks in combinatorial design. Int. J. Inform. Secur. 5, 105–114 (2006)
Chan H., Perrig A., Song D.: Random key predistribution schemes for sensor networks. In: Proceedings of the 2003 Symposium on Security and Privacy. IEEE Computer Society, pp. 197–213 (2003).
Clatworthy W.H.: Tables of Two-Associate Partially Balanced Designs. Natl. Bur. Standards Appl. Math. Ser. No. 63. Washington DC (1973).
Dey A.: Incomplete Block Designs. Hindustan Book Agency, New Delhi (2010)
Dong J., Pei D., Wang X.: A key predistribution scheme based on 3-designs. In: INSCRYPT 2007. Lecture Notes in Computer Science, vol. 4990, pp. 81–92, Springer, Berlin (2008).
Du W., Deng J., Han Y., Varshney P., Katz J., Khalili A.: A pairwise key predistribution scheme for wireless sensor networks. ACM Trans. Inform. Syst. Secur. 8, 228–258 (2005)
Eschenauer L., Gligor V.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security. ACM Press, pp. 41–47 (2002).
Kirkman T.P.: On a problem in combinations. Cambr. Dublin Math. J. 2, 192–204 (1847)
Lee J., Stinson D.: A combinatorial approach to key predistribution for distributed sensor networks. In: IEEE Wireless Communications and Networking Conference (WCNC’05), vol. 2. pp. 1200–1205. IEEE Communications Society (2005).
Lee J., Stinson D.: Deterministic key predistribution schemes for distributed sensor networks. In: SAC 2004 Proceedings. Lecture Notes in Computer Science, vol. 3357, pp. 294–307. Springer, New York (2005).
Lee J., Stinson D.: On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs. ACM Trans. Inform. Syst. Secur. 11, Article 5 (2008).
Martin K.: On the applicability of combinatorial designs to key predistribution for wireless sensor networks. In: Proceedings of the 2nd International Workshop on Coding and Cryptology. Springer, Berlin (2009).
Martin K., Blackburn S.R., Etzion T., Paterson M.B.: Distinct difference configurations: multihop paths and key predistribution in sensor networks. IEEE Trans. Inform. Theory 56, 3961–3972 (2010)
Martin K., Stinson D.R., Paterson M.B.: Key predistribution for homogeneous wireless sensor networks with group deployment of nodes. ACM Trans. Sens. Netw. 7(2) (2011).
Paterson M.B., Stinson D.R.: A Unified Approach to Combinatorial Key Predistribution Schemes for Sensor Networks. http://eprint.iacr.org/2011/076.pdf (2011). Preprint.
Roman R., Zhou J., Lopez J.: On the security of wireless sensor network. In: ICCSA 2005 Proceedings. Lecture Notes in Computer Science, vol. 3482, pp. 681–690. Springer, New York (2005).
Ruj S., Roy B.: Key predistribution using partially balanced designs in wireless sensor networks. In: Proceedings of ISPA 2007. Lecture Notes in Computer Science, vol. 4742, pp. 431–445 (2007).
Ruj S., Seberry J., Roy B.: Key predistribution schemes using block designs in wireless sensor networks. In: Computational Science and Engineering, 2009. CSE ’09., pp. 873–878 (2009) doi:10.1109/CSE.2009.35.
Stinson D.: Combinatorial Designs: Constructions and Analysis. Springer, Berlin (2003)
Street A.P., Street D.J.: Combinatorics of Experimental Design. Clarendon Press, Oxford (1987)
Younis M.F., Ghumman K., Eltoweissy C.V.: Location-aware combinatorial key management scheme for clustered sensor networks. IEEE Trans. Parallel Distrib. Syst. 17, 865–882 (2006)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by R. Steinwandt.
Rights and permissions
About this article
Cite this article
Bose, M., Dey, A. & Mukerjee, R. Key predistribution schemes for distributed sensor networks via block designs. Des. Codes Cryptogr. 67, 111–136 (2013). https://doi.org/10.1007/s10623-011-9590-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-011-9590-1