{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T19:56:20Z","timestamp":1783972580230,"version":"3.55.0"},"reference-count":321,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872091"],"award-info":[{"award-number":["61872091"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Key Laboratory of Cryptography and Information Security","award":["GCIS201721"],"award-info":[{"award-number":["GCIS201721"]}]},{"name":"Opening Project of Guangdong Provincial Key Laboratory of Data Security and Privacy Protection","award":["2019B030301004-13"],"award-info":[{"award-number":["2019B030301004-13"]}]},{"DOI":"10.13039\/501100009696","name":"Minjiang University","doi-asserted-by":"publisher","award":["MJUKF-IPIC201906"],"award-info":[{"award-number":["MJUKF-IPIC201906"]}],"id":[{"id":"10.13039\/501100009696","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2949782","type":"journal-article","created":{"date-parts":[[2019,10,28]],"date-time":"2019-10-28T23:29:28Z","timestamp":1572305368000},"page":"159426-159465","source":"Crossref","is-referenced-by-count":56,"title":["A Comprehensive Survey on Secure Outsourced Computation and Its Applications"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7891-2670","authenticated-orcid":false,"given":"Yang","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xindi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4238-3295","authenticated-orcid":false,"given":"Ximeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0768-7859","authenticated-orcid":false,"given":"Hongju","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Weng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangyang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8012-5852","authenticated-orcid":false,"given":"Victor","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref275","doi-asserted-by":"publisher","DOI":"10.1109\/Cybermatics_2018.2018.00089"},{"key":"ref274","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-642-03168-7_14","article-title":"Privacy-preserving face recognition","author":"erkin","year":"2009","journal-title":"Proc Int Symp Privacy Enhancing Technol Symp"},{"key":"ref277","first-page":"1","article-title":"Secure face matching using fully homomorphic encryption","author":"boddeti","year":"2018","journal-title":"IEEE Int Conf Biometrics Theory Appl Syst (BTAS)"},{"key":"ref276","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.39"},{"key":"ref271","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIFS.2014.2375571","article-title":"Secure outsourced biometric authentication with performance evaluation on smartphones","volume":"10","author":"\u0161ed?nka","year":"2015","journal-title":"IEEE Trans Inf Forensics Security"},{"key":"ref270","doi-asserted-by":"publisher","DOI":"10.1145\/2590296.2590343"},{"key":"ref273","doi-asserted-by":"publisher","DOI":"10.3390\/computers8010003"},{"key":"ref170","first-page":"237","article-title":"Privacy-preserving set union","author":"frikken","year":"2007","journal-title":"Proc Int Conf Appl Cryptogr Netw Secur"},{"key":"ref272","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2819128"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1109\/ICMCS.2018.8525881"},{"key":"ref171","first-page":"261","article-title":"An efficient toolkit for computing private set operations","author":"davidson","year":"2017","journal-title":"Proc Australasian Conf Inf Security Privacy"},{"key":"ref174","doi-asserted-by":"publisher","DOI":"10.1145\/1755688.1755695"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1109\/PST.2008.12"},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1515\/tmmp-2016-0031"},{"key":"ref175","article-title":"Efficient and secure delegation of linear algebra","author":"mohassel","year":"2011"},{"key":"ref178","article-title":"Fast secure matrix multiplications over ring-based homomorphic encryption","author":"mishra","year":"2018"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"ref168","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2917057"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/5841967"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref33","first-page":"1","article-title":"Efficient privacy-preserving biometric identification","volume":"68","author":"evans","year":"2011","journal-title":"Proc 17th Conf Netw Distrib Syst Secur Symp (NDSS)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978347"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"ref267","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/978-3-662-48051-9_15","article-title":"Homomorphic computation of edit distance","author":"cheon","year":"2015","journal-title":"Proc Int Conf Financial Cryptograph Data Secur"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382279"},{"key":"ref268","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-15-S5-S3"},{"key":"ref36","first-page":"229","article-title":"Efficient privacy-preserving face recognition","author":"sadeghi","year":"2009","journal-title":"Proc Int Conf Inf Security Cryptol"},{"key":"ref269","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08344-5_22"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315307"},{"key":"ref34","first-page":"424","article-title":"Secure evaluation of private linear branching programs with medical applications","author":"barni","year":"2009","journal-title":"Proc Euro Symp Res Computer Security"},{"key":"ref288","first-page":"79","article-title":"SecGDB: Graph encryption for exact shortest distance queries with efficient updates","author":"wang","year":"2017","journal-title":"Proc Int Conf DATE"},{"key":"ref287","first-page":"564","article-title":"Efficient secure k-Nearest neighbours over encrypted data","author":"kesarwani","year":"2018","journal-title":"Proc EDBT"},{"key":"ref286","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816688"},{"key":"ref285","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2252011"},{"key":"ref284","doi-asserted-by":"publisher","DOI":"10.1109\/83.841531"},{"key":"ref181","article-title":"Weave ElGamal encryption for secure outsourcing algebraic computations over Zp","author":"chen","year":"2015"},{"key":"ref283","article-title":"Somewhat practical fully homomorphic encryption","author":"fan","year":"2012"},{"key":"ref180","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_16"},{"key":"ref282","doi-asserted-by":"publisher","DOI":"10.1162\/jocn.1991.3.1.71"},{"key":"ref281","first-page":"45","article-title":"Improved security for a ring-based fully homomorphic encryption scheme","author":"bos","year":"2013","journal-title":"IMA Int Conf Crypt & Coding"},{"key":"ref280","first-page":"190","article-title":"Secure and efficient protocols for iris and fingerprint identification","author":"blanton","year":"2011","journal-title":"Comput Secur"},{"key":"ref185","doi-asserted-by":"publisher","DOI":"10.1145\/2897845.2897875"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516751"},{"key":"ref183","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2013.122"},{"key":"ref182","doi-asserted-by":"publisher","DOI":"10.1109\/ICCITechn.2015.7488120"},{"key":"ref189","doi-asserted-by":"publisher","DOI":"10.1109\/PST.2018.8514158"},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2016INP0019"},{"key":"ref187","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.41"},{"key":"ref186","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-54522-0_93","article-title":"On Wiedemann’s method of solving sparse linear systems","author":"kaltofen","year":"1991","journal-title":"Proc Symp Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref179","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/3267973.3267976","article-title":"More practical privacy-preserving machine learning as a service via efficient secure matrix multiplication","author":"lu","year":"2018","journal-title":"Proc ACM 6th Workshop Encrypted Comput Appl Homomorphic Cryptogr"},{"key":"ref29","first-page":"9","article-title":"Fairplay-secure two-party computation system","volume":"4","author":"malkhi","year":"2004","journal-title":"Proc Usenix Secur Symp"},{"key":"ref20","doi-asserted-by":"crossref","DOI":"10.1145\/3124441","article-title":"A survey on fully homomorphic encryption: An engineering perspective","volume":"50","author":"martins","year":"2018","journal-title":"ACM Comput Surv"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53798-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-017-0872-3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2549982"},{"key":"ref23","first-page":"1","volume":"8","author":"chen","year":"2016","journal-title":"Introduction to Secure Outsourcing Computation"},{"key":"ref278","doi-asserted-by":"publisher","DOI":"10.1109\/BTAS.2010.5634527"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3158363"},{"key":"ref279","first-page":"44","article-title":"Privacy-preserving fingerprint authentication resistant to hill-climbing attacks","author":"higo","year":"2015","journal-title":"Proc Int Conf Sel Areas Cryptogr"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.4108\/eai.18-6-2016.2264201"},{"key":"ref293","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref50","first-page":"273","article-title":"Privacy-preserving cooperative scientific computations","author":"du","year":"2001","journal-title":"Proc CSFW"},{"key":"ref292","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref51","first-page":"1","article-title":"Two-party computation model for privacy-preserving queries over distributed databases","author":"chow","year":"2009","journal-title":"Proc NDSS"},{"key":"ref295","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"ref294","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978376"},{"key":"ref297","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"ref296","article-title":"CryptDB: A practical encrypted relational DBMS","author":"popa","year":"2011"},{"key":"ref299","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588572"},{"key":"ref298","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488336"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/2363928"},{"key":"ref153","first-page":"253","article-title":"Fully homomorphic encryption for point numbers","author":"arita","year":"2016","journal-title":"Proc Int Conf Inf Security Cryptol"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2019.2906047"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1186\/s13638-018-1317-9"},{"key":"ref150","doi-asserted-by":"crossref","DOI":"10.1145\/3230833.3233272","article-title":"Secure fixed-point division for homomorphically encrypted operands","author":"ugwuoke","year":"2018","journal-title":"Proc 13th Int Conf Availability Rel Secur"},{"key":"ref291","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/2414687"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2585121"},{"key":"ref290","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2774451"},{"key":"ref151","article-title":"Privacy-preserving outsourced calculation toolkit in the cloud","author":"liu","year":"0","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2012.03.003"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.90"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2017.2773604"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/8142102"},{"key":"ref289","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-017-4299-8"},{"key":"ref59","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-642-54242-8_4","article-title":"Two-round secure MPC from indistinguishability obfuscation","author":"garg","year":"2014","journal-title":"Proc Theory Cryptogr Conf"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591825"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/14095772X"},{"key":"ref56","first-page":"345","article-title":"Two round MPC from LWE via multi-key FHE","volume":"2015","author":"mukherjee","year":"2015","journal-title":"IACR Cryptology ePrint"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214086"},{"key":"ref54","first-page":"75","article-title":"Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based","author":"gentry","year":"2013","journal-title":"Proc Annu Cryptol Conf"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653703"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4329"},{"key":"ref166","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134061"},{"key":"ref165","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/978-3-642-01957-9_8","article-title":"Efficient robust private set intersection","author":"dachman-soled","year":"2009","journal-title":"Proc Int Conf Appl Cryptogr Netw Secur"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.12.022"},{"key":"ref162","article-title":"Faster secure arithmetic computation using switchable homomorphic encryption","author":"lim","year":"2014"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2511008"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2780885"},{"key":"ref4","article-title":"Lightweight sharable and traceable secure mobile health system","author":"yang","year":"0","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.jnca.2016.11.017","article-title":"Lightweight distributed secure data management system for health Internet of Things","volume":"89","author":"yang","year":"2017","journal-title":"J Netw Comput Appl"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s13174-010-0007-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2018.2872066"},{"key":"ref8","article-title":"Secure multi-party computation","volume":"78","author":"goldreich","year":"1998","journal-title":"Manuscript Preliminary Version"},{"key":"ref159","article-title":"Privacy-preserving reinforcement learning design for patient-centric dynamic treatment regimes","author":"liu","year":"0","journal-title":"IEEE Trans Emerg Topics Comput"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JBHI.2015.2407157"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2014.6863131"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2573770"},{"key":"ref9","first-page":"5","article-title":"Techniques of data perturbation for privacy preserving data mining","volume":"1","author":"patel","year":"2014","journal-title":"International Journal of Computer & Electronics Research"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2543220"},{"key":"ref46","first-page":"851","article-title":"Privacy-preserving similarity sorting in multi-party model","volume":"19","author":"yao","year":"2017","journal-title":"IJ Network Security"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TST.2016.7536716","article-title":"Secure two-party distance computation protocol based on privacy homomorphism and scalar product in wireless sensor networks","volume":"21","author":"gong","year":"2016","journal-title":"Tsinghua Sci Technol"},{"key":"ref48","first-page":"1","article-title":"Efficient private matching and set intersection","author":"freedman","year":"2004","journal-title":"Proc Int Conf Theory Appl Cryptograph Techn"},{"key":"ref47","article-title":"A method and system for privacy preserving matrix factorization","author":"ioannidis","year":"2016"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_15"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44634-6_16"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_23"},{"key":"ref320","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2007.114"},{"key":"ref321","first-page":"1","article-title":"Secure computation on floating point numbers","author":"aliasgari","year":"2013","journal-title":"Proc NDSS"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-013-0252-0"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74835-9_22"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.05.002"},{"key":"ref318","doi-asserted-by":"publisher","DOI":"10.3390\/technologies7010021"},{"key":"ref76","first-page":"1","article-title":"Intel SGX explained","author":"costan","year":"2016"},{"key":"ref317","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0179720"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1186\/s12920-017-0281-2"},{"key":"ref316","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2622299"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813672"},{"key":"ref315","year":"1996","journal-title":"The Unicode Standard Version 2 0"},{"key":"ref75","first-page":"1","article-title":"Innovative technology for CPU based attestation and sealing","volume":"13","author":"anati","year":"2013","journal-title":"Proc ACM 2nd Int Workshop Hardw Archit Support Secur Privacy"},{"key":"ref314","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.02.017"},{"key":"ref313","article-title":"Flexible wildcard searchable encryption system","author":"yang","year":"0","journal-title":"IEEE Trans Services Comput"},{"key":"ref312","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2015.2481389"},{"key":"ref78","first-page":"619","article-title":"Oblivious multi-party machine learning on trusted processors","author":"ohrimenko","year":"2016","journal-title":"Proc 25th USENIX Secur Symp (USENIX Secur )"},{"key":"ref311","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55415-5_5"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.10"},{"key":"ref319","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.03.018"},{"key":"ref310","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46497-7_24"},{"key":"ref62","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-3-540-30576-7_17","article-title":"Keyword search and oblivious pseudorandom functions","author":"freedman","year":"2005","journal-title":"Proc Theory Cryptogr Conf"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"ref305","doi-asserted-by":"publisher","DOI":"10.1109\/MINES.2011.90"},{"key":"ref63","first-page":"111","article-title":"Verifiable delegation of computation over large datasets","author":"benabbas","year":"2011","journal-title":"Proc Annu Cryptol Conf"},{"key":"ref304","doi-asserted-by":"publisher","DOI":"10.1109\/IIHMSP.2011.28"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382250"},{"key":"ref307","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-017-4560-x"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848155"},{"key":"ref306","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2509912"},{"key":"ref66","first-page":"195","article-title":"Scaling private set intersection to billion-element sets","author":"kamara","year":"2014","journal-title":"Proc Int Conf Financial Cryptograph Data Secur"},{"key":"ref301","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/7383514"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ATNAC.2015.7366787"},{"key":"ref300","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-59140-557-3.ch189"},{"key":"ref68","first-page":"605","article-title":"Efficient verifiable computation of linear and quadratic functions over encrypted data","author":"tran","year":"2016","journal-title":"Proc 11th ACM Asia Conf Comput Commun Secur"},{"key":"ref303","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737593"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2016.7784424"},{"key":"ref302","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2675864"},{"key":"ref309","first-page":"24","article-title":"Fully homomorphic encryption over the integers","author":"van dijk","year":"2010","journal-title":"Proc Annu Int Conf Theory Appl Cryptograph Techn"},{"key":"ref308","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2013.9"},{"key":"ref197","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2866697"},{"key":"ref198","doi-asserted-by":"publisher","DOI":"10.2196\/medinform.8286"},{"key":"ref199","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150477"},{"key":"ref193","doi-asserted-by":"publisher","DOI":"10.1109\/TrustCom.2016.0041"},{"key":"ref194","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2015INP0020"},{"key":"ref195","doi-asserted-by":"publisher","DOI":"10.1186\/s12920-018-0398-y"},{"key":"ref196","doi-asserted-by":"publisher","DOI":"10.1186\/s12920-018-0401-7"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1980.10014"},{"key":"ref94","author":"denning","year":"1982","journal-title":"Cryptography and Data Security"},{"key":"ref190","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05057-3_7"},{"key":"ref93","first-page":"1289","article-title":"ROTE: Rollback protection for trusted execution","author":"matetic","year":"2017","journal-title":"Proc 26th USENIX Security Symp (USENIX Security)"},{"key":"ref191","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.30"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.45"},{"key":"ref192","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93387-0_13"},{"key":"ref91","first-page":"557","article-title":"Inferring fine-grained control flow inside SGX enclaves with branch shadowing","author":"lee","year":"2017","journal-title":"Proc 26th USENIX Security Symp (USENIX Security)"},{"key":"ref90","first-page":"1","article-title":"Software grand exposure: SGX cache attacks are practical","author":"brasser","year":"2017","journal-title":"Proc 10th USENIX Workshop Offensive Technol (WOOT)"},{"key":"ref98","article-title":"Data perturbation by rotation for privacy preserving clustering","author":"oliveira","year":"2004"},{"key":"ref99","article-title":"A random rotation perturbation approach to privacy preserving data classification","author":"chen","year":"2005"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335438"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/ICICSE.2009.31"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref81","article-title":"SAFETY: Secure GWAS in federated environment through a hybrid solution with Intel SGX and homomorphic encryption","author":"sadat","year":"2017","journal-title":"arXiv 1703 02577"},{"key":"ref84","article-title":"Privacy preserving deep neural network prediction using trusted hardware","author":"reuter","year":"2018"},{"key":"ref83","first-page":"3","article-title":"A secure remote monitoring framework supporting efficient fine-grained access control and data processing in IoT","author":"chen","year":"2018","journal-title":"Proc Int Conf Secur Privacy Commun Syst"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1145\/3065913.3065915"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2018.2833463"},{"key":"ref86","article-title":"An algorithmic framework for differentially private data analysis on trusted processors","author":"allen","year":"2018","journal-title":"arXiv 1807 00736"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1145\/3144730.3144739"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134038"},{"key":"ref200","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-017-0381-1"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1145\/3979.4017"},{"key":"ref100","first-page":"260","article-title":"An analytic approach to statistical databases","author":"lefons","year":"1983","journal-title":"Proc VLDB"},{"key":"ref209","doi-asserted-by":"publisher","DOI":"10.3390\/s19010142"},{"key":"ref203","article-title":"Privacy-preserving outsourced support vector machine design for secure drug discovery","author":"liu","year":"0","journal-title":"IEEE Trans Cloud Comput"},{"key":"ref204","first-page":"1","article-title":"ML confidential: Machine learning on encrypted data","author":"graepel","year":"2012","journal-title":"Proc Int Conf Inf Security Cryptol"},{"key":"ref201","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05063-4_32"},{"key":"ref202","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2013.51"},{"key":"ref207","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2500576"},{"key":"ref208","doi-asserted-by":"publisher","DOI":"10.1145\/3287624.3287699"},{"key":"ref205","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23241"},{"key":"ref206","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.02.058"},{"key":"ref211","first-page":"201","article-title":"CryptoNets: Applying neural networks to encrypted data with high throughput and accuracy","author":"gilad-bachrach","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref210","article-title":"Crypto-nets: Neural networks over encrypted data","author":"xie","year":"2014","journal-title":"arXiv 1412 6181"},{"key":"ref212","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.12.015"},{"key":"ref213","article-title":"CryptoDL: Deep neural networks over encrypted data","author":"hesamifard","year":"2017","journal-title":"arXiv 1711 05189"},{"key":"ref214","doi-asserted-by":"publisher","DOI":"10.3390\/electronics8040411"},{"key":"ref215","article-title":"Privacy-preserving and outsourced multi-user k-means clustering","author":"samanthula","year":"2014","journal-title":"arXiv 1412 4378"},{"key":"ref216","doi-asserted-by":"publisher","DOI":"10.1145\/2590296.2590332"},{"key":"ref217","doi-asserted-by":"publisher","DOI":"10.1109\/MSN.2015.42"},{"key":"ref218","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2017.8024510"},{"key":"ref219","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-319-64283-3_20","article-title":"K-means clustering using homomorphic encryption and an updatable distance matrix: Secure third party data clustering with limited data owner interaction","author":"almutairi","year":"2017","journal-title":"Proc 17th Int Conf Big Data Analytics Knowl Discovery"},{"key":"ref220","doi-asserted-by":"crossref","first-page":"1813","DOI":"10.1007\/s00607-019-00711-w","article-title":"Homomorphically encrypted k-means on cloud-hosted servers with low client-side load","volume":"101","author":"sakellariou","year":"2019","journal-title":"Computing"},{"key":"ref222","first-page":"25","article-title":"Towards a practical clustering analysis over encrypted data","volume":"6","author":"cheon","year":"2019","journal-title":"Networks"},{"key":"ref221","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.02.013"},{"key":"ref229","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate O(1\/k2)","volume":"269","author":"nesterov","year":"1983","journal-title":"Sov Math Doklady"},{"key":"ref228","first-page":"409","article-title":"Homomorphic encryption for arithmetic of approximate numbers","author":"cheon","year":"2017","journal-title":"Proc Int Conf Theory Appl Cryptol Inf Secur"},{"key":"ref227","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"ref226","first-page":"431","article-title":"Privacy-preserving mining of association rule on outsourced cloud data from multiple parties","author":"liu","year":"2018","journal-title":"Proc Australasian Conf Inf Security Privacy"},{"key":"ref225","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2561241"},{"key":"ref224","doi-asserted-by":"publisher","DOI":"10.1145\/2714576.2714603"},{"key":"ref223","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2015.235"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1007\/11556992_27"},{"key":"ref126","first-page":"308","article-title":"A new public-key cryptosystem as secure as factoring","author":"okamoto","year":"1998","journal-title":"Proc Int Conf Theory Appl Cryptograph Techn"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref124","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","article-title":"A generalisation, a simpli.cation and some applications of Paillier’s probabilistic public-key system","author":"damg\u00e5rd","year":"2001","journal-title":"Proc Int Workshop Public Key Cryptogr"},{"key":"ref129","article-title":"A new approach for algebraically homomorphic encryption","author":"armknecht","year":"2008"},{"key":"ref128","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","article-title":"Evaluating 2-DNF formulas on ciphertexts","author":"boneh","year":"2005","journal-title":"Proc Theory Cryptogr Conf"},{"key":"ref130","article-title":"A fully homomorphic encryption scheme","volume":"20","author":"gentry","year":"2009"},{"key":"ref133","first-page":"420","article-title":"Fully homomorphic encryption with relatively small key and ciphertext sizes","author":"smart","year":"2010","journal-title":"Proc Int Workshop Public Key Cryptogr"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"ref131","first-page":"129","article-title":"Implementing gentry’s fully-homomorphic encryption scheme","author":"gentry","year":"2011","journal-title":"Proc Annu Int Conf Theory Appl Cryptograph Techn"},{"key":"ref132","first-page":"377","article-title":"Faster fully homomorphic encryption","author":"stehl\u00e9","year":"2010","journal-title":"Proc Int Conf Theory Appl Cryptol Inf Secur"},{"key":"ref232","first-page":"37","article-title":"A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications","author":"bresson","year":"2003","journal-title":"Proc Int Conf Theory Appl Cryptol Inf Secur"},{"key":"ref233","article-title":"Homomorphic encryption-based secure SIFT for privacy-preserving feature extraction","volume":"7880","author":"hsu","year":"2011","journal-title":"Proc SPIE"},{"key":"ref230","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"ref231","first-page":"98","article-title":"A Bayesian approach to filtering junk e-mail","volume":"62","author":"sahami","year":"1998","journal-title":"Proc Workshop on Learning for Text Categorization"},{"key":"ref239","doi-asserted-by":"publisher","DOI":"10.1145\/2897845.2897861"},{"key":"ref238","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2016.84"},{"key":"ref235","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2568460"},{"key":"ref234","doi-asserted-by":"crossref","first-page":"4593","DOI":"10.1109\/TIP.2012.2204272","article-title":"Image feature extraction in encrypted domain with privacy-preserving SIFT","volume":"21","author":"hsu","year":"2012","journal-title":"IEEE Trans Image Process"},{"key":"ref237","doi-asserted-by":"publisher","DOI":"10.1109\/ICME.2014.6890170"},{"key":"ref236","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2019.03.020"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"ref138","first-page":"641","article-title":"Bootstrapping for HElib","author":"halevi","year":"2015","journal-title":"Proc Annu Int Conf Theory Appl Cryptograph Techn"},{"key":"ref137","article-title":"HElib—An implementation of homomorphic encryption","author":"halevi","year":"2014"},{"key":"ref139","first-page":"850","article-title":"Homomorphic evaluation of the AES circuit","author":"gentry","year":"2012","journal-title":"Proc Annu Cryptol Conf"},{"key":"ref140","first-page":"617","article-title":"FHEW: Bootstrapping homomorphic encryption in less than a second","author":"ducas","year":"2015","journal-title":"Proc Annu Int Conf Theory Appl Cryptograph Techn"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"ref142","first-page":"377","article-title":"Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE","author":"chillotti","year":"2017","journal-title":"Proc Int Conf Theory Appl Cryptol Inf Secur"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49890-3_13"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2017.01.024"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96878-0_3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00354-008-0081-5"},{"key":"ref145","first-page":"565","article-title":"Threshold cryptosystems from threshold fully homomorphic encryption","author":"boneh","year":"2018","journal-title":"Proc Annu Int Cryptol Conf"},{"key":"ref241","first-page":"189","article-title":"Secure feature extraction in computational vision using fully homomorphic encryption","author":"shortell","year":"2018","journal-title":"Proc Future Technol Conf"},{"key":"ref242","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSP.2014.6900669"},{"key":"ref243","doi-asserted-by":"publisher","DOI":"10.1109\/EMBC.2015.7319009"},{"key":"ref244","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2712148"},{"key":"ref240","first-page":"102","article-title":"Privacy-preserving extraction of HOG features based on integer vector homomorphic encryption","author":"yang","year":"2017","journal-title":"Proc Int Conf Inf Secur Pract Exper"},{"key":"ref248","doi-asserted-by":"publisher","DOI":"10.1007\/s00779-018-1131-8"},{"key":"ref247","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2015.03.009"},{"key":"ref246","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2011.2181342"},{"key":"ref245","first-page":"240","article-title":"Walsh–Hadamard transform in the homomorphic encrypted domain and its application in image watermarking","author":"zheng","year":"2012","journal-title":"Proc Int Workshop Inf Hiding"},{"key":"ref249","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-019-7452-4"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7510991"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.11.007"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.22266\/ijies2018.0228.21"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/927867"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0923-2"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2014.6911090"},{"key":"ref103","volume":"2","author":"knuth","year":"1981","journal-title":"The Art of Computer Programming Seminumerical Algorithms"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1145\/2909827.2930794"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0539-4"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-70992-5_7"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2845456"},{"key":"ref250","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2000.899325"},{"key":"ref251","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2427113"},{"key":"ref254","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.cviu.2007.09.014","article-title":"Speeded-up robust features (SURF)","volume":"110","author":"bay","year":"2008","journal-title":"Comput Vis Image Understand"},{"key":"ref255","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.177"},{"key":"ref252","first-page":"6","article-title":"Image feature extraction techniques and their applications for CBIR and biometrics systems","volume":"1","author":"choras","year":"2007","journal-title":"Int J Biol Biomed Eng"},{"key":"ref253","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.790410"},{"key":"ref257","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2014.6804228"},{"key":"ref256","doi-asserted-by":"publisher","DOI":"10.1145\/2600918.2600927"},{"key":"ref259","article-title":"An efficient homomorphic encryption protocol for multi-user systems","author":"xiao","year":"2012"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2016.2536601"},{"key":"ref258","doi-asserted-by":"publisher","DOI":"10.1016\/j.media.2009.11.004"},{"key":"ref11","article-title":"Multi-user multi-keyword rank search over encrypted data in arbitrary language","author":"yang","year":"0","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2751640"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2018.2820714"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2906153"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3296-8_1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CCWC.2018.8301700"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802212"},{"key":"ref17","first-page":"3826","article-title":"A survey of homomorphic encryption for outsourced big data computation","volume":"10","author":"fun","year":"2016","journal-title":"KSII Trans Internet Inf Syst"},{"key":"ref117","first-page":"446","article-title":"Public key compression and modulus switching for fully homomorphic encryption over the integers","author":"coron","year":"2012","journal-title":"Proc Annu Int Conf Theory Appl Cryptograph Techn"},{"key":"ref18","first-page":"1","article-title":"Homomorphic encryption algorithms and schemes for secure computations in the cloud","author":"alkharji","year":"2016","journal-title":"Proc Int Conf Secure Comput Technol"},{"key":"ref19","article-title":"A survey on homomorphic encryption schemes: Theory and implementation","volume":"51","author":"acar","year":"2018","journal-title":"ACM Comput Surv"},{"key":"ref119","first-page":"120","article-title":"Dense probabilistic encryption","author":"benaloh","year":"1994","journal-title":"Proc Workshop Sel Areas Cryptogr"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057074"},{"key":"ref113","author":"daemen","year":"2013","journal-title":"The Design of Rijndael AES—The Advanced Encryption Standard"},{"key":"ref116","article-title":"Fully homomorphic encryption scheme with symmetric keys","author":"sharma","year":"2013","journal-title":"arXiv 1310 2452"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2009.5199505"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_30"},{"key":"ref121","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1109\/TPDS.2012.86","article-title":"EPPA: An efficient and privacy-preserving aggregation scheme for secure smart grid communications","volume":"23","author":"lu","year":"2012","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2364027"},{"key":"ref123","first-page":"138","article-title":"Additively homomorphic encryption with d-operand multiplications","author":"melchor","year":"2010","journal-title":"Proc Annu Cryptol Conf"},{"key":"ref260","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1976.1674569"},{"key":"ref261","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-15-S5-S5"},{"key":"ref262","doi-asserted-by":"publisher","DOI":"10.1109\/SPW.2015.11"},{"key":"ref263","doi-asserted-by":"publisher","DOI":"10.1186\/1472-6947-15-S5-S1"},{"key":"ref264","first-page":"2546","article-title":"Privacy preserving Fisher’s exact test on genomic data","author":"poon","year":"2018","journal-title":"Proc IEEE Int Conf Big Data (Big Data)"},{"key":"ref265","article-title":"Secure and efficient computation on biomedical data in a distributed environment","author":"sadat","year":"2018"},{"key":"ref266","doi-asserted-by":"publisher","DOI":"10.1186\/s12920-017-0277-y"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08884162.pdf?arnumber=8884162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T02:40:31Z","timestamp":1643164831000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8884162\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":321,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2949782","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}