{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1361137045332332928.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1145/293347.293350"}},{"identifier":{"@type":"URI","@value":"https://dl.acm.org/doi/10.1145/293347.293350"}},{"identifier":{"@type":"URI","@value":"https://dl.acm.org/doi/pdf/10.1145/293347.293350"}}],"dc:title":[{"@value":"Private information retrieval"}],"description":[{"type":"abstract","notation":[{"@value":"<jats:p>\n            Publicly accessible databases are an indispensable resource for retrieving up-to-date information. But they also pose a significant risk to the privacy of the user, since a curious database operator can follow the user's queries and infer what the user is after. Indeed, in cases where the users' intentions are to be kept secret, users are often cautious about accessing the database. It can be shown that when accessing a single database, to completely guarantee the privacy of the user, the whole database should be down-loaded; namely\n            <jats:italic>n</jats:italic>\n            bits should be communicated (where\n            <jats:italic>n</jats:italic>\n            is the number of bits in the database).\n          </jats:p>\n          <jats:p>\n            In this work, we investigate whether by replicating the database, more efficient solutions to the private retrieval problem can be  obtained. We describe schemes that enable a user to access\n            <jats:italic>k</jats:italic>\n            replicated copies of a database (\n            <jats:italic>k</jats:italic>\n            ≥2) and\n            <jats:italic>privately</jats:italic>\n            retrieve information stored in the database. This means that each individual server (holding a replicated copy of the database) gets no information on the identity of the item retrieved by the user. Our schemes use the replication to gain substantial saving. In particular, we present a two-server scheme with communication complexity\n            <jats:italic>O(n</jats:italic>\n            <jats:sup>1/3</jats:sup>\n            ).\n          </jats:p>"}]}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1381137045332332928","@type":"Researcher","foaf:name":[{"@value":"Benny Chor"}],"jpcoar:affiliationName":[{"@value":"Technion, Haifa, Israel"}]},{"@id":"https://cir.nii.ac.jp/crid/1381137045332332931","@type":"Researcher","foaf:name":[{"@value":"Eyal Kushilevitz"}],"jpcoar:affiliationName":[{"@value":"Technion, Haifa, Israel"}]},{"@id":"https://cir.nii.ac.jp/crid/1381137045332332930","@type":"Researcher","foaf:name":[{"@value":"Oded Goldreich"}],"jpcoar:affiliationName":[{"@value":"Weizmann Institute of Science, Rehovot, Israel"}]},{"@id":"https://cir.nii.ac.jp/crid/1381137045332332929","@type":"Researcher","foaf:name":[{"@value":"Madhu Sudan"}],"jpcoar:affiliationName":[{"@value":"Massachusetts  Institute of Technology, Cambridge"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"00045411"},{"@type":"EISSN","@value":"1557735X"}],"prism:publicationName":[{"@value":"Journal of the ACM"}],"dc:publisher":[{"@value":"Association for Computing Machinery (ACM)"}],"prism:publicationDate":"1998-11","prism:volume":"45","prism:number":"6","prism:startingPage":"965","prism:endingPage":"981"},"reviewed":"false","dc:rights":["https://www.acm.org/publications/policies/copyright_policy#Background"],"url":[{"@id":"https://dl.acm.org/doi/10.1145/293347.293350"},{"@id":"https://dl.acm.org/doi/pdf/10.1145/293347.293350"}],"createdAt":"2002-07-27","modifiedAt":"2025-06-18","relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1050001337538541056","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Recursive Matrix Oblivious RAM: An ORAM construction for constrained storage devices"}]},{"@id":"https://cir.nii.ac.jp/crid/1360009142769817600","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Capacity of Quantum Private Information Retrieval with Colluding Servers"}]},{"@id":"https://cir.nii.ac.jp/crid/1360009142769820160","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Capacity of Quantum Symmetric Private Information Retrieval With Collusion of All But One of Servers"}]},{"@id":"https://cir.nii.ac.jp/crid/1360009142769822720","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Capacity of Quantum Private Information Retrieval With Multiple Servers"}]},{"@id":"https://cir.nii.ac.jp/crid/1360013168884751488","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Bounds on the Capacity of PIR over Graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1360298757162119680","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"On the Optimal Communication Complexity of Error-Correcting Multi-server PIR"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567180537309184","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Function Secret Sharing Using Fourier Basis"}]},{"@id":"https://cir.nii.ac.jp/crid/1360584341830539392","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Blind Decryption and Private Information Delivery"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848655489894144","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848655493844224","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database"}]},{"@id":"https://cir.nii.ac.jp/crid/1360848657012828672","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Efficient outsourcing of secure k -nearest neighbour query over encrypted database"}]},{"@id":"https://cir.nii.ac.jp/crid/1360857593770407808","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Equivalence of Non-Perfect Secret Sharing and Symmetric Private Information Retrieval With General Access Structure"}]},{"@id":"https://cir.nii.ac.jp/crid/1360861704798117248","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Bounds on the Capacity of Private Information Retrieval Over Graphs"}]},{"@id":"https://cir.nii.ac.jp/crid/1360865814725911296","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@value":"Efficient and Generic Methods to Achieve Active Security in Private Information Retrieval and More Advanced Database Search"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204378876416","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Privacy-Enhancing Queries in Personalized Search with Untrusted Service Providers"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204379797248","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Analysis of Existing Privacy-Preserving Protocols in Domain Name System"}]},{"@id":"https://cir.nii.ac.jp/crid/1390016184232401920","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Security Technologies to Improve Content-Distribution and Broadcasting Services"},{"@language":"ja","@value":"コンテンツ配信・放送サービスを向上させるセキュリティ技術"}]},{"@id":"https://cir.nii.ac.jp/crid/1390019534938092544","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Privacy Preserving Function Evaluation Using Lookup Tables with Word-Wise FHE"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679355277568","@type":"Article","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Comparison of Access Pattern Protection Schemes and Proposals for Efficient Implementation"}]},{"@id":"https://cir.nii.ac.jp/crid/1390580793844070016","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Correlated Randomness Reduction in Domain-Restricted Secure Two-Party Computation"}]},{"@id":"https://cir.nii.ac.jp/crid/1390858220181297280","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["isReferencedBy"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Linear Algebraic Approach to Strongly Secure Ramp Secret Sharing for General Access Structures with Application to Symmetric PIR"}]}],"dataSourceIdentifier":[{"@type":"CROSSREF","@value":"10.1145/293347.293350"},{"@type":"CROSSREF","@value":"10.1109/isit44484.2020.9174005_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1109/jsait.2021.3053537_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1109/isit45174.2021.9518086_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1587/transinf.e95.d.143_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1587/essfr.17.2_108_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1007/978-3-031-22368-6_3_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1007/978-3-319-65521-5_78_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1109/tit.2020.3022515_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1587/transfun.2022cip0001_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1587/transfun.2023cip0023_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1587/transfun.2023eap1114_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1007/978-981-99-4430-9_12_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1007/978-3-319-31301-6_14_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1007/978-3-319-40253-6_11_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1016/j.cose.2016.11.012_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1587/transinf.e93.d.1031_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1587/transinf.2013thp0007_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1109/tifs.2017.2730584_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1109/jsac.2022.3142375_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1109/tit.2021.3077269_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1109/tifs.2022.3220034_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"},{"@type":"CROSSREF","@value":"10.1007/978-3-031-58740-5_4_references_DOI_NgpTcPrNkewsUGxQAcNIExylHWX"}]}