{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T03:03:08Z","timestamp":1763348588310,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T00:00:00Z","timestamp":1701388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No.61902428"],"award-info":[{"award-number":["No.61902428"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The computational complexity of privacy information retrieval protocols is often linearly related to database size. When the database size is large, the efficiency of privacy information retrieval protocols is relatively low. This paper designs an effective privacy information retrieval model based on hybrid fully homomorphic encryption. The assignment method is cleverly used to replace a large number of homomorphic encryption operations. At the same time, the multiplicative homomorphic encryption scheme is first used to deal with the large-scale serialization in the search, and then the fully homomorphic encryption scheme is used to deal with the remaining simple operations. The depth of operations supported by the fully homomorphic scheme no longer depends on the size of the database, but only needs to support the single homomorphic encryption scheme to decrypt the circuit depth. Based on this hybrid homomorphic encryption retrieval model, the efficiency of homomorphic privacy information retrieval model can be greatly improved.<\/jats:p>","DOI":"10.1186\/s42400-023-00168-7","type":"journal-article","created":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T02:02:03Z","timestamp":1701396123000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Research on privacy information retrieval model based on hybrid homomorphic encryption"],"prefix":"10.1186","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6474-2298","authenticated-orcid":false,"given":"Wei-tao","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guang","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-zheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dian-hua","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,1]]},"reference":[{"key":"168_CR1","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1515\/popets-2016-0010","volume":"2","author":"C Aguilar-Melchor","year":"2016","unstructured":"Aguilar-Melchor C, Barrier J, Fousse L et al (2016) XPIR: private information retrieval for everyone. Proc Priv Enhancing Technol 2:155\u2013174","journal-title":"Proc Priv Enhancing Technol"},{"issue":"1","key":"168_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.54692\/ijeci.2023.0701125","volume":"7","author":"H Akbar","year":"2023","unstructured":"Akbar H, Zubair M, Malik MS (2023) The security issues and challenges in cloud computing. Int J Electron Crime Investig 7(1):13\u201332","journal-title":"Int J Electron Crime Investig"},{"key":"168_CR3","doi-asserted-by":"crossref","unstructured":"Ambainis A (1997) Upper bound on the communication complexity of private information retrieval. In: International colloquium on automata, languages, and programming. Springer, Berlin, pp 401\u2013407","DOI":"10.1007\/3-540-63165-8_196"},{"key":"168_CR4","doi-asserted-by":"crossref","unstructured":"Angel S, Chen H, Laine K et al (2018) PIR with compressed queries and amortized query processing. In: 2018 IEEE symposium on security and privacy (SP). IEEE, pp 962\u2013979","DOI":"10.1109\/SP.2018.00062"},{"key":"168_CR5","doi-asserted-by":"crossref","unstructured":"Beimel A, Ishai Y (2001) Information-theoretic private information retrieval: a unified construction. In: Proceeding of the 28th international colloquium on automata, languages and programming, Crete, Greece. Springer, Berlin, pp 912\u2013924","DOI":"10.1007\/3-540-48224-5_74"},{"key":"168_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011a) Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Proceedings of the 31st annual conference on advances in cryptology. Springer, Berlin, pp 505\u2013524","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"168_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski Z, Vaikuntanathan V (2011b) Efficient fully homomorphic encryption from (standard) LWE. In: Proceedings of the 52th annual symposium on foundations of computer science. IEEE Computer Society, Washington, DC, pp 97\u2013106","DOI":"10.1109\/FOCS.2011.12"},{"key":"168_CR8","doi-asserted-by":"crossref","unstructured":"Cachin C, Micali S, Stadler M (1999) Computationally private information retrieval with polylogarithmic communication. In: Proceedings of 17th international conference on the theory and application of cryptographic techniques, Prague, Czech Republic. Springer, Berlin, pp 402\u2013414","DOI":"10.1007\/3-540-48910-X_28"},{"key":"168_CR9","doi-asserted-by":"crossref","unstructured":"Chor B, Gilboa N (1997) Computationally private information retrieval. In: Proceedings of the 29th annual ACM symposium on theory of computing, El Paso, TX, USA. ACM, New York, NY, pp 304\u2013313","DOI":"10.1145\/258533.258609"},{"key":"168_CR10","doi-asserted-by":"crossref","unstructured":"Chor B, Goldreich O, Kushilevitz E et al (1995) Private information retrieval. In: Proceeding of the 36th annual symposium on foundations of computer science. IEEE, pp 41\u201350","DOI":"10.1109\/SFCS.1995.492461"},{"key":"168_CR11","doi-asserted-by":"crossref","unstructured":"Dor\u00f6z Y, Sunar B, Hammouri G (2014) Bandwidth efficient PIR from NTRU. In: International conference on financial cryptography and data security. Springer, Berlin, pp 195\u2013207","DOI":"10.1007\/978-3-662-44774-1_16"},{"key":"168_CR12","unstructured":"Eltarjaman W, Annadata P (2016) Comparative study of private information retrieval protocols. In: Proceedings of the 6th international multi-conference on complexity, informatics and cybernetics, pp 204\u2013209"},{"key":"168_CR13","unstructured":"Gautam D, Shivhare R (2022) Cloud security aspects using homomorphic encryption: a review. Res J Eng Technol Med Sci 5(04). ISSN: 2582-6212"},{"key":"168_CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1142\/S0219493709002610","volume":"9","author":"C Gentry","year":"2009","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. STOC 9:169\u2013178","journal-title":"STOC"},{"key":"168_CR15","doi-asserted-by":"crossref","unstructured":"Gentry C, Halevi S (2019) Compressible FHE with applications to PIR. In: Theory of cryptography: 17th international conference, TCC 2019, Nuremberg, Germany, December 1\u20135, 2019, proceedings, part II. Springer, Cham, pp 438\u2013464","DOI":"10.1007\/978-3-030-36033-7_17"},{"key":"168_CR16","doi-asserted-by":"crossref","unstructured":"Ichibane Y, Gahi Y, Guennoun M et al (2015) Performance analysis of private information retrieval scheme based on homomorphic encryption. In: Proceedings of the 5th international conference on information communication technology and accessibility (ICTA). IEEE, pp 1\u20136","DOI":"10.1109\/ICTA.2015.7426877"},{"key":"168_CR17","doi-asserted-by":"crossref","unstructured":"Ishai Y, Kushilevitz E (1999) Improved upper bounds on information-theoretic private information retrieval. In: Proceedings of the 31th annual ACM symposium on theory of computing, Atlanta, GA, USA. ACM, New York, NY, pp 79\u201388","DOI":"10.1145\/301250.301275"},{"issue":"1","key":"168_CR18","first-page":"11","volume":"E82-A","author":"T Itoh","year":"1999","unstructured":"Itoh T (1999) Efficient private information retrieval. IEICE Trans Fundam Electron Commun Comput Sci E82-A(1):11\u201320","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"168_CR19","doi-asserted-by":"crossref","unstructured":"Kushilevitz E, Ostrovsky R (2000) One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In: Proceedings of advances in cryptology, Bruges, Belgium. Springer, Berlin, pp 104\u2013121","DOI":"10.1007\/3-540-45539-6_9"},{"key":"168_CR20","doi-asserted-by":"crossref","unstructured":"Kushilevitz E, Ostrovsky R (1997) Replication is not needed: single database, computationally-private information retrieval. In: Proceedings of the 38th IEEE symposium on foundations of computer science, Miami Beach, FL, USA. IEEE, Los Alamitos, CA, pp 364\u2013373","DOI":"10.1109\/SFCS.1997.646125"},{"key":"168_CR21","first-page":"280","volume":"34","author":"Z Li","year":"2017","unstructured":"Li Z, Ma C, Wang D et al (2017) Toward single-server private information retrieval protocol via learning with errors. J Inf Secur Appl 34:280\u2013284","journal-title":"J Inf Secur Appl"},{"key":"168_CR22","doi-asserted-by":"crossref","unstructured":"Menon SJ, Wu DJ (2022) Spiral: fast, high-rate single-server PIR via FHE composition. In: 2022 IEEE symposium on security and privacy (SP). IEEE, pp 930\u2013947","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"168_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11659-4","volume-title":"Post-quantum cryptography","author":"M Mosca","year":"2014","unstructured":"Mosca M (2014) Post-quantum cryptography. Springer, Cham"},{"key":"168_CR24","doi-asserted-by":"crossref","unstructured":"Mughees MH, Chen H, Ren L (2021) OnionPIR: response efficient single-server PIR. In: Proceedings of the 2021 ACM SIGSAC conference on computer and communications security, pp 2292\u20132306","DOI":"10.1145\/3460120.3485381"},{"issue":"11","key":"168_CR25","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Adlman L, Dertouzos ML (1978) On data banks and privacy homomorphisms. Found Secur Comput 4(11):169\u2013180","journal-title":"Found Secur Comput"},{"key":"168_CR26","first-page":"107","volume":"2023","author":"C Rout","year":"2022","unstructured":"Rout C, Sethi S, Sahoo RK et al (2022) Empirical analysis of the impact of homomorphic encryption on cloud computing. Intell Syst Appl Sel Proc ICISA 2023:107\u2013120","journal-title":"Intell Syst Appl Sel Proc ICISA"},{"key":"168_CR27","doi-asserted-by":"crossref","unstructured":"Sinha A, Singh NK, Srivastava A et al (2023) Cloud computing security, risk, and challenges: a detailed analysis of preventive measures and applications. In:Machine intelligence, big data analytics, and IoT in image processing: practical applications, p 225","DOI":"10.1002\/9781119865513.ch10"},{"key":"168_CR28","doi-asserted-by":"crossref","unstructured":"Wang S, Agrawal D, El Abbadi A (2010) Generalizing PIR for practical private retrieval of public data. In: Proceedings of the 24th IFIP annual conference on data and applications security and privacy, Rome, Italy. Springer, Heidelberg, pp 1\u201316","DOI":"10.1007\/978-3-642-13739-6_1"},{"issue":"5","key":"168_CR29","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/TKDE.2012.90","volume":"25","author":"X Yi","year":"2013","unstructured":"Yi X, Kaosar MG, Paulet R et al (2013) Single-database private information retrieval from fully homomorphic encryption. IEEE Trans Knowl Data Eng 25(5):1125\u20131134","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-023-00168-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-023-00168-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-023-00168-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,1]],"date-time":"2023-12-01T02:06:27Z","timestamp":1701396387000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-023-00168-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["168"],"URL":"https:\/\/doi.org\/10.1186\/s42400-023-00168-7","relation":{},"ISSN":["2523-3246"],"issn-type":[{"type":"electronic","value":"2523-3246"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"assertion":[{"value":"13 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"31"}}