{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T02:09:18Z","timestamp":1791425358395,"version":"4.3.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540275800","type":"print"},{"value":"9783540316916","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_65","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"803-815","source":"Crossref","is-referenced-by-count":191,"title":["Single-Database Private Information Retrieval with Constant Communication Rate"],"prefix":"10.1007","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zulfikar","family":"Ramzan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"65_CR1","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.F.: Breaking the O(n 1\/(2k\u2009\u2212\u20091) ) Barrier for Information-Theoretic Private Information Retrieval, FOCS 2002 (2002)"},{"key":"65_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: Computational Private Information Retrieval with Polylogarithmic Communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 402. Springer, Heidelberg (1999)"},{"key":"65_CR3","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. Chang","year":"2004","unstructured":"Chang, Y.: Single-Database Private Information Retreival with Logarithmic Communication. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol.\u00a03108, pp. 50\u201361. Springer, Heidelberg (2004)"},{"key":"65_CR4","unstructured":"Chor, B., Gilboa, N.: Comput. Private Information Retrieval. In: STOC (1997)"},{"key":"#cr-split#-65_CR5.1","doi-asserted-by":"crossref","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private Information Retrieval. Journal of the ACM\u00a045 (1998);","DOI":"10.1145\/293347.293350"},{"key":"#cr-split#-65_CR5.2","unstructured":"Earlier version in FOCS 1995"},{"key":"65_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 178\u2013189. Springer, Heidelberg (1996)"},{"key":"65_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a Small Root of a Univ. Mod. Equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 155\u2013165. Springer, Heidelberg (1996)"},{"key":"65_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-46035-7_17","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"I. Damgard","year":"2002","unstructured":"Damgard, I., Koprowski, M.: Generic Lower Bounds for Root Extraction and Signature Schems in General Groups. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, p. 256. Springer, Heidelberg (2002)"},{"key":"65_CR9","unstructured":"Kushilevits, E., Ostrovsky, R.: Replication is not needed: single database, computationally private information Retrieval. In: FOCS (1997)"},{"key":"65_CR10","series-title":"Lecture Notes in Mathematics","volume-title":"The Development of the Number Field Sieve","year":"1995","unstructured":"Lenstra, A.K., Lenstra Jr., H.W. (eds.): The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol.\u00a01554. Springer, Heidelberg (1995)"},{"key":"65_CR11","doi-asserted-by":"crossref","unstructured":"Lipmaa, H.: An Oblivious Transfer Protocol with Log-Squared Communication. Cryptology ePrint Archive, 2004\/063","DOI":"10.1007\/11556992_23"},{"key":"65_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11426639_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A. May","year":"2005","unstructured":"May, A.: A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 251\u2013267. Springer, Heidelberg (2005)"},{"key":"65_CR13","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Obl. Transfer and Polynomial Evaluation. In: STOC (1999)","DOI":"10.1145\/301250.301312"},{"key":"65_CR14","doi-asserted-by":"crossref","unstructured":"Pohlig, S.C., Hellman, M.: An Improved Algorithm for Computing Logarithms Over GF(p) and its Crypt. Significance. IEEE Trans. Inf. Th. IT-24 (1978)","DOI":"10.1109\/TIT.1978.1055817"},{"key":"65_CR15","first-page":"243","volume":"29","author":"J.B. Rosser","year":"1975","unstructured":"Rosser, J.B., Schoenfeld, L.: Sharper Bounds for Chebyshev Functions \u03b8(x) and \u03c8(x). Math. Comput.\u00a029, 243\u2013269 (1975)","journal-title":"Math. Comput."},{"key":"65_CR16","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)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:14Z","timestamp":1605643574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11523468_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}