{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:06:59Z","timestamp":1742382419227},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540490180"},{"type":"electronic","value":"9783540498230"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/978-3-540-49823-0_22","type":"book-chapter","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T12:12:32Z","timestamp":1182859952000},"page":"314-323","source":"Crossref","is-referenced-by-count":7,"title":["Logarithmic Keying of Communication Networks"],"prefix":"10.1007","author":[{"given":"Mohamed G.","family":"Gouda","sequence":"first","affiliation":[]},{"given":"Sandeep S.","family":"Kulkarni","sequence":"additional","affiliation":[]},{"given":"Ehab S.","family":"Elmallah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02252869","volume":"2","author":"L. Gong","year":"1990","unstructured":"Gong, L., Wheeler, J.: A Matrix Key-Distribution Scheme. Journal of Cryptology: The Journal of the International Association for Cryptologic Research\u00a02(1), 51\u201359 (1990)","journal-title":"Journal of Cryptology: The Journal of the International Association for Cryptologic Research"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.comcom.2005.05.017","volume":"29","author":"S.S. Kulkarni","year":"2006","unstructured":"Kulkarni, S.S., Gouda, M.G., Arora, A.: Computer Communications 29, 200\u2013215 (2006)","journal-title":"Computer Communications"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Aiyer, A.S., Alvisi, L., Gouda, M.G.: Key Grids: A protocol Family for Assigning Symmetric Keys. In: Proceedings of the IEEE International Conference on Network Protocols (ICNP 2006) (2006)","DOI":"10.1109\/ICNP.2006.320211"},{"key":"22_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer, Heidelberg (1998)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. In: SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"22_CR6","volume-title":"The Combinatorics of Network Reliability","author":"C.J. Colbourn","year":"1987","unstructured":"Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49823-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:55:57Z","timestamp":1558274157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49823-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540490180","9783540498230"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49823-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}