{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:44:22Z","timestamp":1740149062473,"version":"3.37.3"},"reference-count":34,"publisher":"Wiley","license":[{"start":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:00:00Z","timestamp":1619568000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&D Program of China","award":["2017YFB0802000","U19B2021","61972457","MMJJ20180111","2020ZDLGY08-04"],"award-info":[{"award-number":["2017YFB0802000","U19B2021","61972457","MMJJ20180111","2020ZDLGY08-04"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2017YFB0802000","U19B2021","61972457","MMJJ20180111","2020ZDLGY08-04"],"award-info":[{"award-number":["2017YFB0802000","U19B2021","61972457","MMJJ20180111","2020ZDLGY08-04"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Cryptography Development Fund","award":["2017YFB0802000","U19B2021","61972457","MMJJ20180111","2020ZDLGY08-04"],"award-info":[{"award-number":["2017YFB0802000","U19B2021","61972457","MMJJ20180111","2020ZDLGY08-04"]}]},{"name":"Key Research and Development Program of Shaanxi","award":["2017YFB0802000","U19B2021","61972457","MMJJ20180111","2020ZDLGY08-04"],"award-info":[{"award-number":["2017YFB0802000","U19B2021","61972457","MMJJ20180111","2020ZDLGY08-04"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2021,4,28]]},"abstract":"<jats:p>Private information retrieval (PIR) protocol is a powerful cryptographic tool and has received considerable attention in recent years as it can not only help users to retrieve the needed data from database servers but also protect them from being known by the servers. Although many PIR protocols have been proposed, it remains an open problem to design an efficient PIR protocol whose communication overhead is irrelevant to the database size<jats:inline-formula><a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><a:mi>N<\/a:mi><\/a:math><\/jats:inline-formula>. In this paper, to answer this open problem, we present a new communication-efficient PIR protocol based on our proposed single-ciphertext fully homomorphic encryption (FHE) scheme, which supports unlimited computations with single variable over a single ciphertext even without access to the secret key. Specifically, our proposed PIR protocol is characterized by combining our single-ciphertext FHE with Lagrange interpolating polynomial technique to achieve better communication efficiency. Security analyses show that the proposed PIR protocol can efficiently protect the privacy of the user and the data in the database. In addition, both theoretical analyses and experimental evaluations are conducted, and the results indicate that our proposed PIR protocol is also more efficient and practical than previously reported ones. To the best of our knowledge, our proposed protocol is the first PIR protocol achieving<jats:inline-formula><c:math xmlns:c=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><c:mi>O<\/c:mi><c:mfenced open=\"(\" close=\")\" separators=\"|\"><c:mrow><c:mn>1<\/c:mn><\/c:mrow><\/c:mfenced><\/c:math><\/jats:inline-formula>communication efficiency on the user side, irrelevant to the database size<jats:inline-formula><h:math xmlns:h=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\"><h:mi>N<\/h:mi><\/h:math><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1155\/2021\/5553256","type":"journal-article","created":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T19:24:06Z","timestamp":1619637846000},"page":"1-14","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Private Information Retrieval Protocol with Homomorphically Computing Univariate Polynomials"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7703-882X","authenticated-orcid":true,"given":"Wenju","family":"Xu","sequence":"first","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks, Xidian University, Xi\u2019an 710071, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2554-4464","authenticated-orcid":true,"given":"Baocang","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks, Xidian University, Xi\u2019an 710071, China"},{"name":"Cryptographic Research Center, Xidian University, Xi\u2019an 710071, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5720-0941","authenticated-orcid":true,"given":"Rongxing","family":"Lu","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, University of New Brunswick, Fredericton NB E3B 5A3, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1055-5400","authenticated-orcid":true,"given":"Quanbo","family":"Qu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks, Xidian University, Xi\u2019an 710071, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9703-2943","authenticated-orcid":true,"given":"Yange","family":"Chen","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks, Xidian University, Xi\u2019an 710071, China"},{"name":"School of Information Engineering, Xuchang University, Xuchang 461000, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1977-0959","authenticated-orcid":true,"given":"Yupu","family":"Hu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Integrated Service Networks, Xidian University, Xi\u2019an 710071, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_26"},{"first-page":"364","article-title":"Replication is NOT needed: SINGLE database, computationally-private information retrieval","author":"E. Skeith","key":"2"},{"first-page":"104","article-title":"One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval","author":"E. Skeith","key":"3"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_65"},{"key":"5","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1515\/popets-2016-0010","article-title":"Private information retrieval for everyone","volume":"2","author":"C. A. Melchor","year":"2016","journal-title":"PoPETs"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2012.90"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2016.11.003"},{"key":"8","unstructured":"GentryC.\u201cFully homomorphic encryption scheme\u201d2009Kunnamangalam, IndiaStanford UniversityPhD Thesis"},{"key":"9","first-page":"169","volume-title":"Fully Homomorphic Encryption Using Ideal Lattices","author":"C. Gentry","year":"2009"},{"first-page":"97","article-title":"Efficient fully homomorphic encryption from (standard) LWE","author":"Z. Brakerski","key":"10"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44774-1_16"},{"first-page":"24","article-title":"Fully homomorphic encryption over the integers","author":"M. van Dijk","key":"12"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46447-2_31"},{"key":"14","article-title":"Finite fields for computer scientists and engineer","volume-title":"Kluwer International Series In Engineering And Computer Science,","author":"R. McEliece","year":"1989"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.01.037"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9192-y"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/1666420.1666444"},{"first-page":"309","article-title":"(leveled) fully homomorphic encryption without bootstrapping","author":"Z. Brakerski","key":"18"},{"first-page":"75","article-title":"Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based","author":"C. Gentry","key":"19"},{"first-page":"868","article-title":"Fully homomorphic encryption without modulus switching from classical gapsvp","author":"Z. Brakerski","key":"20"},{"first-page":"55","article-title":"on cca-secure somewhat homomorphic encryption","author":"J. Loftus","key":"21"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54388-7_8"},{"volume-title":"Modern Cryptography","year":"2015","author":"B. Yang","key":"23"},{"key":"24","article-title":"A simple framework for noise-free construction of fully homomorphic encryption from a special class of non-commutative groups","volume":"97","author":"K. Nuida","year":"2014","journal-title":"IACR Cryptology ePrint Archive"},{"key":"25","article-title":"Improved fully homomorphic public-key encryption with small ciphertext size","volume":"232","author":"M. Yagisawa","year":"2018","journal-title":"IACR Cryptology ePrint Archive"},{"key":"26","article-title":"Fully homomorphic encryption on octonion ring","volume":"733","author":"M. Yagisawa","year":"2015","journal-title":"IACR Cryptology ePrint Archive"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/access.2018.2867655"},{"article-title":"The number theory library (ntl)","year":"2017","author":"V. Shoup","key":"28"},{"key":"29","article-title":"Candidate constructions of fully homomorphic encryption on finite simple groups without ciphertext noise","volume":"97","author":"K. Nuida","year":"2015","journal-title":"IACR Cryptology ePrint Archive"},{"key":"30","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/3-540-49649-1_28","article-title":"A new efficient all-or-nothing disclosure of secrets protocol","volume-title":"Advances In Cryptology","author":"J. P. Stern","year":"1998"},{"first-page":"402","article-title":"Computationally private information retrieval with polylogarithmic communication","author":"C. Cachin","key":"31"},{"first-page":"193","article-title":"First CPIR protocol with data-dependent computation","author":"H. Lipmaa","key":"32"},{"first-page":"50","article-title":"Single database private information retrieval with logarithmic communication","author":"Y. Chang","key":"33"},{"author":"J. M. Damgard","key":"34","article-title":"A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/5553256.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/5553256.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2021\/5553256.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,25]],"date-time":"2022-12-25T19:10:52Z","timestamp":1671995452000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2021\/5553256\/"}},"subtitle":[],"editor":[{"given":"Leandros","family":"Maglaras","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,4,28]]},"references-count":34,"alternative-id":["5553256","5553256"],"URL":"https:\/\/doi.org\/10.1155\/2021\/5553256","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2021,4,28]]}}}