{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T12:49:42Z","timestamp":1790858982307,"version":"4.1.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030884277","type":"print"},{"value":"9783030884284","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-88428-4_35","type":"book-chapter","created":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T02:03:11Z","timestamp":1633053791000},"page":"721-742","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Polynomial Representation Is Tricky: Maliciously Secure Private Set Intersection Revisited"],"prefix":"10.1007","author":[{"given":"Aydin","family":"Abadi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steven J.","family":"Murdoch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Zacharias","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,10,2]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, A., Terzis, S., Metere, R., Dong, C.: Efficient delegated private set intersection on outsourced private datasets. IEEE TDSC (2018)","DOI":"10.1007\/978-3-662-54970-4_9"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, A., Murdoch, S.J., Zacharias, T.: Polynomial representation is tricky: Maliciously secure private set intersection revisited (Full version) (2021). https:\/\/eprint.iacr.org\/2021\/1009.pdf","DOI":"10.1007\/978-3-030-88428-4_35"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Abadi, A., Terzis, S., Dong, C.: O-PSI: delegated private set intersection on outsourced datasets. In: IFIP SEC (2015)","DOI":"10.1007\/978-3-319-18467-8_1"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Abadi, A., Terzis, S., Dong, C.: VD-PSI: verifiable delegated private set intersection on outsourced private datasets. In: FC (2016)","DOI":"10.1007\/978-3-662-54970-4_9"},{"key":"35_CR5","unstructured":"Abadi, A., Terzis, S., Dong, C.: Feather: Lightweight multi-party updatable delegated private set intersection. IACR Cryptology ePrint Archive (2020)"},{"key":"35_CR6","unstructured":"Aho, A.V., Hopcroft, J.E.: The Design and Analysis of Computer Algorithms. Addison-Wesley Longman Publishing Co., Inc., Boston (1974)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Efraim, A., Nissenbaum, O., Omri, E., Paskin-Cherniavsky, A.: Psimple: Practical multiparty maliciously-secure private set intersection, ePrint Archive (2021)","DOI":"10.1145\/3488932.3523254"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Gentry, C., Halevi, S., Wang, F., Wu, D.J.: Private database queries using somewhat homomorphic encryption. In: ACNS (2013)","DOI":"10.1007\/978-3-642-38980-1_7"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Brickell, J., Porter, D.E., Shmatikov, V., Witchel, E.: Privacy-preserving remote diagnostics. In: CCS (2007)","DOI":"10.1145\/1315245.1315307"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Bursztein, E., Hamburg, M., Lagarenne, J., Boneh, D.: Openconflict: preventing real time map hacks in online games. In: IEEE S&P (2011)","DOI":"10.1109\/SP.2011.28"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Zaverucha, G.M.: Private intersection of certified sets. In: FC (2009)","DOI":"10.1007\/978-3-642-03549-4_7"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Chase, M., Miao, P.: Private set intersection in the internet setting from lightweight oblivious PRF. In: CRYPTO (2020)","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: CCS (2017)","DOI":"10.1145\/3133956.3134061"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Cristofaro, E.D., Lu, Y., Tsudik, G.: Efficient techniques for privacy-preserving sharing of sensitive information. In: TRUST (2011)","DOI":"10.1007\/978-3-642-21599-5_18"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Duong, T., Phan, D.H., Trieu, N.: Catalic: delegated PSI cardinality with applications to contact tracing. In: ASIACRYPT (2020)","DOI":"10.1007\/978-3-030-64840-4_29"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: EUROCRYPT (2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"35_CR18","unstructured":"Ghosh, S., Nielsen, J.B., Nilges, T.: Maliciously secure oblivious linear function evaluation with constant overhead. In: ASIACRYPT (2007)"},{"key":"35_CR19","unstructured":"Ghosh, S., Nilges, T.: An algebraic approach to maliciously secure private set intersection (full version). ePrint Archive (2017). https:\/\/eprint.iacr.org\/2017\/1064"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Nilges, T.: An algebraic approach to maliciously secure private set intersection. In: EUROCRYPT (2019)","DOI":"10.1007\/978-3-030-17659-4_6"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Simkin, M.: The communication complexity of threshold private set intersection. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26951-7_1"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Hazay, C., Venkitasubramaniam, M.: Scalable multi-party private set-intersection. In: PKC (2017)","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Inbar, R., Omri, E., Pinkas, B.: Efficient scalable multiparty private set-intersection via garbled bloom filters. In: SCN (2018)","DOI":"10.1007\/978-3-319-98113-0_13"},{"key":"35_CR24","doi-asserted-by":"crossref","unstructured":"Ion, M., et al.: On deploying secure computing: private intersection-sum-with-cardinality. In: IEEE EuroS&P (2020)","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"35_CR25","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: FOCS (2000)"},{"key":"35_CR26","doi-asserted-by":"crossref","unstructured":"Kamara, S., Mohassel, P., Raykova, M., Sadeghian, S.: Scaling private set intersection to billion-element sets. In: FC (2014)","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"35_CR27","doi-asserted-by":"crossref","unstructured":"Katz, J., Myers, S.A., Ostrovsky, R.: Cryptographic counters and applications to electronic voting. In: EUROCRYPT (2001)","DOI":"10.1007\/3-540-44987-6_6"},{"key":"35_CR28","doi-asserted-by":"crossref","unstructured":"Kissner, L., Song, D.X.: Privacy-preserving set operations. In: CRYPTO (2005)","DOI":"10.21236\/ADA457144"},{"key":"35_CR29","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: CCS (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"35_CR30","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Matania, N., Pinkas, B., Rosulek, M., Trieu, N.: Practical multi-party private set intersection from symmetric-key techniques. In: CCS (2017)","DOI":"10.1145\/3133956.3134065"},{"key":"35_CR31","doi-asserted-by":"crossref","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: PSI from PaXoS: fast, malicious private set intersection. In: EUROCRYPT (2020)","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"35_CR32","unstructured":"Quarteroni, A., Sacco, R., Saleri, F.: Numerical Mathematics, vol. 37. Springer Science & Business Media, Heidelberg (2010)"},{"issue":"2","key":"35_CR33","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"11","key":"35_CR34","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"35_CR35","unstructured":"Thomas, K., et al.: Protecting accounts from credential stuffing with password breach alerting. In: USENIX Security (2019)"},{"key":"35_CR36","doi-asserted-by":"crossref","unstructured":"Yang, X., Luo, X., Wang, X.A., Zhang, S.: Improved outsourced private set intersectionprotocol based on polynomial interpolation. Concurr. Comput. Pract. Exp. (2018)","DOI":"10.1002\/cpe.4329"},{"key":"35_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, E., Liu, F., Lai, Q., Jin, G., Li, Y.: Efficient multi-party private set intersection against malicious adversaries. In: CCSW (2019)","DOI":"10.1145\/3338466.3358927"},{"key":"35_CR38","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Chow, S.S.M.: Can you find the one for me? Privacy-preserving matchmaking via threshold PSI. ePrint Archive (2018)","DOI":"10.1145\/3267323.3268965"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88428-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:09:02Z","timestamp":1790813342000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88428-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030884277","9783030884284"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88428-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 October 2021","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":"Darmstadt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2021.athene-center.de\/index.php","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":"351","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":"71","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":"20% - 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.07","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":"6.06","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":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","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"}]}}