{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:20:32Z","timestamp":1771485632230,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540851738","type":"print"},{"value":"9783540851745","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85174-5_8","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T08:32:02Z","timestamp":1219221122000},"page":"126-143","source":"Crossref","is-referenced-by-count":26,"title":["Public-Key Locally-Decodable Codes"],"prefix":"10.1007","author":[{"given":"Brett","family":"Hemenway","sequence":"first","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for error-correcting codes. In: STOC 2000: Proceedings of the 32nd Annual Symposium on the Theory of Computing, pp. 80\u201386 (2000)","DOI":"10.1145\/335305.335315"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Yekhanin, S.: Towards 3-Query Locally Decodable Codes of Subexponential Length. In: Proceedings of the 39th ACM Symposiom on the Theory of Computinng (STOC) (2007)","DOI":"10.1145\/1250790.1250830"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/3-540-57785-8_183","volume-title":"STACS 94","author":"R.J. Lipton","year":"1994","unstructured":"Lipton, R.J.: A new approach to information theory. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 699\u2013708. Springer, Heidelberg (1994)"},{"key":"8_CR4","unstructured":"Gopalan, P., Lipton, R.J., Ding, Y.Z.: Error correction against computationally bounded adversaries (manuscript, 2004)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theory of Cryptography","author":"S. Micali","year":"2005","unstructured":"Micali, S., Peikert, C., Sudan, M., Wilson, D.A.: Optimal error correction against computationally bounded noise. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 1\u201316. Springer, Heidelberg (2005)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-73420-8_35","volume-title":"Automata, Languages and Programming","author":"R. Ostrovsky","year":"2007","unstructured":"Ostrovsky, R., Pandey, O., Sahai, A.: Private locally decodable codes. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 298\u2013387. Springer, Heidelberg (2007)"},{"key":"8_CR7","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":"8_CR8","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: IEEE Symposium on Foundations of Computer Science, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-540-71677-8_26","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"R. Ostrovsky","year":"2007","unstructured":"Ostrovsky, R., Skeith III, W.E.: A survey of single-database private information retrieval: Techniques and applications. In: Skeith III, W.E. (ed.) PKC 2007. LNCS, vol.\u00a04450, pp. 393\u2013411. Springer, Heidelberg (2007)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"8_CR12","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.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A Mathematical Theory of Communication. Bell System Technical Journal\u00a027, 343\u2013379, 623\u2013656 (1948)","journal-title":"Bell System Technical Journal"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-3-540-30576-7_24","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2005","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Sufficient conditions for collision resistant hashing. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 445\u2013456. Springer, Heidelberg (2005)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Information Security and Privacy","author":"Y.C. Chang","year":"2004","unstructured":"Chang, Y.C.: Single database private information retrieval with logarithmic communication. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol.\u00a03108. Springer, Heidelberg (2004)"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/288090.288106","volume-title":"CCS 1998: Proceedings of the 5th ACM conference on Computer and communications security","author":"D. Naccache","year":"1998","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: CCS 1998: Proceedings of the 5th ACM conference on Computer and communications security, pp. 59\u201366. ACM Press, New York (1998)"},{"key":"8_CR17","first-page":"10","volume-title":"Proceedings of CRYPTO 84 on Advances in cryptology","author":"T.E. Gamal","year":"1985","unstructured":"Gamal, T.E.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: CRYPTO 1984, pp. 10\u201318. Springer, New York (1985)"},{"key":"8_CR18","first-page":"373","volume-title":"STOC 2004: Proceedings of the thirty-sixth annual ACM symposion the theory of computing","author":"Y. Ishai","year":"2004","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Batch codes and their applications. In: STOC 2004: Proceedings of the thirty-sixth annual ACM symposion the theory of computing, pp. 373\u2013382. ACM Press, New York (2004)"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and System Sciences\u00a028 (2), 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR20","unstructured":"Benaloh, J.D.C.: Verifiable secret-ballot elections. PhD thesis. Yale University (1987)"},{"key":"8_CR21","unstructured":"Benaloh, J.C.: Dense probabilistic encryption. In: Proceedings of the Workshop on Selected Areas in Cryptography, pp. 120\u2013128 (1994)"},{"key":"8_CR22","unstructured":"Hemenway, B., Ostrovsky, R.: Public key locally decodable codes (2007), \n                    \n                      http:\/\/eprint.iacr.org\/2007\/083\/"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85174-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:22:19Z","timestamp":1619508139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85174-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851738","9783540851745"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85174-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}