{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:36:39Z","timestamp":1769916999786,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031505935","type":"print"},{"value":"9783031505942","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-50594-2_20","type":"book-chapter","created":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T09:04:34Z","timestamp":1704963874000},"page":"393-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Committed Private Information Retrieval"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9649-943X","authenticated-orcid":false,"given":"Quang","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong Yen","family":"Tran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Son Hoang","family":"Dau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xun","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuele","family":"Viterbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Chih","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingge","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanislav","family":"Kruglik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han Mao","family":"Kiah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"key":"20_CR1","unstructured":"Uribe, A.: Cyberattack on optus potentially exposes millions of customer accounts; Australian telecoms company says mass breach could have exposed birth dates, phone numbers and other personal data. Wall Street J. Eastern edn. (2022)"},{"key":"20_CR2","unstructured":"Biddle, N., Gray, M., McEachern, S.: Public exposure and responses to data breaches in Australia (2022)"},{"issue":"6","key":"20_CR3","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 (JACM) 45(6), 965\u2013981 (1998)","journal-title":"J. ACM (JACM)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Ke, P., Zhang, L.F.: Two-server private information retrieval with result verification. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), pp. 408\u2013413 (2022)","DOI":"10.1109\/ISIT50566.2022.9834706"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.ins.2020.08.071","volume":"546","author":"L Zhao","year":"2021","unstructured":"Zhao, L., Wang, X., Huang, X.: Verifiable single-server private information retrieval from LWE with binary errors. Inf. Sci. 546, 897\u2013923 (2021)","journal-title":"Inf. Sci."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Zhang, L.F., Wang, H.: Multi-server verifiable computation of low-degree polynomials. In: Proceedings of the IEEE Symposium on Security and Privacy (S &P), pp. 596\u2013613 (2022)","DOI":"10.1109\/SP46214.2022.9833792"},{"key":"20_CR7","unstructured":"Devet, C., Goldberg, I., Heninger, N.: Optimally robust private information retrieval. In: Proceedings of the 21st USENIX Security Symposium, pp. 269\u2013283 (2012)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Yang, E.Y., Xu, J., Bennett, K.H.: Private information retrieval in the presence of malicious failures. In: Proceedings of the 26th Annual International Computer Software and Applications, pp. 805\u2013810 (2002)","DOI":"10.1109\/CMPSAC.2002.1045104"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Beimel, A., Stahl, Y.: Robust information-theoretic private information retrieval. In: Proceedings of the Third International Conference on Security in Communication Networks, pp. 326\u2013341 (2003)","DOI":"10.1007\/3-540-36413-7_24"},{"key":"20_CR10","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, 295\u2013321 (2007)","journal-title":"J. Cryptol."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Goldberg, I.: Improving the robustness of private information retrieval. In: IEEE Symposium on Security and Privacy (SP 2007), pp. 131\u2013148. IEEE (2007)","DOI":"10.1109\/SP.2007.23"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-07536-5_5","volume-title":"Applied Cryptography and Network Security","author":"LF Zhang","year":"2014","unstructured":"Zhang, L.F., Safavi-Naini, R.: Verifiable multi-server private information retrieval. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 62\u201379. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_5"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-26948-7_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"RWF Lai","year":"2019","unstructured":"Lai, R.W.F., Malavolta, G.: Subvector commitments with application to succinct arguments. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 530\u2013560. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_19"},{"key":"20_CR14","unstructured":"Libert, B., Ramanna, S.C., et al.: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions. In: 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016) (2016)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-030-90456-2_16","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2021","unstructured":"Peikert, C., Pepin, Z., Sharp, C.: Vector and functional commitments from lattices. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 480\u2013511. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_16"},{"key":"20_CR16","series-title":"Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-031-22972-5_7","volume-title":"Advances in Cryptology","author":"M Campanelli","year":"2022","unstructured":"Campanelli, M., Nitulescu, A., R\u00e0fols, C., Zacharakis, A., Zapico, A.: Linear-map vector commitments and their practical applications. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13794, pp. 189\u2013219. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_7"},{"key":"20_CR17","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. IEEE (2005)","DOI":"10.1109\/CCC.2005.2"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Bitar, R., El Rouayheb, S.: Staircase-PIR: universally robust private information retrieval. In: IEEE Information Theory Workshop (ITW), pp. 1\u20135. IEEE (2018)","DOI":"10.1109\/ITW.2018.8613532"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Demmler, D., Herzberg, A., Schneider, T.: Raid-PIR: practical multi-server PIR. In: Proceedings of the 6th Edition of the ACM Workshop on Cloud Computing Security, pp. 45\u201356 (2014)","DOI":"10.1145\/2664168.2664181"},{"issue":"4","key":"20_CR20","doi-asserted-by":"publisher","first-page":"2361","DOI":"10.1109\/TIT.2017.2777490","volume":"64","author":"H Sun","year":"2017","unstructured":"Sun, H., Jafar, S.A.: The capacity of robust private information retrieval with colluding databases. IEEE Trans. Inf. Theory 64(4), 2361\u20132370 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"20_CR21","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/JSAC.2022.3142358","volume":"40","author":"S Ulukus","year":"2022","unstructured":"Ulukus, S., Avestimehr, S., Gastpar, M., Jafar, S.A., Tandon, R., Tian, C.: Private retrieval, computing, and learning: recent progress and future challenges. IEEE J. Sel. Areas Commun. 40(3), 729\u2013748 (2022)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"20_CR22","unstructured":"Nikolaenko, V., Ragsdale, S., Bonneau, J., Boneh, D.: Powers-of-tau to the people: decentralizing setup ceremonies. Cryptology ePrint Archive (2022)"},{"key":"20_CR23","unstructured":"Lai, R.W.: Succinct arguments: constructions and applications. Ph.D. dissertation, Friedrich-Alexander-Universitaet Erlangen-Nuernberg (Germany) (2022)"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-36594-2_13","volume-title":"Theory of Cryptography","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 222\u2013242. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_13"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50594-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T21:57:53Z","timestamp":1731016673000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50594-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031505935","9783031505942"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50594-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Hague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"478","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":"93","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":"19% - 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-4","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":"10","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}