Universal service-providers for private information retrieval
A private information retrieval scheme allows a user to retrieve a data item of his choice from a remote database (or several copies of a database) while hiding from the database owner which particular data item he is interested in. We consider the question of private information retrieval in the so...
Gespeichert in:
Veröffentlicht in: | Journal of cryptology 2001, Vol.14 (1), p.37-74 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 74 |
---|---|
container_issue | 1 |
container_start_page | 37 |
container_title | Journal of cryptology |
container_volume | 14 |
creator | DI CRESCENZO, Giovanni ISHAI, Yuval OSTROVSKY, Rafail |
description | A private information retrieval scheme allows a user to retrieve a data item of his choice from a remote database (or several copies of a database) while hiding from the database owner which particular data item he is interested in. We consider the question of private information retrieval in the so-called ``commodity-based'' model, recently proposed by Beaver for practically oriented service-provider Internet applications. We present simple and modular schemes allowing us to reduce dramatically the overall communication involving users, and substantially reduce their computation, using off-line messages sent from service-providers to databases and users. The service-providers do not need to know the database contents nor the future user's requests; all they need to know is an upper bound on the data size. Our solutions can be made resilient against collusions of databases with more than a majority (in fact, all-but-one) of the service-providers. |
doi_str_mv | 10.1007/s001450010008 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2387712568</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2387712568</sourcerecordid><originalsourceid>FETCH-LOGICAL-c330t-607c2469fc9593a488ea1047b2e958e21e3a44cd4576deed41293667973a8a1b3</originalsourceid><addsrcrecordid>eNpVUE1LxDAUDKJgXT16L3iOvnw1ycGDLH7Bghf3HLLpK2TptmvSLfjvjayIXt7jDfNmhiHkmsEtA9B3GYBJVQYAmBNSMSk4ZUKbU1KBFYJybeGcXOS8LSSttKjI_XqIM6bs-zpjmmNAuk_jHNuC1d2Y6n2Ks5-wjkO5dn6K41AnnFLE2feX5Kzzfcarn70g66fH9-ULXb09vy4fVjQIARNtQAcuG9sFq6zw0hj0DKTecLTKIGdYQBlaqXTTIraScSuaRlstvPFsIxbk5qhbsn0cME9uOx7SUCwdF0ZrxlVjCoseWSGNOSfsXAm_8-nTMXDfDbl_Df1R9Tn4vkt-CDH_PhljlGTiCwIUZBM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2387712568</pqid></control><display><type>article</type><title>Universal service-providers for private information retrieval</title><source>Springer Nature - Complete Springer Journals</source><creator>DI CRESCENZO, Giovanni ; ISHAI, Yuval ; OSTROVSKY, Rafail</creator><creatorcontrib>DI CRESCENZO, Giovanni ; ISHAI, Yuval ; OSTROVSKY, Rafail</creatorcontrib><description>A private information retrieval scheme allows a user to retrieve a data item of his choice from a remote database (or several copies of a database) while hiding from the database owner which particular data item he is interested in. We consider the question of private information retrieval in the so-called ``commodity-based'' model, recently proposed by Beaver for practically oriented service-provider Internet applications. We present simple and modular schemes allowing us to reduce dramatically the overall communication involving users, and substantially reduce their computation, using off-line messages sent from service-providers to databases and users. The service-providers do not need to know the database contents nor the future user's requests; all they need to know is an upper bound on the data size. Our solutions can be made resilient against collusions of databases with more than a majority (in fact, all-but-one) of the service-providers.</description><identifier>ISSN: 0933-2790</identifier><identifier>EISSN: 1432-1378</identifier><identifier>DOI: 10.1007/s001450010008</identifier><language>eng</language><publisher>New York, NY: Springer</publisher><subject>Applied sciences ; Cryptography ; Exact sciences and technology ; Information retrieval ; Information, signal and communications theory ; Signal and communications theory ; Telecommunications and information theory ; Upper bounds</subject><ispartof>Journal of cryptology, 2001, Vol.14 (1), p.37-74</ispartof><rights>2001 INIST-CNRS</rights><rights>International Association for Criptologic Research 2000.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c330t-607c2469fc9593a488ea1047b2e958e21e3a44cd4576deed41293667973a8a1b3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,778,782,4012,27910,27911,27912</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=888541$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>DI CRESCENZO, Giovanni</creatorcontrib><creatorcontrib>ISHAI, Yuval</creatorcontrib><creatorcontrib>OSTROVSKY, Rafail</creatorcontrib><title>Universal service-providers for private information retrieval</title><title>Journal of cryptology</title><description>A private information retrieval scheme allows a user to retrieve a data item of his choice from a remote database (or several copies of a database) while hiding from the database owner which particular data item he is interested in. We consider the question of private information retrieval in the so-called ``commodity-based'' model, recently proposed by Beaver for practically oriented service-provider Internet applications. We present simple and modular schemes allowing us to reduce dramatically the overall communication involving users, and substantially reduce their computation, using off-line messages sent from service-providers to databases and users. The service-providers do not need to know the database contents nor the future user's requests; all they need to know is an upper bound on the data size. Our solutions can be made resilient against collusions of databases with more than a majority (in fact, all-but-one) of the service-providers.</description><subject>Applied sciences</subject><subject>Cryptography</subject><subject>Exact sciences and technology</subject><subject>Information retrieval</subject><subject>Information, signal and communications theory</subject><subject>Signal and communications theory</subject><subject>Telecommunications and information theory</subject><subject>Upper bounds</subject><issn>0933-2790</issn><issn>1432-1378</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><recordid>eNpVUE1LxDAUDKJgXT16L3iOvnw1ycGDLH7Bghf3HLLpK2TptmvSLfjvjayIXt7jDfNmhiHkmsEtA9B3GYBJVQYAmBNSMSk4ZUKbU1KBFYJybeGcXOS8LSSttKjI_XqIM6bs-zpjmmNAuk_jHNuC1d2Y6n2Ks5-wjkO5dn6K41AnnFLE2feX5Kzzfcarn70g66fH9-ULXb09vy4fVjQIARNtQAcuG9sFq6zw0hj0DKTecLTKIGdYQBlaqXTTIraScSuaRlstvPFsIxbk5qhbsn0cME9uOx7SUCwdF0ZrxlVjCoseWSGNOSfsXAm_8-nTMXDfDbl_Df1R9Tn4vkt-CDH_PhljlGTiCwIUZBM</recordid><startdate>2001</startdate><enddate>2001</enddate><creator>DI CRESCENZO, Giovanni</creator><creator>ISHAI, Yuval</creator><creator>OSTROVSKY, Rafail</creator><general>Springer</general><general>Springer Nature B.V</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>2001</creationdate><title>Universal service-providers for private information retrieval</title><author>DI CRESCENZO, Giovanni ; ISHAI, Yuval ; OSTROVSKY, Rafail</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c330t-607c2469fc9593a488ea1047b2e958e21e3a44cd4576deed41293667973a8a1b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Applied sciences</topic><topic>Cryptography</topic><topic>Exact sciences and technology</topic><topic>Information retrieval</topic><topic>Information, signal and communications theory</topic><topic>Signal and communications theory</topic><topic>Telecommunications and information theory</topic><topic>Upper bounds</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>DI CRESCENZO, Giovanni</creatorcontrib><creatorcontrib>ISHAI, Yuval</creatorcontrib><creatorcontrib>OSTROVSKY, Rafail</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>Journal of cryptology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>DI CRESCENZO, Giovanni</au><au>ISHAI, Yuval</au><au>OSTROVSKY, Rafail</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Universal service-providers for private information retrieval</atitle><jtitle>Journal of cryptology</jtitle><date>2001</date><risdate>2001</risdate><volume>14</volume><issue>1</issue><spage>37</spage><epage>74</epage><pages>37-74</pages><issn>0933-2790</issn><eissn>1432-1378</eissn><abstract>A private information retrieval scheme allows a user to retrieve a data item of his choice from a remote database (or several copies of a database) while hiding from the database owner which particular data item he is interested in. We consider the question of private information retrieval in the so-called ``commodity-based'' model, recently proposed by Beaver for practically oriented service-provider Internet applications. We present simple and modular schemes allowing us to reduce dramatically the overall communication involving users, and substantially reduce their computation, using off-line messages sent from service-providers to databases and users. The service-providers do not need to know the database contents nor the future user's requests; all they need to know is an upper bound on the data size. Our solutions can be made resilient against collusions of databases with more than a majority (in fact, all-but-one) of the service-providers.</abstract><cop>New York, NY</cop><pub>Springer</pub><doi>10.1007/s001450010008</doi><tpages>38</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0933-2790 |
ispartof | Journal of cryptology, 2001, Vol.14 (1), p.37-74 |
issn | 0933-2790 1432-1378 |
language | eng |
recordid | cdi_proquest_journals_2387712568 |
source | Springer Nature - Complete Springer Journals |
subjects | Applied sciences Cryptography Exact sciences and technology Information retrieval Information, signal and communications theory Signal and communications theory Telecommunications and information theory Upper bounds |
title | Universal service-providers for private information retrieval |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T19%3A27%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Universal%20service-providers%20for%20private%20information%20retrieval&rft.jtitle=Journal%20of%20cryptology&rft.au=DI%20CRESCENZO,%20Giovanni&rft.date=2001&rft.volume=14&rft.issue=1&rft.spage=37&rft.epage=74&rft.pages=37-74&rft.issn=0933-2790&rft.eissn=1432-1378&rft_id=info:doi/10.1007/s001450010008&rft_dat=%3Cproquest_cross%3E2387712568%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2387712568&rft_id=info:pmid/&rfr_iscdi=true |