{"id":"https://openalex.org/W2152942781","doi":"https://doi.org/10.1109/isit.2010.5513726","title":"Perfect secrecy and combinatorial tree packing","display_name":"Perfect secrecy and combinatorial tree packing","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2152942781","doi":"https://doi.org/10.1109/isit.2010.5513726","mag":"2152942781"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011106798","display_name":"Sirin Nitinawarat","orcid":"https://orcid.org/0000-0002-4996-4949"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Nitinawarat","raw_affiliation_strings":["Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102896474","display_name":"Prakash Narayan","orcid":"https://orcid.org/0000-0002-0710-6305"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Narayan","raw_affiliation_strings":["Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and Institute for Systems Research, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"52","issue":null,"first_page":"2622","last_page":"2626"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/secrecy","display_name":"Secrecy","score":0.7261740565299988},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6097685694694519},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5685903429985046},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42386531829833984},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36901482939720154},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27991557121276855},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.20164167881011963}],"concepts":[{"id":"https://openalex.org/C2776452267","wikidata":"https://www.wikidata.org/wiki/Q1503443","display_name":"Secrecy","level":2,"score":0.7261740565299988},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6097685694694519},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5685903429985046},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42386531829833984},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36901482939720154},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27991557121276855},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.20164167881011963}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2010.5513726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1986334784","https://openalex.org/W2005962614","https://openalex.org/W2014912629","https://openalex.org/W2082591111","https://openalex.org/W2092741549","https://openalex.org/W2106833918","https://openalex.org/W2108777864","https://openalex.org/W2129720431","https://openalex.org/W2144387589","https://openalex.org/W2154832352","https://openalex.org/W2161081468","https://openalex.org/W2163497720","https://openalex.org/W2166566585","https://openalex.org/W2540403676","https://openalex.org/W2570092323","https://openalex.org/W6681756074"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2493929861","https://openalex.org/W2016567611","https://openalex.org/W2475541339","https://openalex.org/W565335793","https://openalex.org/W2363071176","https://openalex.org/W2107199751","https://openalex.org/W4243812570","https://openalex.org/W4300441478"],"abstract_inverted_index":{"We":[0],"consider":[1],"perfect":[2,67,94,102,122,193],"secret":[3,68,103,123,194],"key":[4,69,104,124],"generation":[5,125],"for":[6,121,159,202,217],"a":[7,19,43,66,72,97,107,143,175,181,192,209],"\u201cpairwise":[8],"independent":[9,172],"network\u201d":[10],"model":[11,114],"in":[12,100,146,190],"which":[13],"every":[14],"pair":[15],"of":[16,47,75,93,110,165,171,205],"terminals":[17,35,52,76,139,189],"share":[18,142],"random":[20],"binary":[21],"string,":[22],"with":[23],"the":[24,51,78,85,91,111,138,152,160,186,203,206],"strings":[25],"shared":[26,70],"by":[27,71],"distinct":[28],"terminal":[29,184],"pairs":[30],"being":[31],"mutually":[32],"independent.":[33],"The":[34,61],"are":[36,170],"then":[37],"allowed":[38],"to":[39,64,117,141,214],"communicate":[40],"interactively":[41],"over":[42],"public":[44],"noiseless":[45],"channel":[46],"unlimited":[48],"capacity.":[49,105,153],"All":[50],"as":[53,55],"well":[54],"an":[56,118],"eavesdropper":[57],"observe":[58],"this":[59],"communication.":[60],"objective":[62],"is":[63,212],"generate":[65],"given":[73],"set":[74],"at":[77,149],"largest":[79],"rate":[80,164],"possible,":[81],"and":[82,163,169,199],"concealed":[83],"from":[84,174],"eavesdropper.":[86],"First,":[87],"we":[88,196],"show":[89],"how":[90],"notion":[92],"omniscience":[95],"plays":[96],"central":[98],"role":[99],"characterizing":[101],"Second,":[106],"multigraph":[108],"representation":[109],"underlying":[112],"secrecy":[113],"leads":[115],"us":[116],"efficient":[119],"algorithm":[120,133],"based":[126],"on":[127],"maximal":[128],"Steiner":[129,166],"tree":[130,167],"packing.":[131],"This":[132],"attains":[134,148],"capacity":[135],"when":[136,180],"all":[137],"seek":[140],"key,":[144,195],"and,":[145],"general,":[147],"least":[150],"half":[151],"Our":[154],"results":[155],"yield":[156],"new":[157],"bounds":[158],"maximum":[161],"size":[162],"packing,":[168],"interest":[173],"graph":[176],"theoretic":[177],"viewpoint.":[178],"Third,":[179],"single":[182],"\u201chelper\u201d":[183],"assists":[185],"remaining":[187],"\u201cuser\u201d":[188],"generating":[191],"give":[197],"necessary":[198],"sufficient":[200,216],"conditions":[201],"optimality":[204],"algorithm;":[207],"also,":[208],"\u201cweak\u201d":[210],"helper":[211],"shown":[213],"be":[215],"optimality.":[218]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}