{"id":"https://openalex.org/W7098501653","doi":null,"title":"Computationally Inexpensive cPIR","display_name":"Computationally Inexpensive cPIR","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7098501653"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.117.656","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~arkady/papers/pirlattice.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7098501653"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"William Gasarch","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"William Gasarch","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5084079970","display_name":"Arkady Yerukhimovich","orcid":"https://orcid.org/0000-0002-9045-748X","observed_orcids":["https://orcid.org/0000-0002-9045-748X"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Arkady Yerukhimovich","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"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/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"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/T11614","display_name":"Cloud Data Security Solutions","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/private-information-retrieval","display_name":"private information retrieval","score":0.7699999809265137},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"communication complexity","score":0.7400000095367432},{"id":"https://openalex.org/keywords/database-privacy","display_name":"database privacy","score":0.6690000295639038},{"id":"https://openalex.org/keywords/modular-multiplication","display_name":"modular multiplication","score":0.7940000295639038},{"id":"https://openalex.org/keywords/query-cost-reduction","display_name":"query cost reduction","score":0.5820000171661377}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7491999864578247},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6010000109672546},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.526199996471405},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.49810001254081726},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48339998722076416},{"id":"https://openalex.org/C70061542","wikidata":"https://www.wikidata.org/wiki/Q989016","display_name":"Distributed database","level":2,"score":0.4345000088214874},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.4203999936580658},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.41780000925064087},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.3880000114440918},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3855000138282776},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33640000224113464},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3328999876976013},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C152763109","wikidata":"https://www.wikidata.org/wiki/Q1228841","display_name":"Modular exponentiation","level":4,"score":0.3073999881744385},{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.2962999939918518},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.2870999872684479},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.117.656","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umd.edu/~arkady/papers/pirlattice.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2949517654","https://openalex.org/W3121668618","https://openalex.org/W1983182180","https://openalex.org/W2401976587","https://openalex.org/W2044550868","https://openalex.org/W2874619646","https://openalex.org/W7095196525","https://openalex.org/W2135043765","https://openalex.org/W7095754790","https://openalex.org/W2883089683"],"abstract_inverted_index":{"Abstract.":[0],"Computational":[1],"Private":[2],"Information":[3],"Retrieval(cPIR)":[4],"schemes":[5],"allow":[6],"a":[7,13,19,36,48],"user":[8],"to":[9,46,65],"retrieve":[10],"data":[11,23],"from":[12],"database":[14,26,45,56],"privately":[15],"while":[16,85],"exchanging":[17],"only":[18],"small":[20],"amount":[21,89],"of":[22,54,82,90],"between":[24],"the":[25,28,31,44,55,77,88],"and":[27],"user,":[29],"where":[30],"privacy":[32],"is":[33],"based":[34],"on":[35,57],"cryptographic":[37],"assumption.":[38],"All":[39],"previous":[40,83],"cPIR":[41],"protocols":[42,74],"require":[43],"compute":[47],"modular":[49],"multiplication":[50],"for":[51],"every":[52],"bit":[53],"each":[58],"query,":[59],"making":[60],"them":[61],"too":[62],"computationally":[63],"expensive":[64],"be":[66,94],"practical.":[67],"In":[68],"this":[69],"paper,":[70],"we":[71],"propose":[72],"two":[73],"that":[75,92],"achieve":[76],"O(n":[78],"\u025b)":[79],"communication":[80],"complexity":[81],"protocols,":[84],"significantly":[86],"reducing":[87],"computation":[91],"must":[93],"done":[95],"per":[96],"query.":[97]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7098501653","counts_by_year":[],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2025-10-27T00:00:00"}
