Subscribe

Issue No.11 - Nov. (2013 vol.62)

pp: 2224-2237

Sushmita Ruj , Indian Statistical Institute, Kolkata, India

Amiya Nayak , University of Ottawa, Ottawa

Ivan Stojmenovic , University of Ottawa, Ottawa

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2012.138

ABSTRACT

We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). Several types of combinatorial designs have already been applied in key establishment. A $(BIBD(v,b,r,k,\lambda ))$ (or $(t-(v,b,r,k,\lambda ))$ design) can be mapped to a sensor network, where $(v)$ represents the size of the key pool, $(b)$ represents the maximum number of nodes that the network can support, and $(k)$ represents the size of the key chain. Any pair (or $(t)$-subset) of keys occurs together uniquely in exactly $(\lambda)$ nodes; $(\lambda = 2)$ and $(\lambda = 3)$ are used to establish unique pairwise or triple keys. We use several known constructions of designs with $(\lambda =2)$, to predistribute keys in sensors. We also describe a new construction of a design called strong Steiner trade and use it for pairwise key establishment. To the best of our knowledge, this is the first paper on application of trades to key distribution. Our scheme is highly resilient against node capture attacks (achieved by key refreshing) and is applicable for mobile sensor networks (as key distribution is independent on the connectivity graph), while preserving low storage, computation and communication requirements. We introduce a novel concept of triple key distribution, in which three nodes share common keys, and discuss its application in secure forwarding, detecting malicious nodes and key management in clustered sensor networks. We present a polynomial-based and a combinatorial approach (using trades) for triple key distribution. We also extend our construction to simultaneously provide pairwise and triple key distribution scheme, and apply it to secure data aggregation.

INDEX TERMS

Mobile communication, Protocols, Resilience, Mobile computing, Cryptography, Wireless sensor networks,Steiner trades, Key predistribution, pairwise-keys, resilience, secure-routing, secure-aggregation

CITATION

Sushmita Ruj, Amiya Nayak, Ivan Stojmenovic, "Pairwise and Triple Key Distribution in Wireless Sensor Networks with Applications",

*IEEE Transactions on Computers*, vol.62, no. 11, pp. 2224-2237, Nov. 2013, doi:10.1109/TC.2012.138REFERENCES

