{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T21:30:31Z","timestamp":1779399031545,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540223795","type":"print"},{"value":"9783540278009","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27800-9_5","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:00:38Z","timestamp":1283727638000},"page":"50-61","source":"Crossref","is-referenced-by-count":80,"title":["Single Database Private Information Retrieval with Logarithmic Communication"],"prefix":"10.1007","author":[{"given":"Yan-Cheng","family":"Chang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Asonov, D.: Private information retrieval: an overview and current trends. Manuscript (2001)"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing\u00a013(4), 850\u2013864 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00145-002-0112-1","volume":"15","author":"D. Catalano","year":"2002","unstructured":"Catalano, D., Gennaro, R., -Graham, N.H.: Paillier\u2019s trapdoor function hides up to O(n) bits. Journal of Cryptology\u00a015(4), 251\u2013269 (2002)","journal-title":"Journal of Cryptology"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Catalano, D., Gennaro, R., H.-Graham, N., Nguyen, P.: Paillier\u2019s cryptosystem revisited. In: ACM Conference on Computer and Comm. Security, pp. 206\u2013214 (2001)","DOI":"10.1145\/502010.502012"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45539-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"G. Crescenzo","year":"2000","unstructured":"Crescenzo, G., Malkin, T., Ostrovsky, R.: Single database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 122\u2013138. Springer, Heidelberg (2000)"},{"key":"5_CR6","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":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"R. Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 45\u201364. Springer, Heidelberg (2002)"},{"key":"5_CR8","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)"},{"issue":"2","key":"5_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s00145-001-0015-6","volume":"15","author":"S. Galbraith","year":"2000","unstructured":"Galbraith, S.: Elliptic curve Paillier schemes. Journal of Cryptology\u00a015(2), 129\u2013138 (2000)","journal-title":"Journal of Cryptology"},{"key":"5_CR10","unstructured":"Goldreich, O.: Secure multi-party computation. Manuscript (1998)"},{"issue":"2","key":"5_CR11","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS\u00a028(2), 270\u2013299 (1984)","journal-title":"JCSS"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC 1988, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: FOCS 1997, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-45539-6_9","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"E. Kushilevitz","year":"2000","unstructured":"Kushilevitz, E., Ostrovsky, R.: One-way trapdoor permutations are sufficient for non-trivial single-server private information retrieval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 104\u2013121. Springer, Heidelberg (2000)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC, pp. 245\u2013254 (1999)","DOI":"10.1145\/301250.301312"},{"key":"5_CR16","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":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-46588-1_11","volume-title":"Public Key Cryptography","author":"G. Poupard","year":"2000","unstructured":"Poupard, G., Stern, J.: Short proofs of knowledge for factoring. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 147\u2013166. Springer, Heidelberg (2000)"},{"key":"5_CR18","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer. Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University (1981)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27800-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:24Z","timestamp":1605759684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27800-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223795","9783540278009"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27800-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}