{"id":"https://openalex.org/W2166459336","doi":"https://doi.org/10.1137/06064929x","title":"Optimal Tree Structures for Group Key Management with Batch Updates","display_name":"Optimal Tree Structures for Group Key Management with Batch Updates","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2166459336","doi":"https://doi.org/10.1137/06064929x","mag":"2166459336"},"language":"en","primary_location":{"id":"doi:10.1137/06064929x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/06064929x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","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/A5005013807","display_name":"Ronald Graham","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ronald L. Graham","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085884127","display_name":"Minming Li","orcid":"https://orcid.org/0000-0002-7370-6237"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Minming Li","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102463516","display_name":"Frances Yao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frances F. Yao.","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005013807"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0196,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8851853,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"21","issue":"2","first_page":"532","last_page":"547"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11498","display_name":"Security in Wireless Sensor Networks","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rekeying","display_name":"Rekeying","score":0.9401489496231079},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6187030076980591},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5794647932052612},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5737031102180481},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5511252880096436},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5112204551696777},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4898638427257538},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.48694050312042236},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46628332138061523},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-tree","score":0.4334094822406769},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3971056640148163},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39538130164146423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3797374963760376},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.35141342878341675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2824767827987671},{"id":"https://openalex.org/keywords/key-management","display_name":"Key management","score":0.12998110055923462},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.06849038600921631}],"concepts":[{"id":"https://openalex.org/C127150765","wikidata":"https://www.wikidata.org/wiki/Q7310605","display_name":"Rekeying","level":4,"score":0.9401489496231079},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6187030076980591},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5794647932052612},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5737031102180481},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5511252880096436},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5112204551696777},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4898638427257538},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.48694050312042236},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46628332138061523},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.4334094822406769},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3971056640148163},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39538130164146423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3797374963760376},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.35141342878341675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2824767827987671},{"id":"https://openalex.org/C17886624","wikidata":"https://www.wikidata.org/wiki/Q1320561","display_name":"Key management","level":3,"score":0.12998110055923462},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.06849038600921631},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/06064929x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/06064929x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.157.5639","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.5639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ucsd.edu/~fan/ron/papers/07_07_key_trees.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.486.2882","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.486.2882","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cityu.edu.hk/~minmli/files/Optimal_Key_Tree.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1508689723","https://openalex.org/W1534205763","https://openalex.org/W2019267322","https://openalex.org/W2064967060"],"related_works":["https://openalex.org/W2166459336","https://openalex.org/W2026115201","https://openalex.org/W2890975198","https://openalex.org/W2066572674","https://openalex.org/W1978807050","https://openalex.org/W2067642082","https://openalex.org/W1945695511","https://openalex.org/W2146997899","https://openalex.org/W1979994068","https://openalex.org/W1597345325"],"abstract_inverted_index":{"We":[0,136],"investigate":[1],"the":[2,23,45,48,56,60,70,87,112,139,149],"key":[3,50],"management":[4],"problem":[5],"for":[6,69,85,90],"broadcasting":[7],"applications.":[8],"Previous":[9],"work":[10],"showed":[11],"that":[12,25,103,148],"batch":[13,40],"rekeying":[14,41],"can":[15],"be":[16],"more":[17],"cost-effective":[18],"than":[19],"individual":[20],"rekeying.":[21],"Under":[22],"assumption":[24],"every":[26],"user":[27,37],"has":[28,128],"probability":[29],"p":[30,142],"of":[31,47,97,132,165],"being":[32],"replaced":[33],"by":[34],"a":[35,39,129,153],"new":[36],"during":[38],"period,":[42],"we":[43,101],"study":[44,138],"structure":[46],"optimal":[49,71,88,113,150],"trees.":[51],"Constant":[52],"bounds":[53],"on":[54,161],"both":[55],"branching":[57,130],"degree":[58,131],"and":[59,93,118,146],"subtree":[61],"size":[62],"at":[63,133],"any":[64,94],"internal":[65,126],"node":[66,127],"are":[67,75],"established":[68],"tree.":[72],"These":[73],"limits":[74],"then":[76],"utilized":[77],"to":[78,144,157],"give":[79],"an":[80,116],"$O(n)$":[81],"dynamic":[82],"programming":[83],"algorithm":[84],"constructing":[86],"tree":[89,114,151,156],"n":[91],"users":[92],"fixed":[95],"value":[96],"p.":[98],"In":[99],"particular,":[100],"show":[102,147],"when":[104,119,141],"$p":[105],">":[106],"1":[107,121],"-":[108,122],"3^{-1/3}":[109],"\\thickapprox":[110],"0.307$,":[111],"is":[115],"n-star,":[117],"$p\\leq":[120],"3^{-1/3}$,":[123],"each":[124],"nonroot":[125],"most":[134],"4.":[135],"also":[137],"case":[140],"tends":[143],"0":[145],"resembles":[152],"balanced":[154],"ternary":[155],"varying":[158],"degrees":[159],"depending":[160],"certain":[162],"number-theoretical":[163],"properties":[164],"n.":[166]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}