Unconditionally-secure key pre-distribution for triangular grid based wireless sensor network. (English) Zbl 1293.94088
Summary: We present an unconditionally-secure key pre-distribution scheme for a wireless sensor network using \(t\)-degree bivariate polynomials. The proposed scheme is proven to be perfectly resilient against both node disconnection and link failure. The memory requirements, computation and communication overheads of our scheme are also favorable. Our scheme demonstrates superior performance compared to the existing similar schemes.
MSC:
| 94A60 | Cryptography |
References:
| [1] | Blundo, C., Santis, A.D., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-secure key distribution for dynamic conferences. In: Advances in Cryptology–CRYPTO’92. LNCS, vol. 740, pp. 471–486 (1993) · Zbl 0816.94014 |
| [2] | Chan, H., Perrig, A., Song, D.X.: Random key predistribution schemes for sensor network. In: IEEE Symposium on Security and Privacy, pp. 197–213 (2003) |
| [3] | Dai, H., Xu, H.: An improved polynomial-based key predistribution scheme for wireless sensor networks. In: International Conference on Communications, Circuits and Systems, ICCCAS 2008, pp. 424–428 (2008) |
| [4] | Das, A.K., Sengupta, I.: An effective group-based key establishment scheme for large-scale wireless sensor networks using bivariate polynomials. In: COMSWARE 2008, pp. 9–16 (2008) |
| [5] | Delgosha, F., Fekri, F.: Key pre-distribution in wireless sensor networks using multivariate polynomials. In: IEEE Commun. Soc. Conf. Sensor and Ad Hoc Commun. and Networks–SECON05 (2005) |
| [6] | Du, W., Deng, J., Han, Y., Chen, S., Varshney, P.: 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, pp. 586–597. IEEE Press, New York (2004) |
| [7] | Du, W., Deng, J., Han, Y.S., Varshney, P.K.: A key predistribution scheme for sensor networks using deployment knowledge. IEEE Trans. Dependable Secure Comput. 3(1), 62–77 (2006) · doi:10.1109/TDSC.2006.2 |
| [8] | Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: ACM CCS, pp. 41–47. ACM, New York (2002) |
| [9] | Lee, J., Stinson, D.R.: On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs. ACM Trans. Inf. Syst. Secur. 11(2), 1 (2008) |
| [10] | Li, G., He, J., Fu, W.Y.: A hexagon-based key predistribution scheme in sensor networks. In: International Conference on Parallel Processing Workshops (ICPPW’06), pp. 175–180 (2006) |
| [11] | Liu, D., Ning, P.: Location-based pairwise key establishments for static sensor networks. In: Proceedings of the 1st ACM Workshop Security of Ad Hoc and Sensor Networks, Fairfax, VA (2003) |
| [12] | Liu, D., Ning, P.: Improving key pre-distribution with deployment knowledge in static sensor networks. ACM Trans. Sens. Netw. 1(2), 204–239 (2005) · doi:10.1145/1105688.1105691 |
| [13] | Liu, D., Ning, P., Li, R.: Establishing pairwise keys in distributed sensor networks. ACM Trans. Inf. Syst. Secur. 8(1), 41–77 (2005) · doi:10.1145/1053283.1053287 |
| [14] | Ruj, S., Roy, B.: Key predistributions using partially balanced designs in wireless sensor networks. In: ISPA. LNCS, vol. 4742, pp. 431–445. Springer, Berlin (2007) |
| [15] | Simonova, K., Ling, A.C.H., Wang, X.S.: Location-aware key predistribution scheme for wide area wireless sensor networks. In: SASN’06 (2006) |
| [16] | Sridhar, V., Raghavendar, V.: Key predistribution scheme for grid based wireless sensor networks using quadruplex polynomial shares per node. Proc. Comput. Sci. 5, 132–140 (2011) · doi:10.1016/j.procs.2011.07.019 |
| [17] | Stinson, D.R.: Cryptography: Theory and Practice. Chapman & Hall/CRC Press, London (2005) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
