{"id":"https://openalex.org/W2087207261","doi":"https://doi.org/10.1109/sfcs.2002.1181949","title":"Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval","display_name":"Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2087207261","doi":"https://doi.org/10.1109/sfcs.2002.1181949","mag":"2087207261"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181949","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","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/A5031372016","display_name":"Amos Beimel","orcid":"https://orcid.org/0000-0002-6572-4195"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"A. Beimel","raw_affiliation_strings":["CS Department, Ben-Gurion University of the Negev, Israel","CS Dept., Ben-Gurion Univ., Beer Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"CS Department, Ben-Gurion University of the Negev, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"CS Dept., Ben-Gurion Univ., Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081852077","display_name":"Yuval Ishai","orcid":"https://orcid.org/0009-0009-4096-6305"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Y. Ishai","raw_affiliation_strings":["CS Department, Technion-Israel Institute of Technology, Israel","Technion"],"affiliations":[{"raw_affiliation_string":"CS Department, Technion-Israel Institute of Technology, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036104549","display_name":"Eyal Kushilevitz","orcid":"https://orcid.org/0009-0009-9277-3863"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"E. Kushilevitz","raw_affiliation_strings":["CS Department, Technion-Israel Institute of Technology, Israel","Technion"],"affiliations":[{"raw_affiliation_string":"CS Department, Technion-Israel Institute of Technology, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049906570","display_name":"Jean-Fran\u00e7ois Raymond","orcid":null},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J.-F. Raymond","raw_affiliation_strings":["Accenture, Paris, France","McGill University"],"affiliations":[{"raw_affiliation_string":"Accenture, Paris, France","institution_ids":[]},{"raw_affiliation_string":"McGill University","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5031372016"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":16.3787,"has_fulltext":false,"cited_by_count":227,"citation_normalized_percentile":{"value":0.99091772,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"261","last_page":"270"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"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":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9911999702453613,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6779986619949341},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.5939110517501831},{"id":"https://openalex.org/keywords/private-information-retrieval","display_name":"Private information retrieval","score":0.5536749958992004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5436186194419861},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5048375725746155},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4786228537559509},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.44443267583847046},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.43662017583847046},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41360923647880554},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38564780354499817},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38207167387008667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3597748279571533},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.3366159498691559},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1657644808292389},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14958268404006958}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6779986619949341},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.5939110517501831},{"id":"https://openalex.org/C99221444","wikidata":"https://www.wikidata.org/wiki/Q1532069","display_name":"Private information retrieval","level":2,"score":0.5536749958992004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5436186194419861},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5048375725746155},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4786228537559509},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.44443267583847046},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.43662017583847046},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41360923647880554},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38564780354499817},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38207167387008667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3597748279571533},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.3366159498691559},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1657644808292389},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14958268404006958},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.2002.1181949","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","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":45,"referenced_works":["https://openalex.org/W1514221954","https://openalex.org/W1521213514","https://openalex.org/W1526780465","https://openalex.org/W1535843738","https://openalex.org/W1552623664","https://openalex.org/W1593123147","https://openalex.org/W1594962164","https://openalex.org/W1600224816","https://openalex.org/W1686844196","https://openalex.org/W1745686190","https://openalex.org/W1832668820","https://openalex.org/W1963094505","https://openalex.org/W1967703498","https://openalex.org/W1983182180","https://openalex.org/W2012882416","https://openalex.org/W2017464959","https://openalex.org/W2019356824","https://openalex.org/W2065265824","https://openalex.org/W2069717895","https://openalex.org/W2070391692","https://openalex.org/W2073346043","https://openalex.org/W2094630003","https://openalex.org/W2107342895","https://openalex.org/W2133032412","https://openalex.org/W2146447528","https://openalex.org/W2154654620","https://openalex.org/W2247375362","https://openalex.org/W2400164041","https://openalex.org/W2951483008","https://openalex.org/W3030909269","https://openalex.org/W3049068437","https://openalex.org/W4285719527","https://openalex.org/W6630918642","https://openalex.org/W6631177534","https://openalex.org/W6631587840","https://openalex.org/W6632080743","https://openalex.org/W6633090160","https://openalex.org/W6635787358","https://openalex.org/W6637505000","https://openalex.org/W6637734525","https://openalex.org/W6638942238","https://openalex.org/W6640747883","https://openalex.org/W6712774105","https://openalex.org/W6782226990","https://openalex.org/W7070647758"],"related_works":["https://openalex.org/W1983915440","https://openalex.org/W1513451900","https://openalex.org/W4288641573","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2130100567","https://openalex.org/W2328371232","https://openalex.org/W3095925971","https://openalex.org/W2963903795","https://openalex.org/W2008470896"],"abstract_inverted_index":{"Private":[0],"information":[1],"retrieval":[2],"(PIR)":[3],"protocols":[4,30,53,78,135,177],"allow":[5],"a":[6,10,14],"user":[7,47],"to":[8,80,95,125,140,156],"retrieve":[9],"data":[11],"item":[12,22,45],"from":[13],"database":[15,32],"while":[16],"hiding":[17],"the":[18,21,31,44,46,57,73,76,104,117,175,189],"identity":[19],"of":[20,51,60,64,67,75,119,147,173],"being":[23],"retrieved.":[24],"Specifically,":[25],"in":[26,92,159,165],"information-theoretic,":[27],"k-server":[28,121],"PIR":[29,122,134,176],"is":[33,54,113,123],"replicated":[34],"among":[35],"k":[36],"servers,":[37],"and":[38,116,188],"each":[39],"server":[40],"learns":[41],"nothing":[42],"about":[43],"retrieves.":[48],"The":[49,132,162],"cost":[50],"such":[52],"measured":[55],"by":[56],"communication":[58],"complexity":[59,74,118],"retrieving":[61],"one":[62],"out":[63],"n":[65],"bits":[66],"data.":[68],"For":[69],"any":[70],"fixed":[71],"k,":[72],"best":[77],"prior":[79],"our":[81],"work":[82],"was":[83],"O(n/sup":[84],"1/2k-1/).":[85],"Since":[86],"then":[87],"several":[88],"methods":[89,102],"were":[90],"developed":[91],"an":[93],"attempt":[94],"beat":[96],"this":[97,109,111,166],"bound,":[98],"but":[99],"all":[100],"these":[101],"yielded":[103],"same":[105],"asymptotic":[106],"bound.":[107],"In":[108],"paper,":[110],"barrier":[112],"finally":[114],"broken":[115],"information-theoretic":[120],"improved":[124],"n/sup":[126],"O(log":[127,150],"log":[128,130,151,153],"k/k":[129,152],"k)/.":[131],"new":[133],"can":[136],"also":[137],"be":[138],"used":[139],"construct":[141],"k-query":[142],"binary":[143],"locally":[144,190],"decodable":[145,191],"codes":[146,192],"length":[148],"exp(n/sup":[149,157],"k)/),":[154],"compared":[155],"1/k-1/)":[158],"previous":[160,182],"constructions.":[161],"improvements":[163],"presented":[164],"paper":[167],"apply":[168],"even":[169],"for":[170,184,195],"small":[171],"values":[172],"k:":[174],"are":[178,193],"more":[179],"efficient":[180],"than":[181],"ones":[183],"every":[185,196],"k/spl":[186,197],"ges/3,":[187],"shorter":[194],"ges/4.":[198]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":13},{"year":2018,"cited_by_count":18},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}