{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T06:26:53Z","timestamp":1750746413135},"reference-count":12,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2002.1004354","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T16:30:39Z","timestamp":1056558639000},"page":"184-193","source":"Crossref","is-referenced-by-count":10,"title":["Better lower bounds for locally decodable codes"],"prefix":"10.1109","author":[{"given":"A.","family":"Deshpande","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Kavitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.V.","family":"Lokam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"journal-title":"Private access to distributed information","year":"1998","author":"mann","key":"10"},{"key":"1","first-page":"401","article-title":"Upper bounds on the communication complexity of private information retrieval","author":"amabainis","year":"1997","journal-title":"Proc ICALP"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103429"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"5","article-title":"Information-theoretic private information retrieval: A unified construction","author":"beimel","year":"2001","journal-title":"ECCC TR01-015"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275486"},{"year":"1999","author":"goldreich","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90195-2"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"12","first-page":"537","article-title":"Pseudo-random Generators without the XOR Lemma","author":"sudan","year":"1999","journal-title":"Proc 31st STOC"}],"event":{"name":"17th IEEE Annual Conference on Computational Complexity","acronym":"CCC-02","location":"Montreal, Que., Canada"},"container-title":["Proceedings 17th IEEE Annual Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7872\/21680\/01004354.pdf?arnumber=1004354","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T13:28:51Z","timestamp":1489152531000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004354\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ccc.2002.1004354","relation":{},"subject":[]}}