{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:29:45Z","timestamp":1778128185737,"version":"3.51.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319705026","type":"print"},{"value":"9783319705033","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-70503-3_23","type":"book-chapter","created":{"date-parts":[[2017,11,4]],"date-time":"2017-11-04T02:43:27Z","timestamp":1509763407000},"page":"694-726","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":58,"title":["Towards Doubly Efficient Private Information Retrieval"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[]},{"given":"Justin","family":"Holmgren","sequence":"additional","affiliation":[]},{"given":"Silas","family":"Richelson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,5]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Oblivious rams without cryptographic assumptions. In: STOC, pp. 181\u2013190. ACM (2010)","DOI":"10.1145\/1806689.1806716"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1007\/3-540-48224-5_74","volume-title":"Automata, Languages and Programming","author":"A Beimel","year":"2001","unstructured":"Beimel, A., Ishai, Y.: Information-theoretic private information retrieval: a unified construction. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 912\u2013926. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_74"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00145-004-0134-y","volume":"17","author":"A Beimel","year":"2004","unstructured":"Beimel, A., Ishai, Y., Malkin, T.: Reducing the servers\u2019 computation in private information retrieval: PIR with preprocessing. J. Cryptol. 17(2), 125\u2013151 (2004)","journal-title":"J. Cryptol."},{"key":"23_CR4","unstructured":"Boyle, E., Ishai, Y., Pass, R., Wootters, M.: Can we access a database both locally and privately? Cryptology ePrint Archive, Report 2017\/567 (2017). http:\/\/eprint.iacr.org\/2017\/567"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45539-6_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"D Bleichenbacher","year":"2000","unstructured":"Bleichenbacher, D., Nguyen, P.Q.: Noisy polynomial interpolation and noisy chinese remaindering. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 53\u201369. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_4"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Braverman, M.: Poly-logarithmic independence fools $$AC^{0}$$ circuits. In: IEEE Conference on Computational Complexity, pp. 3\u20138. IEEE Computer Society (2009)","DOI":"10.1109\/CCC.2009.35"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-32009-5_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"M Bellare","year":"2012","unstructured":"Bellare, M., Tessaro, S., Vardy, A.: Semantic security for the wiretap channel. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 294\u2013311. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_18"},{"issue":"6","key":"23_CR8","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965\u2013981 (1998)","journal-title":"J. ACM"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology \u2014 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. 1592, pp. 402\u2013414. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_28"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Sudan, M.: Reconstructing curves in three (and higher) dimensional space from noisy data. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 9\u201311 June 2003, San Diego, CA, USA, pp. 136\u2013142 (2003)","DOI":"10.1145\/780542.780563"},{"key":"23_CR11","unstructured":"Cheng, R., Scott, W., Parno, B., Zhang, I., Krishnamurthy, A., Anderson, T.: Talek: a private publish-subscribe protocol (2016)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-19571-6_10","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2011","unstructured":"Damg\u00e5rd, I., Meldgaard, S., Nielsen, J.B.: Perfectly secure oblivious RAM without random oracles. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 144\u2013163. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_10"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-32284-6_6","volume-title":"Information Theoretic Security","author":"Y Dodis","year":"2012","unstructured":"Dodis, Y.: Shannon impossibility, revisited. In: Smith, A. (ed.) ICITS 2012. LNCS, vol. 7412, pp. 100\u2013110. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32284-6_6"},{"issue":"6","key":"23_CR14","doi-asserted-by":"publisher","first-page":"2598","DOI":"10.1137\/070705258","volume":"39","author":"P Gopalan","year":"2010","unstructured":"Gopalan, P., Khot, S., Saket, R.: Hardness of reconstructing multivariate polynomials over finite fields. SIAM J. Comput. 39(6), 2598\u20132621 (2010)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Rothblum, G.N.: Simple doubly-efficient interactive proof systems for locally-characterizable sets. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 24, p. 18 (2017)","DOI":"10.1561\/9781680834253"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: FOCS, pp. 364\u2013373. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"23_CR18","unstructured":"Kalai, Y., Raz, R.: Personal communication (2017)"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-03356-8_17","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Morris","year":"2009","unstructured":"Morris, B., Rogaway, P., Stegers, T.: How to encipher messages on a small domain. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 286\u2013302. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_17"},{"issue":"5","key":"23_CR20","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M Naor","year":"2006","unstructured":"Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM J. Comput. 35(5), 1254\u20131281 (2006)","journal-title":"SIAM J. Comput."},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-25385-0_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"E Shi","year":"2011","unstructured":"Shi, E., Chan, T.-H.H., Stefanov, E., Li, M.: Oblivious RAM with $$O((\\text{log}N)^{3})$$ worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197\u2013214. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_11"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70503-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T21:25:38Z","timestamp":1750973138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-70503-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319705026","9783319705033"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70503-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"5 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baltimore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iacr.org\/workshops\/tcc2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}