- [1] K. Römer and F. Mattern, "The Design Space of Wireless Sensor Networks,"
IEEE Wireless Comm., vol. 11, no. 6, pp. 54-61, Dec. 2004.- [2] H. Chan, A. Perrig, and D.X. Song, "Random Key Predistribution Schemes for Sensor Networks,"
Proc. IEEE Symp. Security and Privacy, pp. 197-213, 2003.- [3] W. Dargie and C. Poellabauer,
Fundamentals of Wireless Sensor Networks: Theory and Practice. Wiley, 2010.- [4] A. Lachenmann, P.J. Marrón, M. Gauger, D. Minder, O. Saukh, and K. Rothermel, "Removing the Memory Limitations of Sensor Networks with Flash-Based Virtual Memory,"
Proc. Second ACM SIGOPS/EuroSys European Conf. Computer (EuroSys), pp. 131-144, 2007.- [5] L. Eschenauer and V.D. Gligor, "A Key-Management Scheme for Distributed Sensor Networks,"
Proc. Ninth ACM Conf. Computer and Comm. Security, pp. 41-47, 2002.- [6] H. Chan and A. Perrig, "PIKE: Peer Intermediaries for Key Establishment in Sensor Networks,"
Proc. IEEE INFOCOM, pp. 524-535, 2005.- [7] Z. Yu and Y. Guan, "A Key Management Scheme Using Deployment Knowledge for Wireless Sensor Networks,"
IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 10, pp. 1411-1425, Oct. 2008.- [8] D. Liu and P. Ning, "Improving Key Predistribution with Deployment Knowledge in Static Sensor Networks,"
ACM Trans. Sensor Networks, vol. 1, no. 2, pp. 204-239, 2005.- [9] W. Du, J. Deng, Y.S. Han, and P.K. Varshney, "A Key Predistribution Scheme for Sensor Networks Using Deployment Knowledge,"
IEEE Trans. Dependable and Secure Computing, vol. 3, no. 1, pp. 62-77, Jan. 2006.- [10] D.R. Stinson,
Combinatorial Designs: Constructions and Analysis. Springer, 2004.- [11] R. Blom, "An Optimal Class of Symmetric Key Generation Systems,"
Proc. Workshop Advances in Cryptology: Theory and Application of Cryptographic Techniques (EUROCRYPT '84), pp. 335-338, 1984.- [12] C. Blundo, A.D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, "Perfectly-Secure Key Distribution for Dynamic Conferences,"
Proc. 12th Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO '92), vol. 740, pp. 471-486, 1993.- [13] W. Du, J. Deng, Y.S. Han, P.K. Varshney, J. Katz, and A. Khalili, "A Pairwise Key Predistribution Scheme for Wireless Sensor Networks,"
ACM Trans. Information and System Security, vol. 8, no. 2, pp. 228-258, 2005.- [14] Z. Wan and M. Gu, "USOR: An Unobservable Secure on-Demand Routing Protocol for Ad Hoc Networks,"
IEEE Trans. Wireless Comm., vol. 11, no. 5, pp. 1922-1932, May 2012.- [15] J. Lee and D.R. Stinson, "On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs,"
ACM Trans. Information and System Security, vol. 11, no. 2,article no. 1, 2008.- [16] D. Xu, J. Huang, J. Dwoskin, M. Chiang, and R. Lee, "Re-Examining Probabilistic versus Deterministic Key Management,"
Proc. IEEE Int'l Symp. Imformation Theory (ISIT), pp. 2586-2590, 2007.- [17] L. Wang and R. Wei, "Reputation Model Based Dynamic Pair-Wise Key Establishment Scheme for Sensor Networks,"
Ad Hoc and Sensor Wireless Networks, vol. 9, nos. 3/4, pp. 163-177, 2010.- [18] R.D. Pietro, L.V. Mancini, and A. Mei, "Energy Efficient Node-to-Node Authentication and Communication Confidentiality in Wireless Sensor Networks,"
Wireless Networks, vol. 12, no. 6, pp. 709-721, 2006.- [19] C.J. Mitchell and F. Piper, "Key Storage in Secure Networks,"
Discrete Applied Math., vol. 21, pp. 215-228, 1988.- [20] S.A. Çamtepe and B. Yener, "Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks,"
Proc. European Symp. Research in Computer Security (ESORICS), pp. 293-308, 2004.- [21] S.A. Çamtepe and B. Yener, "Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks,"
IEEE/ACM Trans. Network, vol. 15, no. 2, pp. 346-358, Apr. 2007.- [22] C.J. Colbourn and J.H. Dinitz,
The CRC Handbook of Combinatorial Designs. CRC Press, 1995.- [23] J. Lee and D.R. Stinson, "A Combinatorial Approach to Key Predistribution for Distributed Sensor Networks,"
Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), pp. 1200-1205, 2005.- [24] S. Ruj and B. Roy, "Key Predistribution Using Partially Balanced Designs in Wireless Sensor Networks,"
Proc. Fifth Int'l Conf. Parallel and Distributed Processing and Applications (ISPA), pp. 431-445, 2007.- [25] S.R. Blackburn, T. Etzion, K.M. Martin, and M.B. Paterson, "Efficient Key Predistribution for Grid-Based Wireless Sensor Networks,"
Proc. Third Int'l Conf. Information Theoretic Security (ICITS), pp. 54-69, 2008.- [26] A. Joux, "A One Round Protocol for Tripartite Diffie-Hellman,"
J. Cryptology, vol. 17, no. 4, pp. 263-276, 2004.- [27] M. Sudan, "Algorithmic Introduction to Coding Theory, Lecture 4," 2004, http://courses.csail.mit.edu/6.897/spring04 L25. pdf, Last accessed on Oct. 28, 2011.
- [28] S.S. Al-Riyami and K.G. Paterson, "Tripartite Authenticated Key Agreement Protocols from Pairings,"
IMA Int'l Conf., pp. 332-359, 2003.- [29] D. Freeman, M. Scott, and E. Teske, "A Taxonomy of Pairing-Friendly Elliptic Curves,"
J. Cryptology, vol. 23, no. 2, pp. 224-280, 2010.- [30] S. Ruj, A. Nayak, and I. Stojmenovic, "Fully Secure Pairwise and Triple Key Distribution in Wireless Sensor Networks Using Combinatorial Designs,"
Proc. IEEE INFOCOM, pp. 226-330, 2011.- [31] S. Zhu, S. Xu, S. Setia, and S. Jajodia, "Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach,"
Proc. IEEE 11th Int'l Conf. Network Protocols (ICNP), pp. 326-335, 2003.- [32] R. Canetti, J.A. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, "Multicast Security: A Taxonomy and Some Efficient Constructions,"
Proc. IEEE INFOCOM, pp. 708-716, 1999.- [33] D.R. Stinson,
Cryptography: Theory and Practice, third ed. CRC Press Inc., 2006.- [34] P. Traynor, H. Choi, G. Cao, S. Zhu, and T.L. Porta, "Establishing Pair-Wise Keys in Heterogeneous Sensor Networks,"
Proc. IEEE INFOCOM, 2006.- [35] D. Huang and D. Medhi, "Secure Pairwise Key Establishment in Large-Scale Sensor Networks: An Area Partitioning and Multigroup Key Predistribution Approach,"
ACM Trans. Sensor Networks, vol. 3, no. 3, pp. 16:1-16:34, 2007.- [36] E.J. Billington, "Combinatorial Trades: A Survey of Recent Results,"
DESIGNS 2002, pp. 47-67, Kluwer Academic Publishers, 2003.- [37] G.B. Khosrovshahi and B. Tayfeh-Rezaie, "Trades and $t$ -Designs,"
Surveys in Combinatorics, pp. 91-112, 2009.- [38] N. Hamilton and A. Khodkar, "On Minimum Possible Volumes of Strong Steiner Trades,"
Australasian J. Combinatorics, vol. 20, pp. 197-203, 1999.- [39] K.M. Martin, "On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks,"
Proc. Int'l Conf. Coding and Cryptology (IWCC), pp. 124-145, 2009.- [40] S. Ruj, A. Nayak, and I. Stojmenovic, "Key Predistribution in Wireless Sensor Networks When Sensors Are within Communication Range, Chapter 24,"
Theoretical Aspects of Distributed Computing in Sensor Networks, Monographs in Theoretical Computer Science: An EATCS Series, S. Nikoletseas and J. Rolim, eds., pp. 787-832, Springer, 2011.- [41] J. Yan, J. Ma, F. Li, and S.-J. Moon, "Key Pre-Distribution Scheme with Node Revocation for Wireless Sensor Networks,"
Ad Hoc and Sensor Wireless Networks, vol. 10, nos. 2/3, pp. 235-251, 2010.- [42] R.D. Pietro, G. Oligeri, C. Soriente, and G. Tsudik, "Intrusion-Resilience in Mobile Unattended WSNs,"
Proc. IEEE INFOCOM, pp. 2303-2311, 2010.- [43] K.M. Martin, M.B. Paterson, and D.R. Stinson, "Key Predistribution for Homogeneous Wireless Sensor Networks with Group Deployment of Nodes,"
ACM Trans. Sensor Networks, vol. 7, no. 2, 2010.- [44] F. Piper and P. Wild, "The Use of Combinatorics in Key Management,"
IMA J. Math. Applied in Business and Industry, vol. 7, pp. 207-218, 1996.- [45] The Pairing-Based Cryptography Library, http://crypto.stanford. edupbc/, 2013.
- [46] Mike Scott, "Efficient Implementation of Cryptographic Pairings," http://ecrypt-ss07.rhul.ac.uk/Slides/Thursday mscott- samos07.pdf, 2013.
- [47] J. Kong and X. Hong, "ANODR: Anonymous on Demand Routing with Untraceable Routes for Mobile Ad-Hoc Networks,"
Proc. ACM MobiHoc, pp. 291-302, 2003.- [48] Y. Zhang, W. Liu, and W. Lou, "Anonymous Communications in Mobile Ad Hoc Networks,"
Proc. IEEE INFOCOM, pp. 1940-1951, 2005.- [49] S. Seys and B. Preneel, "ARM: Anonymous Routing Protocol for Mobile Ad Hoc Networks,"
Proc. IEEE 20th Int'l Conf. Advanced Information Networking and Applications (AINA), vol. 2, pp. 133-137, 2006.- [50] M. Heissenbüttel, T. Braun, T. Bernoulli, and M. Wälchli, "BLR: Beacon-Less Routing Algorithm for Mobile Ad Hoc Networks,"
Computer Comm., vol. 27, no. 11, pp. 1076-1086, 2004.- [51] S. Zhu, S. Setia, and S. Jajodia, "LEAP: Efficient Security Mechanisms for Large-Scale Distributed Sensor Networks,"
Proc. ACM Conf. Computer and Comm. Security, pp. 62-72, 2003.- [52] Y. Cheng and D.P. Agrawal, "An Improved Key Distribution Mechanism for Large-Scale Hierarchical Wireless Sensor Networks,"
Ad Hoc Networks, vol. 5, no. 1, pp. 35-48, 2007. |