{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:22:24Z","timestamp":1765959744197,"version":"build-2065373602"},"reference-count":18,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSAN"],"abstract":"<jats:p>We propose a new authenticated key agreement scheme based on Blom\u2019s scheme, but using multiple master keys and public keys in permutations to compute the private keys in each node. The computations are over a small prime field, and by storing them in a random order in the node, the private-public-master-key associations (PPMka) of the private keys are lost. If a node is captured, the PPMka of the private keys cannot be determined with certainty, making it difficult to begin to attack the scheme. We obtained analytical results to show that, using suitable keying parameters, the probability of discovering the correct PPMka can be made so small, that a very powerful adversary needs to capture the entire network of tens of thousands of nodes or expend an infeasible amount of effort to try all of the possible solutions. We verified our results using computer-simulated attacks on the scheme. The unknown PPMka enables our scheme to break free from the capture threshold of the original Blom\u2019s scheme, so that it can be used in large networks of low-resource devices, such as sensor nodes.<\/jats:p>","DOI":"10.3390\/jsan3030181","type":"journal-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T12:08:07Z","timestamp":1404216487000},"page":"181-206","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Authenticated Key Agreement Scheme for Wireless Sensor Networks"],"prefix":"10.3390","volume":"3","author":[{"given":"Mee","family":"Yang","sequence":"first","affiliation":[{"name":"School of Computer and Mathematical Sciences, Auckland University of Technology, Auckland 1142, New Zealand"}]},{"given":"Adnan","family":"Al-Anbuky","sequence":"additional","affiliation":[{"name":"School of Engineering, Auckland University of Technology, Auckland 1142, New Zealand"}]},{"given":"William","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer and Mathematical Sciences, Auckland University of Technology, Auckland 1142, New Zealand"}]}],"member":"1968","published-online":{"date-parts":[[2014,7,1]]},"reference":[{"key":"ref_1","unstructured":"Yang, M.L., Al-Anbuky, A., and Liu, W. (2012, January 24\u201329). A Fast and Efficient Key Agreement Scheme for Wireless Sensor Networks. Proceedings of International Conference on Wireless and Mobile Communications, Venice, Italy."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Yang, M.L., Al-Anbuky, A., and Liu, W. (2013, January 29\u201331). The Multiple-Key Blom\u2019s Scheme for Key Establishment in Mobile Ad Hoc Sensor Networks. Proceedings of the 19th Asia-Pacific Conference on Communications, Bali, Indonesia.","DOI":"10.1109\/APCC.2013.6765983"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Cuppens-Boulahia, N., Jajodia, S., and Cuppens, F. (2014). ICT Systems Security and Privacy Protection, Springer.","DOI":"10.1007\/978-3-642-55415-5"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Blom, R. (1983). Non-Public Key Distribution. Advances in Cryptology, Springer.","DOI":"10.1007\/978-1-4757-0602-4_22"},{"key":"ref_5","unstructured":"Blom, R. (1984). An Optimal Class of Symmetric Key Generation Systems, Linkopping University. Technical Report."},{"key":"ref_6","unstructured":"Menezes, A.J., Oorschot, P.C., and Vanstone, S.A. (2001). Handbook of Applied Cryptography, CRC."},{"key":"ref_7","unstructured":"Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., and Yung, M. (1995). Perfectly-Secure Key Distribution for Dynamic Conferences, Universita di Salerno. Technical Report."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Liu, D., and Ning, P. (2003, January 27\u201330). Establishing Pairwise Keys in Distributed Sensor Networks. Proceedings of the 10th ACM Conference on Computer and Communications Security, Washington, DC, USA.","DOI":"10.1145\/948109.948119"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Eschenauer, L., and Gligor, V.D. (2002, January 18\u201322). A key-management scheme for distributed sensor networks. Proceedings of the 9th ACM Conference on Computer and Communications Security, Washington, DC, USA.","DOI":"10.1145\/586110.586117"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Du, W., Han, S.Y., Deng, J., and Varshney, P.K. (2003, January 27\u201330). A Pairwise Key Pre-distribution Scheme for Wireless Sensor Networks. Proceedings of the Conference on Computer and Communications Security, Washington, DC, USA.","DOI":"10.1145\/948109.948118"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-540-30564-4_21","article-title":"Deterministic Key Predistribution Schemes for Distributed Sensor Networks","volume":"Volume 3357","author":"Lee","year":"2005","journal-title":"Selected Areas in Cryptography"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Chen, N., Yao, J.B., and Wen, G.J. (2008, January 29\u201331). An Improved Matrix Key Pre-distribution Scheme for Wireless Sensor Networks. Proceedings of International Conference on Embedded Software Systems, Chengdu, China.","DOI":"10.1109\/ICESS.2008.44"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Zhang, W., Zhu, S., and Cao, G. (2007, January 9\u201314). A Random Perturbation-Based Scheme for Pairwise Key Establishment in Sensor Networks. Proceedings of MobiHoc\u201907, Montr\u00ef\u00bf\u00bd\u00ef\u00bf\u00bdal, QC, Canada.","DOI":"10.1145\/1288107.1288120"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Chien, H.Y., Chen, R.C., and Shen, A. (2008, January 25\u201328). Efficient Key Pre-distribution for Sensor Nodes with Strong Connectivity and Low Storage Space. Poceedings of the 22nd International Conference on Advanced Information Networking and Applications (AINA\u201908), Okinawa, Japan.","DOI":"10.1109\/AINA.2008.24"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1109\/TIFS.2010.2050140","article-title":"Noninteractive Pairwise Key Establishment for Sensor Networks","volume":"5","author":"Yu","year":"2010","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_16","unstructured":"Zhou, J., and He, M. (2009). Information Security Applications, Springer."},{"key":"ref_17","unstructured":"Memsic Corp MICAz Datasheet. Available online: http:\/\/www.docstoc.com\/docs\/20049970\/MICAz-Datasheet."},{"key":"ref_18","unstructured":"Levis, P., and Gay, D. (2006). TinyOS Programming, Cambridge University Press. Available online: http:\/\/csl.stanford.edu\/~pal\/pubs\/tinyos-programming.pdf."}],"container-title":["Journal of Sensor and Actuator Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2224-2708\/3\/3\/181\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:13:11Z","timestamp":1760217191000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2224-2708\/3\/3\/181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,1]]},"references-count":18,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2014,9]]}},"alternative-id":["jsan3030181"],"URL":"https:\/\/doi.org\/10.3390\/jsan3030181","relation":{},"ISSN":["2224-2708"],"issn-type":[{"type":"electronic","value":"2224-2708"}],"subject":[],"published":{"date-parts":[[2014,7,1]]}}}