{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T07:21:57Z","timestamp":1763018517055,"version":"3.40.3"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031171390"},{"type":"electronic","value":"9783031171406"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17140-6_11","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T06:19:49Z","timestamp":1664000389000},"page":"217-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["XSPIR: Efficient Symmetrically Private Information Retrieval from\u00a0Ring-LWE"],"prefix":"10.1007","author":[{"given":"Chengyu","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeyu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,25]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-70697-9_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"H Abusalah","year":"2017","unstructured":"Abusalah, H., Alwen, J., Cohen, B., Khilko, D., Pietrzak, K., Reyzin, L.: Beyond Hellman\u2019s time-memory trade-offs with applications to proofs of space. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 357\u2013379. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_13"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1515\/popets-2016-0010","volume":"2016","author":"C Aguilar Melchor","year":"2016","unstructured":"Aguilar Melchor, C., Barrier, J., Fousse, L., Killijian, M.O.: XPIR: private information retrieval for everyone. Proc. Priv. Enhancing Technol. 2016(2), 155\u2013174 (2016)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-030-77287-1_2","volume-title":"Protecting Privacy through Homomorphic Encryption","author":"M Albrecht","year":"2021","unstructured":"Albrecht, M., et al.: Homomorphic Encryption Standard. In: Lauter, K., Dai, W., Laine, K. (eds.) Protecting Privacy through Homomorphic Encryption, pp. 31\u201362. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77287-1_2"},{"key":"11_CR4","unstructured":"Ali, A., et al.: Communication-computation trade-offs in PIR. In: 30th USENIX Security Symposium (USENIX Security 21). USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/ali"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy, pp. 962\u2013979. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"11_CR6","unstructured":"Angel, S., Setty, S.: Unobservable communication over fully untrusted infrastructure. In: Holz, T., Savage, S. (eds.) USENIX Security 2016: 25th USENIX Security Symposium. USENIX Association (2016)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.F.: Breaking the $$O(n^{1\/(2k-1)})$$ barrier for information-theoretic private information retrieval. In: 43rd Annual Symposium on Foundations of Computer Science, pp. 261\u2013270. IEEE Computer Society Press (2002)","DOI":"10.1109\/SFCS.2002.1181949"},{"key":"11_CR9","unstructured":"Boneh, D., Bortz, A., Inguva, S., Saint-Jean, F., Feigenbaum, J.: Private information retrieval. https:\/\/crypto.stanford.edu\/pir-library\/"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36362-7_1","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"Z Brakerski","year":"2013","unstructured":"Brakerski, Z., Gentry, C., Halevi, S.: Packed ciphertexts in LWE-based homomorphic encryption. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 1\u201313. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_1"},{"key":"11_CR12","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":"11_CR13","doi-asserted-by":"crossref","unstructured":"Chen, H., Dai, W., Kim, M., Song, Y.: Efficient multi-key homomorphic encryption with packed ciphertexts with application to oblivious neural network inference. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 395\u2013412. ACM Press (2019)","DOI":"10.1145\/3319535.3363207"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled psi from fully homomorphic encryption with malicious security. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. CCS 2018, Association for Computing Machinery (2018). https:\/\/doi.org\/10.1145\/3243734.3243836","DOI":"10.1145\/3243734.3243836"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. CCS 2017, Association for Computing Machinery (2017). https:\/\/doi.org\/10.1145\/3133956.3134061","DOI":"10.1145\/3133956.3134061"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, pp. 1243\u20131255. ACM Press (2017)","DOI":"10.1145\/3133956.3134061"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Cheng, R., et al.: Talek: private group messaging with hidden access patterns. Cryptology ePrint Archive, Report 2020\/066 (2020). https:\/\/eprint.iacr.org\/2020\/066","DOI":"10.1145\/3427228.3427231"},{"key":"11_CR18","unstructured":"Cheng, R., et al.: Talek: a private publish-subscribe protocol. In Submission (2020). https:\/\/raymondcheng.net\/download\/papers\/talek-tr.pdf"},{"key":"11_CR19","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: 36th Annual Symposium on Foundations of Computer Science, pp. 41\u201350. IEEE Computer Society Press (1995)"},{"key":"11_CR20","doi-asserted-by":"publisher","unstructured":"Cong, K., et al.: Labeled PSI from homomorphic encryption with reduced computation and communication. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. CCS 2021, Association for Computing Machinery (2021). https:\/\/doi.org\/10.1145\/3460120.3484760","DOI":"10.1145\/3460120.3484760"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Costea, S., Barbu, D.M., Ghinita, G., Rughinis, R.: A comparative evaluation of private information retrieval techniques in location-based services. In: 2012 Fourth International Conference on Intelligent Networking and Collaborative Systems, pp. 618\u2013623 (2012)","DOI":"10.1109\/iNCoS.2012.96"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-21599-5_18","volume-title":"Trust and Trustworthy Computing","author":"E De Cristofaro","year":"2011","unstructured":"De Cristofaro, E., Lu, Y., Tsudik, G.: Efficient techniques for privacy-preserving sharing of sensitive information. In: McCune, J.M., et al. (eds.) Trust and Trustworthy Computing, pp. 239\u2013253. Springer, Berlin Heidelberg, Berlin, Heidelberg (2011)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Demmler, D., Herzberg, A., Schneider, T.: RAID-PIR: Practical multi-server PIR. In: CCSW 2014: Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, pp. 45\u201356 (2014)","DOI":"10.1145\/2664168.2664181"},{"key":"11_CR24","unstructured":"Devet, C., Goldberg, I., Heninger, N.: Optimally robust private information retrieval. In: Kohno, T. (ed.) USENIX Security 2012: 21st USENIX Security Symposium, pp. 269\u2013283. USENIX Association (2012)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-11203-9_22","volume-title":"Computer Security - ESORICS 2014","author":"C Dong","year":"2014","unstructured":"Dong, C., Chen, L.: A fast single server private information retrieval protocol with low communication cost. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8712, pp. 380\u2013399. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11203-9_22"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-26954-8_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"N D\u00f6ttling","year":"2019","unstructured":"D\u00f6ttling, N., Garg, S., Ishai, Y., Malavolta, G., Mour, T., Ostrovsky, R.: Trapdoor hash functions and their applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 3\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_1"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-662-49890-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"L Ducas","year":"2016","unstructured":"Ducas, L., Stehl\u00e9, D.: Sanitization of FHE ciphertexts. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 294\u2013310. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_12"},{"key":"11_CR28","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). http:\/\/eprint.iacr.org\/2012\/144"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Fisch, B.A., et al.: Malicious-client security in blind seer: a scalable private DBMS. In: 2015 IEEE Symposium on Security and Privacy, pp. 395\u2013410. IEEE Computer Society Press (2015)","DOI":"10.1109\/SP.2015.31"},{"key":"11_CR30","unstructured":"Garg, S., Hajiabadi, M., Ostrovsky, R.: Efficient range-trapdoor functions and applications: rate-1 OT and more. Cryptology ePrint Archive, Report 2019\/990 (2019). https:\/\/eprint.iacr.org\/2019\/990"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM Press (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 465\u2013482. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_28"},{"key":"11_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803\u2013815. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_65"},{"key":"11_CR34","doi-asserted-by":"publisher","unstructured":"Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. J. Comput. Syst. Sci. 60(3) (2000). https:\/\/doi.org\/10.1006\/jcss.1999.1689","DOI":"10.1006\/jcss.1999.1689"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Goldberg, I.: Improving the robustness of private information retrieval. In: 2007 IEEE Symposium on Security and Privacy, pp. 131\u2013148. IEEE Computer Society Press (2007)","DOI":"10.1109\/SP.2007.23"},{"key":"11_CR36","doi-asserted-by":"publisher","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. CCS 2016, Association for Computing Machinery (2016). https:\/\/doi.org\/10.1145\/2976749.2978407","DOI":"10.1145\/2976749.2978407"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-13013-7_7","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"J Groth","year":"2010","unstructured":"Groth, J., Kiayias, A., Lipmaa, H.: Multi-query computationally-private information retrieval with constant communication rate. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol. 6056, pp. 107\u2013123. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_7"},{"key":"11_CR38","unstructured":"Gupta, T., Crooks, N., Mulhern, W., Setty, S., Alvisi, L., Walfish, M.: Scalable and private media consumption with popcorn. Cryptology ePrint Archive, Report 2015\/489 (2015). http:\/\/eprint.iacr.org\/2015\/489"},{"key":"11_CR39","doi-asserted-by":"publisher","unstructured":"Huberman, B.A., Franklin, M., Hogg, T.: Enhancing privacy and trust in electronic communities. In: Proceedings of the 1st ACM Conference on Electronic Commerce. EC 1999, Association for Computing Machinery (1999). https:\/\/doi.org\/10.1145\/336992.337012","DOI":"10.1145\/336992.337012"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Jutla, C., Krawczyk, H., Rosu, M.C., Steiner, M.: Outsourced symmetric private information retrieval. In: Proceedings of the ACM Conference on Computer and Communications Security (2013)","DOI":"10.1145\/2508859.2516730"},{"issue":"2","key":"11_CR41","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1515\/popets-2015-0016","volume":"2015","author":"A Kiayias","year":"2015","unstructured":"Kiayias, A., Leonardos, N., Lipmaa, H., Pavlyk, K., Tang, Q.: Optimal rate private information retrieval from homomorphic encryption. Proc. Priv. Enhancing Technol. 2015(2), 222\u2013243 (2015)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, pp. 818\u2013829. ACM Press (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"11_CR43","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: 38th Annual Symposium on Foundations of Computer Science, pp. 364\u2013373. IEEE Computer Society Press (1997)"},{"issue":"2","key":"11_CR44","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":"11_CR45","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, Y., Wu, S.: Pipa: Privacy-preserving password checkup via homomorphic encryption. In: Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security (2021)","DOI":"10.1145\/3433210.3457535"},{"key":"11_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-319-70972-7_35","volume-title":"Financial Cryptography and Data Security","author":"H Lipmaa","year":"2017","unstructured":"Lipmaa, H., Pavlyk, K.: A simpler rate-optimal CPIR protocol. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 621\u2013638. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70972-7_35"},{"key":"11_CR47","doi-asserted-by":"publisher","unstructured":"Mansy, D., Rindal, P.: Endemic oblivious transfer. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security. CCS 2019, Association for Computing Machinery (2019). https:\/\/doi.org\/10.1145\/3319535.3354210","DOI":"10.1145\/3319535.3354210"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"McQuoid, I., Rosulek, M., Roy, L.: Minimal symmetric PAKE and 1-out-of-N OT from programmable-once public functions. Cryptology ePrint Archive, Report 2020\/1043 (2020). https:\/\/eprint.iacr.org\/2020\/1043","DOI":"10.1145\/3372297.3417870"},{"key":"11_CR49","unstructured":"McQuoid, I., Rosulek, M., Roy, L.: Batching base oblivious transfers. Cryptology ePrint Archive, Report 2021\/682 (2021). https:\/\/eprint.iacr.org\/2021\/682"},{"key":"11_CR50","doi-asserted-by":"crossref","unstructured":"Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: 1986 IEEE Symposium on Security and Privacy, pp. 134\u2013134 (1986)","DOI":"10.1109\/SP.1986.10022"},{"key":"11_CR51","unstructured":"Microsoft SEAL (release 3.5). Microsoft Research, Redmond, WA (2020). https:\/\/github.com\/Microsoft\/SEAL"},{"key":"11_CR52","unstructured":"Microsoft SealPIR. https:\/\/github.com\/microsoft\/SealPIR"},{"key":"11_CR53","unstructured":"Mittal, P., Olumofin, F.G., Troncoso, C., Borisov, N., Goldberg, I.: PIR-tor: scalable anonymous communication using private information retrieval. In: USENIX Security 2011: 20th USENIX Security Symposium. USENIX Association (2011)"},{"key":"11_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-319-52153-4_22","volume-title":"Topics in Cryptology \u2013 CT-RSA 2017","author":"M Orr\u00f9","year":"2017","unstructured":"Orr\u00f9, M., Orsini, E., Scholl, P.: Actively secure 1-out-of-N OT extension with application to private set intersection. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 381\u2013396. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52153-4_22"},{"issue":"1","key":"11_CR55","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1109\/TDSC.2010.60","volume":"9","author":"S Papadopoulos","year":"2012","unstructured":"Papadopoulos, S., Bakiras, S., Papadias, D.: pCloud: a distributed system for practical PIR. IEEE Trans. Dependable Secure Comput. 9(1), 115\u2013127 (2012)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"11_CR56","doi-asserted-by":"crossref","unstructured":"Pappas, V., et al.: Blind seer: a scalable private DBMS. In: 2014 IEEE Symposium on Security and Privacy, pp. 359\u2013374. IEEE Computer Society Press (2014)","DOI":"10.1109\/SP.2014.30"},{"key":"11_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-59013-0_5","volume-title":"Computer Security \u2013 ESORICS 2020","author":"J Park","year":"2020","unstructured":"Park, J., Tibouchi, M.: SHECS-PIR: Somewhat Homomorphic Encryption-Based Compact and Scalable Private Information Retrieval. In: Chen, L., Li, N., Liang, K., Schneider, S. (eds.) ESORICS 2020. LNCS, vol. 12309, pp. 86\u2013106. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59013-0_5"},{"key":"11_CR58","unstructured":"Rindal, P.: libOTe: an efficient, portable, and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe"},{"key":"11_CR59","doi-asserted-by":"publisher","DOI":"10.21236\/ADA459016","volume-title":"Java implementation of a single-database computationally symmetric private information retrieval (CSPIR) protocol","author":"F Saint-Jean","year":"2005","unstructured":"Saint-Jean, F.: Java implementation of a single-database computationally symmetric private information retrieval (CSPIR) protocol. Yale University New Haven CT Department of Computer Science Technical Representative (2005)"},{"key":"11_CR60","unstructured":"Smart, N., Vercauteren, F.: Fully homomorphic SIMD operations. Cryptology ePrint Archive, Report 2011\/133 (2011). http:\/\/eprint.iacr.org\/2011\/133"},{"key":"11_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-49649-1_28","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u201998","author":"JP Stern","year":"1998","unstructured":"Stern, J.P.: A new and efficient all-or-nothing disclosure of secrets protocol. In: Ohta, K., et al. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 357\u2013371. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49649-1_28"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17140-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T15:15:33Z","timestamp":1728054933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17140-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031171390","9783031171406"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17140-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 September 2022","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":"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":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2022.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":"562","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":"104","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":"6","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":"12","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)"}}]}}