{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T22:10:06Z","timestamp":1732140606695,"version":"3.28.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T00:00:00Z","timestamp":1716854400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,28]],"date-time":"2024-05-28T00:00:00Z","timestamp":1716854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Guangdong Provincial Key Laboratory of Intelligent Measurement and Advanced Metering of Power Grid Open-end Fund"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s11235-024-01162-1","type":"journal-article","created":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T18:53:35Z","timestamp":1717181615000},"page":"743-755","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["VPIR: an efficient verifiable private information retrieval scheme resisting malicious cloud server"],"prefix":"10.1007","volume":"86","author":[{"given":"Wenqi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haolin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziwen","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,28]]},"reference":[{"key":"1162_CR1","doi-asserted-by":"crossref","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1995). Private information retrieval. In: Proceedings of IEEE 36th annual foundations of computer science, pp. 41\u201350. https:\/\/api.semanticscholar.org\/CorpusID:544823","DOI":"10.1109\/SFCS.1995.492461"},{"key":"1162_CR2","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Maffei, M., & Pecina, K. (2012). Obliviad: Provably secure and practical online behavioral advertising. In: 2012 IEEE symposium on security and privacy, IEEE, pp. 257\u2013271.","DOI":"10.1109\/SP.2012.25"},{"key":"1162_CR3","unstructured":"Kogan, D., & Corrigan-Gibbs, H. (2021). Private blocklist lookups with checklist. In: 30th USENIX security symposium (USENIX Security 21), pp. 875\u2013892."},{"key":"1162_CR4","doi-asserted-by":"crossref","unstructured":"Singanamalla, S., Chunhapanya, S., Vavru\u0161a, M., Verma, T., Wu, P., Fayed, M., Heimerl, K., Sullivan, N., & Wood, C. (2020). Oblivious dns over https (odoh): A practical privacy enhancement to dns. arXiv preprint arXiv:2011.10121","DOI":"10.2478\/popets-2021-0085"},{"key":"1162_CR5","doi-asserted-by":"crossref","unstructured":"Melchor, C. A., Barrier, J., Fousse, L., & Killijian, M. O. (2016). Xpir: Private information retrieval for everyone. Proceedings on Privacy Enhancing Technologies 155\u2013174","DOI":"10.1515\/popets-2016-0010"},{"key":"1162_CR6","doi-asserted-by":"crossref","unstructured":"Park, J., & Tibouchi, M. (2020). Shecs-pir: Somewhat homomorphic encryption-based compact and scalable private information retrieval. In: European symposium on research in computer security, Springer, pp. 86\u2013106.","DOI":"10.1007\/978-3-030-59013-0_5"},{"key":"1162_CR7","doi-asserted-by":"crossref","unstructured":"Menon, S. J., & Wu, D. J .(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":"1162_CR8","doi-asserted-by":"crossref","unstructured":"Mughees, M. H., 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"},{"key":"1162_CR9","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., & Setty, S. (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":"1162_CR10","doi-asserted-by":"crossref","unstructured":"Demmler, D., Herzberg, A., & Schneider, T. (2014). RAID-PIR: Practical multi-server PIR. In: Proceedings of the 6th edition of the ACM workshop on cloud computing security. https:\/\/api.semanticscholar.org\/CorpusID:488163","DOI":"10.1145\/2664168.2664181"},{"key":"1162_CR11","unstructured":"Devet, C., Goldberg, I., & Heninger, N. (2012). Optimally robust private information retrieval. In: USENIX security symposium. https:\/\/api.semanticscholar.org\/CorpusID:206578602"},{"key":"1162_CR12","doi-asserted-by":"crossref","unstructured":"Dvir, Z., & Gopi, S. (2014). 2-server PIR with sub-polynomial communication. In: Proceedings of the forty-seventh annual ACM symposium on theory of computing. https:\/\/api.semanticscholar.org\/CorpusID:8595187","DOI":"10.1145\/2746539.2746546"},{"key":"1162_CR13","doi-asserted-by":"publisher","first-page":"4075","DOI":"10.1109\/TIT.2017.2689028","volume":"63","author":"H Sun","year":"2017","unstructured":"Sun, H., & Jafar, S. A. (2017). The capacity of private information retrieval. IEEE Transactions on Information Theory, 63, 4075\u20134088.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1162_CR14","doi-asserted-by":"crossref","unstructured":"Tian, C., Sun, H., & Chen, J. (2018). Capacity-achieving private information retrieval codes with optimal message size and upload cost. In: ICC 2019\u20132019 IEEE international conference on communications (ICC), pp. 1\u20136. https:\/\/api.semanticscholar.org\/CorpusID:52072833","DOI":"10.1109\/ICC.2019.8761802"},{"key":"1162_CR15","doi-asserted-by":"publisher","first-page":"6842","DOI":"10.1109\/TIT.2018.2828310","volume":"64","author":"KA Banawan","year":"2017","unstructured":"Banawan, K. A., & Ulukus, S. (2017). Multi-message private information retrieval: Capacity results and near-optimal schemes. IEEE Transactions on Information Theory, 64, 6842\u20136862.","journal-title":"IEEE Transactions on Information Theory"},{"key":"1162_CR16","doi-asserted-by":"crossref","unstructured":"Ryan, M. D. (2013). Enhanced certificate transparency and end-to-end encrypted mail. Cryptology ePrint Archive","DOI":"10.14722\/ndss.2014.23379"},{"key":"1162_CR17","unstructured":"Henzinger, A., Hong, M. M., Corrigan-Gibbs, H., Meiklejohn, S., & Vaikuntanathan, V .(2023a). One server for the price of two: Simple and fast single-server private information retrieval. In: Usenix security, vol.\u00a023."},{"key":"1162_CR18","doi-asserted-by":"crossref","unstructured":"Henzinger, A., Dauterman ,E., Corrigan-Gibbs, H., & Zeldovich, N. (2023b). Private web search with tiptoe. In: Proceedings of the 29th symposium on operating systems principles, pp. 396\u2013416.","DOI":"10.1145\/3600006.3613134"},{"key":"1162_CR19","doi-asserted-by":"crossref","unstructured":"Green, M., Ladd ,W., & Miers, I. (2016). A protocol for privately reporting ad impressions at scale. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pp. 1591\u20131601.","DOI":"10.1145\/2976749.2978407"},{"key":"1162_CR20","unstructured":"Angel, S., & Setty, S. (2016). Unobservable communication over fully untrusted infrastructure. In: 12th USENIX symposium on operating systems design and implementation (OSDI 16), pp. 551\u2013569."},{"key":"1162_CR21","doi-asserted-by":"crossref","unstructured":"Cheng, R., Scott, W., Masserova, E., Zhang, I., Goyal, V., Anderson ,T., Krishnamurthy, A., & Parno, B. (2020). Talek: Private group messaging with hidden access patterns. In: Annual computer security applications conference, pp. 84\u201399.","DOI":"10.1145\/3427228.3427231"},{"key":"1162_CR22","unstructured":"Ali, A., Lepoint, T., Patel, S., Raykova, M., Schoppmann, P., Seth, K., & Yeo, K. (2021). Communication\u2013computation trade-offs in PIR. In: 30th USENIX security symposium (USENIX Security 21), pp. 1811\u20131828."},{"key":"1162_CR23","unstructured":"Gupta, T., Crooks, N., Mulhern, W., Setty, S., Alvisi, L., & Walfish, M. (2016). Scalable and private media consumption with popcorn. In: 13th USENIX symposium on networked systems design and implementation (NSDI 16), pp. 91\u2013107."},{"key":"1162_CR24","unstructured":"Colombo, S., Nikitin ,K., Corrigan-Gibbs, H., Wu, D. J., & Ford, B. (2023). Authenticated private information retrieval. In: 32nd USENIX security symposium (USENIX Security 23), pp. 3835\u20133851."},{"key":"1162_CR25","unstructured":"Chor, B., Gilboa, N., & Naor, M. (1998). Private information retrieval by keywords. IACR Cryptol ePrint Arch 1998:3, https:\/\/api.semanticscholar.org\/CorpusID:17509445"},{"key":"1162_CR26","unstructured":"Angel, S., & Setty, S. (2016). Unobservable communication over fully untrusted infrastructure. In: 12th USENIX symposium on operating systems design and implementation (OSDI 16), pp. 551\u2013569."},{"key":"1162_CR27","unstructured":"Sion, R., & Carbunar, B. (2007). On the computational practicality of private information retrieval. In: Proceedings of the network and distributed systems security symposium, Internet Society Geneva, Switzerland, pp. 2006\u201306."},{"issue":"6","key":"1162_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O. (2009). On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM (JACM), 56(6), 1\u201340.","journal-title":"Journal of the ACM (JACM)"},{"key":"1162_CR29","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai ,A., & Waters, B. (2013). Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in cryptology\u2013CRYPTO 2013: 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18\u201322, 2013. Proceedings, Part I, Springer, pp. 75\u201392.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1162_CR30","doi-asserted-by":"crossref","unstructured":"Gentry, C., & Halevi, S. (2019). Compressible FHE with applications to PIR. In: Theory of cryptography conference, Springer, pp. 438\u2013464.","DOI":"10.1007\/978-3-030-36033-7_17"},{"key":"1162_CR31","unstructured":"Ahmad, I., Yang ,Y., Agrawal, D., El\u00a0Abbadi, A., & Gupta, T. (2021). Addra: Metadata-private voice communication over fully untrusted infrastructure. In: 15th$$\\{$$USENIX$$\\}$$symposium on operating systems design and implementation ($$\\{$$OSDI$$\\}$$ 21)."},{"issue":"6","key":"1162_CR32","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., & Sudan, M. (1998). Private information retrieval. Journal of the ACM (JACM), 45(6), 965\u2013981.","journal-title":"Journal of the ACM (JACM)"},{"key":"1162_CR33","doi-asserted-by":"crossref","unstructured":"Efremenko, K. (2009). 3-query locally decodable codes of subexponential length. In: Proceedings of the forty-first annual ACM symposium on theory of computing, pp. 39\u201344.","DOI":"10.1145\/1536414.1536422"},{"issue":"4","key":"1162_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2968443","volume":"63","author":"Z Dvir","year":"2016","unstructured":"Dvir, Z., & Gopi, S. (2016). 2-server PIR with subpolynomial communication. Journal of the ACM (JACM), 63(4), 1\u201315.","journal-title":"Journal of the ACM (JACM)"},{"key":"1162_CR35","doi-asserted-by":"crossref","unstructured":"Gilboa ,N., & Ishai, Y. (2014). Distributed point functions and their applications. In: Advances in cryptology\u2013EUROCRYPT 2014: 33rd annual international conference on the theory and applications of cryptographic techniques, Copenhagen, Denmark, May 11\u201315, 2014. Proceedings 33, Springer, pp. 640\u2013658.","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"1162_CR36","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa ,N., & Ishai, Y. (2016). Function secret sharing: Improvements and extensions. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pp. 1292\u20131303.","DOI":"10.1145\/2976749.2978429"},{"key":"1162_CR37","doi-asserted-by":"publisher","first-page":"112","DOI":"10.2478\/popets-2019-0061","volume":"2019","author":"SM Hafiz","year":"2019","unstructured":"Hafiz, S. M., & Henry, R. (2019). A bit more than a bit is more than a bit better. Proceedings on Privacy Enhancing Technologies, 2019, 112\u2013131.","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"1162_CR38","doi-asserted-by":"crossref","unstructured":"Shah, N. B., Rashmi, K., & Ramchandran, K. (2014). One extra bit of download ensures perfectly private information retrieval. In: 2014 IEEE international symposium on information theory, IEEE, pp. 856\u2013860.","DOI":"10.1109\/ISIT.2014.6874954"},{"key":"1162_CR39","doi-asserted-by":"crossref","unstructured":"Bellare, M., & Rogaway, P. (1993). Random oracles are practical: A paradigm for designing efficient protocols. In: Proceedings of the 1st ACM conference on computer and communications security, pp. 62\u201373.","DOI":"10.1145\/168588.168596"},{"key":"1162_CR40","doi-asserted-by":"crossref","unstructured":"Dietz, M., & Tessaro, S. (2023). Fully malicious authenticated PIR. Cryptology ePrint Archive","DOI":"10.1007\/978-3-031-68400-5_4"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-024-01162-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-024-01162-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-024-01162-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T21:48:13Z","timestamp":1732139293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-024-01162-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,28]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["1162"],"URL":"https:\/\/doi.org\/10.1007\/s11235-024-01162-1","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2024,5,28]]},"assertion":[{"value":"28 April 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no Conflict of interest","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}