{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T02:40:07Z","timestamp":1744252807823,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341588"},{"type":"electronic","value":"9783642341595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34159-5_5","type":"book-chapter","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T07:34:12Z","timestamp":1349508852000},"page":"62-82","source":"Crossref","is-referenced-by-count":4,"title":["On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Michelle","family":"Kendall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keith M.","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Analyzing Graphs, http:\/\/docs.yworks.com\/yfiles\/doc\/developers-guide\/analysis.html"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-85093-9_16","volume-title":"Information Theoretic Security","author":"S.R. Blackburn","year":"2008","unstructured":"Blackburn, S.R., Martin, K.M., Paterson, M.B., Stinson, D.R.: Key Refreshing in Wireless Sensor Networks. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol.\u00a05155, pp. 156\u2013170. Springer, Heidelberg (2008)"},{"issue":"4-5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/0020-0190(81)90050-8","volume":"13","author":"M. Blum","year":"1981","unstructured":"Blum, M., Karp, R.M., Vornberger, O., Papadimitriu, C.H., Yannakakis, M.: The Complexity of Testing whether a Graph is a Superconcentrator. Information Processing Letters\u00a013(4-5), 164\u2013167 (1981)","journal-title":"Information Processing Letters"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Camtepe, S.A., Yener, B.: Key Distribution Mechanisms for Wireless Sensor Networks: a Survey. Rensselaer Polytechnic Institute, Computer Science Department, Tech. Rep. TR-05-07 (2005)","DOI":"10.1109\/ICC.2006.255107"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Camtepe, S.A., Yener, B., Yung, M.: Expander Graph Based Key Distribution Mechanisms in Wireless Sensor Networks. In: ICC 2006, IEEE International Conference on Communications, pp. 2262\u20132267 (2006)","DOI":"10.1109\/ICC.2006.255107"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/SECPRI.2003.1199337","volume-title":"SP 2003: Proceedings of the 2003 IEEE Symposium on Security and Privacy","author":"H. Chan","year":"2003","unstructured":"Chan, H., Perrig, A., Song, D.: Random Key Predistribution Schemes for Sensor Networks. In: SP 2003: Proceedings of the 2003 IEEE Symposium on Security and Privacy, pp. 197\u2013213. IEEE Computer Society, Washington, DC (2003)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chen, C.-Y., Chao, H.-C.: A Survey of Key Distribution in Wireless Sensor Networks. In: Security and Communication Networks (2011)","DOI":"10.1002\/sec.354"},{"key":"5_CR8","unstructured":"Chen, W.-K.: Applied Graph Theory. University of Virginia, North-Holland (1971)"},{"key":"5_CR9","unstructured":"Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, California State University, Fresno (1994)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-16988-5_9","volume-title":"Algorithms for Sensor Systems","author":"J. Cicho\u0144","year":"2010","unstructured":"Cicho\u0144, J., Go\u0142\u0119biewski, Z., Kuty\u0142owski, M.: From Key Predistribution to Key Redistribution. In: Scheideler, C. (ed.) ALGOSENSORS 2010. LNCS, vol.\u00a06451, pp. 92\u2013104. Springer, Heidelberg (2010)"},{"key":"5_CR11","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On the Evolution of Random Graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 17\u201361 (1960)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/586110.586117","volume-title":"CCS 2002: Proceedings of the 9th ACM Conference on Computer and Communications Security","author":"L. Eschenauer","year":"2002","unstructured":"Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: CCS 2002: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41\u201347. ACM, New York (2002)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/11964254_12","volume-title":"Security and Privacy in Ad-Hoc and Sensor Networks","author":"S.K. Ghosh","year":"2006","unstructured":"Ghosh, S.K.: On Optimality of Key Pre-distribution Schemes for Distributed Sensor Networks. In: Butty\u00e1n, L., Gligor, V.D., Westhoff, D. (eds.) ESAS 2006. LNCS, vol.\u00a04357, pp. 121\u2013135. Springer, Heidelberg (2006)"},{"issue":"04","key":"5_CR14","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S. Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bulletin of the American Mathematical Society\u00a043(04), 439\u2013562 (2006)","journal-title":"Bulletin of the American Mathematical Society"},{"issue":"6","key":"5_CR15","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM\u00a016(6), 372\u2013378 (1973)","journal-title":"Commun. ACM"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Rubinfeld, R.: Short Paths in Expander Graphs. In: Annual Symposium on Foundations of Computer Science, vol.\u00a037, pp. 86\u201395 (1996)","DOI":"10.1109\/SFCS.1996.548467"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-30564-4_21","volume-title":"Selected Areas in Cryptography","author":"J. Lee","year":"2004","unstructured":"Lee, J., Stinson, D.R.: Deterministic Key Predistribution Schemes for Distributed Sensor Networks. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 294\u2013307. Springer, Heidelberg (2004)"},{"issue":"2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.entcs.2008.05.004","volume":"192","author":"K.M. Martin","year":"2008","unstructured":"Martin, K.M., Paterson, M.B.: An Application-Oriented Framework for Wireless Sensor Network Key Establishment. Electronic Notes in Theoretical Computer Science\u00a0192(2), 31\u201341 (2008)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"5_CR19","unstructured":"Paterson, M.B., Stinson, D.R.: A unified approach to combinatorial key predistribution schemes for sensor networks. Cryptology ePrint Archive, Report 076 (2011)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/SFCS.2000.892006","volume-title":"Proceedings of the 41st Annual Symposium on Foundations of Computer Science","author":"O. Reingold","year":"2000","unstructured":"Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 3\u201328. IEEE Computer Society, Washington, DC (2000)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Shafiei, H., Mehdizadeh, A., Khonsari, A., Ould-Khaoua, M.: A Combinatorial Approach for Key-Distribution in Wireless Sensor Networks. In: Global Telecommunications Conference, IEEE GLOBECOM 2008, pp. 1\u20135. IEEE (2008)","DOI":"10.1109\/GLOCOM.2008.ECP.34"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Tarjan, R.: A Note on Finding the Bridges of a Graph. Information Processing Letters, 160\u2013161 (1974)","DOI":"10.1016\/0020-0190(74)90003-9"},{"issue":"11-12","key":"5_CR23","doi-asserted-by":"publisher","first-page":"2314","DOI":"10.1016\/j.comcom.2007.04.009","volume":"30","author":"Y. Xiao","year":"2007","unstructured":"Xiao, Y., Rayi, V.K., Sun, B., Du, X., Hu, F., Galloway, M.: A survey of key management schemes in wireless sensor networks. Computer Communications\u00a030(11-12), 2314\u20132341 (2007)","journal-title":"Computer Communications"}],"container-title":["Lecture Notes in Computer Science","Research in Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34159-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T02:05:31Z","timestamp":1744250731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34159-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341588","9783642341595"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34159-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}