{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T15:54:03Z","timestamp":1791561243548,"version":"4.3.4"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789811972416","type":"print"},{"value":"9789811972423","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.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-981-19-7242-3_8","type":"book-chapter","created":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T23:02:22Z","timestamp":1665270142000},"page":"117-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Publicly Verifiable Private Set Intersection from\u00a0Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Yuting","family":"Jiang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianghong","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,9]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-662-54970-4_9","volume-title":"Financial Cryptography and Data Security","author":"A Abadi","year":"2017","unstructured":"Abadi, A., Terzis, S., Dong, C.: VD-PSI: verifiable delegated private set intersection on outsourced private datasets. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 149\u2013168. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_9"},{"key":"8_CR2","unstructured":"Armknecht, F., et al.: A guide to fully homomorphic encryption. IACR Cryptology ePrint Archive, p. 1192 (2015)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-319-69453-5_23","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"J-C Bajard","year":"2017","unstructured":"Bajard, J.-C., Eynard, J., Hasan, M.A., Zucca, V.: A full RNS variant of FV like somewhat homomorphic encryption schemes. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 423\u2013442. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_23"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-45239-0_4","volume-title":"Cryptography and Coding","author":"JW Bos","year":"2013","unstructured":"Bos, J.W., Lauter, K., Loftus, J., Naehrig, M.: Improved security for a ring-based fully homomorphic encryption scheme. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 45\u201364. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45239-0_4"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6(3), 13:1\u201313:36 (2014)","DOI":"10.1145\/2633600"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1137\/120868669","volume":"43","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. SIAM J. Comput. 43(2), 831\u2013871 (2014)","journal-title":"SIAM J. Comput."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Brickell, J., Porter, D.E., Shmatikov, V., Witchel, E.: Privacy-preserving remote diagnostics. In: CCS 2007, pp. 498\u2013507. ACM (2007)","DOI":"10.1145\/1315245.1315307"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"8_CR9","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: CCS 2019, pp. 395\u2013412. ACM (2019)","DOI":"10.1145\/3319535.3363207"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled PSI from fully homomorphic encryption with malicious security. In: CCS 2018, pp. 1223\u20131237. ACM (2018)","DOI":"10.1145\/3243734.3243836"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: CCS 2017, pp. 1243\u20131255. ACM (2017)","DOI":"10.1145\/3133956.3134061"},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1515\/popets-2018-0037","volume":"2018","author":"D Demmler","year":"2018","unstructured":"Demmler, D., Rindal, P., Rosulek, M., Trieu, N.: PIR-PSI: scaling private contact discovery. Proc. Priv. Enhancing Technol. 2018(4), 159\u2013178 (2018)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: CCS 2013, pp. 789\u2013800. ACM (2013)","DOI":"10.1145\/2508859.2516701"},{"key":"8_CR14","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, p. 144 (2012)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 844\u2013855. ACM (2014)","DOI":"10.1145\/2660267.2660366"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"MJ Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_1"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1007\/978-3-642-32009-5_49","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 850\u2013867. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_49"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"8_CR20","unstructured":"Gilad-Bachrach, R., Dowlin, N., Laine, K., Lauter, K.E., Naehrig, M., Wernsing, J.: CryptoNets: applying neural networks to encrypted data with high throughput and accuracy. In: ICML 2016, pp. 201\u2013210. JMLR.org (2016)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2008","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 155\u2013175. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_10"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/978-3-642-15317-4_26","volume-title":"Security and Cryptography for Networks","author":"S Jarecki","year":"2010","unstructured":"Jarecki, S., Liu, X.: Fast secure computation of set intersection. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 418\u2013435. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_26"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-662-45472-5_13","volume-title":"Financial Cryptography and Data Security","author":"S Kamara","year":"2014","unstructured":"Kamara, S., Mohassel, P., Raykova, M., Sadeghian, S.: Scaling private set intersection to billion-element sets. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 195\u2013215. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_13"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Kerschbaum, F.: Outsourced private set intersection using homomorphic encryption. In: ASIACCS 2012, pp. 85\u201386. ACM (2012)","DOI":"10.1145\/2414456.2414506"},{"issue":"4","key":"8_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1515\/popets-2017-0044","volume":"2017","author":"\u00c1 Kiss","year":"2017","unstructured":"Kiss, \u00c1., Liu, J., Schneider, T., Asokan, N., Pinkas, B.: Private set intersection for unequal set sizes with mobile applications. Proc. Priv. Enhancing Technol. 2017(4), 177\u2013197 (2017)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, Y., Wu, S.: Pipa: privacy-preserving password checkup via homomorphic encryption. In: ASIA CCS 2021, pp. 242\u2013251. ACM (2021)","DOI":"10.1145\/3433210.3457535"},{"key":"8_CR27","unstructured":"Marlinspike, M.: The difficulty of private contact discovery (2014). https:\/\/whispersystems.org\/blog\/contact-discovery. A company sponsored blog post"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Mayer, D.A., Wetzel, S.: Verifiable private equality test: enabling unbiased 2-party reconciliation on ordered sets in the malicious model. In: ASIACCS 2012, pp. 46\u201347. ACM (2012)","DOI":"10.1145\/2414456.2414482"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-10433-6_13","volume-title":"Cryptology and Network Security","author":"G Mezzour","year":"2009","unstructured":"Mezzour, G., Perrig, A., Gligor, V., Papadimitratos, P.: Privacy-preserving relationship path discovery in social networks. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 189\u2013208. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10433-6_13"},{"key":"8_CR30","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"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-28914-9_24","volume-title":"Theory of Cryptography","author":"B Parno","year":"2012","unstructured":"Parno, B., Raykova, M., Vaikuntanathan, V.: How to delegate and verify in public: verifiable computation from attribute-based encryption. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 422\u2013439. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_24"},{"key":"8_CR32","unstructured":"Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: private set intersection using permutation-based hashing. In: USENIX Security Symposium 2015, pp. 515\u2013530. USENIX Association (2015)"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78372-7_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Weinert, C., Wieder, U.: Efficient circuit-based PSI via cuckoo hashing. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 125\u2013157. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_5"},{"key":"8_CR34","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Faster private set intersection based on OT extension. In: USENIX Security Symposium 2014, pp. 797\u2013812. USENIX Association (2014)"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-58387-6_11","volume-title":"Financial Cryptography and Data Security","author":"ACD Resende","year":"2018","unstructured":"Resende, A.C.D., Aranha, D.F.: Faster unbalanced private set intersection. In: Meiklejohn, S., Sako, K. (eds.) FC 2018. LNCS, vol. 10957, pp. 203\u2013221. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-58387-6_11"},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Rindal, P., Rosulek, M.: Malicious-secure private set intersection via dual execution. In: CCS 2017, pp. 1229\u20131242. ACM (2017)","DOI":"10.1145\/3133956.3134044"},{"key":"8_CR37","unstructured":"Microsoft SEAL (release 3.6) (2020). https:\/\/github.com\/Microsoft\/SEAL. Microsoft Research, Redmond, WA"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Troncoso-Pastoriza, J.R., Katzenbeisser, S., Celik, M.U.: Privacy preserving error resilient DNA searching through oblivious automata. In: CCS 2007, pp. 519\u2013528. ACM (2007)","DOI":"10.1145\/1315245.1315309"}],"container-title":["Communications in Computer and Information Science","Security and Privacy in Social Networks and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-7242-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,8]],"date-time":"2022-10-08T23:02:48Z","timestamp":1665270168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-7242-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811972416","9789811972423"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-7242-3_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SocialSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Security and Privacy in Social Networks and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"16 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"socialsec2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/socialsec2022.xidian.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"103","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":"23","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":"22% - 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","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)"}}]}}