{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:42:09Z","timestamp":1729636929736,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/isit.2010.5513726","type":"proceedings-article","created":{"date-parts":[[2010,8,19]],"date-time":"2010-08-19T19:57:25Z","timestamp":1282247845000},"page":"2622-2626","source":"Crossref","is-referenced-by-count":0,"title":["Perfect secrecy and combinatorial tree packing"],"prefix":"10.1109","author":[{"given":"S.","family":"Nitinawarat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Narayan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595140"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797559"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205948"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595140"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"2398","DOI":"10.1109\/TIT.2006.874430","article-title":"A unification of network coding and tree-packing (routing) theorems","volume":"52","author":"wu","year":"2006","journal-title":"IEEE Trans Inform Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557610"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.262101"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921705"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838380"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01902503"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592086"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.256484"},{"key":"ref7","article-title":"Provably secure key distribution based on independent channels","author":"maurer","year":"1990","journal-title":"Proc IEEE Inform Theory Workshop"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.825796"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.243431"},{"key":"ref9","article-title":"Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing","author":"nitinawarat","year":"0","journal-title":"IEEE Trans Inform Theory submitted"}],"event":{"name":"2010 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2010,6,13]]},"location":"Austin, TX, USA","end":{"date-parts":[[2010,6,18]]}},"container-title":["2010 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5508195\/5513230\/05513726.pdf?arnumber=5513726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T12:53:22Z","timestamp":1497876802000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5513726\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2010.5513726","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}