{"id":"https://openalex.org/W7138869178","doi":"https://doi.org/10.1109/globecom59602.2025.11431662","title":"Symmetric Private Information Retrieval (SPIR) on Graph-Based Replicated Systems","display_name":"Symmetric Private Information Retrieval (SPIR) on Graph-Based Replicated Systems","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7138869178","doi":"https://doi.org/10.1109/globecom59602.2025.11431662"},"language":null,"primary_location":{"id":"doi:10.1109/globecom59602.2025.11431662","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11431662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-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/A5129924431","display_name":"Shreya Meel","orcid":null},"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":true,"raw_author_name":"Shreya Meel","raw_affiliation_strings":["University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,20742"],"affiliations":[{"raw_affiliation_string":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021132487","display_name":"\u015eennur Uluku\u015f","orcid":"https://orcid.org/0000-0002-8219-8190"},"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":"Sennur Ulukus","raw_affiliation_strings":["University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,20742"],"affiliations":[{"raw_affiliation_string":"University of Maryland,Department of Electrical and Computer Engineering,College Park,MD,20742","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5129924431"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.88102115,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3945","last_page":"3950"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.5020999908447266,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10237","display_name":"Cryptography and Data Security","score":0.5020999908447266,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.1851000040769577,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.05660000070929527,"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/randomness","display_name":"Randomness","score":0.6988000273704529},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.6550999879837036},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.616100013256073},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5263000130653381},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45329999923706055},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.436599999666214},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.427700012922287},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.42739999294281006}],"concepts":[{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.6988000273704529},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.6550999879837036},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.616100013256073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5584999918937683},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5263000130653381},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48840001225471497},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45329999923706055},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.436599999666214},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.430400013923645},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.427700012922287},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.42739999294281006},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.41100001335144043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3993000090122223},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39160001277923584},{"id":"https://openalex.org/C99221444","wikidata":"https://www.wikidata.org/wiki/Q1532069","display_name":"Private information retrieval","level":2,"score":0.35659998655319214},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.32499998807907104},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C2780154274","wikidata":"https://www.wikidata.org/wiki/Q7126717","display_name":"Download","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C70061542","wikidata":"https://www.wikidata.org/wiki/Q989016","display_name":"Distributed database","level":2,"score":0.25679999589920044}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom59602.2025.11431662","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11431662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W2007725949","https://openalex.org/W2065265824","https://openalex.org/W2073346043","https://openalex.org/W2109394932","https://openalex.org/W2593599278","https://openalex.org/W2599749253","https://openalex.org/W2774968492","https://openalex.org/W2808769206","https://openalex.org/W2898111259","https://openalex.org/W2919422837","https://openalex.org/W2961382438","https://openalex.org/W2962692592","https://openalex.org/W2976078580","https://openalex.org/W2977086002","https://openalex.org/W2990789045","https://openalex.org/W2999760042","https://openalex.org/W3011894940","https://openalex.org/W3044113996","https://openalex.org/W3093360177","https://openalex.org/W3191104470","https://openalex.org/W3210888078","https://openalex.org/W4205173135","https://openalex.org/W4289655260","https://openalex.org/W4310902932","https://openalex.org/W4311080731","https://openalex.org/W4312229871","https://openalex.org/W4389665995","https://openalex.org/W4401692235","https://openalex.org/W4406417446","https://openalex.org/W4415366983","https://openalex.org/W4415368930","https://openalex.org/W4416114280"],"related_works":[],"abstract_inverted_index":{"We":[0,45],"introduce":[1],"the":[2,47,50,62,66,85,89,113,123,136,141],"problem":[3],"of":[4,116,125,143],"symmetric":[5],"private":[6],"information":[7],"retrieval":[8],"(SPIR)":[9],"on":[10,32,84],"replicated":[11,31,60],"databases":[12],"modeled":[13],"by":[14,96,129],"a":[15,25,28,81,126],"simple":[16],"graph.":[17],"In":[18,76],"this":[19,71,77],"model,":[20],"each":[21],"vertex":[22],"corresponds":[23],"to":[24,55,65,110,122],"server,":[26],"and":[27,36,68,145],"message":[29],"is":[30,40,58],"two":[33],"servers":[34,63],"if":[35,38],"only":[37],"there":[39],"an":[41,98],"edge":[42],"between":[43],"them.":[44],"consider":[46],"setting":[48],"where":[49],"server-side":[51],"common":[52,74],"randomness":[53,118],"necessary":[54],"accomplish":[56],"SPIR":[57,86,100,108,138],"also":[59],"at":[61],"according":[64],"graph,":[67],"we":[69,79,103,134],"call":[70],"as":[72],"message-specific":[73,117],"randomness.":[75],"setting,":[78],"establish":[80],"lower":[82],"bound":[83],"capacity,":[87],"i.e.,":[88],"maximum":[90],"download":[91],"rate,":[92],"for":[93,106,140],"general":[94],"graphs,":[95],"proposing":[97],"achievable":[99],"scheme.":[101],"Next,":[102],"prove":[104],"that,":[105],"any":[107],"scheme":[109],"be":[111,120],"feasible,":[112],"minimum":[114],"size":[115,124],"should":[119],"equal":[121],"message.":[127],"Finally,":[128],"providing":[130],"matching":[131],"upper":[132],"bounds,":[133],"derive":[135],"exact":[137],"capacity":[139],"class":[142],"path":[144],"regular":[146],"graphs.":[147]},"counts_by_year":[],"updated_date":"2026-03-20T20:54:20.808490","created_date":"2026-03-20T00:00:00"}