{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:46Z","timestamp":1750220026427,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T00:00:00Z","timestamp":1671148800000},"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":[[2022,12,16]]},"DOI":"10.1145\/3584714.3584720","type":"proceedings-article","created":{"date-parts":[[2023,9,7]],"date-time":"2023-09-07T22:35:22Z","timestamp":1694126122000},"page":"25-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A symmetric additive homomorphic encryption scheme based on NTRU proxy rekeys"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4859-2053","authenticated-orcid":false,"given":"Wei","family":"Liu","sequence":"first","affiliation":[{"name":"Zhenjiang Human Resources and Social Security Information Center, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8541-3355","authenticated-orcid":false,"given":"Hua Xiao","family":"Hao","sequence":"additional","affiliation":[{"name":"Jiangsu University, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9914-6956","authenticated-orcid":false,"given":"Lan Ai","family":"Wan","sequence":"additional","affiliation":[{"name":"Zhenjiang Human Resources and Social Security Information Center, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7757-5350","authenticated-orcid":false,"given":"Kai","family":"Xu","sequence":"additional","affiliation":[{"name":"Jiangsu University, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1001-8035","authenticated-orcid":false,"given":"Mu","family":"Han","sequence":"additional","affiliation":[{"name":"Jiangsu University, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8106-2855","authenticated-orcid":false,"given":"Long Xiao","family":"Zhu","sequence":"additional","affiliation":[{"name":"Jiangsu University, China"}]}],"member":"320","published-online":{"date-parts":[[2023,9,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2298\/CSIS140205086C"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2019.102362"},{"key":"e_1_3_2_1_3_1","volume-title":"Multi-bit homomorphic encryption based on learning with errors over rings[J]. Cryptology ePrint Archive","author":"Wei Z","year":"2013","unstructured":"Wei Z , Shuguang L , Xiaoyuan Y. Multi-bit homomorphic encryption based on learning with errors over rings[J]. Cryptology ePrint Archive , 2013 . Wei Z, Shuguang L, Xiaoyuan Y. Multi-bit homomorphic encryption based on learning with errors over rings[J]. Cryptology ePrint Archive, 2013."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Gentry C. Fully homomorphic encryption using ideal lattices[C]\/\/Proceedings of the forty-first annual ACM symposium on Theory of computing. 2009: 169 -178.  Gentry C. Fully homomorphic encryption using ideal lattices[C]\/\/Proceedings of the forty-first annual ACM symposium on Theory of computing. 2009: 169 -178.","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_5_1","volume-title":"Fully homomorphic encryption over the integers[C]\/\/Annual international conference on the theory and applications of Springer","author":"Dijk M","year":"2010","unstructured":"Dijk M , Gentry C , Halevi S , Fully homomorphic encryption over the integers[C]\/\/Annual international conference on the theory and applications of Springer , Berlin, Heidelberg , 2010 : 24-43. Dijk M, Gentry C, Halevi S, Fully homomorphic encryption over the integers[C]\/\/Annual international conference on the theory and applications of Springer, Berlin, Heidelberg, 2010: 24-43."},{"key":"e_1_3_2_1_6_1","volume-title":"Fully homomorphic encryption over the integers with shorter public keys[C]\/\/Annual Cryptology Conference","author":"Coron J S","year":"2011","unstructured":"Coron J S , Mandal A , Naccache D , Fully homomorphic encryption over the integers with shorter public keys[C]\/\/Annual Cryptology Conference . Springer , Berlin, Heidelberg , 2011 : 487-504. Coron J S, Mandal A, Naccache D, Fully homomorphic encryption over the integers with shorter public keys[C]\/\/Annual Cryptology Conference. Springer, Berlin, Heidelberg, 2011: 487-504."},{"key":"e_1_3_2_1_7_1","volume-title":"Improvement of fully homomorphic encryption schemes on integers [D]","author":"Lin Rulei","year":"2013","unstructured":"Lin Rulei , Wang Arrow, Du He . Improvement of fully homomorphic encryption schemes on integers [D] . , 2013 . Lin Rulei, Wang Arrow, Du He. Improvement of fully homomorphic encryption schemes on integers [D]. , 2013."},{"issue":"4","key":"e_1_3_2_1_8_1","first-page":"1179","article-title":"A fully homomorphic encryption scheme for n bit over integers[J]","volume":"35","author":"Sun","year":"2018","unstructured":"Sun , Ni-Gang, Zhu , Hao-Ran, Wang , Wei-Xin . A fully homomorphic encryption scheme for n bit over integers[J] . Computer Applications Research , 2018 , 35 ( 4 ): 1179 - 1181 . Sun, Ni-Gang, Zhu, Hao-Ran, Wang, Wei-Xin. A fully homomorphic encryption scheme for n bit over integers[J]. Computer Applications Research, 2018, 35(4): 1179-1181.","journal-title":"Computer Applications Research"},{"key":"e_1_3_2_1_9_1","volume-title":"Secure large-scale genome data storage and query[J]. Computer methods and programs in biomedicine","author":"Chen L","year":"2018","unstructured":"Chen L , Aziz M M , Mohammed N , Secure large-scale genome data storage and query[J]. Computer methods and programs in biomedicine , 2018 , 165: 129-137. Chen L, Aziz M M, Mohammed N, Secure large-scale genome data storage and query[J]. Computer methods and programs in biomedicine, 2018, 165: 129-137."},{"key":"e_1_3_2_1_10_1","volume-title":"Privacy-preserving watermarking transformation technique in a distributed environment[C]\/\/2018 IEEE Conference on Communications and Network Security (CNS)","author":"Allami A A","year":"2018","unstructured":"Allami A A , Mohania M K , Jiang W. Privacy-preserving watermarking transformation technique in a distributed environment[C]\/\/2018 IEEE Conference on Communications and Network Security (CNS) . IEEE , 2018 : 1-9. Allami A A, Mohania M K, Jiang W. Privacy-preserving watermarking transformation technique in a distributed environment[C]\/\/2018 IEEE Conference on Communications and Network Security (CNS). IEEE, 2018: 1-9."},{"key":"e_1_3_2_1_11_1","volume-title":"Fousse L","author":"Melchor C A","year":"2016","unstructured":"Melchor C A , Barrier J , Fousse L , XPIR : Private information retrieval for everyone[J]. Proceedings on Privacy Enhancing Technologies , 2016 : 155-174. Melchor C A, Barrier J, Fousse L, XPIR: Private information retrieval for everyone[J]. Proceedings on Privacy Enhancing Technologies, 2016: 155-174."},{"volume-title":"NTRUReEncrypt: An efficient proxy re-encryption scheme based on NTRU[C]\/\/Proceedings of the 10th ACM symposium on information, computer and communications security. 2015: 179-189","author":"Nunez D","key":"e_1_3_2_1_12_1","unstructured":"Nunez D , Agudo I , Lopez J. NTRUReEncrypt: An efficient proxy re-encryption scheme based on NTRU[C]\/\/Proceedings of the 10th ACM symposium on information, computer and communications security. 2015: 179-189 . Nunez D, Agudo I, Lopez J. NTRUReEncrypt: An efficient proxy re-encryption scheme based on NTRU[C]\/\/Proceedings of the 10th ACM symposium on information, computer and communications security. 2015: 179-189."},{"key":"e_1_3_2_1_13_1","volume-title":"Silverman J H. NTRU: A ring-based public key cryptosystem[C]\/\/International algorithmic number theory symposium. springer","author":"Hoffstein J","year":"1998","unstructured":"Hoffstein J , Pipher J , Silverman J H. NTRU: A ring-based public key cryptosystem[C]\/\/International algorithmic number theory symposium. springer , Berlin, Heidelberg , 1998 : 267-288. Hoffstein J, Pipher J, Silverman J H. NTRU: A ring-based public key cryptosystem[C]\/\/International algorithmic number theory symposium. springer, Berlin, Heidelberg, 1998: 267-288."},{"issue":"2","key":"e_1_3_2_1_14_1","article-title":"Research on NTRU-based encryption and signature algorithms[J]","volume":"4","author":"He","year":"2019","unstructured":"He , Jing-Nan, Zhang , Zhen-Fei . Research on NTRU-based encryption and signature algorithms[J] . Journal of Cyber Security Information Security Journal , 2019 , 4 ( 2 ). He, Jing-Nan, Zhang, Zhen-Fei. Research on NTRU-based encryption and signature algorithms[J]. Journal of Cyber Security Information Security Journal, 2019, 4(2).","journal-title":"Journal of Cyber Security Information Security Journal"},{"key":"e_1_3_2_1_15_1","volume-title":"Making NTRU as secure as worst-case problems over ideal lattices[C]\/\/Annual international conference on the theory and Springer","author":"Stehl\u00e9 D","year":"2011","unstructured":"Stehl\u00e9 D , Steinfeld R. Making NTRU as secure as worst-case problems over ideal lattices[C]\/\/Annual international conference on the theory and Springer , Berlin, Heidelberg , 2011 : 27-47. Stehl\u00e9 D, Steinfeld R. Making NTRU as secure as worst-case problems over ideal lattices[C]\/\/Annual international conference on the theory and Springer, Berlin, Heidelberg, 2011: 27-47."},{"key":"e_1_3_2_1_16_1","first-page":"29","article-title":"Proxy Re-Encryption based on Learning with Errors (Mathematical Foundation of Algorithms and Computer Science)[J]. Lecture Notes","volume":"1691","author":"Xagawa K","year":"2010","unstructured":"Xagawa K , Tanaka K . Proxy Re-Encryption based on Learning with Errors (Mathematical Foundation of Algorithms and Computer Science)[J]. Lecture Notes , Institute of Mathematical Analysis , 2010 , 1691 : 29 - 35 . Xagawa K, Tanaka K. Proxy Re-Encryption based on Learning with Errors (Mathematical Foundation of Algorithms and Computer Science)[J]. Lecture Notes, Institute of Mathematical Analysis, 2010, 1691: 29-35.","journal-title":"Institute of Mathematical Analysis"},{"key":"e_1_3_2_1_17_1","volume-title":"Animal communication: when i'm calling you, will you answer too?[J]. Current biology","author":"Vickers N J","year":"2017","unstructured":"Vickers N J . Animal communication: when i'm calling you, will you answer too?[J]. Current biology , 2017 , 27(14): R713-R715. Vickers N J. Animal communication: when i'm calling you, will you answer too?[J]. Current biology, 2017, 27(14): R713-R715."},{"issue":"2","key":"e_1_3_2_1_18_1","first-page":"187","article-title":"A one-way collusion-resistant proxy re-encryption scheme based on NTRU[J]","volume":"7","author":"Zhang M.W.","year":"2019","unstructured":"Zhang M.W. , Du L . A one-way collusion-resistant proxy re-encryption scheme based on NTRU[J] . Journal of Cryptography , 2019 , 7 ( 2 ): 187 - 196 . Zhang M.W., Du L. A one-way collusion-resistant proxy re-encryption scheme based on NTRU[J]. Journal of Cryptography, 2019, 7(2): 187-196.","journal-title":"Journal of Cryptography"},{"issue":"5","key":"e_1_3_2_1_19_1","first-page":"909","article-title":"NTRU-type proxy re-encryption scheme based on the RLWE difficulty assumption[J]","volume":"8","author":"Wang Chao","year":"2021","unstructured":"Wang Chao , Han Yilang, Duan Xiaowei , An NTRU-type proxy re-encryption scheme based on the RLWE difficulty assumption[J] . Journal of Cryptography , 2021 , 8 ( 5 ): 909 - 920 . Wang Chao, Han Yilang, Duan Xiaowei, An NTRU-type proxy re-encryption scheme based on the RLWE difficulty assumption[J]. Journal of Cryptography, 2021, 8(5): 909-920.","journal-title":"Journal of Cryptography"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2981239"},{"key":"e_1_3_2_1_21_1","volume-title":"On ideal lattices and learning with errors over rings[C]\/\/Annual international conference on the theory and applications of cryptographic techniques","author":"Lyubashevsky V","year":"2010","unstructured":"Lyubashevsky V , Peikert C , Regev O. On ideal lattices and learning with errors over rings[C]\/\/Annual international conference on the theory and applications of cryptographic techniques . Springer , Berlin, Heidelberg , 2010 : 1-23. Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings[C]\/\/Annual international conference on the theory and applications of cryptographic techniques. Springer, Berlin, Heidelberg, 2010: 1-23."},{"key":"e_1_3_2_1_22_1","volume-title":"Approximate integer common divisors [C]\/\/International Cryptography and Lattices Conference","author":"Howgrave-Graham N.","year":"2001","unstructured":"Howgrave-Graham N. Approximate integer common divisors [C]\/\/International Cryptography and Lattices Conference . Springer, Berlin, Heidelberg , Springer , Berlin, Heidelberg, 2001 : 51-66. Howgrave-Graham N. Approximate integer common divisors [C]\/\/International Cryptography and Lattices Conference. Springer, Berlin, Heidelberg, Springer, Berlin, Heidelberg, 2001: 51-66."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2018.5246"},{"issue":"1","key":"e_1_3_2_1_24_1","first-page":"61","article-title":"Effective identity-based agent re-encryption on standard model hypogrids[J]","volume":"41","author":"Jiang M","year":"2019","unstructured":"Jiang M , Guo YY , Yu L , Effective identity-based agent re-encryption on standard model hypogrids[J] . Journal of Electronics and Information , 2019 , 41 ( 1 ): 61 - 66 . Jiang M, Guo YY, Yu L, Effective identity-based agent re-encryption on standard model hypogrids[J]. Journal of Electronics and Information, 2019, 41(1): 61-66.","journal-title":"Journal of Electronics and Information"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.3390\/s21010288"}],"event":{"name":"CSW 2022: 2022 International Conference on Cyber Security","acronym":"CSW 2022","location":"Hangzhou China"},"container-title":["Proceedings of the 2022 International Conference on Cyber Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584714.3584720","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3584714.3584720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:37Z","timestamp":1750182697000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3584714.3584720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,16]]},"references-count":25,"alternative-id":["10.1145\/3584714.3584720","10.1145\/3584714"],"URL":"https:\/\/doi.org\/10.1145\/3584714.3584720","relation":{},"subject":[],"published":{"date-parts":[[2022,12,16]]},"assertion":[{"value":"2023-09-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}