{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:41Z","timestamp":1725488981956},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_35","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T03:29:48Z","timestamp":1187062188000},"page":"383-393","source":"Crossref","is-referenced-by-count":4,"title":["Nearly Private Information Retrieval"],"prefix":"10.1007","author":[{"given":"Amit","family":"Chakrabarti","sequence":"first","affiliation":[]},{"given":"Anna","family":"Shubina","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0304-3975(95)00157-3","volume":"175","author":"F. Ablayev","year":"1996","unstructured":"Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science\u00a0175(2), 139\u2013159 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s00037-006-0208-3","volume":"15","author":"R. Beigel","year":"2006","unstructured":"Beigel, R., Fortnow, L., Gasarch, W.: A tight lower bound for restricted PIR protocols. Comput. Complexity\u00a015(1), 82\u201391 (2006)","journal-title":"Comput. Complexity"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/3-540-44598-6_4","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A. Beimel","year":"2000","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers computation in private information retrieval: PIR with preprocessing. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 56\u201374. Springer, Heidelberg (2000)"},{"issue":"6","key":"35_CR4","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\u00a045(6), 965\u2013982 (1998)","journal-title":"J. ACM"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/CCC.2002.1004353","volume-title":"Proc. 17th Annual IEEE Conference on Computational Complexity","author":"O. Goldreich","year":"2002","unstructured":"Goldreich, O., Karloff, H., Schulman, L., Trevisan, L.: Lower bounds for linear locally decodable codes and private information retrieval. In: Proc. 17th Annual IEEE Conference on Computational Complexity, pp. 175\u2013183. IEEE Computer Society Press, Los Alamitos (2002)"},{"issue":"3","key":"35_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.jcss.2004.04.007","volume":"69","author":"I. Kerenidis","year":"2004","unstructured":"Kerenidis, I., de Wolf, R.: Exponential lower bound for 2-query locally decodable codes. J. Comput. Syst. Sci.\u00a069(3), 395\u2013420 (2004) (Preliminary version in Proc. 35th Annual ACM Symposium on the Theory of Computing, pp.106\u2013115 (2003))","journal-title":"J. Comput. Syst. Sci."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. American Mathematical Society (2002)","DOI":"10.1090\/gsm\/047"},{"key":"35_CR8","first-page":"124","volume-title":"Proc. 40th Annual IEEE Symposium on Foundations of Computer Science","author":"A. Nayak","year":"1999","unstructured":"Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proc. 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 124\u2013133. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"35_CR9","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"35_CR10","first-page":"739","volume-title":"Proc. 47th Annual IEEE Symposium on Foundations of Computer Science","author":"A. Razborov","year":"2006","unstructured":"Razborov, A., Yekhanin, S.: An \u03a9(n\n                  1\/3) lower bound for bilinear group based private information retrieval. In: Proc. 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 739\u2013748. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"35_CR11","first-page":"275","volume-title":"Proc. 20th Annual IEEE Conference on Computational Complexity, 2005","author":"D. Woodruff","year":"2005","unstructured":"Woodruff, D., Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. In: Proc. 20th Annual IEEE Conference on Computational Complexity, 2005, pp. 275\u2013284. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"35_CR12","volume-title":"Proc. 39th Annual ACM Symposium on the Theory of Computing","author":"S. Yekhanin","year":"2007","unstructured":"Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. In: Proc. 39th Annual ACM Symposium on the Theory of Computing, ACM Press, New York (to appear, 2007)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:29:01Z","timestamp":1619504941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}