{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:31:24Z","timestamp":1758267084055},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130120"},{"type":"electronic","value":"9783642130137"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-13013-7_7","type":"book-chapter","created":{"date-parts":[[2010,5,14]],"date-time":"2010-05-14T06:18:57Z","timestamp":1273817937000},"page":"107-123","source":"Crossref","is-referenced-by-count":27,"title":["Multi-query Computationally-Private Information Retrieval with Constant Communication Rate"],"prefix":"10.1007","author":[{"given":"Jens","family":"Groth","sequence":"first","affiliation":[]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[]},{"given":"Helger","family":"Lipmaa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/11426639_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"J. Bl\u00f6mer","year":"2005","unstructured":"Bl\u00f6mer, J., 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":"7_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, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"key":"7_CR3","first-page":"41","volume-title":"36th Annual Symposium on Foundations of Computer Science","author":"B. Chor","year":"1995","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private Information Retrieval. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, October 23\u201325, pp. 41\u201350. IEEE, Los Alamitos (1995)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Coppersmith, D.: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. In: Maurer [11], pp. 178\u2013189","DOI":"10.1007\/3-540-68339-9_16"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Coppersmith, D.: Finding a Small Root of a Univariate Modular Equation. In: Maurer [11], pp. 155\u2013165","DOI":"10.1007\/3-540-68339-9_14"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"7_CR7","first-page":"262","volume-title":"Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing","author":"Y. Ishai","year":"2004","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, Chicago, IL, USA, June 13\u201316, pp. 262\u2013271. ACM Press, New York (2004)"},{"key":"7_CR8","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/SFCS.1997.646125","volume-title":"38th Annual Symposium on Foundations of Computer Science","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is Not Needed: Single Database, Computationally-Private Information Retrieval. In: 38th Annual Symposium on Foundations of Computer Science, Miami Beach, Florida, October\u00a020\u201322, pp. 364\u2013373. IEEE Computer Society, Los Alamitos (1997)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"7_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","year":"1996","unstructured":"Maurer, U. (ed.): EUROCRYPT 1996. LNCS, vol.\u00a01070. Springer, Heidelberg (1996)"},{"key":"7_CR12","first-page":"245","volume-title":"Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious Transfer and Polynomial Evaluation. In: Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, Atlanta, Georgia, USA, May\u00a01\u20134, pp. 245\u2013254. ACM Press, New York (1999)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance. IEEE Transactions on Information Theory\u00a024, 106\u2013110 (1978)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13013-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:44:05Z","timestamp":1558291445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13013-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130120","9783642130137"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13013-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}