{"id":"https://openalex.org/W4385286208","doi":"https://doi.org/10.1109/tifs.2023.3299183","title":"On Extremal Rates of Secure Storage Over Graphs","display_name":"On Extremal Rates of Secure Storage Over Graphs","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4385286208","doi":"https://doi.org/10.1109/tifs.2023.3299183"},"language":"en","primary_location":{"id":"doi:10.1109/tifs.2023.3299183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tifs.2023.3299183","pdf_url":null,"source":{"id":"https://openalex.org/S61310614","display_name":"IEEE Transactions on Information Forensics and Security","issn_l":"1556-6013","issn":["1556-6013","1556-6021"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Forensics and Security","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/A5102773333","display_name":"Zhou Li","orcid":"https://orcid.org/0000-0003-4070-3985"},"institutions":[{"id":"https://openalex.org/I123534392","display_name":"University of North Texas","ror":"https://ror.org/00v97ad02","country_code":"US","type":"education","lineage":["https://openalex.org/I123534392"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhou Li","raw_affiliation_strings":["Department of Electrical Engineering, University of North Texas, Denton, TX, USA"],"raw_orcid":"https://orcid.org/0000-0003-4070-3985","affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of North Texas, Denton, TX, USA","institution_ids":["https://openalex.org/I123534392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016951190","display_name":"Hua Sun","orcid":"https://orcid.org/0000-0001-8777-7987"},"institutions":[{"id":"https://openalex.org/I123534392","display_name":"University of North Texas","ror":"https://ror.org/00v97ad02","country_code":"US","type":"education","lineage":["https://openalex.org/I123534392"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hua Sun","raw_affiliation_strings":["Department of Electrical Engineering, University of North Texas, Denton, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of North Texas, Denton, TX, USA","institution_ids":["https://openalex.org/I123534392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I123534392"],"apc_list":null,"apc_paid":null,"fwci":0.794,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.71743563,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"18","issue":null,"first_page":"4721","last_page":"4731"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9995999932289124,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9995999932289124,"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/T11478","display_name":"Caching and Content Delivery","score":0.9988999962806702,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9976000189781189,"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/notation","display_name":"Notation","score":0.7199669480323792},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4197455048561096},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3863554894924164},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3670491576194763},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3528323769569397},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3237950801849365},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.16530841588974}],"concepts":[{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.7199669480323792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4197455048561096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3863554894924164},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3670491576194763},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3528323769569397},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3237950801849365},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.16530841588974}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tifs.2023.3299183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tifs.2023.3299183","pdf_url":null,"source":{"id":"https://openalex.org/S61310614","display_name":"IEEE Transactions on Information Forensics and Security","issn_l":"1556-6013","issn":["1556-6013","1556-6021"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Forensics and Security","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.5,"id":"https://metadata.un.org/sdg/7"}],"awards":[{"id":"https://openalex.org/G1784528590","display_name":"CAREER: Fundamental Limits of Cryptographic Primitives Through Network Information Theory","funder_award_id":"2045656","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4487682990","display_name":"Collaborative Research: CIF: Small: Communication, Storage, Complexity, and Security: A Holistic View on the Fundamental Limits and Code Designs for Private Information Retrieval","funder_award_id":"2007108","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W51265332","https://openalex.org/W1599026900","https://openalex.org/W1968245619","https://openalex.org/W2005090414","https://openalex.org/W2056327536","https://openalex.org/W2065265824","https://openalex.org/W2080132708","https://openalex.org/W2096031205","https://openalex.org/W2105831729","https://openalex.org/W2106248279","https://openalex.org/W2130507035","https://openalex.org/W2140218616","https://openalex.org/W2542298476","https://openalex.org/W2588265860","https://openalex.org/W2605201962","https://openalex.org/W2963288098","https://openalex.org/W3005569643","https://openalex.org/W3048049228","https://openalex.org/W3090813372","https://openalex.org/W3137013420","https://openalex.org/W3196509486","https://openalex.org/W3199097732","https://openalex.org/W4289713075","https://openalex.org/W4319989880","https://openalex.org/W6674060165","https://openalex.org/W6680315945","https://openalex.org/W6791723353","https://openalex.org/W6849317297"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2504004674","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885"],"abstract_inverted_index":{"A":[0],"secure":[1,102,125,152,192],"storage":[2,103,126,153,193],"code":[3,104,127,154,194],"maps$K$source":[4],"symbols,":[5,9],"each":[6,10,14,170],"of$L_{w}$bits,":[7],"to$N$coded":[8],"of$L_{v}$bits,":[11],"such":[12,44,77],"that":[13,45,78,161],"coded":[15],"symbol":[16,98,109],"is":[17,38,71,92,111,128,137,155,195],"stored":[18],"in":[19],"a":[20,23,28,31,101,124,151,158,178,191],"node":[21,29],"of":[22,35,49,82,100,123,150,171,190],"graph":[24,37],"(one":[25],"may":[26],"view":[27],"as":[30],"server).":[32],"Each":[33],"edge":[34,70],"the":[36,47,53,65,69,80,86,97,106,113,121,148,165,188],"either":[39],"associated":[40,72,168],"with$D$of":[41],"the$K$source":[42,90],"symbols":[43,59,76,91,167],"from":[46,79],"pair":[48,81],"nodes":[50,83],"connected":[51,84,173],"by":[52,85],"edge,":[54,87],"we":[55,142,182],"can":[56],"decode":[57],"the$D$source":[58],"and":[60,105],"learn":[61],"no":[62,74],"information":[63],"about":[64,89],"remaining$K-D$source":[66],"symbols;":[67],"or":[68],"with":[73,169],"source":[75,166],"nothing":[88],"revealed.":[93],"The":[94],"ratio$L_{w}/L_{v}$is":[95],"called":[96,112],"rate":[99,110],"highest":[107],"possible":[108],"capacity.":[114],"We":[115],"characterize":[116,143,183],"all":[117,144,184],"graphs":[118,145,185],"over":[119,146,186],"which":[120,147,187],"capacity":[122,149,189],"equal":[129,156,196],"to":[130],"1,":[131],"when$D":[132],"=":[133],"1$.":[134],"This":[135],"result":[136],"generalized":[138],"to$D>":[139],"1$,":[140],"i.e.,":[141],"to$1/D$under":[157],"mild":[159],"condition":[160],"for":[162],"any":[163],"node,":[164],"its":[172],"edges":[174],"do":[175],"not":[176],"include":[177],"common":[179],"element.":[180],"Further,":[181],"to$2/D$.":[197]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}