{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T04:11:44Z","timestamp":1746591104412,"version":"3.40.5"},"reference-count":22,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T00:00:00Z","timestamp":1414972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"name":"Innovation Research Funds of Huazhong University of Science & Technology","award":["2011QN055"],"award-info":[{"award-number":["2011QN055"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security Comm Networks"],"published-print":{"date-parts":[[2015,5,25]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Private information retrieval (PIR) is a technique for clients to retrieve data from database while hiding the identity of data. Existing PIR schemes are impractical because of the expensive cost for complete privacy. In this paper, we propose a flexible, distributed scheme for PIR. First, a new protocol row\u2010based computational PIR (Robac\u2010PIR) is designed to make a trade\u2010off between privacy and efficiency. Second, we apply Robac\u2010PIR in a distributed system to further lower the computational cost. We implement the scheme, and the results show it has a good performance and can also provide the trade\u2010off. Copyright \u00a9 2014 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/sec.1102","type":"journal-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T09:42:10Z","timestamp":1415007730000},"page":"1537-1546","source":"Crossref","is-referenced-by-count":0,"title":["A distributed scheme for row\u2010based computational private information retrieval"],"prefix":"10.1002","volume":"8","author":[{"given":"Hong","family":"Zhu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology Huazhong University of Science &amp; Technology Wuhan 430074 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology Huazhong University of Science &amp; Technology Wuhan 430074 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"L\u00fc","sequence":"additional","affiliation":[{"name":"Brunel University Uxbridge UB8 3PH U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meiyi","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology Huazhong University of Science &amp; Technology Wuhan 430074 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Zou","sequence":"additional","affiliation":[{"name":"The 3rd Research Institute of Ministry of Public Security (Key Laboratory of Information Network Security, Ministry of Public Security) Shanghai 201204 China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Chen","sequence":"additional","affiliation":[{"name":"The 3rd Research Institute of Ministry of Public Security (Key Laboratory of Information Network Security, Ministry of Public Security) Shanghai 201204 China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2014,11,3]]},"reference":[{"key":"e_1_2_8_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"e_1_2_8_3_1","doi-asserted-by":"crossref","unstructured":"MirkovicJ.Privacy\u2010safe network trace sharing via secure queries.Proceedings of the 1st ACM Workshop on Network Data Anonymization Alexandria USA 2008;3\u201310.","DOI":"10.1145\/1456441.1456445"},{"key":"e_1_2_8_4_1","doi-asserted-by":"crossref","unstructured":"HenryR OlumofinF GoldbergI.Practical PIR for electronic commerce.Proceedings of the 18th ACM Conference on Computer and Communications Security Chicago USA 2011;677\u2013689.","DOI":"10.1145\/2046707.2046784"},{"key":"e_1_2_8_5_1","doi-asserted-by":"crossref","unstructured":"TrostleJ ParrishA.Efficient computationally private information retrieval from anonymity or trapdoor groups.13th Information Security Conference Boca Raton USA 2010;114\u2013128.","DOI":"10.1007\/978-3-642-18178-8_10"},{"key":"e_1_2_8_6_1","doi-asserted-by":"crossref","unstructured":"AmbainisA.Upper bound on the communication complexity of private information retrieval.Proceeding of the 24th ICALP Bologna Italy 1997;401\u2013407.","DOI":"10.1007\/3-540-63165-8_196"},{"key":"e_1_2_8_7_1","doi-asserted-by":"crossref","unstructured":"IshaiY KushilevitzE.Improved upper bounds on information\u2010theoretic private information retrieval.Proceedings of the 31st Annual ACM Symposium on Theory of Computing Atlanta USA 1999;79\u201388.","DOI":"10.1145\/301250.301275"},{"key":"e_1_2_8_8_1","doi-asserted-by":"crossref","unstructured":"BeimelA IshaiY.Information\u2010theoretic private information retrieval: a unified construction.Proceeding of the 28th ICALP Heraklion Greece 2001;912\u2013926.","DOI":"10.1007\/3-540-48224-5_74"},{"key":"e_1_2_8_9_1","doi-asserted-by":"crossref","unstructured":"BeimelA IshaiY KushilevitzE RayomndJF.Breaking the O(n1\/(2k\u2009\u2212\u20091)) barrier for information\u2010theoretic private information retrieval.Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science Vancouver Canada 2002;261\u2013270.","DOI":"10.1109\/SFCS.2002.1181949"},{"key":"e_1_2_8_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.03.002"},{"key":"e_1_2_8_11_1","doi-asserted-by":"crossref","unstructured":"BakirasS NikolopoulosKF.Adjusting the trade\u2010off between privacy guarantees and computational cost in secure hardware PIR.Proceedings of the 8th VLDB Workshop Seattle USA 2011;128\u2013144.","DOI":"10.1007\/978-3-642-23556-6_9"},{"key":"e_1_2_8_12_1","doi-asserted-by":"crossref","unstructured":"WangS AgrawalD El AbbadiA.Generalizing PIR for practical private retrieval of public data.Data and Applications Security and Privacy XXIV. 24th Annual IFIP WG 11.3 Working Conference Rome Italy 2010;1\u201316.","DOI":"10.1007\/978-3-642-13739-6_1"},{"key":"e_1_2_8_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2010.60"},{"key":"e_1_2_8_14_1","doi-asserted-by":"crossref","unstructured":"Gro\u00dfschadlJ.The Chinese remainder theorem and its application in high\u2010speed RSA crypto chip.16th Annual Computer Security Applications Conference New Orleans USA 2000;384\u2013393.","DOI":"10.1109\/ACSAC.2000.898893"},{"key":"e_1_2_8_15_1","doi-asserted-by":"crossref","unstructured":"ChorB GilboaN.Computationally private information retrieval.Proceedings of the 29th Annual ACM Symposium on Theory of Computing El Paso USA 1997;304\u2013313.","DOI":"10.1145\/258533.258609"},{"key":"e_1_2_8_16_1","doi-asserted-by":"crossref","unstructured":"KushilevitzE OstrovskyR.Replication is not needed: single database computationally private information retrieval.Proceedings of the 38th IEEE Symposium on Foundations of Computer Science Miami Beach USA 1997;364\u2013373.","DOI":"10.1109\/SFCS.1997.646125"},{"key":"e_1_2_8_17_1","doi-asserted-by":"crossref","unstructured":"GrothJ KiayiasA LipmaaH.Multi\u2010query computationally\u2010private information retrieval with constant communication rate.13th International Conference on Practice and Theory in Public Key Cryptography (PKC 2010) Paris France 2010;107\u2013123.","DOI":"10.1007\/978-3-642-13013-7_7"},{"key":"e_1_2_8_18_1","doi-asserted-by":"crossref","unstructured":"GentryC RamzanZ.Single\u2010database private information retrieval with constant communication rate.Proceedings of the 32nd International Colloquium on Automata Languages and Programming Lisbon Portugal 2005;803\u2013815.","DOI":"10.1007\/11523468_65"},{"key":"e_1_2_8_19_1","doi-asserted-by":"crossref","unstructured":"KushilevitzE OstrovskyR.One\u2010way trapdoor permutations are sufficient for non\u2010trivial single\u2010server private information retrieval.Proceedings of Advances in Cryptology\u2014EUROCRYPT 2000 Bruges Belgium 2000;104\u2013121.","DOI":"10.1007\/3-540-45539-6_9"},{"key":"e_1_2_8_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2011.2166783"},{"key":"e_1_2_8_21_1","doi-asserted-by":"crossref","unstructured":"GoldbergI.Improving the robustness of private information retrieval.IEEE Symposium on Security and Privacy Oakland USA 2007;131\u2013145.","DOI":"10.1109\/SP.2007.23"},{"key":"e_1_2_8_22_1","doi-asserted-by":"publisher","DOI":"10.1108\/14684520910985693"},{"key":"e_1_2_8_23_1","doi-asserted-by":"crossref","unstructured":"OlumofinF GoldbergI.Privacy\u2010preserving queries over relational databases.Proceedings of the 10th International Symposium on Privacy Enhancing Technologies Berlin Germany 2010;75\u201392.","DOI":"10.1007\/978-3-642-14527-8_5"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fsec.1102","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fsec.1102","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/sec.1102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T04:55:48Z","timestamp":1746507348000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/sec.1102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,3]]},"references-count":22,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,5,25]]}},"alternative-id":["10.1002\/sec.1102"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1002\/sec.1102","archive":["Portico"],"relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"type":"print","value":"1939-0114"},{"type":"electronic","value":"1939-0122"}],"subject":[],"published":{"date-parts":[[2014,11,3]]}}}