{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:07:01Z","timestamp":1773796021216,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T00:00:00Z","timestamp":1653868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ariel Cyber Innovation Center in conjunction with the Israel National Cyber directorate in the Prime Minister's Office"},{"name":"ISF","award":["152\/17"],"award-info":[{"award-number":["152\/17"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,30]]},"DOI":"10.1145\/3488932.3523254","type":"proceedings-article","created":{"date-parts":[[2022,5,24]],"date-time":"2022-05-24T04:23:26Z","timestamp":1653366206000},"page":"1098-1112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["PSImple"],"prefix":"10.1145","author":[{"given":"Aner","family":"Ben-Efraim","sequence":"first","affiliation":[{"name":"Ariel University, Ariel, Israel"}]},{"given":"Olga","family":"Nissenbaum","sequence":"additional","affiliation":[{"name":"Ariel University, Ariel, Israel"}]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[{"name":"Ariel University, Ariel, Israel"}]},{"given":"Anat","family":"Paskin-Cherniavsky","sequence":"additional","affiliation":[{"name":"Ariel University, Ariel, Israel"}]}],"member":"320","published-online":{"date-parts":[[2022,5,30]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"805","article-title":"High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority","volume":"2016","author":"Araki T.","year":"2016","unstructured":"T. Araki , J. Furukawa , Y. Lindell , A. Nof , and K. Ohara . 2016 . High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority . ACM CCS 2016 , 805 -- 817 . https:\/\/doi.org\/10.1145\/2976749.2978331 10.1145\/2976749.2978331 T. Araki, J. Furukawa, Y. Lindell, A. Nof, and K. Ohara. 2016. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. ACM CCS 2016, 805--817. https:\/\/doi.org\/10.1145\/2976749.2978331","journal-title":"ACM CCS"},{"key":"e_1_3_2_2_2_1","volume-title":"ACNS","author":"Ben-Efraim A.","year":"2019","unstructured":"A. Ben-Efraim , M. Nielsen , and E. Omri . 2019. Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing . ACNS 2019 , 530--549. A. Ben-Efraim, M. Nielsen, and E. Omri. 2019. Turbospeedz: Double Your Online SPDZ! Improving SPDZ Using Function Dependent Preprocessing. ACNS 2019, 530--549."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"A. Ben-Efraim O. Nissenbaum E. Omri and A. Paskin-Cherniavsky. 2021. Psim- ple: Practical multiparty maliciously-secure private set intersection. Cryptology ePrint Archive (2021).  A. Ben-Efraim O. Nissenbaum E. Omri and A. Paskin-Cherniavsky. 2021. Psim- ple: Practical multiparty maliciously-secure private set intersection. Cryptology ePrint Archive (2021).","DOI":"10.1145\/3488932.3523254"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.05.018"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3402457"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"J. H. Cheon S. Jarecki and J. H. Seo. 2012. Multi-Party Privacy-Preserving Set Intersection with Quasi-Linear Complexity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(8) (2012) 1366--1378.  J. H. Cheon S. Jarecki and J. H. Seo. 2012. Multi-Party Privacy-Preserving Set Intersection with Quasi-Linear Complexity. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(8) (2012) 1366--1378.","DOI":"10.1587\/transfun.E95.A.1366"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90084-0"},{"key":"e_1_3_2_2_9_1","volume-title":"Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits. ESORICS 2013 8134","author":"Damg\u00e5rd I.","unstructured":"I. Damg\u00e5rd , M. Keller , E. Larraia , V. Pastro , P. Scholl , and N. P. Smart . 2013 . Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits. ESORICS 2013 8134 , 1--18. I. Damg\u00e5rd, M. Keller, E. Larraia, V. Pastro, P. Scholl, and N. P. Smart. 2013. Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits. ESORICS 2013 8134, 1--18."},{"key":"e_1_3_2_2_10_1","volume-title":"ASIACRYPT","author":"De Cristofaro E.","year":"2010","unstructured":"E. De Cristofaro , J. Kim , and G. Tsudik . 2010. Linear-complexity private set intersection protocols secure in malicious model . ASIACRYPT 2010 , 213--231. E. De Cristofaro, J. Kim, and G. Tsudik. 2010. Linear-complexity private set intersection protocols secure in malicious model. ASIACRYPT 2010, 213--231."},{"key":"e_1_3_2_2_11_1","first-page":"789","article-title":"When private set intersection meets big data: An efficient and scalable protocol","volume":"2013","author":"Dong C.","year":"2013","unstructured":"C. Dong , L. Chen , and Z. Wen . 2013 . When private set intersection meets big data: An efficient and scalable protocol . ACM CCS 2013 , 789 -- 800 . C. Dong, L. Chen, and Z. Wen. 2013. When private set intersection meets big data: An efficient and scalable protocol. ACM CCS 2013, 789--800.","journal-title":"ACM CCS"},{"key":"e_1_3_2_2_12_1","volume-title":"CRYPTO","author":"Garimella G.","year":"2021","unstructured":"G. Garimella , B. Pinkas , M. Rosulek , N. Trieu , and A. Yanai . 2021. Oblivious key-value stores and amplification for private set intersection . CRYPTO 2021 , 395--425. G. Garimella, B. Pinkas, M. Rosulek, N. Trieu, and A. Yanai. 2021. Oblivious key-value stores and amplification for private set intersection. CRYPTO 2021, 395--425."},{"key":"e_1_3_2_2_13_1","volume-title":"EUROCRYPT","author":"Ghosh S.","year":"2019","unstructured":"S. Ghosh and T. Nilges . 2019. An algebraic approach to maliciously secure private set intersection . EUROCRYPT 2019 , 154--185. S. Ghosh and T. Nilges. 2019. An algebraic approach to maliciously secure private set intersection. EUROCRYPT 2019, 154--185."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.09.004"},{"key":"e_1_3_2_2_15_1","volume-title":"Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. ASIACRYPT 2017 10624","author":"Hazay C.","unstructured":"C. Hazay , P. Scholl , and E. Soria-Vazquez . 2017 . Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. ASIACRYPT 2017 10624 , 598--628. C. Hazay, P. Scholl, and E. Soria-Vazquez. 2017. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. ASIACRYPT 2017 10624, 598--628."},{"key":"e_1_3_2_2_16_1","first-page":"175","article-title":"Scalable Multi-Party Private Set- Intersection","volume":"2017","author":"Hazay C.","year":"2017","unstructured":"C. Hazay and M. Venkitasubramaniam . 2017 . Scalable Multi-Party Private Set- Intersection . PKC 2017 , 175 -- 203 . C. Hazay and M. Venkitasubramaniam. 2017. Scalable Multi-Party Private Set- Intersection. PKC 2017, 175--203.","journal-title":"PKC"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"R. Inbar E. Omri and B. Pinkas. 2018. Efficient scalable multiparty private set-intersection via garbled bloom filters. SCN (2018) 235--252.  R. Inbar E. Omri and B. Pinkas. 2018. Efficient scalable multiparty private set-intersection via garbled bloom filters. SCN (2018) 235--252.","DOI":"10.1007\/978-3-319-98113-0_13"},{"key":"e_1_3_2_2_18_1","first-page":"145","volume-title":"Extending Oblivious Transfers Efficiently. CRYPTO 2003 2729","author":"Ishai Y.","unstructured":"Y. Ishai , J. Kilian , K. Nissim , and E. Petrank . 2003 . Extending Oblivious Transfers Efficiently. CRYPTO 2003 2729 , 145 - 161 . Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. 2003. Extending Oblivious Transfers Efficiently. CRYPTO 2003 2729, 145-161."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"F. Karako\u00e7 and A. K\u00fcp\u00e7\u00fc. 2020. Linear Complexity Private Set Intersection for Secure Two-Party Protocols. In CANS. Springer 409--429.  F. Karako\u00e7 and A. K\u00fcp\u00e7\u00fc. 2020. Linear Complexity Private Set Intersection for Secure Two-Party Protocols. In CANS. Springer 409--429.","DOI":"10.1007\/978-3-030-65411-5_20"},{"key":"e_1_3_2_2_20_1","volume-title":"CRYPTO","author":"Keller M.","year":"2015","unstructured":"M. Keller , E. Orsini , and P. Scholl . 2015. Actively secure OT extension with optimal overhead . CRYPTO 2015 , 724--741. M. Keller, E. Orsini, and P. Scholl. 2015. Actively secure OT extension with optimal overhead. CRYPTO 2015, 724--741."},{"key":"e_1_3_2_2_21_1","first-page":"158","article-title":"Overdrive","volume":"10822","author":"Keller M.","year":"2018","unstructured":"M. Keller , V. Pastro , and D. Rotaru . 2018 . Overdrive : Making SPDZ Great Again. EUROCRYPT 10822 (2018), 158 -- 189 . M. Keller, V. Pastro, and D. Rotaru. 2018. Overdrive: Making SPDZ Great Again. EUROCRYPT 10822 (2018), 158--189.","journal-title":"Making SPDZ Great Again. EUROCRYPT"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"M. Kim H. T. Lee and J. H. Cheon. 2011. Mutual private set intersection with linear complexity. WISA (2011) 219--231.  M. Kim H. T. Lee and J. H. Cheon. 2011. Mutual private set intersection with linear complexity. WISA (2011) 219--231.","DOI":"10.1007\/978-3-642-27890-7_18"},{"key":"e_1_3_2_2_23_1","volume-title":"CRYPTO","author":"Kissner L.","year":"2005","unstructured":"L. Kissner and D. Song . 2005. Privacy-preserving set operations . CRYPTO 2005 , 241--257. L. Kissner and D. Song. 2005. Privacy-preserving set operations. CRYPTO 2005, 241--257."},{"key":"e_1_3_2_2_24_1","first-page":"818","article-title":"Efficient batched oblivious PRF with applications to private set intersection","volume":"2016","author":"Kolesnikov V.","year":"2016","unstructured":"V. Kolesnikov , R. Kumaresan , M. Rosulek , and N. Trieu . 2016 . Efficient batched oblivious PRF with applications to private set intersection . ACM CCS 2016 , 818 -- 829 . V. Kolesnikov, R. Kumaresan, M. Rosulek, and N. Trieu. 2016. Efficient batched oblivious PRF with applications to private set intersection. ACM CCS 2016, 818--829.","journal-title":"ACM CCS"},{"key":"e_1_3_2_2_25_1","first-page":"1257","article-title":"Practical Multi-party Private Set Intersection from Symmetric-Key Techniques","volume":"2017","author":"Kolesnikov V.","year":"2017","unstructured":"V. Kolesnikov , N. Matania , B. Pinkas , M. Rosulek , and N. Trieu . 2017 . Practical Multi-party Private Set Intersection from Symmetric-Key Techniques . ACM CCS 2017 , 1257 -- 1272 . V. Kolesnikov, N. Matania, B. Pinkas, M. Rosulek, and N. Trieu. 2017. Practical Multi-party Private Set Intersection from Symmetric-Key Techniques. ACM CCS 2017, 1257--1272.","journal-title":"ACM CCS"},{"key":"e_1_3_2_2_26_1","unstructured":"M. Mitzenmacher and E. Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge Uni. press.  M. Mitzenmacher and E. Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge Uni. press."},{"key":"e_1_3_2_2_27_1","volume-title":"Fast Malicious Multiparty Private Set Intersection. In ACM CCS","author":"Nevo O.","year":"2021","unstructured":"O. Nevo , N. Trieu , and A. Yanai . 2021. Simple , Fast Malicious Multiparty Private Set Intersection. In ACM CCS 2021 . O. Nevo, N. Trieu, and A. Yanai. 2021. Simple, Fast Malicious Multiparty Private Set Intersection. In ACM CCS 2021."},{"key":"e_1_3_2_2_28_1","volume-title":"EUROCRYPT","author":"Pinkas B.","year":"2020","unstructured":"B. Pinkas , M. Rosulek , N. Trieu , and A. Yanai . 2020. PSI from PaXoS: Fast, malicious private set intersection . EUROCRYPT 2020 , 739--767. B. Pinkas, M. Rosulek, N. Trieu, and A. Yanai. 2020. PSI from PaXoS: Fast, malicious private set intersection. EUROCRYPT 2020, 739--767."},{"key":"e_1_3_2_2_29_1","unstructured":"B. Pinkas T. Schneider and M. Zohner. 2014. Faster Private Set Intersection Based on OT Extension. USENIX Security (2014) 797--812.  B. Pinkas T. Schneider and M. Zohner. 2014. Faster Private Set Intersection Based on OT Extension. USENIX Security (2014) 797--812."},{"key":"e_1_3_2_2_30_1","volume-title":"ACM TOPS 2018 21","author":"Pinkas B.","unstructured":"B. Pinkas , T. Schneider , and M. Zohner . 2018. Scalable private set intersection based on OT extension . ACM TOPS 2018 21 , 2, 1--35. B. Pinkas, T. Schneider, and M. Zohner. 2018. Scalable private set intersection based on OT extension. ACM TOPS 2018 21, 2, 1--35."},{"key":"e_1_3_2_2_31_1","volume-title":"Aiken Computation Laboratory","author":"Rabin M. O.","unstructured":"M. O. Rabin . 1981. How to Exchange Secrets by Oblivious Transfer. Tech. Memo TR-81 , Aiken Computation Laboratory , Harvard University . M. O. Rabin. 1981. How to Exchange Secrets by Oblivious Transfer. Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University."},{"key":"e_1_3_2_2_32_1","volume-title":"FC 2018. 203--221","author":"Resende A. C. D.","unstructured":"A. C. D. Resende and D. F. Aranha . 2018. Faster unbalanced private set intersection . In FC 2018. 203--221 . A. C. D. Resende and D. F. Aranha. 2018. Faster unbalanced private set intersection. In FC 2018. 203--221."},{"key":"e_1_3_2_2_33_1","unstructured":"P. Rindal.. libOTe: an efficient portable and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe  P. Rindal.. libOTe: an efficient portable and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe"},{"key":"e_1_3_2_2_34_1","first-page":"235","article-title":"Improved Private Set Intersection Against Malicious Adversaries","volume":"2017","author":"Rindal P.","year":"2017","unstructured":"P. Rindal and M. Rosulek . 2017 . Improved Private Set Intersection Against Malicious Adversaries . EUROCRYPT 2017 , 235 -- 259 . P. Rindal and M. Rosulek. 2017. Improved Private Set Intersection Against Malicious Adversaries. EUROCRYPT 2017, 235--259.","journal-title":"EUROCRYPT"},{"key":"e_1_3_2_2_35_1","first-page":"1229","article-title":"Malicious-secure private set intersection via dual execution","volume":"2017","author":"Rindal P.","year":"2017","unstructured":"P. Rindal and M. Rosulek . 2017 . Malicious-secure private set intersection via dual execution . ACM CCS 2017 , 1229 -- 1242 . P. Rindal and M. Rosulek. 2017. Malicious-secure private set intersection via dual execution. ACM CCS 2017, 1229--1242.","journal-title":"ACM CCS"},{"key":"e_1_3_2_2_36_1","first-page":"39","article-title":"Global-Scale Secure Multiparty Com- putation","volume":"2017","author":"Wang X.","year":"2017","unstructured":"X. Wang , S. Ranellucci , and J. Katz . 2017 . Global-Scale Secure Multiparty Com- putation . ACM CCS 2017 , 39 -- 56 . X. Wang, S. Ranellucci, and J. Katz. 2017. Global-Scale Secure Multiparty Com- putation. ACM CCS 2017, 39--56.","journal-title":"ACM CCS"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338466.3358927"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2017-0010"}],"event":{"name":"ASIA CCS '22: ACM Asia Conference on Computer and Communications Security","location":"Nagasaki Japan","acronym":"ASIA CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3523254","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3488932.3523254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:27Z","timestamp":1750188687000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3488932.3523254"}},"subtitle":["Practical Multiparty Maliciously-Secure Private Set Intersection"],"short-title":[],"issued":{"date-parts":[[2022,5,30]]},"references-count":38,"alternative-id":["10.1145\/3488932.3523254","10.1145\/3488932"],"URL":"https:\/\/doi.org\/10.1145\/3488932.3523254","relation":{},"subject":[],"published":{"date-parts":[[2022,5,30]]},"assertion":[{"value":"2022-05-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}