{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:57:55Z","timestamp":1772283475301,"version":"3.50.1"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2008,3]]},"abstract":"<jats:p>In this paper, we discuss the use of combinatorial set systems (combinatorial designs) in the design of key predistribution schemes (KPSs) for sensor networks. We show that the performance of a KPS can be improved by carefully choosing a certain class of set systems as \u201ckey ring spaces\u201d. Especially, we analyze KPSs based on a type of combinatorial design known as a &lt;it&gt;transversal design&lt;\/it&gt;. We employ two types of transversal designs, which are represented by the set of all linear polynomials and the set of quadratic polynomials (over some finite field), respectively. These KPSs turn out to have significant efficiency in a shared-key discovery phase without degrading connectivity and resiliency.<\/jats:p>","DOI":"10.1145\/1330332.1330333","type":"journal-article","created":{"date-parts":[[2008,2,28]],"date-time":"2008-02-28T14:02:33Z","timestamp":1204207353000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":81,"title":["On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs"],"prefix":"10.1145","volume":"11","author":[{"given":"Jooyoung","family":"Lee","sequence":"first","affiliation":[{"name":"National Security Research Institute"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]}],"member":"320","published-online":{"date-parts":[[2008,5]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Lecture Notes in Computer Science","volume":"209","author":"Blom R.","year":"1985"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2717"},{"key":"e_1_2_1_3_1","unstructured":"Carmen D. Kruus P. and Matt B. 2000. Constraints and approaches for distributed sensor network security. Tech. rep. 00-010 NAI Labs. Carmen D. Kruus P. and Matt B. 2000. Constraints and approaches for distributed sensor network security. Tech. rep. 00-010 NAI Labs."},{"key":"e_1_2_1_4_1","volume-title":"Lecture Notes in Computer Science","volume":"3193","author":"\u00c7amtepe S."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.892879"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11556992_7"},{"key":"e_1_2_1_7_1","unstructured":"Chan H. Perrig A. and Song D. 2003. Random key predistribution schemes for sensor networks. In &lt;it&gt;Proceedings of the 2003 Symposium on Security and Privacy&lt;\/it&gt;. IEEE Computer Society 197--213. Chan H. Perrig A. and Song D. 2003. Random key predistribution schemes for sensor networks. In &lt;it&gt;Proceedings of the 2003 Symposium on Security and Privacy&lt;\/it&gt;. IEEE Computer Society 197--213."},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Colbourn C. and Dinitz J. Eds. 2007. &lt;it&gt;The CRC Handbook of Combinatorial Designs&lt;\/it&gt; 2nd Ed. CRC Press Boca Raton. Colbourn C. and Dinitz J. Eds. 2007. &lt;it&gt;The CRC Handbook of Combinatorial Designs&lt;\/it&gt; 2nd Ed. CRC Press Boca Raton.","DOI":"10.1201\/9781420010541"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065545.1065548"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586117"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Lee J. and Stinson D. 2005a. A combinatorial approach to key predistribution for distributed sensor networks. In &lt;it&gt;IEEE Wireless Communications and Networking Conference (WCNC'05)&lt;\/it&gt;. Vol. 2. IEEE Communications Society 1200--1205. Lee J. and Stinson D. 2005a. A combinatorial approach to key predistribution for distributed sensor networks. In &lt;it&gt;IEEE Wireless Communications and Networking Conference (WCNC'05)&lt;\/it&gt;. Vol. 2. IEEE Communications Society 1200--1205.","DOI":"10.1109\/WCNC.2005.1424679"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30564-4_21"},{"key":"e_1_2_1_13_1","first-page":"251","volume":"1","author":"Lee J.","journal-title":"J. Combin. Designs"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_13"},{"key":"e_1_2_1_15_1","volume-title":"Lecture Notes in Computer Science","volume":"773","author":"Leighton T."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1053283.1053287"},{"key":"e_1_2_1_17_1","unstructured":"Ramkumar M. and Memon N. 2003. Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks. In &lt;it&gt;IEEE GLOBECOM 2003&lt;\/it&gt;. IEEE Communications Society 1405--1409. Ramkumar M. and Memon N. 2003. Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks. In &lt;it&gt;IEEE GLOBECOM 2003&lt;\/it&gt;. IEEE Communications Society 1405--1409."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.842555"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11424857_75"},{"key":"e_1_2_1_20_1","unstructured":"Stinson D. 2003. &lt;it&gt;Combinatorial Designs: Constructions and Analysis&lt;\/it&gt;. Springer Berlin Germany. Stinson D. 2003. &lt;it&gt;Combinatorial Designs: Constructions and Analysis&lt;\/it&gt;. Springer Berlin Germany."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30564-4_20"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1330332.1330333","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1330332.1330333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:31Z","timestamp":1750258051000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1330332.1330333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["10.1145\/1330332.1330333"],"URL":"https:\/\/doi.org\/10.1145\/1330332.1330333","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"value":"1094-9224","type":"print"},{"value":"1557-7406","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]},"assertion":[{"value":"2005-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}