{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:09:10Z","timestamp":1767035350632,"version":"3.48.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:00:00Z","timestamp":1765756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:00:00Z","timestamp":1765756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Great Bay University","award":["H24120002"],"award-info":[{"award-number":["H24120002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-05015-x","type":"journal-article","created":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T05:06:39Z","timestamp":1765775199000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Authenticated sublinear quantum private information retrieval"],"prefix":"10.1007","volume":"24","author":[{"given":"Fengxia","family":"Liu","sequence":"first","affiliation":[]},{"given":"Zhiyong","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Oleksiy","family":"Zhedanov","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Heng","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Zhiming","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Kun","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Zixian","family":"Gong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,15]]},"reference":[{"issue":"6","key":"5015_CR1","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private Information Retrieval. J. ACM 45(6), 965\u2013981 (1998)","journal-title":"J. ACM"},{"key":"5015_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00145-007-0424-2","volume":"20","author":"A Beimel","year":"2007","unstructured":"Beimel, A., Stahl, Y.: Robust information-theoretic private information retrieval. J. Cryptology 20, 295-C321 (2007)","journal-title":"J. Cryptology"},{"key":"5015_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.3390\/e23010054","volume":"23","author":"KW Yu","year":"2021","unstructured":"Yu, K.W., Lim, C.C.W.: Provably secure symmetric private information retrieval with quantum cryptography. Entropy 23, 54 (2021). https:\/\/doi.org\/10.3390\/e23010054","journal-title":"Entropy"},{"key":"5015_CR4","first-page":"8","volume":"67","author":"S Song","year":"2021","unstructured":"Song, S., Hayashi, M.: Capacity of quantum private information retrieval with colluding servers. IEEE Trans. Inf. Theory 67, 8 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"5015_CR5","doi-asserted-by":"publisher","first-page":"369","DOI":"10.4086\/toc.2012.v008a016","volume":"8","author":"F Le Gall","year":"2012","unstructured":"Le Gall, F.: Quantum private information retrievalwith sublinear communication complexity. Theory Comput. 8(1), 369\u2013374 (2012)","journal-title":"Theory Comput."},{"key":"5015_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-014-9180-2","volume":"28","author":"A Baumeler","year":"2015","unstructured":"Baumeler, A., Broadbent, A.: Quantum private information retrieval has linear communication complexity. J. Cryptol. 28, 161\u2013175 (2015)","journal-title":"J. Cryptol."},{"key":"5015_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U.V., Vidick, T.: A cryptographic test of quantumness and certifiable randomness from a single quantum device. In Mikkel Thorup, editor, 59th FOCS, pages 320-331. IEEE Computer Society Press, October (2018)","DOI":"10.1109\/FOCS.2018.00038"},{"key":"5015_CR8","doi-asserted-by":"crossref","unstructured":"Nayak, A.: Optimal lower bounds for quantum au-tomata and random access codes.In Proceedings of the40th Annual Symposium on Foundations of ComputerScience,FOCS \u201999, (1999), pages 369-376","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"5015_CR9","first-page":"04","volume":"04","author":"F Liu","year":"2024","unstructured":"Liu, F., Zheng, Z., Gong, Z., et al.: A survey on lattice-based digital signature. Cybersecurity 04, 04 (2024)","journal-title":"Cybersecurity"},{"key":"5015_CR10","doi-asserted-by":"crossref","unstructured":"Liu, F., Zheng, Z., et al.: Authenticated Sublinear Quantum Private Information Retrieval. (2025), arXiv:2504.04041","DOI":"10.1007\/s11128-025-05015-x"},{"key":"5015_CR11","volume-title":"Kun Tian","author":"Z Zheng","year":"2023","unstructured":"Zheng, Z., Liu, F.: Kun Tian. Higher Education Press of China, Mathematical theory of post-quantum cryptography (2023)"},{"key":"5015_CR12","volume-title":"A Survey on Private Information Retrieval Gasarch","author":"W Gasarch","year":"2004","unstructured":"Gasarch, W.: A Survey on Private Information Retrieval Gasarch. Bulletin of the EATCS, Citeseer (2004)"},{"key":"5015_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ipl.2004.02.003","volume":"90","author":"Iordanis Kerenidis","year":"2023","unstructured":"Kerenidis, Iordanis, de Wolf, Ronald: Quantum symmetrically-private information retrieval. Inf. Process Lett. 90, 109\u2013114 (2023). (https:\/\/api.semanticscholar.org\/CorpusID:68509)","journal-title":"Inf. Process Lett."},{"key":"5015_CR14","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Brakerski, Z., Chung, K.-M., Green, A., Lai, C.-Y., Sattath, O.: On quantum advantage in information theoretic single-server PIR. IACR Cryptol. ePrint Arch. 232, (2019)","DOI":"10.1007\/978-3-030-17659-4_8"},{"key":"5015_CR15","doi-asserted-by":"publisher","unstructured":"Aharonov, D., Ben-Or, M., Eban, E., Mahadev, U.: Interact. Proofs Quantum Comput. (2017). https:\/\/doi.org\/10.48550\/arXiv.1704.04487","DOI":"10.48550\/arXiv.1704.04487"},{"key":"5015_CR16","volume-title":"Secure Communication: CDS","author":"I Grosof","year":"2017","unstructured":"Grosof, I.: Secure Communication: CDS. PIR, PSM (2017)"},{"issue":"3","key":"5015_CR17","first-page":"181","volume":"16","author":"I Kerenidis","year":"2016","unstructured":"Kerenidis, I., Lauri\u00e8re, M., Le Gall, F., Rennela, M.: Privacy in quantum communication complexity. Quantum Inf. Comput. 16(3), 181\u2013196 (2016). (https:\/\/api.semanticscholar.org\/CorpusID:14491405)","journal-title":"Quantum Inf. Comput."},{"key":"5015_CR18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.84.022313","volume":"84","author":"L Olejnik","year":"2011","unstructured":"Olejnik, L.: Secure quantum private information retrieval using phase-encoded queries. Phys. Rev. A 84, 022313 (2011)","journal-title":"Phys. Rev. A"},{"key":"5015_CR19","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1038\/s41377-022-00996-1","volume":"11","author":"S Wang","year":"2022","unstructured":"Wang, S.: Symmetric private information retrieval supported by quantum-secure key-exchange network. Light Sci. Appl. 11, 301 (2022). https:\/\/doi.org\/10.1038\/s41377-022-00996-1","journal-title":"Light Sci. Appl."},{"issue":"1","key":"5015_CR20","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1109\/TIT.2020.3022515","volume":"67","author":"S Song","year":"2020","unstructured":"Song, S., Hayashi, M.: Capacity of quantum private information retrieval with multiple servers. IEEE Trans. Inf. Theory 67(1), 452\u2013463 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5015_CR21","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/s11128-025-04765-y","volume":"24","author":"J Hao","year":"2025","unstructured":"Hao, J., Yang, Y., Guangbao, X., et al.: Quantum private information retrieval with lattice-based access authentication. Quantum Inf. Process. 24, 148 (2025)","journal-title":"Quantum Inf. Process."},{"key":"5015_CR22","doi-asserted-by":"publisher","first-page":"4034","DOI":"10.1109\/TIFS.2023.3288989","volume":"18","author":"Y Yang","year":"2023","unstructured":"Yang, Y., Liu, B., Guangbao, X., et al.: Practical quantum anonymous private information retrieval based on quantum key distribution. IEEE Trans. Inf. Forensics Secur. 18, 4034\u20134045 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"5015_CR23","doi-asserted-by":"crossref","unstructured":"Dupuis, F., Nielsen, J.B., Salvail, L.: Secure two-party quantum evaluation of unitaries againstspecious adversaries. In Procedings of the 30th AnnualConference on Advances in Cryptology,CRYPTO (2010), Sprinter-Verlag, pages 685-706","DOI":"10.1007\/978-3-642-14623-7_37"},{"key":"5015_CR24","unstructured":"Cojocaru, Alexandru et al.: Delegated Pseudo-Secret Random Qubit Generator ArXiv:abs\/1802.08759, (2018), n. pag"},{"key":"5015_CR25","doi-asserted-by":"crossref","unstructured":"Maitra, A., Paul G., Roy, S.: Device Independent Quantum Private Query. Phys. Rev. A 95, 042344. Published 28 April, (2017)","DOI":"10.1103\/PhysRevA.95.042344"},{"key":"5015_CR26","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1038\/s41567-022-01643-7","volume":"18","author":"GD Kahanamoku-Meyer","year":"2022","unstructured":"Kahanamoku-Meyer, G.D., Choi, S., Vazirani, U.V., Yao, N.Y.: Classically verifiable quantum advantage from a computational Bell test. Nat. Phys. 18, 918\u2013924 (2022). https:\/\/doi.org\/10.1038\/s41567-022-01643-7","journal-title":"Nat. Phys."},{"key":"5015_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.012303","volume":"96","author":"JF Fitzsimons","year":"2017","unstructured":"Fitzsimons, J.F., Kashefi, E.: Unconditionally verifiable blind quantum computation. Phys. Rev. A 96, 012303 (2017). https:\/\/doi.org\/10.1103\/PhysRevA.96.012303","journal-title":"Phys. Rev. A"},{"key":"5015_CR28","doi-asserted-by":"publisher","unstructured":"Acin, A., Massar, S., Pironio, S.: Randomness versus Nonlocality and Entanglement. Phys. Rev. Lett. 108, 100402. Published 9 March, (2012). https:\/\/doi.org\/10.1103\/PhysRevLett.108.100402.","DOI":"10.1103\/PhysRevLett.108.100402."},{"key":"5015_CR29","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical verification of quantum computations. IEEE Computer Society Press, October (2018). In Mikkel Thorup, editor, 59th FOCS: 259-267","DOI":"10.1109\/FOCS.2018.00033"},{"key":"5015_CR30","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical homomorphic encryption for quantum circuits. IEEE Computer Society Press, October (2018). In Mikkel Thorup, editor, 59th FOCS: 332-338","DOI":"10.1109\/FOCS.2018.00039"},{"key":"5015_CR31","doi-asserted-by":"crossref","unstructured":"Gheorghiu, A., Vidick, T.: Computationally-secure and composable remote state preparation. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pages 1024\u20131033. IEEE Computer Society, (2019)","DOI":"10.1109\/FOCS.2019.00066"},{"key":"5015_CR32","doi-asserted-by":"crossref","unstructured":"Coladangelo, A., Goldwasser, S., Vazirani, U.V.: Deniable encryption in a quantum world. In Stefano Leonardi and Anupam Gupta, editors, 54th ACM STOC, pages 1378\u20131391, Rome, Italy, June 20\u201324, (2022). ACM Press","DOI":"10.1145\/3519935.3520019"},{"key":"5015_CR33","volume-title":"David J","author":"S Colombo","year":"2023","unstructured":"Colombo, S., Nikitin, K., Corrigan-Gibbs, H.: David J. Wu and Bryan Ford. Authenticated private information retrieval, USENIX Security Symposium (2023)"},{"issue":"11","key":"5015_CR34","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secur. Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secur. Comput."},{"key":"5015_CR35","doi-asserted-by":"crossref","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully Homomorphic Encryption over the Integers. In: Gilbert, H. (eds) Advances in Cryptology \u2013 EUROCRYPT 2010. EUROCRYPT 2010. Lecture Notes in Computer Science, vol 6110. Springer, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"5015_CR36","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM, 2009, 56(6). Preliminary version in STOC (2005)","DOI":"10.1145\/1568318.1568324"},{"key":"5015_CR37","unstructured":"Ajtai, M.: Generating hard instances of lattice problems. Quaderni di Matematica 2004, 13, 1-32. Preliminary version in STOC (1996)"},{"key":"5015_CR38","doi-asserted-by":"publisher","first-page":"366","DOI":"10.4236\/jis.2023.144021","volume":"14","author":"Z Zheng","year":"2023","unstructured":"Zheng, Z., Liu, F., Tian, K.: An unbounded fully homomorphic encryptionscheme based on ideal lattices and Chinese remainder theorem. J. Inf. Secur. 14, 366\u2013395 (2023). https:\/\/doi.org\/10.4236\/jis.2023.144021","journal-title":"J. Inf. Secur."},{"issue":"3","key":"5015_CR39","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) Fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 36 (2014)","journal-title":"ACM Trans. Comput. Theory"},{"key":"5015_CR40","unstructured":"Craig, G., Sahai, A., Waters, B.: \"Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based.\" Annual Cryptology Conference. Springer, Berlin, Heidelberg, (2013)"},{"key":"5015_CR41","unstructured":"Hee, C.J., et al.: \"Homomorphic encryption for arithmetic of approximate numbers.\" Advances in Cryptology\u2013ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, December 3-7, 2017, Proceedings, Part I 23. Springer International Publishing, (2017)"},{"key":"5015_CR42","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Jeffery, S.: Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity. In: Gennaro, R., Robshaw, M. (eds) Advances in Cryptology \u2013 CRYPTO 2015. CRYPTO 2015. Lecture Notes in Computer Science, vol 9216. Springer, Berlin, Heidelberg (2015)","DOI":"10.1007\/978-3-662-48000-7_30"},{"key":"5015_CR43","doi-asserted-by":"crossref","unstructured":"Dulek, Y., Schaffner, C., Speelman, F.: Quantum Homomorphic Encryption for Polynomial-Sized Circuits. In: Robshaw, M., Katz, J. (eds) Advances in Cryptology \u2013 CRYPTO 2016. CRYPTO 2016. Lecture Notes in Computer Science, vol 9816. Springer, Berlin, Heidelberg (2016)","DOI":"10.1007\/978-3-662-53015-3_1"},{"key":"5015_CR44","unstructured":"Aguilar-Melchor, C., Barrier, J., Fousse L., Killijian, M.-O.: XPIR: Private Information Retrieval for Everyone, Cryptology ePrint Archive, Paper 2014\/1025. https:\/\/eprint.iacr.org\/2014\/1025"},{"key":"5015_CR45","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., et al.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy, pp. 962\u2013979. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"5015_CR46","doi-asserted-by":"crossref","unstructured":"Yael, G., Yuval, I., Eyal, K., Tal, M.: Protecting data privacy in private information retrieval schemes. In: Association for Computing Machinery Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, 151-160 (1998)","DOI":"10.1145\/276698.276723"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-05015-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-05015-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-05015-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T14:58:18Z","timestamp":1767020298000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-05015-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,15]]},"references-count":46,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["5015"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-05015-x","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2025,12,15]]},"assertion":[{"value":"3 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2025","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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"398"}}