{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T12:08:39Z","timestamp":1790510919196,"version":"4.1.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319112022","type":"print"},{"value":"9783319112039","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11203-9_22","type":"book-chapter","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T20:36:46Z","timestamp":1408048606000},"page":"380-399","source":"Crossref","is-referenced-by-count":29,"title":["A Fast Single Server Private Information Retrieval Protocol with Low Communication Cost"],"prefix":"10.1007","author":[{"given":"Changyu","family":"Dong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liqun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-03511-1_3","volume-title":"Privacy in Location-Based Applications","author":"A. Khoshgozaran","year":"2009","unstructured":"Khoshgozaran, A., Shahabi, C.: Private information retrieval techniques for enabling location privacy in location-based services. In: Bettini, C., Jajodia, S., Samarati, P., Wang, X.S. (eds.) Privacy in Location-Based Applications. LNCS, vol.\u00a05599, pp. 59\u201383. Springer, Heidelberg (2009)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Henry, R., Olumofin, F.G., Goldberg, I.: Practical PIR for electronic commerce. In: ACM Conference on Computer and Communications Security, pp. 677\u2013690 (2011)","DOI":"10.1145\/2046707.2046784"},{"key":"22_CR3","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: FOCS, pp. 41\u201350 (1995)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: FOCS, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-49649-1_28","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"J.P. Stern","year":"1998","unstructured":"Stern, J.P.: A new and efficient all-or-nothing disclosure of secrets protocol. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 357\u2013371. Springer, Heidelberg (1998)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-45539-6_9","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"E. Kushilevitz","year":"2000","unstructured":"Kushilevitz, E., Ostrovsky, R.: One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 104\u2013121. Springer, Heidelberg (2000)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-27800-9_5","volume-title":"Information Security and Privacy","author":"Y.-C. Chang","year":"2004","unstructured":"Chang, Y.-C.: Single database private information retrieval with logarithmic communication. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol.\u00a03108, pp. 50\u201361. Springer, Heidelberg (2004)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C. Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 803\u2013815. Springer, Heidelberg (2005)"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11556992_23","volume-title":"Information Security","author":"H. Lipmaa","year":"2005","unstructured":"Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Zhou, J., L\u00f3pez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 314\u2013328. Springer, Heidelberg (2005)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: FOCS, pp. 97\u2013106 (2011)","DOI":"10.1109\/FOCS.2011.12"},{"issue":"5","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1125","DOI":"10.1109\/TKDE.2012.90","volume":"25","author":"X. Yi","year":"2013","unstructured":"Yi, X., Kaosar, M.G., Paulet, R., Bertino, E.: Single-database private information retrieval from fully homomorphic encryption. IEEE Trans. Knowl. Data Eng.\u00a025(5), 1125\u20131134 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR13","unstructured":"Sion, R., Carbunar, B.: On the practicality of private information retrieval. In: NDSS (2007)"},{"key":"22_CR14","unstructured":"Williams, P., Sion, R.: Usable PIR. In: NDSS (2008)"},{"issue":"4","key":"22_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10207-010-0105-2","volume":"9","author":"X. Ding","year":"2010","unstructured":"Ding, X., Yang, Y., Deng, R.H., Wang, S.: A new hardware-assisted PIR with o(n) shuffle cost. Int. J. Inf. Sec.\u00a09(4), 237\u2013252 (2010)","journal-title":"Int. J. Inf. Sec."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography from anonymity. In: FOCS, pp. 239\u2013248 (2006)","DOI":"10.1109\/FOCS.2006.25"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-14423-3_14","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"H. Lipmaa","year":"2010","unstructured":"Lipmaa, H.: First CPIR protocol with data-dependent computation. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol.\u00a05984, pp. 193\u2013210. Springer, Heidelberg (2010)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Melchor, C.A., Gaborit, P.: A fast private information retrieval protocol. In: ISIT, pp. 1848\u20131852 (2008)","DOI":"10.1109\/ISIT.2008.4595308"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-71677-8_26","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"R. Ostrovsky","year":"2007","unstructured":"Ostrovsky, R., Skeith III, W.E.: A survey of single-database private information retrieval: Techniques and applications. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 393\u2013411. Springer, Heidelberg (2007)"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. In: ITCS, pp. 309\u2013325 (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V. Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (2010)"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Chor, B., Gilboa, N.: Computationally private information retrieval (extended abstract). In: STOC, pp. 304\u2013313 (1997)","DOI":"10.1145\/258533.258609"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Improved upper bounds on information-theoretic private information retrieval (extended abstract). In: STOC, pp. 79\u201388 (1999)","DOI":"10.1145\/301250.301275"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.-F.: Breaking the O(n1\/(2k-1)) barrier for information-theoretic private information retrieval. In: FOCS, pp. 261\u2013270 (2002)","DOI":"10.1109\/SFCS.2002.1181949"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Goldberg, I.: Improving the robustness of private information retrieval. In: IEEE Symposium on Security and Privacy, pp. 131\u2013148 (2007)","DOI":"10.1109\/SP.2007.23"},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier\u2019s probabilistic public-key system. In: Kim, K.-C. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Bi, J., Liu, M., Wang, X.: Cryptanalysis of a homomorphic encryption scheme from ISIT 2008. In: ISIT, pp. 2152\u20132156 (2012)","DOI":"10.1109\/ISIT.2012.6283832"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M. Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"22_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C. Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 75\u201392. Springer, Heidelberg (2013)"},{"key":"22_CR33","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. IACR Cryptology ePrint Archive 2011, 133 (2011)"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"C. Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 465\u2013482. Springer, Heidelberg (2012)"},{"key":"22_CR35","volume-title":"Models of Computation: Exploring the Power of Computing","author":"J.E. Savage","year":"1997","unstructured":"Savage, J.E.: Models of Computation: Exploring the Power of Computing, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1997)","edition":"1"},{"key":"22_CR36","doi-asserted-by":"crossref","unstructured":"Halevi, S., Shoup, V.: Algorithms in HElib. IACR Cryptology ePrint Archive 2014 (2014)","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"22_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"C. Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 850\u2013867. Springer, Heidelberg (2012)"},{"key":"22_CR38","unstructured":"Granlund, T.: The GMP development team: GNU MP: The GNU Multiple Precision Arithmetic Library. 5.1.3 edn. (2013), http:\/\/gmplib.org\/"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: STOC, pp. 262\u2013271 (2004)","DOI":"10.1145\/1007352.1007396"}],"container-title":["Lecture Notes in Computer Science","Computer Security - ESORICS 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11203-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T06:07:09Z","timestamp":1746338829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11203-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112022","9783319112039"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11203-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}