{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:14:26Z","timestamp":1742926466501,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207273"},{"type":"electronic","value":"9783642207280"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20728-0_6","type":"book-chapter","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T09:45:24Z","timestamp":1304588724000},"page":"58-72","source":"Crossref","is-referenced-by-count":1,"title":["Homogeneous Faults, Colored Edge Graphs, and Cover Free Families"],"prefix":"10.1007","author":[{"given":"Yongge","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yvo","family":"Desmedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00026-005-0247-5","volume":"9","author":"G. Constantine","year":"2005","unstructured":"Constantine, G.: Colorful isomorphic spanning trees in complete graphs. Annals of Combinatorics\u00a09, 163\u2013167 (2005)","journal-title":"Annals of Combinatorics"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-46035-7_33","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"Y. Desmedt","year":"2002","unstructured":"Desmedt, Y., Wang, Y.: Perfectly Secure Message Transmission Revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 502\u2013517. Springer, Heidelberg (2002)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/11602613_29","volume-title":"Algorithms and Computation","author":"Y. Desmedt","year":"2005","unstructured":"Desmedt, Y., Wang, Y., Burmester, M.: A complete characterization of tolerable adversary structures for secure point-to-point transmissions without feedback. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 277\u2013287. Springer, Heidelberg (2005)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11533719_18","volume-title":"Computing and Combinatorics","author":"Y.G. Desmedt","year":"2005","unstructured":"Desmedt, Y.G., Wang, Y., Safavi-Naini, R., Wang, H.: Radio networks with reliable communication. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 156\u2013166. Springer, Heidelberg (2005)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1017\/S0963548300002121","volume":"5","author":"K. Engel","year":"1995","unstructured":"Engel, K.: Interval packing and covering in the boolean lattice. Combin. Probab. Comput.\u00a05, 373\u2013384 (1995)","journal-title":"Combin. Probab. Comput."},{"key":"6_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1287\/moor.10.4.701","volume":"10","author":"J. Roskind","year":"1985","unstructured":"Roskind, J., Tarjan, R.: A note on finding minimum-cost edge-disjoint spanning trees. Math. Oper. Res.\u00a010, 701\u2013708 (1985)","journal-title":"Math. Oper. Res."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/S0012-365X(03)00287-5","volume":"279","author":"D. Stinson","year":"2004","unstructured":"Stinson, D., Wei, R.: Generalized cover-free families. Discrete Math.\u00a0279, 463\u2013477 (2004)","journal-title":"Discrete Math."},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00145-001-0002-y","volume":"14","author":"Y. Wang","year":"2001","unstructured":"Wang, Y., Desmedt, Y.: Secure communication in multicast channels. Journal of Cryptology\u00a014(2), 121\u2013135 (2001)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20728-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T02:55:17Z","timestamp":1558580117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20728-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207273","9783642207280"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20728-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}