On private information retrieval supporting range queries.
Saved in:
| Title: | On private information retrieval supporting range queries. |
|---|---|
| Authors: | Hayata, Junichiro1 (AUTHOR) junichiro.hayata@tohmatsu.co.jp, Schuldt, Jacob C. N.2 (AUTHOR), Hanaoka, Goichiro2 (AUTHOR), Matsuura, Kanta3 (AUTHOR) |
| Source: | International Journal of Information Security. Feb2024, Vol. 23 Issue 1, p629-647. 19p. |
| Subjects: | Information retrieval, Multidimensional databases, Databases, Image databases |
| Abstract: | Private information retrieval (PIR) allows a client to retrieve data from a database without the database server learning what data are being retrieved. Although many PIR schemes have been proposed in the literature, almost all of these focus on retrieval of a single database element, and do not consider more flexible retrieval queries such as basic range queries. Furthermore, while practically-oriented database schemes aiming at providing flexible and privacy-preserving queries have been proposed, to the best of our knowledge, no formal treatment of range queries has been considered for these. In this paper, we firstly highlight that a simple extension of the standard PIR security notion to range queries is insufficient in many usage scenarios, and propose a stronger security notion aimed at addressing this. We then show a simple generic construction of a PIR scheme meeting our stronger security notion, and propose a more efficient direct construction based on function secret sharing—while the former has a round complexity logarithmic in the size of the database, the round complexity of the latter is constant. After that, we report on the practical performance of our direct construction. Finally, we extend the results to the case of multi-dimensional databases and show the construction of PIR scheme supporting multi-dimensional range queries. The communication round complexity of our scheme is O (k log n) in worst case, where n is the size of database and k is the number of elements retrieved by the query. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Information Security is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| FullText | Links: – Type: pdflink Text: Availability: 1 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 174953257 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On private information retrieval supporting range queries. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Hayata%2C+Junichiro%22">Hayata, Junichiro</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> junichiro.hayata@tohmatsu.co.jp</i><br /><searchLink fieldCode="AR" term="%22Schuldt%2C+Jacob+C%2E+N%2E%22">Schuldt, Jacob C. N.</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Hanaoka%2C+Goichiro%22">Hanaoka, Goichiro</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Matsuura%2C+Kanta%22">Matsuura, Kanta</searchLink><relatesTo>3</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Information+Security%22">International Journal of Information Security</searchLink>. Feb2024, Vol. 23 Issue 1, p629-647. 19p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Information+retrieval%22">Information retrieval</searchLink><br /><searchLink fieldCode="DE" term="%22Multidimensional+databases%22">Multidimensional databases</searchLink><br /><searchLink fieldCode="DE" term="%22Databases%22">Databases</searchLink><br /><searchLink fieldCode="DE" term="%22Image+databases%22">Image databases</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Private information retrieval (PIR) allows a client to retrieve data from a database without the database server learning what data are being retrieved. Although many PIR schemes have been proposed in the literature, almost all of these focus on retrieval of a single database element, and do not consider more flexible retrieval queries such as basic range queries. Furthermore, while practically-oriented database schemes aiming at providing flexible and privacy-preserving queries have been proposed, to the best of our knowledge, no formal treatment of range queries has been considered for these. In this paper, we firstly highlight that a simple extension of the standard PIR security notion to range queries is insufficient in many usage scenarios, and propose a stronger security notion aimed at addressing this. We then show a simple generic construction of a PIR scheme meeting our stronger security notion, and propose a more efficient direct construction based on function secret sharing—while the former has a round complexity logarithmic in the size of the database, the round complexity of the latter is constant. After that, we report on the practical performance of our direct construction. Finally, we extend the results to the case of multi-dimensional databases and show the construction of PIR scheme supporting multi-dimensional range queries. The communication round complexity of our scheme is O (k log n) in worst case, where n is the size of database and k is the number of elements retrieved by the query. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Information Security is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=174953257 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10207-023-00743-6 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 19 StartPage: 629 Subjects: – SubjectFull: Information retrieval Type: general – SubjectFull: Multidimensional databases Type: general – SubjectFull: Databases Type: general – SubjectFull: Image databases Type: general Titles: – TitleFull: On private information retrieval supporting range queries. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Hayata, Junichiro – PersonEntity: Name: NameFull: Schuldt, Jacob C. N. – PersonEntity: Name: NameFull: Hanaoka, Goichiro – PersonEntity: Name: NameFull: Matsuura, Kanta IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 02 Text: Feb2024 Type: published Y: 2024 Identifiers: – Type: issn-print Value: 16155262 Numbering: – Type: volume Value: 23 – Type: issue Value: 1 Titles: – TitleFull: International Journal of Information Security Type: main |
| ResultId | 1 |
