{"id":"https://openalex.org/W3124525143","doi":"https://doi.org/10.1109/isit45174.2021.9518070","title":"Optimal Demand Private Coded Caching for Users with Small Buffers","display_name":"Optimal Demand Private Coded Caching for Users with Small Buffers","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3124525143","doi":"https://doi.org/10.1109/isit45174.2021.9518070","mag":"3124525143"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9518070","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2101.08745","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030167148","display_name":"K. K. Krishnan Namboodiri","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"K.K. Krishnan Namboodiri","raw_affiliation_strings":["IISc Bangalore,Department of Electrical Communication Engineering,India"],"affiliations":[{"raw_affiliation_string":"IISc Bangalore,Department of Electrical Communication Engineering,India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015398340","display_name":"B. Sundar Rajan","orcid":"https://orcid.org/0000-0002-7847-0200"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B. Sundar Rajan","raw_affiliation_strings":["IISc Bangalore,Department of Electrical Communication Engineering,India","Indian Institute of Science"],"affiliations":[{"raw_affiliation_string":"IISc Bangalore,Department of Electrical Communication Engineering,India","institution_ids":[]},{"raw_affiliation_string":"Indian Institute of Science","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030167148"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3202,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58294693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"706","last_page":"711"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9998000264167786,"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/T11478","display_name":"Caching and Content Delivery","score":0.9998000264167786,"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.9961000084877014,"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.9609000086784363,"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/cache","display_name":"Cache","score":0.7245631814002991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6672402024269104},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.6475986838340759},{"id":"https://openalex.org/keywords/false-sharing","display_name":"False sharing","score":0.601345956325531},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.500556230545044},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.5000870227813721},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.45926108956336975},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4151465892791748},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.16418218612670898},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14364787936210632}],"concepts":[{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7245631814002991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6672402024269104},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.6475986838340759},{"id":"https://openalex.org/C5165142","wikidata":"https://www.wikidata.org/wiki/Q5432732","display_name":"False sharing","level":5,"score":0.601345956325531},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.500556230545044},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.5000870227813721},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.45926108956336975},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4151465892791748},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.16418218612670898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14364787936210632},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit45174.2021.9518070","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2101.08745","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.08745","pdf_url":"https://arxiv.org/pdf/2101.08745","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3124525143","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/2101.08745.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2101.08745","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2101.08745","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2101.08745","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.08745","pdf_url":"https://arxiv.org/pdf/2101.08745","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320719","display_name":"Department of Science and Technology, Ministry of Science and Technology, India","ror":"https://ror.org/0101xrq71"},{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3124525143.pdf","grobid_xml":"https://content.openalex.org/works/W3124525143.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1990395546","https://openalex.org/W2106248279","https://openalex.org/W2169897889","https://openalex.org/W2399048200","https://openalex.org/W2482095914","https://openalex.org/W2527594325","https://openalex.org/W2547052808","https://openalex.org/W2786757013","https://openalex.org/W2799278985","https://openalex.org/W2894495612","https://openalex.org/W2970675090","https://openalex.org/W2971476613","https://openalex.org/W3015500082","https://openalex.org/W3043788271","https://openalex.org/W3047776111","https://openalex.org/W3098870865","https://openalex.org/W3103610239","https://openalex.org/W3105559639","https://openalex.org/W6754757686","https://openalex.org/W6767434219","https://openalex.org/W6767682332","https://openalex.org/W6781659429"],"related_works":["https://openalex.org/W3121192967","https://openalex.org/W2345652583","https://openalex.org/W3111418340","https://openalex.org/W3129212555","https://openalex.org/W3082381348","https://openalex.org/W3200969873","https://openalex.org/W2963858052","https://openalex.org/W2887711554","https://openalex.org/W2963345435","https://openalex.org/W2766867902","https://openalex.org/W2786589296","https://openalex.org/W2971499952","https://openalex.org/W3085354969","https://openalex.org/W3197124326","https://openalex.org/W2990345840","https://openalex.org/W2909468325","https://openalex.org/W2963602389","https://openalex.org/W3005909811","https://openalex.org/W2784739900","https://openalex.org/W1480444129"],"abstract_inverted_index":{"Coded":[0],"Caching":[1,128],"is":[2,18,66],"an":[3,73],"efficient":[4],"technique":[5],"to":[6,27],"reduce":[7],"peak-hour":[8],"network":[9],"traffic.":[10],"One":[11],"limitation":[12],"of":[13,22,55,127],"known":[14],"coded":[15,79,151],"caching":[16,80,152],"schemes":[17],"that":[19,35,48,92],"the":[20,31,44,49,59,110,122,138,143,148],"demands":[21,40],"all":[23],"users":[24,50,86],"are":[25,41,51],"revealed":[26],"their":[28],"peers":[29],"in":[30,43,68,121],"delivery":[32],"phase.":[33],"Schemes":[34],"assure":[36],"privacy":[37,64],"for":[38,129,147,154],"user":[39],"studied":[42],"recent":[45,123],"past.":[46],"Assuming":[47],"equipped":[52],"with":[53,82],"caches":[54],"small":[56],"memory":[57,95,136,156],"sizes,":[58],"achievable":[60,139],"rate":[61,96],"under":[62,113],"demand":[63,77,149],"constraints":[65],"investigated":[67],"this":[69],"work.":[70],"We":[71],"present":[72],"MDS":[74],"code":[75],"based":[76],"private":[78,150],"scheme":[81,153],"<tex":[83,88,98,157],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[84,89,99,158],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$K$</tex>":[85],"and":[87,119],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$N$</tex>":[90],"files":[91],"achieves":[93],"a":[94],"pair":[97,108,141],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\left(\\frac{1}{K(N-1)+1},":[100],"N\\,":[101],"\\left(1-":[102],"\\frac{1}{K(N-1)+1}\\right)\\right)$</tex>":[103],".":[104,160],"The":[105],"presented":[106],"memory-rate":[107,140],"meets":[109],"lower":[111],"bound":[112],"demand-privacy":[114],"requirements,":[115],"proposed":[116],"by":[117],"Yan":[118],"Tuninetti":[120],"work":[124],"\u201cFundamental":[125],"Limits":[126],"Demand":[130],"Privacy":[131],"against":[132],"Colluding":[133],"Users\u201d.":[134],"By":[135],"sharing,":[137],"characterizes":[142],"exact":[144],"rate-memory":[145],"trade-off":[146],"cache":[155],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$M\\in\\left[0,\\frac{1}{K(N-1)+1}\\right]$</tex>":[159]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}