{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T14:16:32Z","timestamp":1785420992299,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,11]]},"DOI":"10.1145\/3338466.3358927","type":"proceedings-article","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T18:15:00Z","timestamp":1573496100000},"page":"93-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Efficient Multi-Party Private Set Intersection Against Malicious Adversaries"],"prefix":"10.1145","author":[{"given":"En","family":"Zhang","sequence":"first","affiliation":[{"name":"Henan Normal University, Henan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng-Hao","family":"Liu","sequence":"additional","affiliation":[{"name":"Florida Atlantic University, Boca Raton, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qiqi","family":"Lai","sequence":"additional","affiliation":[{"name":"Shaanxi Normal University, Xi'an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ganggang","family":"Jin","sequence":"additional","affiliation":[{"name":"Henan Normal University, Henan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Li","sequence":"additional","affiliation":[{"name":"Henan Normal University, Henan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","article-title":"Efficient delegated private setintersection on outsourced private datasets","author":"Abadi A.","year":"2017","unstructured":"A. Abadi , S. Terzis , R. Metere , and C. Dong . Efficient delegated private setintersection on outsourced private datasets . IEEE Transactions on Dependableand Secure Computing, pages 1--15 , 2017 . A. Abadi, S. Terzis, R. Metere, and C. Dong. Efficient delegated private setintersection on outsourced private datasets. IEEE Transactions on Dependableand Secure Computing, pages 1--15, 2017.","journal-title":"IEEE Transactions on Dependableand Secure Computing, pages 1--15"},{"key":"e_1_3_2_1_2_1","first-page":"691","volume-title":"Countering GAT-TACA: efficient and secure testing of fully-sequenced human genomes","author":"Baldi P.","year":"2011","unstructured":"P. Baldi , R. Baronio , E. De Cristofaro , P. Gasti , and G. Tsudik . Countering GAT-TACA: efficient and secure testing of fully-sequenced human genomes . In Y. Chen,G. Danezis, and V. Shmatikov, editors,ACM CCS 2011 , pages 691 -- 702 . ACM Press ,Oct. 2011. P. Baldi, R. Baronio, E. De Cristofaro, P. Gasti, and G. Tsudik. Countering GAT-TACA: efficient and secure testing of fully-sequenced human genomes. In Y. Chen,G. Danezis, and V. Shmatikov, editors,ACM CCS 2011, pages 691--702. ACM Press,Oct. 2011."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.05.018"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875553"},{"key":"e_1_3_2_1_5_1","first-page":"597","volume-title":"G.-J. Ahn","author":"Canetti R.","year":"2014","unstructured":"R. Canetti , A. Jain , and A. Scafuro . Practical UC security with a global random oracle . In G.-J. Ahn , M. Yung, and N. Li, editors,ACM CCS 2014 , pages 597 -- 608 .ACM Press , Nov. 2014. R. Canetti, A. Jain, and A. Scafuro. Practical UC security with a global random oracle. In G.-J. Ahn, M. Yung, and N. Li, editors,ACM CCS 2014, pages 597--608.ACM Press, Nov. 2014."},{"key":"e_1_3_2_1_6_1","first-page":"1243","volume-title":"Thuraisingham et al. [37]","author":"Chen H.","unstructured":"H. Chen , K. Laine , and P. Rindal . Fast private set intersection from homomorphicen cryption . In Thuraisingham et al. [37] , pages 1243 -- 1255 . H. Chen, K. Laine, and P. Rindal. Fast private set intersection from homomorphicen cryption. In Thuraisingham et al. [37], pages 1243--1255."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"S. G.\n      Choi J.\n      Katz R.\n      Kumaresan and \n      C.\n      Cid\n  . \n  Multi-client non-interactive verifiable computation\n  . In A. Sahai editor TCC \n  2013 volume \n  7785\n   of \n  LNCS pages \n  499\n  --\n  518\n  . \n  Springer Heidelberg Mar. 2013.  S. G. Choi J. Katz R. Kumaresan and C. Cid. Multi-client non-interactive verifiable computation. In A. Sahai editor TCC 2013 volume 7785 of LNCS pages 499--518. Springer Heidelberg Mar. 2013.","DOI":"10.1007\/978-3-642-36594-2_28"},{"key":"e_1_3_2_1_8_1","first-page":"719","volume-title":"Thuraisingham et al. [37]","author":"Choudhuri A. R.","unstructured":"A. R. Choudhuri , M. Green , A. Jain , G. Kaptchuk , and I. Miers . Fairness in an unfair world: Fair multiparty computation from public bulletin boards . In Thuraisingham et al. [37] , pages 719 -- 728 . A. R. Choudhuri, M. Green, A. Jain, G. Kaptchuk, and I. Miers. Fairness in an unfair world: Fair multiparty computation from public bulletin boards. In Thuraisingham et al. [37], pages 719--728."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1450"},{"key":"e_1_3_2_1_10_1","first-page":"425","volume-title":"Nielsen and Rijmen [31]","author":"Derler D.","unstructured":"D. Derler , T. Jager , D. Slamanig , and C. Striecks . Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange . In Nielsen and Rijmen [31] , pages 425 -- 455 . D. Derler, T. Jager, D. Slamanig, and C. Striecks. Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange. In Nielsen and Rijmen [31], pages 425--455."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_12_1","first-page":"789","volume-title":"ACM CCS 2013","author":"Dong C.","year":"2013","unstructured":"C. Dong , L. Chen , and Z. Wen . When private set intersection meets big data: an efficient and scalable protocol. In A.-R. Sadeghi, V. D. Gligor, and M. Yung, editors , ACM CCS 2013 , pages 789 -- 800 . ACM Press , Nov. 2013 . C. Dong, L. Chen, and Z. Wen. When private set intersection meets big data: an efficient and scalable protocol. In A.-R. Sadeghi, V. D. Gligor, and M. Yung, editors, ACM CCS 2013, pages 789--800. ACM Press, Nov. 2013."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"M. J.\n      Freedman K.\n      Nissim and \n      B.\n      Pinkas\n  . \n  Efficient private matching and setintersection\n  . In C. Cachin and J. Camenisch editors EUROCRYPT \n  2004 volume \n  3027\n   of \n  LNCS pages \n  1\n  --\n  19\n  . \n  Springer Heidelberg May 2004.  M. J. Freedman K. Nissim and B. Pinkas. Efficient private matching and setintersection. In C. Cachin and J. Camenisch editors EUROCRYPT 2004 volume 3027 of LNCS pages 1--19. Springer Heidelberg May 2004.","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_14_1","first-page":"658","volume-title":"48th FOCS","author":"Garay J. A.","year":"2007","unstructured":"J. A. Garay , J. Katz , C.-Y. Koo , and R. Ostrovsky . Round complexity of authenti-cated broadcast with a dishonest majority . In 48th FOCS , pages 658 -- 668 . IEEE Computer Society Press , Oct. 2007 . J. A. Garay, J. Katz, C.-Y. Koo, and R. Ostrovsky. Round complexity of authenti-cated broadcast with a dishonest majority. In 48th FOCS, pages 658--668. IEEE Computer Society Press, Oct. 2007."},{"key":"e_1_3_2_1_15_1","volume-title":"Foundations of cryptography","author":"Goldreich O.","year":"2009","unstructured":"O. Goldreich . Foundations of cryptography : volume 2 , basic applications. Cambridge university press , 2009 . O. Goldreich. Foundations of cryptography: volume 2, basic applications. Cambridge university press, 2009."},{"key":"e_1_3_2_1_16_1","first-page":"17","volume-title":"16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings","author":"Goldwasser S.","year":"2002","unstructured":"S. Goldwasser and Y. Lindell . Secure computation without agreement. In Distributed Computing , 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings , pages 17 -- 32 , 2002 . S. Goldwasser and Y. Lindell. Secure computation without agreement. In Distributed Computing, 16th International Conference, DISC 2002, Toulouse, France, October 28-30, 2002 Proceedings, pages 17--32, 2002."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"S. D.\n      Gordon J.\n      Katz F.-H.\n      Liu E.\n      Shi and \n      H.-S.\n      Zhou\n    .\n  Multi-client verifiable computation with stronger security guarantees\n  . In Y. Dodis and J. B. Nielsen editors TCC \n  2015 Part II volume \n  9015\n   of \n  LNCS pages \n  144\n  --\n  168\n  . \n  Springer Heidelberg Mar. 2015.  S. D. Gordon J. Katz F.-H. Liu E. Shi and H.-S. Zhou. Multi-client verifiable computation with stronger security guarantees. In Y. Dodis and J. B. Nielsen editors TCC 2015 Part II volume 9015 of LNCS pages 144--168. Springer Heidelberg Mar. 2015.","DOI":"10.1007\/978-3-662-46497-7_6"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"C.\n      Hazay\n     and \n      M.\n      Venkitasubramaniam\n  . \n  Scalable multi-party private set-intersection\n  . In S. Fehr editor PKC \n  2017 Part I volume \n  10174\n   of \n  LNCS pages \n  175\n  --\n  203\n  . \n  Springer Heidelberg Mar. 2017.  C. Hazay and M. Venkitasubramaniam. Scalable multi-party private set-intersection. In S. Fehr editor PKC 2017 Part I volume 10174 of LNCS pages 175--203. Springer Heidelberg Mar. 2017.","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"e_1_3_2_1_19_1","volume-title":"NDSS 2012","author":"Huang Y.","year":"2012","unstructured":"Y. Huang , D. Evans , and J. Katz . Private set intersection: Are garbled circuits better than custom protocols? In NDSS 2012 . The Internet Society , Feb. 2012 . Y. Huang, D. Evans, and J. Katz. Private set intersection: Are garbled circuits better than custom protocols? In NDSS 2012. The Internet Society, Feb. 2012."},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","first-page":"235","volume-title":"D. Catalano and R. De Prisco","author":"Inbar R.","year":"2018","unstructured":"R. Inbar , E. Omri , and B. Pinkas . Efficient scalable multiparty private set-intersection via garbled bloom filters . In D. Catalano and R. De Prisco , editors, SCN 18, volume 11035 of LNCS , pages 235 -- 252 . Springer , Heidelberg, Sept. 2018 . R. Inbar, E. Omri, and B. Pinkas. Efficient scalable multiparty private set-intersection via garbled bloom filters. In D. Catalano and R. De Prisco, editors, SCN 18, volume 11035 of LNCS, pages 235--252. Springer, Heidelberg, Sept. 2018."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"S.\n      Kamara P.\n      Mohassel M.\n      Raykova and \n      S. S.\n      Sadeghian\n  . \n  Scaling private set intersection to billion-element sets\n  . In N. Christin and R. Safavi-Naini editors FC \n  2014 volume \n  8437\n   of \n  LNCS pages \n  195\n  --\n  215\n  . \n  Springer Heidelberg Mar. 2014.  S. Kamara P. Mohassel M. Raykova and S. S. Sadeghian. Scaling private set intersection to billion-element sets. In N. Christin and R. Safavi-Naini editors FC 2014 volume 8437 of LNCS pages 195--215. Springer Heidelberg Mar. 2014.","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"J.\n      Katz\n     and \n      C.-Y.\n      Koo\n    .\n  Round-efficient secure computation in point-to-point networks\n  . In M. Naor editor EUROCRYPT \n  2007 volume \n  4515\n   of \n  LNCS pages \n  311\n  --\n  328\n  . \n  Springer Heidelberg May 2007.  J. Katz and C.-Y. Koo. Round-efficient secure computation in point-to-point networks. In M. Naor editor EUROCRYPT 2007 volume 4515 of LNCS pages 311--328. Springer Heidelberg May 2007.","DOI":"10.1007\/978-3-540-72540-4_18"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"M.\n      Keller E.\n      Orsini and \n      P.\n      Scholl\n  . \n  Actively secure OT extension with optima loverhead\n  . In R. Gennaro and M. J. B. Robshaw editors CRYPTO \n  2015 Part I volume \n  9215\n   of \n  LNCS pages \n  724\n  --\n  741\n  . \n  Springer Heidelberg Aug. 2015.  M. Keller E. Orsini and P. Scholl. Actively secure OT extension with optima loverhead. In R. Gennaro and M. J. B. Robshaw editors CRYPTO 2015 Part I volume 9215 of LNCS pages 724--741. Springer Heidelberg Aug. 2015.","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"L.\n      Kissner\n     and \n      D. X.\n      Song\n  . \n  Privacy-preserving set operations\n  . In V. Shoup editor CRYPTO \n  2005 volume \n  3621\n   of \n  LNCS pages \n  241\n  --\n  257\n  . \n  Springer Heidelberg Aug. 2005.  L. Kissner and D. X. Song. Privacy-preserving set operations. In V. Shoup editor CRYPTO 2005 volume 3621 of LNCS pages 241--257. Springer Heidelberg Aug. 2005.","DOI":"10.1007\/11535218_15"},{"key":"e_1_3_2_1_25_1","first-page":"818","volume-title":"ACM CCS 2016","author":"Kolesnikov V.","year":"2016","unstructured":"V. Kolesnikov , R. Kumaresan , M. Rosulek , and N. Trieu . Efficient batched oblivious PRF with applications to private set intersection. In E. R. Weippl, S. Katzenbeisser, C. Kruegel, A. C. Myers, and S. Halevi, editors , ACM CCS 2016 , pages 818 -- 829 . ACM Press , Oct. 2016 . V. Kolesnikov, R. Kumaresan, M. Rosulek, and N. Trieu. Efficient batched oblivious PRF with applications to private set intersection. In E. R. Weippl, S. Katzenbeisser, C. Kruegel, A. C. Myers, and S. Halevi, editors, ACM CCS 2016, pages 818--829. ACM Press, Oct. 2016."},{"key":"e_1_3_2_1_26_1","first-page":"1257","volume-title":"Thuraisinghamet al. [37]","author":"Kolesnikov V.","unstructured":"V. Kolesnikov , N. Matania , B. Pinkas , M. Rosulek , and N. Trieu . Practical multi-party private set intersection from symmetric-key techniques . In Thuraisinghamet al. [37] , pages 1257 -- 1272 . V. Kolesnikov, N. Matania, B. Pinkas, M. Rosulek, and N. Trieu. Practical multi-party private set intersection from symmetric-key techniques. In Thuraisinghamet al. [37], pages 1257--1272."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"P.\n      Mohassel\n     and \n      M.\n      Franklin\n  . \n  Efficiency tradeoffs for malicious two-party compu-tation\n  . In M. Yung Y. Dodis A. Kiayias and T. Malkin editors PKC \n  2006 volume\n  3958\n   of\n  LNCS pages \n  458\n  --\n  473\n  . \n  Springer Heidelberg Apr\n  . 2006.  P. Mohassel and M. Franklin. Efficiency tradeoffs for malicious two-party compu-tation. In M. Yung Y. Dodis A. Kiayias and T. Malkin editors PKC 2006 volume3958 ofLNCS pages 458--473. Springer Heidelberg Apr. 2006.","DOI":"10.1007\/11745853_30"},{"key":"e_1_3_2_1_28_1","first-page":"95","volume-title":"USENIX Security 2010","author":"Nagaraja S.","year":"2010","unstructured":"S. Nagaraja , P. Mittal , C.-Y. Hong , M. Caesar , and N. Borisov . BotGrep: Finding P2P bots with structured graph analysis . In USENIX Security 2010 , pages 95 -- 110 . USENIX Association , Aug. 2010 . S. Nagaraja, P. Mittal, C.-Y. Hong, M. Caesar, and N. Borisov. BotGrep: Finding P2P bots with structured graph analysis. In USENIX Security 2010, pages 95--110. USENIX Association, Aug. 2010."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"M.\n      Naor\n     and \n      E.\n      Yogev\n  . \n  Bloom filters in adversarial environments\n  . In R. Gennaroand M. J. B. Robshaw editors CRYPTO \n  2015 Part II volume \n  9216\n   of \n  LNCS pages \n  565\n  --\n  584\n  . \n  Springer Heidelberg Aug. 2015.  M. Naor and E. Yogev. Bloom filters in adversarial environments. In R. Gennaroand M. J. B. Robshaw editors CRYPTO 2015 Part II volume 9216 of LNCS pages 565--584. Springer Heidelberg Aug. 2015.","DOI":"10.1007\/978-3-662-48000-7_28"},{"key":"e_1_3_2_1_30_1","volume-title":"NDSS 2011","author":"Narayanan A.","year":"2011","unstructured":"A. Narayanan , N. Thiagarajan , M. Lakhani , M. Hamburg , and D. Boneh . Location privacy via private proximity testing . In NDSS 2011 . The Internet Society, Feb. 2011 . A. Narayanan, N. Thiagarajan, M. Lakhani, M. Hamburg, and D. Boneh. Location privacy via private proximity testing. In NDSS 2011. The Internet Society, Feb.2011."},{"key":"e_1_3_2_1_31_1","series-title":"LNCS","volume-title":"EUROCRYPT","author":"Nielsen J. B.","year":"2018","unstructured":"J. B. Nielsen and V. Rijmen , editors . EUROCRYPT 2018 , Part III, volume 10822 of LNCS . Springer , Heidelberg, Apr. \/ May 2018. J. B. Nielsen and V. Rijmen, editors.EUROCRYPT 2018, Part III, volume 10822 of LNCS. Springer, Heidelberg, Apr. \/ May 2018."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","first-page":"3170","DOI":"10.1109\/GLOCOM.2013.6831559","volume-title":"2013 IEEE Global Communications Conference (GLOBECOM)","author":"Niu B.","year":"2013","unstructured":"B. Niu , X. Zhu , J. Liu , Z. Li , and H. Li . Weight-aware private matching scheme forproximity-based mobile social networks . In 2013 IEEE Global Communications Conference (GLOBECOM) , pages 3170 -- 3175 . IEEE, 2013 . B. Niu, X. Zhu, J. Liu, Z. Li, and H. Li. Weight-aware private matching scheme forproximity-based mobile social networks. In 2013 IEEE Global Communications Conference (GLOBECOM), pages 3170--3175. IEEE, 2013."},{"key":"e_1_3_2_1_33_1","first-page":"125","volume-title":"Nielsen and Rijmen [31]","author":"Pinkas B.","unstructured":"B. Pinkas , T. Schneider , C. Weinert , and U. Wieder . Efficient circuit-based PSI viacuckoo hashing . In Nielsen and Rijmen [31] , pages 125 -- 157 . B. Pinkas, T. Schneider, C. Weinert, and U. Wieder. Efficient circuit-based PSI viacuckoo hashing. In Nielsen and Rijmen [31], pages 125--157."},{"key":"e_1_3_2_1_34_1","first-page":"797","volume-title":"USENIX Security","author":"Pinkas B.","year":"2014","unstructured":"B. Pinkas , T. Schneider , and M. Zohner . Faster private set intersection based on OT extension . In K. Fu and J. Jung, editors, USENIX Security 2014 , pages 797 -- 812 . USENIX Association , Aug. 2014. B. Pinkas, T. Schneider, and M. Zohner. Faster private set intersection based on OT extension. In K. Fu and J. Jung, editors, USENIX Security 2014, pages 797--812. USENIX Association, Aug. 2014."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"P.\n      Rindal\n     and \n      M.\n      Rosulek\n  . \n  Improved private set intersection against malicious adversaries\n  . In J. Coron and J. B. Nielsen editors EUROCRYPT \n  2017 Part I volume\n  10210\n   of \n  LNCS pages \n  235\n  --\n  259\n  . \n  Springer Heidelberg Apr. \/ May 2017.  P. Rindal and M. Rosulek. Improved private set intersection against malicious adversaries. In J. Coron and J. B. Nielsen editors EUROCRYPT 2017 Part I volume10210 of LNCS pages 235--259. Springer Heidelberg Apr. \/ May 2017.","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"e_1_3_2_1_36_1","first-page":"1229","volume-title":"Thuraisingham et al.","author":"Rindal P.","unstructured":"P. Rindal and M. Rosulek . Malicious-secure private set intersection via dual execution . In Thuraisingham et al. , pages 1229 -- 1242 . P. Rindal and M. Rosulek. Malicious-secure private set intersection via dual execution. In Thuraisingham et al., pages 1229--1242."},{"key":"e_1_3_2_1_37_1","volume-title":"ACM CCS","author":"Thuraisingham B. M.","year":"2017","unstructured":"B. M. Thuraisingham , D. Evans , T. Malkin , and D. Xu , editors . ACM CCS 2017 . ACM Press , Oct . \/ Nov. 2017. B. M. Thuraisingham, D. Evans, T. Malkin, and D. Xu, editors. ACM CCS 2017. ACM Press, Oct. \/ Nov. 2017."},{"key":"e_1_3_2_1_38_1","first-page":"1","volume-title":"ACM CCS 2015","author":"Yung M.","year":"2015","unstructured":"M. Yung . From mental poker to core business: Why and how to deploy secure computation protocols? In I. Ray, N. Li, and C. Kruegel, editors , ACM CCS 2015 , pages 1 -- 2 . ACM Press , Oct. 2015 . M. Yung. From mental poker to core business: Why and how to deploy secure computation protocols? In I. Ray, N. Li, and C. Kruegel, editors, ACM CCS 2015, pages 1--2. ACM Press, Oct. 2015."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.09.056"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338466.3358927","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338466.3358927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:21Z","timestamp":1750207401000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338466.3358927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":39,"alternative-id":["10.1145\/3338466.3358927","10.1145\/3338466"],"URL":"https:\/\/doi.org\/10.1145\/3338466.3358927","relation":{},"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"2019-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}