{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T14:13:44Z","timestamp":1754144024242,"version":"3.41.2"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,23]]},"DOI":"10.1109\/cniot65435.2025.11070621","type":"proceedings-article","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T17:41:09Z","timestamp":1752514869000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["A Feasible Method for Computing the Greatest Common Divisor and Least Common Multiple Under Ciphertext Based on Fully Homomorphic Encryption"],"prefix":"10.1109","author":[{"given":"Ruoyun","family":"Zhao","sequence":"first","affiliation":[{"name":"Shanghai Yinan Technology Co., Ltd.,Beijing Electronic Science and Technology Institute,Department of Cyberspace Security,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Li","sequence":"additional","affiliation":[{"name":"Shanghai Yinan Technology Co., Ltd.,Beijing Electronic Science and Technology Institute,Department of Cyberspace Security,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Guan","sequence":"additional","affiliation":[{"name":"Beijing Electronic Science and Technology Institute,Department of Cyberspace Security,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bofei","family":"Li","sequence":"additional","affiliation":[{"name":"Shanghai Yinan Technology Co., Ltd.,Beijing Electronic Science and Technology Institute,Department of Cyberspace Security,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuoning","family":"Liang","sequence":"additional","affiliation":[{"name":"Beijing Electronic Science and Technology Institute,Department of Cyberspace Security,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yimeng","family":"Dou","sequence":"additional","affiliation":[{"name":"Beijing Electronic Science and Technology Institute,Department of Cyberspace Security,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lan","family":"Ma","sequence":"additional","affiliation":[{"name":"Beijing Electronic Science and Technology Institute,Department of Cyberspace Security,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Cui","sequence":"additional","affiliation":[{"name":"Beijing Electronic Science and Technology Institute,Department of Cyberspace Security,Beijing,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"12","key":"ref1","first-page":"3069","article-title":"Research progress on fully homomorphic encryption","volume":"61","author":"Bai","year":"2024","journal-title":"Journal of Computer Research and Development"},{"issue":"9","key":"ref2","volume-title":"A fully homomorphic encryption scheme","volume":"20","author":"Gentry","year":"2009"},{"issue":"9","key":"ref3","first-page":"1328","article-title":"Research status and challenges of fully homomorphic encryption technology based on error learning","volume":"24","author":"Wen","year":"2024","journal-title":"Information Network Security"},{"key":"ref4","article-title":"An efficient homomorphic maximum computation method and system based on fully homomorphic encryption","volume-title":"Chinese Patent CN118074884A","author":"Zhang","year":"2024"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"issue":"5","key":"ref6","first-page":"1132","article-title":"Privacy-preserving replacement and its application in secure scientific computation","volume":"41","author":"Yang","year":"2018","journal-title":"Chinese Journal of Computers"},{"issue":"6","key":"ref7","first-page":"1393","article-title":"A quantum-secure multi-party computation protocol for solving the least common multiple problem","volume":"47","author":"Li","year":"2024","journal-title":"Chinese Journal of Computers"},{"key":"ref8","article-title":"Somewhat practical fully homomorphic encryption","author":"Fan","year":"2012","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"}],"event":{"name":"2025 6th International Conference on Computing, Networks and Internet of Things (CNIOT)","start":{"date-parts":[[2025,5,23]]},"location":"Shanghai, China","end":{"date-parts":[[2025,5,25]]}},"container-title":["2025 6th International Conference on Computing, Networks and Internet of Things (CNIOT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11069441\/11069432\/11070621.pdf?arnumber=11070621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T05:58:54Z","timestamp":1752559134000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11070621\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,23]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/cniot65435.2025.11070621","relation":{},"subject":[],"published":{"date-parts":[[2025,5,23]]}}}