{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T08:43:20Z","timestamp":1751100200207,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#1561536"],"award-info":[{"award-number":["#1561536"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2021,4,1]]},"DOI":"10.1109\/tpds.2020.3030748","type":"journal-article","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T19:22:58Z","timestamp":1602616978000},"page":"760-771","source":"Crossref","is-referenced-by-count":7,"title":["Homomorphic Sorting With Better Scalability"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8264-2901","authenticated-orcid":false,"given":"Gizem S.","family":"Cetin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4869-5556","authenticated-orcid":false,"given":"Erkay","family":"Savas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5404-5368","authenticated-orcid":false,"given":"Berk","family":"Sunar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","first-page":"24","article-title":"Fully homomorphic encryption over the integers","author":"van dijk","year":"2010","journal-title":"Proc Annu Int Conf Theory Appl Cryptogr Techn"},{"key":"ref32","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":"ref31","article-title":"Fully homomorphic SIMD operations","volume":"2011","author":"smart","year":"2011","journal-title":"IACR Cryptology ePrint"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2017.85"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-6393-1_3"},{"key":"ref11","first-page":"262","article-title":"Accelarating sorting of fully homomorphic encrypted data","author":"chatterjee","year":"2013","journal-title":"Proc Int Conf Cryptol India"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"ref13","first-page":"169","article-title":"cuHE: A homomorphic encryption accelerator library","author":"dai","year":"2016","journal-title":"Proc Int Conf Cryptogr Inf Secur Balkans"},{"article-title":"Flattening NTRU for evaluation key free homomorphic encryption","year":"2016","author":"dor\u00f6z","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCRI.2015.28"},{"key":"ref16","article-title":"Somewhat practical fully homomorphic encryption","volume":"2012","author":"fan","year":"2012","journal-title":"IACR Cryptology ePrint"},{"article-title":"A fully homomorphic encryption scheme","year":"2009","author":"gentry","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.94"},{"article-title":"Simple encrypted arithmetic library - SEAL (v2.0)","year":"2016","author":"laine","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"journal-title":"The art of computer programming","year":"1998","author":"knuth","key":"ref27"},{"key":"ref3","article-title":"Fully homomorphic encryption without bootstrapping","author":"brakerski","year":"2011","journal-title":"Electronic Colloq on Computational Complexity"},{"key":"ref6","first-page":"505","article-title":"Fully homomorphic encryption from ring-LWE and security for key dependent messages","author":"brakerski","year":"2011","journal-title":"Proc Annu Cryptol Conf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214086"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"ref8","first-page":"61","article-title":"Low depth circuits for efficient homomorphic sorting","author":"\u00e7etin","year":"2015","journal-title":"Proc Int Conf Cryptol Inf Secur Latin Amer"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/120868669"},{"key":"ref2","article-title":"Fully homomorphic encryption without modulus switching from classical gapSVP","volume":"2012","author":"brakerski","year":"2012","journal-title":"IACR Cryptology ePrint"},{"key":"ref9","first-page":"311","article-title":"Homomorphic rank sort using surrogate polynomials","author":"\u00e7etin","year":"2017","journal-title":"Proc Int Conf Cryptol Inf Secur Latin Amer"},{"article-title":"Efficient parallel binary operations on homomorphic encrypted real numbers","year":"2018","author":"basilakis","key":"ref1"},{"key":"ref20","first-page":"129","article-title":"Implementing Gentry’s fully-homomorphic encryption scheme","author":"gentry","year":"2011","journal-title":"Proc Annu Int Conf Theory Appl Cryptogr Techn"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_28"},{"article-title":"Fully homomorphic encryption with polylog overhead","year":"2011","author":"gentry","key":"ref21"},{"key":"ref24","article-title":"Homomorphic evaluation of the AES circuit","volume":"2012","author":"gentry","year":"2012","journal-title":"IACR Cryptology ePrint"},{"key":"ref23","first-page":"850","article-title":"Homomorphic evaluation of the AES circuit","author":"gentry","year":"2012","journal-title":"Proc Annu Cryptol Conf"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-44371-2_31","article-title":"Algorithms in HElib","author":"halevi","year":"2014"},{"key":"ref25","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"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/71\/9257114\/9222337-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/9257114\/09222337.pdf?arnumber=9222337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:29Z","timestamp":1652194229000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9222337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,1]]},"references-count":33,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2020.3030748","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"type":"print","value":"1045-9219"},{"type":"electronic","value":"1558-2183"},{"type":"electronic","value":"2161-9883"}],"subject":[],"published":{"date-parts":[[2021,4,1]]}}}