{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:05:55Z","timestamp":1780448755354,"version":"3.54.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031069741","type":"print"},{"value":"9783031069758","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-06975-8_25","type":"book-chapter","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T19:03:42Z","timestamp":1654196622000},"page":"431-448","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Post-Quantum Cheating Detectable Private Information Retrieval"],"prefix":"10.1007","author":[{"given":"Lin","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changlu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fuchun","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang Feng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,3]]},"reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1145\/1008731.1008735","volume":"51","author":"S Aaronson","year":"2004","unstructured":"Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. J. ACM 51(4), 595\u2013605 (2004)","journal-title":"J. ACM"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 962\u2013979 (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"25_CR3","unstructured":"Angel, S., Setty, S.: Unobservable communication over fully untrusted infrastructure. In: 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 2016), pp. 551\u2013569 (2016)"},{"issue":"3","key":"25_CR4","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":"25_CR5","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":"25_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, R., et al.: Talek: private group messaging with hidden access patterns. In: Annual Computer Security Applications Conference, pp. 84\u201399 (2020)","DOI":"10.1145\/3427228.3427231"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, pp. 41\u201350 (1995)","DOI":"10.1109\/SFCS.1995.492461"},{"key":"25_CR8","unstructured":"Devet, C., Goldberg, I., Heninger, N.: Optimally robust private information retrieval. In: Presented as part of the 21st USENIX Security Symposium (USENIX Security 2012), pp. 269\u2013283 (2012)"},{"issue":"4","key":"25_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":"25_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":"25_CR11","doi-asserted-by":"crossref","unstructured":"Goldberg, I.: Improving the robustness of private information retrieval. In: 2007 IEEE Symposium on Security and Privacy (SP 2007), pp. 131\u2013148 (2007)","DOI":"10.1109\/SP.2007.23"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Green, M., Ladd, W., Miers, I.: A protocol for privately reporting ad impressions at scale. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1591\u20131601 (2016)","DOI":"10.1145\/2976749.2978407"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC 1996, Association for Computing Machinery, p. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"25_CR14","unstructured":"Gupta, T., Crooks, N., Mulhern, W., Setty, S., Alvisi, L., Walfish, M.: Scalable and private media consumption with popcorn. In: 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 2016), pp. 91\u2013107 (2016)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.cosrev.2018.11.002","volume":"31","author":"L Gyongyosi","year":"2019","unstructured":"Gyongyosi, L., Imre, S.: A survey on quantum computing technology. Comput. Sci. Rev. 31, 51\u201371 (2019)","journal-title":"Comput. Sci. Rev."},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-44223-1_23","volume-title":"Post-Quantum Cryptography","author":"T H\u00e4ner","year":"2020","unstructured":"H\u00e4ner, T., Jaques, S., Naehrig, M., Roetteler, M., Soeken, M.: Improved quantum circuits for elliptic curve discrete logarithms. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 425\u2013444. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_23"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-45353-9_30","volume-title":"Topics in Cryptology \u2014 CT-RSA 2001","author":"A Juels","year":"2001","unstructured":"Juels, A.: Targeted advertising ... and privacy too. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 408\u2013424. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_30"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-03511-1_3","volume-title":"Privacy in Location-Based Applications","author":"A Khoshgozaran","year":"2009","unstructured":"Khoshgozaran, A., Shahabi, C.: Private information retrieval techniques for enabling location privacy in location-based services. In: Bettini, C., Jajodia, S., Samarati, P., Wang, X.S. (eds.) Privacy in Location-Based Applications. LNCS, vol. 5599, pp. 59\u201383. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03511-1_3"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 364\u2013373 (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1515\/popets-2016-0008","volume":"2016","author":"A Kwon","year":"2016","unstructured":"Kwon, A., Lazar, D., Devadas, S., Ford, B.: Riffle: an efficient communication system with strong anonymity. Proc. Priv. Enhancing Technol. 2016(2), 115\u2013134 (2016)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-662-47854-7_10","volume-title":"Financial Cryptography and Data Security","author":"W Lueks","year":"2015","unstructured":"Lueks, W., Goldberg, I.: Sublinear scaling for multi-client private information retrieval. In: B\u00f6hme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 168\u2013186. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47854-7_10"},{"key":"25_CR22","unstructured":"Mittal, P., Olumofin, F., Troncoso, C., Borisov, N., Goldberg, I.: PIR-Tor: scalable anonymous communication using private information retrieval. In: Proceedings of the 20th USENIX Conference on Security (SEC 2011), p. 31 (2011)"},{"issue":"2","key":"25_CR23","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1515\/popets-2015-0008","volume":"2015","author":"N Borisov","year":"2015","unstructured":"Borisov, N., Danezis, G., Goldberg, I.: Dp5: a private presence service. Proc. Priv. Enhancing Technol. 2015(2), 4\u201324 (2015)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-70697-9_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"M Roetteler","year":"2017","unstructured":"Roetteler, M., Naehrig, M., Svore, K.M., Lauter, K.: Quantum resource estimates for computing elliptic curve discrete logarithms. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 241\u2013270. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_9"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Sassaman, L., Cohen, B., Mathewson, N.: The pynchon gate: a secure method of pseudonymous mail retrieval. In: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, pp. 1\u20139 (2005)","DOI":"10.1145\/1102199.1102201"},{"key":"25_CR26","volume-title":"Quantum computing: progress and prospects","author":"National Academies of Sciences, Engineering, and Medicine","year":"2019","unstructured":"National Academies of Sciences, Engineering, and Medicine: Quantum computing: progress and prospects. National Academies Press, Washington, DC (2019)"},{"key":"25_CR27","unstructured":"Microsoft SEAL (release 3.2) Microsoft Research, Redmond (2019). https:\/\/github.com\/microsoft\/SEAL"},{"issue":"5","key":"25_CR28","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"25_CR29","doi-asserted-by":"publisher","unstructured":"Wang, X., Zhao, L.: Verifiable single-server private information retrieval. In: Naccache, D., Xu, S., Qing, S., Samarati, P., Blanc, G., Lu, R., Zhang, Z., Meddahi, A. (eds.) ICICS 2018. LNCS, vol. 11149, pp. 478\u2013493. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01950-1_28","DOI":"10.1007\/978-3-030-01950-1_28"},{"key":"25_CR30","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":"25_CR31","doi-asserted-by":"crossref","unstructured":"Yannuzzi, M., Milito, R.A., Serral-Graci\u00e1, R., Montero, D., Nemirovsky, M.: Key ingredients in an IoT recipe: Fog computing, Cloud computing, and more Fog computing. In: 2014 IEEE 19th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), pp. 325\u2013329 (2014)","DOI":"10.1109\/CAMAD.2014.7033259"},{"issue":"1","key":"25_CR32","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 55(1), 1\u201316 (2008)","journal-title":"J. ACM"},{"key":"25_CR33","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"}],"container-title":["IFIP Advances in Information and Communication Technology","ICT Systems Security and Privacy Protection"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06975-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:04:54Z","timestamp":1780445094000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06975-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069741","9783031069758"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06975-8_25","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on ICT Systems Security and Privacy Protection","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"13 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sec2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifipsec2022.compute.dtu.dk\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"127","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":"29","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":"23% - 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":"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":"5","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"}]}}