{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T18:10:05Z","timestamp":1746641405724,"version":"3.40.5"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:00:00Z","timestamp":1736985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:00:00Z","timestamp":1736985600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372299"],"award-info":[{"award-number":["62372299"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai Municipality","doi-asserted-by":"publisher","award":["21ZR1443000"],"award-info":[{"award-number":["21ZR1443000"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10623-024-01562-z","type":"journal-article","created":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T15:54:25Z","timestamp":1737042865000},"page":"1501-1530","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient information-theoretic distributed point functions with general output groups"],"prefix":"10.1007","volume":"93","author":[{"given":"Junru","family":"Li","sequence":"first","affiliation":[]},{"given":"Pengzhen","family":"Ke","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3543-1524","authenticated-orcid":false,"given":"Liang Feng","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,16]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Gilboa N., Ishai Y.: Distributed point functions and their applications. In: Eurocrypt 2014, LNCS, vol. 8441, pp. 640\u2013658 (2014)","key":"1562_CR1","DOI":"10.1007\/978-3-642-55220-5_35"},{"unstructured":"Boyle E., Gilboa N., Ishai Y., Kolobov V.I.: Information-theoretic distributed point functions. In: ITC 2022, LIPIcs, vol. 230, pp. 1\u201314 (2022)","key":"1562_CR2"},{"unstructured":"Chor B., Goldreich O., Kushilevitz E., Sudan M.: Private information retrieval. In: FOCS 1995, pp. 41\u201350 (1995)","key":"1562_CR3"},{"doi-asserted-by":"crossref","unstructured":"Beimel A., Ishai Y., Kushilevitz E., Orlov I.: Share conversion and private information retrieval. In: CCC 2012, pp. 258\u2013268 (2012)","key":"1562_CR4","DOI":"10.1109\/CCC.2012.23"},{"issue":"4","key":"1562_CR5","doi-asserted-by":"publisher","first-page":"497","DOI":"10.3390\/e24040497","volume":"24","author":"A Paskin-Cherniavsky","year":"2022","unstructured":"Paskin-Cherniavsky A., Nissenbaum O.: New bounds and a generalization for share conversion for 3-server PIR. Entropy 24(4), 497 (2022).","journal-title":"Entropy"},{"issue":"9","key":"1562_CR6","doi-asserted-by":"publisher","first-page":"826","DOI":"10.3390\/e21090826","volume":"21","author":"A Paskin-Cherniavsky","year":"2019","unstructured":"Paskin-Cherniavsky A., Schmerler L.: On share conversions for private information retrieval. Entropy 21(9), 826 (2019).","journal-title":"Entropy"},{"doi-asserted-by":"crossref","unstructured":"Dvir Z., Gopi S.: 2-server PIR with sub-polynomial communication. In: STOC 2015, pp. 577\u2013584 (2015)","key":"1562_CR7","DOI":"10.1145\/2746539.2746546"},{"doi-asserted-by":"crossref","unstructured":"Ke P., Zhang L.F.: Two-server private information retrieval with result verification. In: ISIT 2022, pp. 408\u2013413 (2022)","key":"1562_CR8","DOI":"10.1109\/ISIT50566.2022.9834706"},{"doi-asserted-by":"crossref","unstructured":"Boneh D., Boyle E., Corrigan-Gibbs H., Gilboa N., Ishai Y.: Lightweight techniques for private heavy hitters. In: IEEE S &P 2021, pp. 762\u2013776 (2021)","key":"1562_CR9","DOI":"10.1109\/SP40001.2021.00048"},{"doi-asserted-by":"crossref","unstructured":"Boyle E., Gilboa N., Ishai Y.: Function secret sharing: improvements and extensions. In: CCS 2016, pp. 1292\u20131303 (2016)","key":"1562_CR10","DOI":"10.1145\/2976749.2978429"},{"doi-asserted-by":"crossref","unstructured":"Woodruff D.P., Yekhanin S.: A geometric approach to information-theoretic private information retrieval. In: CCC 2005, pp. 275\u2013284 (2005)","key":"1562_CR11","DOI":"10.1109\/CCC.2005.2"},{"doi-asserted-by":"crossref","unstructured":"Efremenko K.: 3-query locally decodable codes of subexponential length. In: STOC 2009, pp. 39\u201344 (2009)","key":"1562_CR12","DOI":"10.1145\/1536414.1536422"},{"issue":"2","key":"1562_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1587\/transinf.E93.D.263","volume":"93\u2013D","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. 93\u2013D(2), 263\u2013270 (2010).","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"1","key":"1562_CR14","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."},{"doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs H., Boneh D., Mazi\u00e8res D.: Riposte: an anonymous messaging system handling millions of users. In: IEEE S &P 2015, pp. 321\u2013338 (2015)","key":"1562_CR15","DOI":"10.1109\/SP.2015.27"},{"unstructured":"Newman Z., Servan-Schreiber S., Devadas S.: Spectrum: High-bandwidth anonymous broadcast. In: NSDI 2022, pp. 229\u2013248 (2022).","key":"1562_CR16"},{"unstructured":"Dittmer S., Ishai Y., Lu S., Ostrovsky R., Elsabagh M., Kiourtis N., Schulte B., Stavrou A.: Function secret sharing for PSI-CA: with applications to private contact tracing. CoRR arXiv:2012.13053 (2012)","key":"1562_CR17"},{"doi-asserted-by":"crossref","unstructured":"Boyle E., Gilboa N., Ishai Y.: Function secret sharing. In: Oswald E., Fischlin M. (eds.) Eurocrypt 2015, LNCS, vol. 9057, pp. 337\u2013367 (2015)","key":"1562_CR18","DOI":"10.1007\/978-3-662-46803-6_12"},{"issue":"1","key":"1562_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s004930070032","volume":"20","author":"V Grolmusz","year":"2000","unstructured":"Grolmusz V.: Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica 20(1), 71\u201386 (2000).","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"Ben-David S., Kalai Y.T., Paneth O.: Verifiable private information retrieval. In: TCC 2022, LNCS, vol. 1379, pp. 3\u201332 (2022)","key":"1562_CR20","DOI":"10.1007\/978-3-031-22368-6_1"},{"unstructured":"Colombo S., Nikitin K., Corrigan-Gibbs H., Wu D.J., Ford, B.: Authenticated private information retrieval. In: USENIX Security 23, pp. 3835\u20133851 (2023)","key":"1562_CR21"},{"unstructured":"Devet C., Goldberg I., Heninger N.: Optimally robust private information retrieval. In: USENIX Security 12, pp. 269\u2013283 (2012)","key":"1562_CR22"},{"doi-asserted-by":"crossref","unstructured":"Beimel A., Stahl Y.: Robust information-theoretic private information retrieval. In: SCN 2002, LNCS, vol. 2576, pp. 326\u2013341 (2002)","key":"1562_CR23","DOI":"10.1007\/3-540-36413-7_24"},{"doi-asserted-by":"crossref","unstructured":"Goldberg I.: Improving the robustness of private information retrieval. In: IEEE S &P 2007, pp. 131\u2013148 (2007)","key":"1562_CR24","DOI":"10.1109\/SP.2007.23"},{"doi-asserted-by":"crossref","unstructured":"Kurosawa K.: How to correct errors in multi-server PIR. In: Asiacrypt 2019, LNCS, vol. 11922, pp. 564\u2013574 (2019)","key":"1562_CR25","DOI":"10.1007\/978-3-030-34621-8_20"},{"doi-asserted-by":"crossref","unstructured":"Zhang L.F., Wang H., Wang L.: Byzantine-robust private information retrieval with low communication and efficient decoding. In: ASIACCS 2022, pp. 1079\u20131085 (2022)","key":"1562_CR26","DOI":"10.1145\/3488932.3497773"},{"doi-asserted-by":"crossref","unstructured":"Ke P., Zhang L.F.: Private information retrieval with result verification for more servers. In: ACNS 2023, pp. 197\u2013216 (2023)","key":"1562_CR27","DOI":"10.1007\/978-3-031-33491-7_8"},{"unstructured":"Dummit D.S., Foote R.M.: Abstract Algebra, 3rd edn (2004)","key":"1562_CR28"},{"doi-asserted-by":"crossref","unstructured":"Beimel A.: Secret-sharing schemes: a survey. In: IWCC 2011, LNCS, vol. 6639, pp. 11\u201346 (2011)","key":"1562_CR29","DOI":"10.1007\/978-3-642-20901-7_2"},{"doi-asserted-by":"crossref","unstructured":"Yekhanin S.: Towards 3-query locally decodable codes of subexponential length. In: STOC 2007, pp. 266\u2013274 (2007)","key":"1562_CR30","DOI":"10.1145\/1250790.1250830"},{"issue":"12","key":"1562_CR31","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1093\/comjnl\/bxab121","volume":"65","author":"L Zhu","year":"2022","unstructured":"Zhu L., Li W.M., Zhang L.F.: On the modulus in matching vector codes. Comput. J. 65(12), 2991\u20132997 (2022).","journal-title":"Comput. J."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01562-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01562-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01562-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T17:46:55Z","timestamp":1746640015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01562-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,16]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1562"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01562-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2025,1,16]]},"assertion":[{"value":"2 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}