{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:00:39Z","timestamp":1787504439100,"version":"build-2736575974"},"reference-count":7,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2002.1004353","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T16:30:39Z","timestamp":1056558639000},"page":"175-183","source":"Crossref","is-referenced-by-count":36,"title":["Lower bounds for linear locally decodable codes and private information retrieval"],"prefix":"10.1109","author":[{"given":"O.","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H.","family":"Karloff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.J.","family":"Schulman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Trevisan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258609"},{"key":"2","author":"bolloba?s","year":"1986","journal-title":"Combinatorics"},{"key":"1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/3-540-63165-8_196","article-title":"An upper bound on the communication complexity of private information retrieval","volume":"1256","author":"ambainis","year":"1997","journal-title":"Lecture Notes in Computer Science"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646125"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"5","article-title":"Lower bounds for linear locally decodable codes and private information retrieval","author":"goldreich","year":"2001","journal-title":"ECC"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"}],"event":{"name":"17th IEEE Annual Conference on Computational Complexity","location":"Montreal, Que., Canada","acronym":"CCC-02"},"container-title":["Proceedings 17th IEEE Annual Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7872\/21680\/01004353.pdf?arnumber=1004353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:39:02Z","timestamp":1497551942000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004353\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/ccc.2002.1004353","relation":{},"subject":[]}}