{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T17:53:59Z","timestamp":1775584439713,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031223679","type":"print"},{"value":"9783031223686","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22368-6_3","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T08:03:39Z","timestamp":1671609819000},"page":"60-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the\u00a0Optimal Communication Complexity of\u00a0Error-Correcting Multi-server PIR"],"prefix":"10.1007","author":[{"given":"Reo","family":"Eriguchi","sequence":"first","affiliation":[]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[]},{"given":"Koji","family":"Nuida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-63165-8_196","volume-title":"Automata, Languages and Programming","author":"A Ambainis","year":"1997","unstructured":"Ambainis, A.: Upper bound on the communication complexity of private information retrieval. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 401\u2013407. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63165-8_196"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1109\/TIT.2018.2869154","volume":"65","author":"K Banawan","year":"2019","unstructured":"Banawan, K., Ulukus, S.: The capacity of private information retrieval from byzantine and colluding databases. IEEE Trans. Inf. Theory 65(2), 1206\u20131219 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.F.: Breaking the o(n\/sup 1\/(2k\u20131)\/) barrier for information-theoretic private information retrieval. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 261\u2013270 (2002)","DOI":"10.1109\/SFCS.2002.1181949"},{"key":"3_CR4","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":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00145-007-0424-2","volume":"20","author":"A Beimel","year":"2007","unstructured":"Beimel, A., Stahl, Y.: Robust information-theoretic private information retrieval. J. Cryptol. 20(3), 295\u2013321 (2007)","journal-title":"J. Cryptol."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-38348-9_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Practical homomorphic MACs for arithmetic circuits. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 336\u2013352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_21"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00037-011-0017-1","volume":"22","author":"YM Chee","year":"2013","unstructured":"Chee, Y.M., Feng, T., Ling, S., Wang, H., Zhang, L.F.: Query-efficient locally decodable codes of subexponential length. Comput. Complex. 22(1), 159\u2013189 (2013)","journal-title":"Comput. Complex."},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. J. ACM 45(6), 965\u2013982 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2968443","volume":"63","author":"Z Dvir","year":"2016","unstructured":"Dvir, Z., Gopi, S.: 2-server PIR with subpolynomial communication. J. ACM 63(4), 1\u201315 (2016)","journal-title":"J. ACM"},{"issue":"6","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.1137\/090772721","volume":"41","author":"K Efremenko","year":"2012","unstructured":"Efremenko, K.: 3-query locally decodable codes of subexponential length. SIAM J. Comput. 41(6), 1694\u20131703 (2012)","journal-title":"SIAM J. Comput."},{"key":"3_CR11","unstructured":"Eriguchi, R., Kurosawa, K., Nuida, K.: Multi-server PIR with full error detection and limited error correction. In: 3rd Conference on Information-Theoretic Cryptography (ITC 2022), pp. 1:1\u20131:20 (2022)"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00037-006-0216-3","volume":"15","author":"O Goldreich","year":"2006","unstructured":"Goldreich, O., Karloff, H., Schulman, L., Trevisan, L.: Lower bounds for linear locally decodable codes and private information retrieval. Comput. Complex. 15(3), 263\u2013296 (2006)","journal-title":"Comput. Complex."},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1587\/transinf.E93.D.263","volume":"E93.D","author":"T Itoh","year":"2010","unstructured":"Itoh, T., Suzuki, Y.: Improved constructions for query-efficient locally decodable codes of subexponential length. IEICE Trans. Inf. Syst. E93.D(2), 263\u2013270 (2010)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-030-34621-8_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"K Kurosawa","year":"2019","unstructured":"Kurosawa, K.: How to correct errors in multi-server PIR. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11922, pp. 564\u2013574. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34621-8_20"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"issue":"7","key":"3_CR16","doi-asserted-by":"publisher","first-page":"4075","DOI":"10.1109\/TIT.2017.2689028","volume":"63","author":"H Sun","year":"2017","unstructured":"Sun, H., Jafar, S.A.: The capacity of private information retrieval. IEEE Trans. Inf. Theory 63(7), 4075\u20134088 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"2361","DOI":"10.1109\/TIT.2017.2777490","volume":"64","author":"H Sun","year":"2018","unstructured":"Sun, H., Jafar, S.A.: The capacity of robust private information retrieval with colluding databases. IEEE Trans. Inf. Theory 64(4), 2361\u20132370 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1007\/11523468_115","volume-title":"Automata, Languages and Programming","author":"S Wehner","year":"2005","unstructured":"Wehner, S., de Wolf, R.: Improved lower bounds for locally decodable codes and private information retrieval. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1424\u20131436. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_115"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Woodruff, D., Yekhanin, S.: A geometric approach to information-theoretic private information retrieval. In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), pp. 275\u2013284 (2005)","DOI":"10.1109\/CCC.2005.2"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Yang, E., Xu, J., Bennett, K.: Private information retrieval in the presence of malicious failures. In: Proceedings 26th Annual International Computer Software and Applications, pp. 805\u2013810 (2002)","DOI":"10.1109\/CMPSAC.2002.1045104"},{"issue":"1","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1326554.1326555","volume":"55","author":"S Yekhanin","year":"2008","unstructured":"Yekhanin, S.: Towards 3-query locally decodable codes of subexponential length. J. ACM (JACM) 55(1), 1\u201316 (2008)","journal-title":"J. ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22368-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:01:56Z","timestamp":1766278916000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22368-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223679","9783031223686"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22368-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 December 2022","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":"Chicago, IL","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"139","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}