{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:45:18Z","timestamp":1762623918806,"version":"3.37.3"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370203"],"award-info":[{"award-number":["61370203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Lu&#x0027;an Commission Directed City-Level Key Research","award":["2010LWA004"],"award-info":[{"award-number":["2010LWA004"]}]},{"name":"Lu&#x0027;an Commission Directed City-Level Research","award":["2012LW022"],"award-info":[{"award-number":["2012LW022"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2020,1,1]]},"DOI":"10.1109\/tdsc.2017.2751476","type":"journal-article","created":{"date-parts":[[2017,9,12]],"date-time":"2017-09-12T18:20:11Z","timestamp":1505240411000},"page":"179-193","source":"Crossref","is-referenced-by-count":40,"title":["Secure outsourcing SIFT: Efficient and Privacy-Preserving Image Feature Extraction in the Encrypted Domain"],"prefix":"10.1109","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8320-0168","authenticated-orcid":false,"given":"Linzhi","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunxiang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8196-2436","authenticated-orcid":false,"given":"Bo","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaqun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_25"},{"key":"ref38","first-page":"169","article-title":"(Leveled) fully homomorphic encryption without bootstrapping","volume":"18","author":"brakerski","year":"2011","journal-title":"ACM Trans Comput Theory"},{"key":"ref33","first-page":"1219","article-title":"On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption","author":"adriana","year":"2012","journal-title":"Proc Annu ACM Symp Theory Comput"},{"key":"ref32","first-page":"27","article-title":"Making NTRU as secure as worst-case problems over ideal lattices","author":"damien","year":"2011","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn Adv Cryptology"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"ref37","article-title":"Which ring based somewhat homomorphic encryption scheme is best?","author":"ana","year":"2016","journal-title":"Topics in Cryptology - CT-RSA"},{"key":"ref36","first-page":"318","article-title":"A comparison of the homomorphic encryption schemes FV, and YASHE","author":"tancr\u00e8de","year":"2014","journal-title":"Progress in Cryptology AFRICACRYPT"},{"key":"ref35","first-page":"144","article-title":"Somewhat practical fully homomorphic encryption","author":"fan","year":"2012","journal-title":"International Association for Cryptologic Research Cryptology ePrint Archive"},{"key":"ref34","first-page":"221","article-title":"A scalable implementation of fully homomorphic encryption built on NTRU","author":"kurt","year":"2014","journal-title":"Financial Cryptography and Data Security"},{"key":"ref10","first-page":"725418","article-title":"Enabling search over encrypted multimedia databases","volume":"7254","author":"wenjun","year":"2009","journal-title":"Proc SPIE-Int Soc Opt Eng"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9720-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24177-7_10"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.104"},{"key":"ref13","first-page":"788005","article-title":"Homomorphic encryption-based secure SIFT for privacy-preserving feature extraction","author":"shien","year":"2011","journal-title":"Proc SPIE-Int Soc Opt Eng"},{"key":"ref14","first-page":"4593","article-title":"Image feature extraction in encrypted domain with privacy-preserving SIFT","volume":"21","author":"hsu","year":"2012","journal-title":"IEEE Trans Image Process Publication IEEE Signal Process Soc"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2600918.2600927"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2647868.2654941"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01001-9_13"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2568460"},{"key":"ref28","first-page":"1","article-title":"Efficient and privacy-preserving outsourced calculation of rational numbers","volume":"pp","author":"liu","year":"2016","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"ref4","first-page":"169","article-title":"Fully homomorphic encryption using ideal lattices","volume":"2009","author":"gentry","year":"2011","journal-title":"Proc 13th Annu ACM Symp Theory Comput"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2001.990541"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1666420.1666444"},{"key":"ref6","first-page":"44","article-title":"Practical techniques for searches on encrypted data","author":"xiaodong","year":"2000","journal-title":"Proc IEEE Symp Security Privacy"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2535925"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2692728"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2448099"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1314313.1314316"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/MIC.2012.14","article-title":"Security challenges for the public cloud","volume":"16","author":"kui","year":"2012","journal-title":"IEEE Internet Comput"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587388"},{"key":"ref1","first-page":"169","article-title":"On data banks and privacy homomorphisms","volume":"76","author":"rivest","year":"1978","journal-title":"Found Secure Comput"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02726-5_7"},{"year":"2004","key":"ref45"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524460"},{"key":"ref21","first-page":"223","article-title":"Public-key cryptosystems based on composite degree residuosity classes","author":"paillier","year":"1999","journal-title":"Advances in Cryptology"},{"key":"ref42","first-page":"153","article-title":"A Subfield lattice attack on overstretched NTRU assumptions","author":"martin","year":"2016","journal-title":"Advances in Cryptology-CRYPTO"},{"key":"ref24","first-page":"267","article-title":"NTRU: A ring-based public key cryptosystem","author":"jeffrey","year":"1998","journal-title":"Proc Algorithmic Number Theory Symp III"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1117\/12.853197"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2897845.2897861"},{"year":"2007","key":"ref44"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.1999.790410"},{"key":"ref43","first-page":"1","article-title":"Statistical learning based fully homomorphic encryption on encrypted data","author":"jiang","year":"2016","journal-title":"Soft Computing"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45239-0_4"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/8960487\/08031988.pdf?arnumber=8031988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T16:44:16Z","timestamp":1651077856000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8031988\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":45,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2017.2751476","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"type":"print","value":"1545-5971"},{"type":"electronic","value":"1941-0018"},{"type":"electronic","value":"2160-9209"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}