{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T01:00:26Z","timestamp":1771981226360,"version":"3.50.1"},"reference-count":181,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["24-21-00277"],"award-info":[{"award-number":["24-21-00277"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comput Virol Hack Tech"],"DOI":"10.1007\/s11416-024-00530-4","type":"journal-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:02:20Z","timestamp":1719878540000},"page":"765-782","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On modular (CRT-based) secret sharing"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1399-1822","authenticated-orcid":false,"given":"Nikolay N.","family":"Shenets","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,1]]},"reference":[{"key":"530_CR1","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"530_CR2","doi-asserted-by":"publisher","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: 1979 International Workshop on Managing Requirements Knowledge (MARK), pp. 313\u2013318 (1979). https:\/\/doi.org\/10.1109\/MARK.1979.8817296","DOI":"10.1109\/MARK.1979.8817296"},{"key":"530_CR3","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-39466-4_27","volume-title":"Cryptography. EUROCRYPT 1982","author":"M Mignotte","year":"1983","unstructured":"Mignotte, M.: How to share a secret. In: Beth, T. (ed.) Cryptography. EUROCRYPT 1982, pp. 371\u2013375. Springer, Berlin (1983). https:\/\/doi.org\/10.1007\/3-540-39466-4_27"},{"issue":"2","key":"530_CR4","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C Asmuth","year":"1983","unstructured":"Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theory 29(2), 208\u2013210 (1983). https:\/\/doi.org\/10.1109\/TIT.1983.1056651","journal-title":"IEEE Trans. Inf. Theory"},{"key":"530_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-45664-3_14","volume-title":"Public Key Cryptography","author":"M Quisquater","year":"2002","unstructured":"Quisquater, M., Preneel, B., Vandewalle, J.: On the security of the threshold scheme based on the Chinese remainder theorem. In: Naccache, D., Paillier, P. (eds.) Public Key Cryptography, pp. 199\u2013210. Springer, Berlin (2002). https:\/\/doi.org\/10.1007\/3-540-45664-3_14"},{"issue":"6","key":"530_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.ipl.2014.01.008","volume":"114","author":"FL \u0162iplea","year":"2014","unstructured":"\u0162iplea, F.L., Dr\u0103gan, C.C.: A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme. Inf. Process. Lett. 114(6), 299\u2013303 (2014). https:\/\/doi.org\/10.1016\/j.ipl.2014.01.008","journal-title":"Inf. Process. Lett."},{"key":"530_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ins.2018.06.046","volume":"463\u2013464","author":"FL \u0162iplea","year":"2018","unstructured":"\u0162iplea, F.L., Dr\u0103gan, C.C.: On the asymptotic idealness of the Asmuth\u2013Bloom threshold secret sharing scheme. Inf. Sci. 463\u2013464, 75\u201385 (2018). https:\/\/doi.org\/10.1016\/j.ins.2018.06.046","journal-title":"Inf. Sci."},{"key":"530_CR8","first-page":"691","volume":"15","author":"R-J Hwang","year":"1999","unstructured":"Hwang, R.-J., Chang, C.-C.: An improved threshold scheme based on modular arithmetic. J. Inf. Sci. Eng. 15, 691\u2013699 (1999)","journal-title":"J. Inf. Sci. Eng."},{"key":"530_CR9","doi-asserted-by":"publisher","unstructured":"Milanezi, J., da Costa Jo\u00e3o Paulo, C.L., Maranh\u00e3o Jo\u00e3o Paulo, A., de Sousa, R.T., del Galdo, G.: A Chinese Remainder Theorem based perfect secret sharing scheme with enhanced secret range values using tensor based operations. In: 2019 13th International Conference on Signal Processing and Communication Systems (ICSPCS), pp. 1\u20136 (2019). https:\/\/doi.org\/10.1109\/ICSPCS47537.2019.9008712","DOI":"10.1109\/ICSPCS47537.2019.9008712"},{"key":"530_CR10","doi-asserted-by":"publisher","unstructured":"Dolev, S., Kleinman, Y.: Multiplicative partially homomorphic CRT secret sharing: (preliminary version). In: 2022 IEEE 21st International Symposium on Network Computing and Applications (NCA), vol. 21, pp. 201\u2013207 (2022). https:\/\/doi.org\/10.1109\/NCA57778.2022.10013513","DOI":"10.1109\/NCA57778.2022.10013513"},{"key":"530_CR11","doi-asserted-by":"crossref","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: International Workshop on Coding and Cryptology (2011)","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"530_CR12","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s00778-017-0470-9","volume":"26","author":"V Attasena","year":"2017","unstructured":"Attasena, V., Harbi, N.: Secret sharing for cloud data security: a survey. VLDB J. 26, 657\u2013681 (2017). https:\/\/doi.org\/10.1007\/s00778-017-0470-9","journal-title":"VLDB J."},{"key":"530_CR13","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1090\/conm\/677","volume":"677","author":"CS Chum","year":"2016","unstructured":"Chum, C.S., Fine, B., Anja, I.S., Moldenhauer, G.R., Zhang, X.: On secret sharing protocols. Contemp. Math. 677, 51\u201378 (2016). https:\/\/doi.org\/10.1090\/conm\/677","journal-title":"Contemp. Math."},{"key":"530_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2023.100608","author":"AK Chattopadhyay","year":"2024","unstructured":"Chattopadhyay, A.K., Saha, S., Nag, A., Nandi, S.: Secret sharing: a comprehensive survey, taxonomy and applications. Comput. Sci. Rev. (2024). https:\/\/doi.org\/10.1016\/j.cosrev.2023.100608","journal-title":"Comput. Sci. Rev."},{"key":"530_CR15","series-title":"Textbooks in Mathematics","doi-asserted-by":"publisher","DOI":"10.1201\/9781315282497","volume-title":"Cryptography: Theory and Practice","author":"DR Stinson","year":"2018","unstructured":"Stinson, D.R., Paterson, M.: Cryptography: Theory and Practice. Textbooks in Mathematics, 4th edn. CRC Press, New York (2018)","edition":"4"},{"key":"530_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"DR Cramer","year":"2015","unstructured":"Cramer, D.R., Damg\u0227rd, I.B., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing. Cambridge University Press, New York (2015)"},{"key":"530_CR17","unstructured":"Stinson, D., Wei, R.: Bibliography on secret sharing schemes. https:\/\/cs.uwaterloo.ca\/~dstinson\/ssbib.html (1998)"},{"key":"530_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.entcs.2006.12.044","volume":"186","author":"T Galibus","year":"2007","unstructured":"Galibus, T., Matveev, G.: Generalized Mignotte\u2019s sequences over polynomial rings. Electron. Notes Theor. Comput. Sci. 186, 43\u201348 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2006.12.044","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"530_CR19","doi-asserted-by":"publisher","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) Advances in Cryptology\u2014CRYPTO\u2019 88, pp. 27\u201335. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3","DOI":"10.1007\/0-387-34799-2_3"},{"issue":"4","key":"530_CR20","doi-asserted-by":"publisher","first-page":"1330","DOI":"10.1109\/18.850672","volume":"46","author":"O Goldreich","year":"2000","unstructured":"Goldreich, O., Ron, D., Sudan, M.: Chinese remaindering with errors. IEEE Trans. Inf. Theory 46(4), 1330\u20131338 (2000). https:\/\/doi.org\/10.1109\/18.850672","journal-title":"IEEE Trans. Inf. Theory"},{"key":"530_CR21","first-page":"85","volume":"1","author":"NN Koshur","year":"2002","unstructured":"Koshur, N.N.: Generation of moduli for threshold schemes. Vopr. Inf. Bezop. 1, 85\u201388 (2002). (in Russian)","journal-title":"Vopr. Inf. Bezop."},{"key":"530_CR22","unstructured":"Iftene, S.: A generalization of Mignotte\u2019s secret sharing scheme. In: Jebelean, T., Negru, V., Petcu, D., Zaharie, D. (eds.) Proceedings of the 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC\u201904), Timisoara, Romania, pp. 196\u2013207 (2004)"},{"key":"530_CR23","unstructured":"Ersoy, O., Kaya, K., Kaskaloglu, K.: Multilevel threshold secret and function sharing based on the Chinese remainder theorem. ArXiv (2016)"},{"key":"530_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.entcs.2007.01.065","volume":"186","author":"S Iftene","year":"2007","unstructured":"Iftene, S.: General secret sharing based on the Chinese remainder theorem with applications in E-voting. Electron. Notes Theor. Comput. Sci. 186, 67\u201384 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.01.065","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"530_CR25","unstructured":"Iftene, S.: Secret sharing schemes with applications in security protocols. Ph.D. thesis, Romania. https:\/\/www.info.uaic.ro\/wp-content\/uploads\/2019\/03\/tr07-01.pdf (2007)"},{"key":"530_CR26","unstructured":"Kaya, K.: Threshold cryptography with Chinese remainder theorem. Ph.D. thesis, Turkey (2009)"},{"key":"530_CR27","unstructured":"Iftene, S.: General secret sharing based on the Chinese remainder theorem. IACR Cryptol. ePrint Arch. (2006). ArticleID 166"},{"key":"530_CR28","unstructured":"Iftene, S.: Compartmented secret sharing based on the Chinese remainder theorem. IACR Cryptol. ePrint Arch. (2005). ArticleID 408"},{"key":"530_CR29","first-page":"161","volume":"15","author":"S Iftene","year":"2005","unstructured":"Iftene, S., Boureanu, I.: Weighted threshold secret sharing based on the Chinese remainder theorem. Sci. Ann. Cuza Univ. 15, 161\u2013172 (2005)","journal-title":"Sci. Ann. Cuza Univ."},{"key":"530_CR30","doi-asserted-by":"crossref","unstructured":"Pasaila, D., Alexa, V., Iftene, S.: Cheating detection and cheater identification in CRT-based secret sharing schemes. IACR Cryptol. ePrint Arch. 2009 (2009). ArticleID 426","DOI":"10.47839\/ijc.9.2.702"},{"issue":"19","key":"530_CR31","doi-asserted-by":"publisher","first-page":"4148","DOI":"10.1016\/j.ins.2007.04.008","volume":"177","author":"K Kaya","year":"2007","unstructured":"Kaya, K., Sel\u00e7uk, A.A.: Threshold cryptography based on Asmuth\u2013Bloom secret sharing. Inf. Sci. 177(19), 4148\u20134160 (2007). https:\/\/doi.org\/10.1016\/j.ins.2007.04.008","journal-title":"Inf. Sci."},{"key":"530_CR32","unstructured":"Kaya, K., D\u00fcndar, B.G., Kalkan, S., Sel\u00e7uk, A.A.: Threshold Paillier and Naccache-Stern cryptosystems based on Asmuth\u2013Bloom secret sharing. In: Proceedings of 1st National Cryptology Symposium (2006)"},{"key":"530_CR33","doi-asserted-by":"publisher","unstructured":"Kaya, K., Sel\u00e7uk, A.A.: Robust threshold schemes based on the Chinese remainder theorem. In: Vaudenay, S. (ed.) Progress in Cryptology\u2014AFRICACRYPT 2008, pp. 94\u2013108. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-68164-9_7","DOI":"10.1007\/978-3-540-68164-9_7"},{"key":"530_CR34","doi-asserted-by":"publisher","unstructured":"Kaya, K., Sel\u00e7uk, A.A.: Sharing DSS by the Chinese remainder theorem. J. Comput. Appl. Math. 259, 495\u2013502 (2014). https:\/\/doi.org\/10.1016\/j.cam.2013.05.023. Recent Advances in Applied and Computational Mathematics: ICACM-IAM-METU. Also available at IACR Cryptol. ePrint Arch. https:\/\/eprint.iacr.org\/2008\/483","DOI":"10.1016\/j.cam.2013.05.023"},{"key":"530_CR35","first-page":"63","volume":"16","author":"S Iftene","year":"2006","unstructured":"Iftene, S.: Secret sharing schemes with applications in security protocols. Sci. Ann. Cuza Univ. 16, 63\u201396 (2006)","journal-title":"Sci. Ann. Cuza Univ."},{"key":"530_CR36","doi-asserted-by":"publisher","unstructured":"Iftene, S., Grindei, M.: Weighted threshold RSA based on the Chinese remainder theorem. In: Ninth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2007), pp. 175\u2013181 (2007). https:\/\/doi.org\/10.1109\/SYNASC.2007.20","DOI":"10.1109\/SYNASC.2007.20"},{"key":"530_CR37","doi-asserted-by":"crossref","unstructured":"Iftene, S., Ciob\u0103c\u0103, \u015e., Grindei, M.: Compartmented threshold RSA based on the Chinese remainder theorem. IACR Cryptol. ePrint Arch. (2008). ArticleID 370","DOI":"10.1109\/SYNASC.2007.20"},{"key":"530_CR38","doi-asserted-by":"publisher","unstructured":"Kaya, K., Sel\u00e7uk, A.A.: A verifiable secret sharing scheme based on the Chinese remainder theorem. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) Progress in Cryptology\u2014INDOCRYPT 2008, pp. 414\u2013425. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-89754-5_32","DOI":"10.1007\/978-3-540-89754-5_32"},{"key":"530_CR39","unstructured":"Kaya, K., Sel\u00e7uk, A.A.: Secret sharing extensions based on the Chinese remainder theorem. IACR Cryptol. ePrint Arch. (2010). ArticleID 96"},{"key":"530_CR40","doi-asserted-by":"publisher","unstructured":"Galibus, T., Matveev, G., Shenets, N.: Some structural and security properties of the modular secret sharing. In: 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 197\u2013200 (2008).https:\/\/doi.org\/10.1109\/SYNASC.2008.14","DOI":"10.1109\/SYNASC.2008.14"},{"key":"530_CR41","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-030-03332-3_12","volume-title":"Advances in Cryptology\u2013ASIACRYPT 2018","author":"Y Ning","year":"2018","unstructured":"Ning, Y., Miao, F., Huang, W., Meng, K., Xiong, Y., Wang, X.: Constructing ideal secret sharing schemes based on Chinese remainder theorem. In: Peyrin, T., Galbraith, S. (eds.) Advances in Cryptology\u2013ASIACRYPT 2018, pp. 310\u2013331. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_12"},{"key":"530_CR42","unstructured":"Bozkurt, I.N., Kaya, K., Sel\u00e7uk, A.A.: Secret sharing for general access structures. Information Security and Cryptology, Ankara (2010)"},{"key":"530_CR43","doi-asserted-by":"publisher","unstructured":"Qiong, L., Zhifang, W., Xiamu, N., Shenghe, S.: A non-interactive modular verifiable secret sharing scheme. In: Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005., vol. 1, pp. 84\u201387 (2005). https:\/\/doi.org\/10.1109\/ICCCAS.2005.1493367","DOI":"10.1109\/ICCCAS.2005.1493367"},{"issue":"4","key":"530_CR44","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ffa.2005.04.007","volume":"12","author":"R Steinfeld","year":"2006","unstructured":"Steinfeld, R., Pieprzyk, J., Wang, H.: Lattice-based threshold-changeability for standard CRT secret-sharing schemes. Finite Fields Their Appl. 12(4), 653\u2013680 (2006). https:\/\/doi.org\/10.1016\/j.ffa.2005.04.007","journal-title":"Finite Fields Their Appl."},{"key":"530_CR45","doi-asserted-by":"publisher","unstructured":"Lou, T., Tartary, C.: Analysis and design of multiple threshold changeable secret sharing schemes. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds.) Cryptology and Network Security, pp. 196\u2013213. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-89641-8_14","DOI":"10.1007\/978-3-540-89641-8_14"},{"key":"530_CR46","doi-asserted-by":"publisher","unstructured":"Yang, Y.-T., Zeng, P., Fang, Y., Chi, Y.-P.: A feasible key management scheme in adhoc network. In: Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel\/Distributed Computing (SNPD 2007), vol. 1, pp. 300\u2013303 (2007). https:\/\/doi.org\/10.1109\/SNPD.2007.275","DOI":"10.1109\/SNPD.2007.275"},{"key":"530_CR47","doi-asserted-by":"publisher","unstructured":"Sarkar, S., Kisku, B., Misra, S., Obaidat, M.S.: Chinese remainder theorem-based RSA-threshold cryptography in MANET using verifiable secret sharing scheme. In: 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, pp. 258\u2013262 (2009). https:\/\/doi.org\/10.1109\/WiMob.2009.51","DOI":"10.1109\/WiMob.2009.51"},{"key":"530_CR48","doi-asserted-by":"publisher","unstructured":"Xie, Q., Shen, Z., Yu, X.: Threshold signature scheme based on modular secret sharing. In: 2008 International Conference on Computational Intelligence and Security, vol. 2, pp. 442\u2013445 (2008). https:\/\/doi.org\/10.1109\/CIS.2008.78","DOI":"10.1109\/CIS.2008.78"},{"key":"530_CR49","doi-asserted-by":"publisher","unstructured":"Shyu, S.J., Chen, Y.-R.: Threshold secret image sharing by Chinese remainder theorem. In: 2008 IEEE Asia-Pacific Services Computing Conference, pp. 1332\u20131337 (2008). https:\/\/doi.org\/10.1109\/APSCC.2008.223","DOI":"10.1109\/APSCC.2008.223"},{"key":"530_CR50","first-page":"6","volume":"12","author":"WQ Yan","year":"2000","unstructured":"Yan, W.Q., Ding, W., Dongxu, Q.: Image sharing based on Chinese remainder theorem. J. North China Univ. Technol. 12, 6\u20139 (2000)","journal-title":"J. North China Univ. Technol."},{"key":"530_CR51","doi-asserted-by":"publisher","unstructured":"Ulutas, M., Nabiyev, V.V., Ulutas, G.: A new secret image sharing technique based on Asmuth Bloom\u2019s scheme. In: 2009 International Conference on Application of Information and Communication Technologies, pp. 1\u20135 (2009). https:\/\/doi.org\/10.1109\/ICAICT.2009.5372571","DOI":"10.1109\/ICAICT.2009.5372571"},{"key":"530_CR52","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.ins.2013.03.062","volume":"240","author":"M Barzu","year":"2013","unstructured":"Barzu, M., \u0162iplea, F.L., Dr\u0103gan, C.C.: Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes. Inf. Sci. 240, 161\u2013172 (2013). https:\/\/doi.org\/10.1016\/j.ins.2013.03.062","journal-title":"Inf. Sci."},{"key":"530_CR53","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1049\/ise2.12014","volume":"15","author":"FL \u0162iplea","year":"2021","unstructured":"\u0162iplea, F.L., Dr\u0103gan, C.C.: Asymptotically ideal Chinese remainder theorem-based secret sharing schemes for multilevel and compartmented access structures. IET Inf. Secur. 15, 282\u2013296 (2021). https:\/\/doi.org\/10.1049\/ise2.12014","journal-title":"IET Inf. Secur."},{"issue":"17","key":"530_CR54","doi-asserted-by":"publisher","first-page":"4416","DOI":"10.1002\/sec.1617","volume":"9","author":"O Ersoy","year":"2016","unstructured":"Ersoy, O., Pedersen, T.B., Kaya, K., Sel\u00e7uk, A.A., Anarim, E.: A CRT-based verifiable secret sharing scheme secure against unbounded adversaries. Secur. Commun. Netw. 9(17), 4416\u20134427 (2016). https:\/\/doi.org\/10.1002\/sec.1617","journal-title":"Secur. Commun. Netw."},{"key":"530_CR55","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11277-014-1751-x","volume":"78","author":"C-F Hsu","year":"2014","unstructured":"Hsu, C.-F., Harn, L.: Multipartite secret sharing based on CRT. Wirel. Pers. Commun. 78, 271\u2013282 (2014). https:\/\/doi.org\/10.1007\/s11277-014-1751-x","journal-title":"Wirel. Pers. Commun."},{"issue":"9","key":"530_CR56","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.ipl.2014.04.006","volume":"114","author":"L Harn","year":"2014","unstructured":"Harn, L., Fuyou, M.: Multilevel threshold secret sharing based on the Chinese remainder theorem. Inf. Process. Lett. 114(9), 504\u2013509 (2014). https:\/\/doi.org\/10.1016\/j.ipl.2014.04.006","journal-title":"Inf. Process. Lett."},{"key":"530_CR57","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.ins.2016.06.006","volume":"367\u2013368","author":"L Harn","year":"2016","unstructured":"Harn, L., Hsu, C., Zhang, M., He, T., Zhang, M.: Realizing secret sharing with general access structure. Inf. Sci. 367\u2013368, 209\u2013220 (2016). https:\/\/doi.org\/10.1016\/j.ins.2016.06.006","journal-title":"Inf. Sci."},{"key":"530_CR58","doi-asserted-by":"publisher","unstructured":"Meng, K., Miao, F., Yu, Y., Lu, C.: A universal secret sharing scheme with general access structure based on CRT. In: 2018 17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications\/12th IEEE International Conference on Big Data Science and Engineering (TrustCom\/BigDataSE), pp. 142\u2013148 (2018). https:\/\/doi.org\/10.1109\/TrustCom\/BigDataSE.2018.00031","DOI":"10.1109\/TrustCom\/BigDataSE.2018.00031"},{"key":"530_CR59","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.dam.2019.05.011","volume":"268","author":"K Meng","year":"2019","unstructured":"Meng, K., Miao, F., Huang, W., Xiong, Y.: Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem. Discrete Appl. Math. 268, 152\u2013163 (2019). https:\/\/doi.org\/10.1016\/j.dam.2019.05.011","journal-title":"Discrete Appl. Math."},{"key":"530_CR60","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/2387358","author":"S D\u2019Antonio","year":"2019","unstructured":"D\u2019Antonio, S., Chen, H., Chang, C.-C.: A novel $$(t, n)$$ secret sharing scheme based upon Euler\u2019s theorem. Secur. Commun. Netw. (2019). https:\/\/doi.org\/10.1155\/2019\/2387358","journal-title":"Secur. Commun. Netw."},{"key":"530_CR61","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6678345","author":"F Miao","year":"2021","unstructured":"Miao, F., Yu, Y., Meng, K., Xiong, Y., Chang, C.-C.: Grouped secret sharing schemes based on Lagrange interpolation polynomials and Chinese remainder theorem. Secur. Commun. Netw. (2021). https:\/\/doi.org\/10.1155\/2021\/6678345","journal-title":"Secur. Commun. Netw."},{"issue":"7","key":"530_CR62","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1002\/dac.2760","volume":"28","author":"Y Liu","year":"2014","unstructured":"Liu, Y., Harn, L., Chang, C.-C.: A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets. Int. J. Commun. Syst. 28(7), 1282\u20131292 (2014). https:\/\/doi.org\/10.1002\/dac.2760","journal-title":"Int. J. Commun. Syst."},{"issue":"6","key":"530_CR63","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1002\/sec.807","volume":"7","author":"L Harn","year":"2014","unstructured":"Harn, L., Fuyou, M., Chang, C.-C.: Verifiable secret sharing based on the Chinese remainder theorem. Secur. Commun. Netw. 7(6), 950\u2013957 (2014). https:\/\/doi.org\/10.1002\/sec.807","journal-title":"Secur. Commun. Netw."},{"issue":"4","key":"530_CR64","first-page":"617","volume":"18","author":"Y Liu","year":"2016","unstructured":"Liu, Y., Chang, C.-C.: An integratable verifiable secret sharing mechanism. Int. J. Netw. Secur. 18(4), 617\u2013624 (2016)","journal-title":"Int. J. Netw. Secur."},{"issue":"1","key":"530_CR65","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1002\/dac.2348","volume":"27","author":"C Guo","year":"2014","unstructured":"Guo, C., Chang, C.-C.: An authenticated group key distribution protocol based on the generalized Chinese remainder theorem. Int. J. Commun. Syst. 27(1), 126\u2013134 (2014). https:\/\/doi.org\/10.1002\/dac.2348","journal-title":"Int. J. Commun. Syst."},{"key":"530_CR66","doi-asserted-by":"publisher","unstructured":"Lu, Q., Xiong, Y., Huang, W., Gong, X., Miao, F.: A distributed ECC-DSS authentication scheme based on CRT-VSS and Trusted Computing in MANET. In: IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications, pp. 656\u2013665 (2012). https:\/\/doi.org\/10.1109\/TrustCom.2012.24","DOI":"10.1109\/TrustCom.2012.24"},{"key":"530_CR67","unstructured":"Lu, Q., Huang, W., Gong, X., Wang, X., Xiong, Y., Miao, F.: A secure distributed authentication scheme based on CRT-VSS and trusted computing in MANET (2013). http:\/\/arxiv.org\/abs\/1307.2977"},{"key":"530_CR68","doi-asserted-by":"publisher","unstructured":"Zhang, S., Miao, F.: Secret image sharing based on Chinese remainder theorem over a polynomial ring. In: Chen, X., Yan, H., Yan, Q., Zhang, X. (eds.) Machine Learning for Cyber Security, pp. 634\u2013643. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62223-7_55","DOI":"10.1007\/978-3-030-62223-7_55"},{"key":"530_CR69","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2021.116221","author":"K Meng","year":"2021","unstructured":"Meng, K., Miao, F., Xiong, Y., Chang, C.-C.: A reversible extended secret image sharing scheme based on Chinese remainder theorem. Signal Process. Image Commun. (2021). https:\/\/doi.org\/10.1016\/j.image.2021.116221","journal-title":"Signal Process. Image Commun."},{"key":"530_CR70","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-019-9123-z","author":"K Meng","year":"2021","unstructured":"Meng, K., Miao, F., Ning, Y., Huang, W., Xiong, Y., Chang, C.-C.: A proactive secret sharing scheme based on Chinese remainder theorem. Front. Comput. Sci. (2021). https:\/\/doi.org\/10.1007\/s11704-019-9123-z","journal-title":"Front. Comput. Sci."},{"key":"530_CR71","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-021-0483-9","author":"L Wu","year":"2022","unstructured":"Wu, L., Miao, F., Meng, K., Wang, X.: A simple construction of CRT-based ideal secret sharing scheme and its security extension based on common factor. Front. Comput. Sci. (2022). https:\/\/doi.org\/10.1007\/s11704-021-0483-9","journal-title":"Front. Comput. Sci."},{"key":"530_CR72","doi-asserted-by":"publisher","unstructured":"Guo, C., Chang, C.-C.: General threshold signature based on the Chinese remainder theorem. In: 2011 Seventh International Conference on Intelligent Information Hiding and Multimedia Signal Processing, pp. 244\u2013247 (2011). https:\/\/doi.org\/10.1109\/IIHMSP.2011.27","DOI":"10.1109\/IIHMSP.2011.27"},{"key":"530_CR73","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-030-91356-4_7","volume-title":"Information Security","author":"X Wang","year":"2021","unstructured":"Wang, X., Miao, F.: Randomized component based secure secret reconstruction in insecure networks. In: Liu, J.K., Katsikas, S., Meng, W., Susilo, W., Intan, R. (eds.) Information Security, pp. 117\u2013138. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91356-4_7"},{"key":"530_CR74","doi-asserted-by":"publisher","unstructured":"Yao, R., Miao, F.: Enabling efficient applications of CRT and GCRT in practice. In: 2023 4th International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT), pp. 91\u201399 (2023).https:\/\/doi.org\/10.1109\/AINIT59027.2023.10212710","DOI":"10.1109\/AINIT59027.2023.10212710"},{"key":"530_CR75","doi-asserted-by":"publisher","unstructured":"Chervyakov, N., Babenko, M., Deryabin, M., Garianina, A.: Development of information security\u2019s theoretical aspects in Cloud technology with the use of threshold structures. In: 2014 International Conference on Engineering and Telecommunication, pp. 38\u201342 (2014). https:\/\/doi.org\/10.1109\/EnT.2014.19","DOI":"10.1109\/EnT.2014.19"},{"issue":"1","key":"530_CR76","first-page":"62","volume":"9","author":"M Deryabin","year":"2018","unstructured":"Deryabin, M., Chervyakov, N., Tchernykh, A., Babenko, M., Shabalina, M.: High performance parallel computing in residue number system. Int. J. Comb. Optim. Probl. Inform. 9(1), 62\u201367 (2018)","journal-title":"Int. J. Comb. Optim. Probl. Inform."},{"issue":"1","key":"530_CR77","first-page":"81","volume":"9","author":"A Nazarov","year":"2018","unstructured":"Nazarov, A., Chervyakov, N., Tchernykh, A., Babenko, M.: Reliability improvement of information systems by residue number system code. Int. J. Comb. Optim. Probl. Inform. 9(1), 81\u201384 (2018)","journal-title":"Int. J. Comb. Optim. Probl. Inform."},{"key":"530_CR78","doi-asserted-by":"publisher","unstructured":"Deryabin, M., Chervyakov, N., Tchernykh, A., Babenko, M., Kucherov, N., Miranda-L\u00f3pez, V., Avetisyan, A.: Secure verifiable secret short sharing scheme for multi-Cloud storage. In: 2018 International Conference on High Performance Computing and Simulation (HPCS), pp. 700\u2013706 (2018). https:\/\/doi.org\/10.1109\/HPCS.2018.00114","DOI":"10.1109\/HPCS.2018.00114"},{"key":"530_CR79","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-319-73353-1_26","volume-title":"High Performance Computing","author":"V Miranda-L\u00f3pez","year":"2018","unstructured":"Miranda-L\u00f3pez, V., Tchernykh, A., Cort\u00e9s-Mendoza, J.M., Babenko, M., Radchenko, G., Nesmachnow, S., Du, Z.: Experimental analysis of secret sharing schemes for Cloud storage based on RNS. In: Mocskos, E., Nesmachnow, S. (eds.) High Performance Computing, pp. 370\u2013383. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73353-1_26"},{"issue":"4","key":"530_CR80","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1007\/s10586-018-02896-9","volume":"22","author":"A Tchernykh","year":"2019","unstructured":"Tchernykh, A., Miranda-L\u00f3pez, V., Babenko, M., Armenta-Cano, F., Radchenko, G., Drozdov, A.Y., Avetisyan, A.: Performance evaluation of secret sharing schemes with data recovery in secured and reliable heterogeneous multi-Cloud storage. Clust. Comput. 22(4), 1173\u20131185 (2019). https:\/\/doi.org\/10.1007\/s10586-018-02896-9","journal-title":"Clust. Comput."},{"key":"530_CR81","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1016\/j.future.2017.09.061","volume":"92","author":"N Chervyakov","year":"2019","unstructured":"Chervyakov, N., Babenko, M., Tchernykh, A., Kucherov, N., Miranda-L\u00f3pez, V., Cort\u00e9s-Mendoza, J.M.: AR-RRNS: configurable reliable distributed data storage systems for Internet of Things to ensure security. Future Gen. Comput. Syst. 92, 1080\u20131092 (2019). https:\/\/doi.org\/10.1016\/j.future.2017.09.061","journal-title":"Future Gen. Comput. Syst."},{"key":"530_CR82","doi-asserted-by":"publisher","unstructured":"Babenko, M., Tchernykh, A., Golimblevskaia, E., Viet, H.N., Chaurasiya, V.K.: Computationally secure threshold secret sharing scheme with minimal redundancy. In: International Workshop on Information, Computation, and Control Systems for Distributed Environments, vol. 2638 (2020). https:\/\/doi.org\/10.47350\/ICCS-DE.2020.02","DOI":"10.47350\/ICCS-DE.2020.02"},{"key":"530_CR83","doi-asserted-by":"publisher","unstructured":"Babenko, M., Tchernykh, A., Pulido-Gaytan, B., Cort\u00e9s-Mendoza, J.M., Shiryaev, E., Golimblevskaia, E., Avetisyan, A., Nesmachnow, S.: RRNS base extension error-correcting code for performance optimization of scalable reliable distributed Cloud data storage. In: 2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 548\u2013553 (2021). https:\/\/doi.org\/10.1109\/IPDPSW52791.2021.00087","DOI":"10.1109\/IPDPSW52791.2021.00087"},{"key":"530_CR84","doi-asserted-by":"publisher","unstructured":"Chervyakov, N.I., Deryabin, M.A., Nazarov, A.S., Babenko, M.G., Kucherov, N.N., Gladkov, A.V., G.I., R.: Secure and reliable data transmission over MANET based on principles of computationally secure secret sharing. In: Proceedings of ISP RAS, vol. 31, pp. 153\u2013158 (2019). https:\/\/doi.org\/10.15514\/ISPRAS-2019-31(2)-118 (in Russian)","DOI":"10.15514\/ISPRAS-2019-31(2)-118"},{"key":"530_CR85","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-031-28454-0_17","volume-title":"Smart Cities","author":"A Gladkov","year":"2023","unstructured":"Gladkov, A., Shiriaev, E., Tchernykh, A., Deryabin, M., Bezuglova, E., Valuev, G., Babenko, M.: SNS-based secret sharing scheme for security of Smart City communication systems. In: Nesmachnow, S., Hern\u00e1ndez Callejo, L. (eds.) Smart Cities, pp. 248\u2013263. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-28454-0_17"},{"key":"530_CR86","doi-asserted-by":"publisher","unstructured":"Kuzmenko, I., Chervyakov, N., Yuriy, K., Samoylenko, D.: Modification of the scheme of division of Asmuth\u2013Bloom data with the application of the method of fractal geometry. In: 2017 IVth International Conference on Engineering and Telecommunication (EnT), pp. 28\u201332 (2017).https:\/\/doi.org\/10.1109\/ICEnT.2017.13","DOI":"10.1109\/ICEnT.2017.13"},{"key":"530_CR87","doi-asserted-by":"publisher","unstructured":"Subba\u00a0Rao, Y.V., Bhagvati, C.: CRT based secured encryption scheme. In: 2012 1st International Conference on Recent Advances in Information Technology (RAIT), pp. 11\u201313 (2012). https:\/\/doi.org\/10.1109\/RAIT.2012.6194470","DOI":"10.1109\/RAIT.2012.6194470"},{"issue":"3","key":"530_CR88","first-page":"201","volume":"2","author":"YV Subba Rao","year":"2012","unstructured":"Subba Rao, Y.V., Bhagvati, C.: Multi-secret communication scheme. Int. J. Inf. Educ. Technol. 2(3), 201\u2013203 (2012)","journal-title":"Int. J. Inf. Educ. Technol."},{"issue":"4","key":"530_CR89","first-page":"249","volume":"16","author":"YV Subba Rao","year":"2014","unstructured":"Subba Rao, Y.V., Bhagvati, C.: CRT based threshold multi secret sharing scheme. Int. J. Netw. Secur. 16(4), 249\u2013255 (2014)","journal-title":"Int. J. Netw. Secur."},{"key":"530_CR90","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-981-16-3728-5_17","volume-title":"Computer Networks and Inventive Communication Technologies","author":"R Subrahmanyam","year":"2022","unstructured":"Subrahmanyam, R., Rukma Rekha, N., Subba Rao, Y.V.: Multipartite verifiable secret sharing based on CRT. In: Smys, S., Bestak, R., Palanisamy, R., Kotuliak, I. (eds.) Computer Networks and Inventive Communication Technologies, pp. 233\u2013245. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-16-3728-5_17"},{"issue":"1","key":"530_CR91","doi-asserted-by":"publisher","first-page":"15","DOI":"10.24138\/jcomss.v11i1.113","volume":"11","author":"A Endurthi","year":"2015","unstructured":"Endurthi, A., Chanu, O.B., Tentu, A.N., Venkaiah, V.C.: Reusable multi-stage multi-secret sharing schemes based on CRT. J. Commun. Softw. Syst. 11(1), 15\u201324 (2015). https:\/\/doi.org\/10.24138\/jcomss.v11i1.113","journal-title":"J. Commun. Softw. Syst."},{"key":"530_CR92","doi-asserted-by":"publisher","unstructured":"Singh, N., Tentu, A.N., Basit, A., Venkaiah, V.C.: Sequential secret sharing scheme based on Chinese remainder theorem. In: 2016 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), pp. 1\u20136 (2016). https:\/\/doi.org\/10.1109\/ICCIC.2016.7919678","DOI":"10.1109\/ICCIC.2016.7919678"},{"issue":"1","key":"530_CR93","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJSN.2018.090637","volume":"13","author":"AN Tentu","year":"2018","unstructured":"Tentu, A.N., Venkaiah, V.C., Prasad, V.K.: CRT based multi-secret sharing schemes: revisited. Int. J. Secur. Netw. 13(1), 1\u20139 (2018). https:\/\/doi.org\/10.1504\/IJSN.2018.090637","journal-title":"Int. J. Secur. Netw."},{"issue":"9","key":"530_CR94","doi-asserted-by":"publisher","first-page":"553","DOI":"10.18469\/ikt.2019.17.3.01","volume":"25","author":"AA Kolyada","year":"2019","unstructured":"Kolyada, A.A., Kuchynsky, P.V., Chervyakov, N.I.: The threshold method of secret\u2019s division based on redundant modular computing structures. Inf. Technol. 25(9), 553\u2013561 (2019). https:\/\/doi.org\/10.18469\/ikt.2019.17.3.01. (in Russian)","journal-title":"Inf. Technol."},{"issue":"3","key":"530_CR95","doi-asserted-by":"publisher","first-page":"261","DOI":"10.17587\/it.25.553-56","volume":"17","author":"AA Kolyada","year":"2019","unstructured":"Kolyada, A.A., Kuchynsky, P.V., Chervyakov, N.I.: Threshold MRMA schemes of secret sharing. Infokommunikacionnye tehnologii 17(3), 261\u2013269 (2019). https:\/\/doi.org\/10.17587\/it.25.553-56","journal-title":"Infokommunikacionnye tehnologii"},{"issue":"2","key":"530_CR96","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1007\/s11277-023-10315-5","volume":"130","author":"D Pande","year":"2023","unstructured":"Pande, D., Rawat, A.S., Deshmukh, M., Singh, M.: Single secret sharing scheme using Chinese remainder theorem, modified Shamir\u2019s scheme and XOR operation. Wirel. Pers. Commun. 130(2), 957\u2013985 (2023). https:\/\/doi.org\/10.1007\/s11277-023-10315-5","journal-title":"Wirel. Pers. Commun."},{"key":"530_CR97","doi-asserted-by":"publisher","unstructured":"Rawat, A.S., Deshmukh, M., Singh, M.: Meaningful shares based single secret sharing scheme using Chinese remainder theorem and XOR operation. In: 2023 10th International Conference on Signal Processing and Integrated Networks (SPIN), pp. 597\u2013602 (2023). https:\/\/doi.org\/10.1109\/SPIN57001.2023.10116100","DOI":"10.1109\/SPIN57001.2023.10116100"},{"key":"530_CR98","doi-asserted-by":"publisher","first-page":"1","DOI":"10.32817\/amssd.6.1","volume":"6","author":"J Despotovi\u0107","year":"2023","unstructured":"Despotovi\u0107, J., Jadrijevi\u0107, B.: Metode za podjelu tajne temeljene na Kineskom teoremu o ostacima. Acta Math. Spalatensia Ser. Didact. 6, 1\u201314 (2023). (in Croatian)","journal-title":"Acta Math. Spalatensia Ser. Didact."},{"key":"530_CR99","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-22497-3_17","volume-title":"Information Security and Privacy","author":"Y Zhang","year":"2011","unstructured":"Zhang, Y., Tartary, C., Wang, H.: An efficient rational secret sharing scheme based on the Chinese remainder theorem. In: Parampalli, U., Hawkes, P. (eds.) Information Security and Privacy, pp. 259\u2013275. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-22497-3_17"},{"issue":"16","key":"530_CR100","first-page":"125","volume":"4","author":"NN Shenets","year":"2007","unstructured":"Shenets, N.N.: Multidimensional modular secret sharing. Informatics 4(16), 125\u2013132 (2007). (in Russian)","journal-title":"Informatics"},{"issue":"6","key":"530_CR101","doi-asserted-by":"publisher","first-page":"662","DOI":"10.29235\/1561-8323-2019-63-6-662-671","volume":"63","author":"AF Chernyavsky","year":"2019","unstructured":"Chernyavsky, A.F., Kolyada, A.A., Martinov, A.O., Yu, P.S.: Correctness problem of the threshold method of modular sharing of secrets with masking transformation. Informatics 63(6), 662\u2013671 (2019). https:\/\/doi.org\/10.29235\/1561-8323-2019-63-6-662-671. (in Russian)","journal-title":"Informatics"},{"key":"530_CR102","doi-asserted-by":"publisher","unstructured":"Priyanka, K.V., Gowthami, M., Susmitha, O., Prathyusha, G., Muppalaneni, N.B.: Breaking Mignotte\u2019s sequence based secret sharing scheme using SMT solver. CoRR abs\/1801.03758 (2018). https:\/\/doi.org\/10.5121\/ijcsit.2017.9603","DOI":"10.5121\/ijcsit.2017.9603"},{"issue":"6","key":"530_CR103","first-page":"9","volume":"54","author":"NN Shenets","year":"2010","unstructured":"Shenets, N.N.: On information rate of modular secret sharing. Dokl. Natl. Acad. Sci. Belarus 54(6), 9\u201312 (2010). (in Russian)","journal-title":"Dokl. Natl. Acad. Sci. Belarus"},{"key":"530_CR104","unstructured":"Shenets, N.N.: Modular secret sharing over polynomial rings. In: International Congress on Informatics: Information Systems and Technologies (CSIST\u201909), vol. 2, pp. 83\u201385. BSU, Minsk, Belarus (2009). http:\/\/elib.bsu.by\/handle\/123456789\/92786 (in Russian)"},{"key":"530_CR105","unstructured":"Shenets, N.N.: On ideal modular secret sharing over multivariate polynomial rings. In: International Congress on Informatics: Information Systems and Technologies (CSIST\u201911), vol. 1, pp. 169\u2013172. BSU, Minsk, Belarus (2011). http:\/\/elib.bsu.by\/handle\/123456789\/9565 (in Russian)"},{"key":"530_CR106","unstructured":"Matveev, G.V., Shenets, N.N.: Ideal modular secret sharing schemes. In: 10 International Scientific Seminar \"Descrete Mathematicas and Its Applications\", pp. 521\u2013424 (2008). Moscow (in Russian)"},{"issue":"3","key":"530_CR107","doi-asserted-by":"publisher","first-page":"1280","DOI":"10.3934\/mbe.2019062","volume":"16","author":"X Jia","year":"2019","unstructured":"Jia, X., Song, Y., Wang, D., Nie, D., Wu, J.: A collaborative secret sharing scheme based on the Chinese remainder theorem. Math. Biosci. Eng. 16(3), 1280\u20131299 (2019). https:\/\/doi.org\/10.3934\/mbe.2019062","journal-title":"Math. Biosci. Eng."},{"issue":"16","key":"530_CR108","first-page":"118","volume":"4","author":"TV Galibus","year":"2007","unstructured":"Galibus, T.V.: Modular realization of special access structures. Informatics 4(16), 118\u2013124 (2007). (in Russian)","journal-title":"Informatics"},{"key":"530_CR109","unstructured":"Shenets, N.N.: Elementary access structures. In: Modern Information Computer Technologies (mcIT\u201908), vol. 2, pp. 288\u2013290. Grodno State University, Grodno, Belarus (2008). (in Russian)"},{"key":"530_CR110","unstructured":"Galibus, T.V., Matveev, G.V., Shenets, N.N.: Monomial ordering and access structures. In: XI Belorussian Mathematics Conference, vol. 5, pp. 35\u201336 (2008). (in Russian)"},{"key":"530_CR111","unstructured":"Galibus, T.V., Shenets, N.N.: Elementary modular secret sharing. Vestnik BSU. Seria 1, Phisics. Mathematics. Informatics (2), 85\u201390 (2008). (in Russian)"},{"issue":"8","key":"530_CR112","doi-asserted-by":"publisher","first-page":"798","DOI":"10.3103\/S0146411615080337","volume":"49","author":"NN Shenets","year":"2015","unstructured":"Shenets, N.N.: Ideal composite modular secret sharing schemes. Autom. Control. Comput. Sci. 49(8), 798\u2013802 (2015). https:\/\/doi.org\/10.3103\/S0146411615080337","journal-title":"Autom. Control. Comput. Sci."},{"key":"530_CR113","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ins.2022.02.016","volume":"595","author":"X Jia","year":"2022","unstructured":"Jia, X., Guo, Y., Luo, X., Wang, D., Zhang, C.: A perfect secret sharing scheme for general access structures. Inf. Sci. 595, 54\u201369 (2022). https:\/\/doi.org\/10.1016\/j.ins.2022.02.016","journal-title":"Inf. Sci."},{"key":"530_CR114","unstructured":"Matveev, G.V., Matulis, V.V.: Non-threshold modular secret sharing. In: Theoretical and Applied Cryptography, pp. 43\u201347. BSU, Minsk (2020). (in Russian)"},{"issue":"89","key":"530_CR115","first-page":"26","volume":"5","author":"TV Galibus","year":"2014","unstructured":"Galibus, T.V.: Verification of polynomial secret sharing over binary field. Vestnik Brest State Tech. Univ. Phisics Math. Inform. 5(89), 26\u201326 (2014). (in Russian)","journal-title":"Vestnik Brest State Tech. Univ. Phisics Math. Inform."},{"key":"530_CR116","unstructured":"Galibus, T.V., Matveev, G.V.: Parameters verification in modular secret sharing. Vestnik BSU. Seria 1, Phisics. Math. Inform. (1), 76\u201379 (2015). (in Russian)"},{"key":"530_CR117","unstructured":"Matveev, G.V., Galibus, T.V.: Verification of modular secret sharing. In: Descrete Mathematicas, Algebra and Their Applications, pp. 116\u2013117 (2015). (in Russian)"},{"key":"530_CR118","first-page":"17","volume":"2","author":"MM Vaskouski","year":"2017","unstructured":"Vaskouski, M.M., Matveev, G.V.: Verification of modular secret sharing. J. Belarus. State Univ. Math. Inform. 2, 17\u201322 (2017). (in Russian)","journal-title":"J. Belarus. State Univ. Math. Inform."},{"issue":"4","key":"530_CR119","doi-asserted-by":"publisher","first-page":"2395","DOI":"10.1007\/s13369-019-03992-7","volume":"45","author":"OP Verma","year":"2020","unstructured":"Verma, O.P., Jain, N., Pal, S.K.: A hybrid-based verifiable secret sharing scheme using Chinese remainder theorem. Arab. J. Sci. Eng. 45(4), 2395\u20132406 (2020). https:\/\/doi.org\/10.1007\/s13369-019-03992-7","journal-title":"Arab. J. Sci. Eng."},{"issue":"11","key":"530_CR120","doi-asserted-by":"publisher","first-page":"1778","DOI":"10.1109\/TCSII.2017.2756343","volume":"65","author":"L Xiao","year":"2018","unstructured":"Xiao, L., Xia, X.-G.: Robust polynomial reconstruction via Chinese remainder theorem in the presence of small degree residue errors. IEEE Trans. Circuits Syst. II Express Briefs 65(11), 1778\u20131782 (2018). https:\/\/doi.org\/10.1109\/TCSII.2017.2756343","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"issue":"18","key":"530_CR121","doi-asserted-by":"publisher","first-page":"3592","DOI":"10.1002\/sec.1283","volume":"8","author":"Z Chen","year":"2015","unstructured":"Chen, Z., Li, S., Zhu, Y., Yan, J., Xu, X.: A cheater identifiable multi-secret sharing scheme based on the Chinese remainder theorem. Secur. Commun. Netw. 8(18), 3592\u20133601 (2015). https:\/\/doi.org\/10.1002\/sec.1283","journal-title":"Secur. Commun. Netw."},{"key":"530_CR122","doi-asserted-by":"publisher","unstructured":"Zou, X., Maino, F., Bertino, E., Sui, Y., Wang, K., Li, F.: A new approach to weighted multi-secret sharing. In: 2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN), pp. 1\u20136 (2011). https:\/\/doi.org\/10.1109\/ICCCN.2011.6005766","DOI":"10.1109\/ICCCN.2011.6005766"},{"key":"530_CR123","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ins.2018.09.024","volume":"473","author":"X Jia","year":"2019","unstructured":"Jia, X., Wang, D., Nie, D., Luo, X., Sun, J.Z.: A new threshold changeable secret sharing scheme based on the Chinese remainder theorem. Inf. Sci. 473, 13\u201330 (2019). https:\/\/doi.org\/10.1016\/j.ins.2018.09.024","journal-title":"Inf. Sci."},{"key":"530_CR124","unstructured":"Galibus, T.V.: Secret sharing over polynomial rings. Vestnik BSU. Seria 1, Phisics. Math. Inform. (2), 97\u2013100 (2006). (in Russian)"},{"key":"530_CR125","unstructured":"Galibus, T.V., Matveev, G.V.: Combinatorics of zero-dimensional ideals and modular secret sharing. In: 9 International on Scientific Seminar \"Descrete Mathematicas and Its Applications\", pp. 424\u2013426 (2007). Moscow. (in Russian)"},{"key":"530_CR126","unstructured":"Galibus, T.V.: Ideals of symmetric relations and secret sharing. Vestnik BSU. Seria 1, Phisics. Math. Inform. (2), 141\u2013143 (2011). (in Russian)"},{"key":"530_CR127","unstructured":"Galibus, T.V., Matveev, G.V.: Modular secret sharing and equiresidual ideals. In: XI Belorussian Mathematics Conference, pp. 54\u201354 (2012). (in Russian)"},{"issue":"6","key":"530_CR128","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1080\/09720529.2012.10698386","volume":"15","author":"T Galibus","year":"2012","unstructured":"Galibus, T., Matveev, G.: Finite fields, Gr\u00f6bner bases and modular secret sharing. J. Discrete Math. Sci. Cryptogr. 15(6), 339\u2013348 (2012). https:\/\/doi.org\/10.1080\/09720529.2012.10698386","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"530_CR129","doi-asserted-by":"publisher","DOI":"10.33581\/2520-6508-2019-3-129-133","author":"GV Matveev","year":"2019","unstructured":"Matveev, G.V.: Chinese remainder theorem secret sharing in multivariate polynomials. J. Belarusian State Univ. Math. Inform. (2019). https:\/\/doi.org\/10.33581\/2520-6508-2019-3-129-133","journal-title":"J. Belarusian State Univ. Math. Inform."},{"issue":"3","key":"530_CR130","doi-asserted-by":"publisher","first-page":"147","DOI":"10.13069\/jacodesmath.617239","volume":"6","author":"I Ozbek","year":"2019","unstructured":"Ozbek, I., Temiz, F., Siap, I.: A generalization of the Mignotte\u2019s scheme over Euclidean domains and applications to secret image sharing. J. Algebra Comb. Discrete Struct. Appl. 6(3), 147\u2013161 (2019). https:\/\/doi.org\/10.13069\/jacodesmath.617239","journal-title":"J. Algebra Comb. Discrete Struct. Appl."},{"key":"530_CR131","doi-asserted-by":"publisher","unstructured":"Dong, X., Gao, Y., Gao, H.: A new verifiable multi-secret sharing scheme over the ring of Gaussian Integers. In: 2018 2nd IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC), pp. 58\u201361 (2018). https:\/\/doi.org\/10.1109\/IMCEC.2018.8469290","DOI":"10.1109\/IMCEC.2018.8469290"},{"key":"530_CR132","doi-asserted-by":"crossref","unstructured":"Munuera-Merayo, D.: On Mignotte secret sharing schemes over Gaussian Integers (2021). https:\/\/arxiv.org\/abs\/2104.06361","DOI":"10.13069\/jacodesmath.v9i3.211"},{"issue":"3","key":"530_CR133","first-page":"1","volume":"9","author":"D Munuera-Merayo","year":"2022","unstructured":"Munuera-Merayo, D.: On Mignotte secret sharing schemes over Gaussian Integers. J. Algebra Comb. Discrete Appl. 9(3), 1\u201310 (2022)","journal-title":"J. Algebra Comb. Discrete Appl."},{"key":"530_CR134","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.dam.2020.06.006","volume":"285","author":"O Ersoy","year":"2020","unstructured":"Ersoy, O., Pedersen, T.B., Anarim, E.: Homomorphic extensions of CRT-based secret sharing. Discrete Appl. Math. 285, 317\u2013329 (2020). https:\/\/doi.org\/10.1016\/j.dam.2020.06.006","journal-title":"Discrete Appl. Math."},{"key":"530_CR135","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6577492","author":"G Mehmood","year":"2021","unstructured":"Mehmood, G., Khan, M.S., Waheed, A., Zareei, M., Fayaz, M., Sadad, T., Kama, N., Azmi, A.: An efficient and secure session key management scheme in Wireless Sensor Network. Complexity (2021). https:\/\/doi.org\/10.1155\/2021\/6577492","journal-title":"Complexity"},{"key":"530_CR136","doi-asserted-by":"publisher","unstructured":"Uluta\u015f, G., Uluta\u015f, M., Nabiyev, V.: Secret sharing scheme based on Mignotte\u2019s scheme. In: 2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU), pp. 291\u2013294 (2011). https:\/\/doi.org\/10.1109\/SIU.2011.5929644. (in Turkish)","DOI":"10.1109\/SIU.2011.5929644"},{"issue":"6","key":"530_CR137","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.jisa.2014.10.013","volume":"19","author":"KM Faraoun","year":"2014","unstructured":"Faraoun, K.M.: A novel fast and provably secure ($$t, n$$)-threshold secret sharing construction for digital images. J. Inf. Secur. Appl. 19(6), 331\u2013340 (2014). https:\/\/doi.org\/10.1016\/j.jisa.2014.10.013","journal-title":"J. Inf. Secur. Appl."},{"issue":"03","key":"530_CR138","doi-asserted-by":"publisher","first-page":"1250023","DOI":"10.1142\/S0219691312500233","volume":"10","author":"C Hu","year":"2012","unstructured":"Hu, C., Liao, X., Xiao, D.: Secret image sharing based on chaotic map and Chinese remainder theorem. Int. J. Wavelets Multiresolut. Inf. Process. 10(03), 1250023 (2012). https:\/\/doi.org\/10.1142\/S0219691312500233","journal-title":"Int. J. Wavelets Multiresolut. Inf. Process."},{"key":"530_CR139","unstructured":"Tsai, M.H., Chen, C.-C.: A Study on secret image sharing. In: The Sixth International Workshop on Image Media Quality and Its Applications, IMQA2013, Tokyo, Japan, pp. 135\u2013139 (2013). https:\/\/www.cs.nthu.edu.tw\/~cchen\/Research\/2013IMQA.pdf"},{"key":"530_CR140","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.sigpro.2013.12.022","volume":"99","author":"C-C Chang","year":"2014","unstructured":"Chang, C.-C., Huynh, N.-T., Le, H.-D.: Lossless and unlimited multi-image sharing based on Chinese remainder theorem and Lagrange interpolation. Signal Process. 99, 159\u2013170 (2014). https:\/\/doi.org\/10.1016\/j.sigpro.2013.12.022","journal-title":"Signal Process."},{"key":"530_CR141","doi-asserted-by":"publisher","unstructured":"Chuang, T.-W., Chen, C.-C., Chien, B.: Image sharing and recovering based on Chinese remainder theorem. In: 2016 International Symposium on Computer, Consumer and Control (IS3C), pp. 817\u2013820 (2016). https:\/\/doi.org\/10.1109\/IS3C.2016.208","DOI":"10.1109\/IS3C.2016.208"},{"key":"530_CR142","unstructured":"Koikara, R., Paul, A., Yoo, K.-Y.: Multilevel threshold secret image sharing based on the Chinese remainder theorem. In: Int\u2019l Conf. Security and Management (SAM\u201916), pp. 318\u2013323 (2016). http:\/\/worldcomp-proceedings.com\/proc\/p2016\/SAM9726.pdf"},{"issue":"5","key":"530_CR143","doi-asserted-by":"publisher","first-page":"7087","DOI":"10.1007\/s11042-016-3364-8","volume":"76","author":"W Hua","year":"2017","unstructured":"Hua, W., Liao, X.: A secret image sharing scheme based on piecewise linear chaotic map and Chinese remainder theorem. Multimed. Tools Appl. 76(5), 7087\u20137103 (2017). https:\/\/doi.org\/10.1007\/s11042-016-3364-8","journal-title":"Multimed. Tools Appl."},{"key":"530_CR144","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-319-68542-7_36","volume-title":"Cloud Computing and Security","author":"X Yan","year":"2017","unstructured":"Yan, X., Lu, Y., Liu, L., Wan, S., Ding, W., Liu, H.: Chinese remainder theorem-based secret image sharing for ($$k, n$$) threshold. In: Sun, X., Chao, H.-C., You, X., Bertino, E. (eds.) Cloud Computing and Security, pp. 433\u2013440. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68542-7_36"},{"key":"530_CR145","doi-asserted-by":"publisher","DOI":"10.3390\/sym10080340","author":"J Chen","year":"2018","unstructured":"Chen, J., Liu, K., Yan, X., Liu, L., Zhou, X., Tan, L.: Chinese remainder theorem-based secret image sharing with small-sized shadow images. Symmetry (2018). https:\/\/doi.org\/10.3390\/sym10080340","journal-title":"Symmetry"},{"key":"530_CR146","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.dsp.2018.07.015","volume":"82","author":"X Yan","year":"2018","unstructured":"Yan, X., Lu, Y., Liu, L., Liu, J., Yang, G.: Chinese remainder theorem-based two-in-one image secret sharing with three decoding options. Digit. Signal Process. 82, 80\u201390 (2018). https:\/\/doi.org\/10.1016\/j.dsp.2018.07.015","journal-title":"Digit. Signal Process."},{"issue":"12","key":"530_CR147","doi-asserted-by":"publisher","first-page":"16727","DOI":"10.1007\/s11042-018-7023-0","volume":"78","author":"T Duseja","year":"2019","unstructured":"Duseja, T., Deshmukh, M.: Image compression and encryption using Chinese remainder theorem. Multimed. Tools Appl. 78(12), 16727\u201316753 (2019). https:\/\/doi.org\/10.1007\/s11042-018-7023-0","journal-title":"Multimed. Tools Appl."},{"key":"530_CR148","doi-asserted-by":"publisher","first-page":"59278","DOI":"10.1109\/ACCESS.2019.2914515","volume":"7","author":"L Tan","year":"2019","unstructured":"Tan, L., Lu, Y., Yan, X., Liu, L., Li, L.: Weighted secret image sharing for a $$(k, n)$$ threshold based on the Chinese remainder theorem. IEEE Access 7, 59278\u201359286 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2914515","journal-title":"IEEE Access"},{"key":"530_CR149","doi-asserted-by":"publisher","first-page":"75113","DOI":"10.1109\/ACCESS.2019.2921612","volume":"7","author":"L Li","year":"2019","unstructured":"Li, L., Lu, Y., Yan, X., Liu, L., Tan, L.: Lossless $$(k, n)$$ -Threshold image secret sharing based on the Chinese remainder theorem without auxiliary encryption. IEEE Access 7, 75113\u201375121 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2921612","journal-title":"IEEE Access"},{"issue":"3","key":"530_CR150","doi-asserted-by":"publisher","first-page":"335","DOI":"10.22266\/ijies2022.0630.28","volume":"15","author":"AS Choudhary","year":"2022","unstructured":"Choudhary, A.S., Kumar, M., Keshari, S.: Effective secret image sharing using enhanced Chinese remainder theorem. Int. J. Intell. Eng. Syst. 15(3), 335\u2013342 (2022). https:\/\/doi.org\/10.22266\/ijies2022.0630.28","journal-title":"Int. J. Intell. Eng. Syst."},{"key":"530_CR151","doi-asserted-by":"publisher","DOI":"10.3390\/math10121959","author":"L Li","year":"2022","unstructured":"Li, L., Lu, Y., Liu, L., Sun, Y., Wang, J.: Practical secret image sharing based on the Chinese remainder theorem. Mathematics (2022). https:\/\/doi.org\/10.3390\/math10121959","journal-title":"Mathematics"},{"key":"530_CR152","doi-asserted-by":"publisher","DOI":"10.1016\/j.heliyon.2023.e14918","author":"C Wang","year":"2023","unstructured":"Wang, C., Peng, Y., Liang, Z., Wang, Y., Ke, G., Jin, Z.: Reversible extended secret image sharing with ability to correct errors based on Chinese remainder theorem. Heliyon (2023). https:\/\/doi.org\/10.1016\/j.heliyon.2023.e14918","journal-title":"Heliyon"},{"key":"530_CR153","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-023-17270-0","author":"F Hu","year":"2023","unstructured":"Hu, F., Li, W., Yu, N.: $$(k, n)$$ threshold secret image sharing scheme based on Chinese remainder theorem with authenticability. Multimed. Tools Appl. (2023). https:\/\/doi.org\/10.1007\/s11042-023-17270-0","journal-title":"Multimed. Tools Appl."},{"issue":"3","key":"530_CR154","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1080\/17445760.2017.1334777","volume":"34","author":"JC Anjos","year":"2019","unstructured":"Anjos, J.C., Galibus, T., Geyer, C.F., Fedak, G., Costa, J.P.C., Pereira, R., Freitas, E.P.: Fast-Sec: an approach to secure Big Data processing in the cloud. Int. J. Parallel Emerg. Distrib. Syst. 34(3), 272\u2013287 (2019)","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"key":"530_CR155","doi-asserted-by":"publisher","unstructured":"Yang, Y., Du, W.: Secret sharing scheme based on Chinese remainder theorem in Cloud Computing. In: 2019 4th International Conference on Mechanical, Control and Computer Engineering (ICMCCE), pp. 618\u20136183 (2019). https:\/\/doi.org\/10.1109\/ICMCCE48743.2019.00143","DOI":"10.1109\/ICMCCE48743.2019.00143"},{"key":"530_CR156","doi-asserted-by":"publisher","unstructured":"Jency Rubia, J., Sherin Shibi, C., Balajishanmugam, V., Babitha Lincy, R.: High-performance computing based on Residue Number System: A Review. In: 9th International Conference on Advanced Computing and Communication Systems (ICACCS), vol. 1, pp. 639\u2013647 (2023). https:\/\/doi.org\/10.1109\/ICACCS57279.2023.10112959","DOI":"10.1109\/ICACCS57279.2023.10112959"},{"key":"530_CR157","doi-asserted-by":"publisher","DOI":"10.3390\/s23073738","author":"A Gladkov","year":"2023","unstructured":"Gladkov, A., Shiriaev, E., Tchernykh, A., Deryabin, M., Babenko, M., Nesmachnow, S.: DT-RRNS: routing protocol design for secure and reliable distributed smart sensors communication systems. Sensors (2023). https:\/\/doi.org\/10.3390\/s23073738","journal-title":"Sensors"},{"key":"530_CR158","doi-asserted-by":"publisher","unstructured":"Sinha, D., Chaki, R., Bhattacharya, U.: A secure routing scheme in MANET with CRT based secret sharing. In: 2012 15th International Conference on Computer and Information Technology (ICCIT), pp. 225\u2013229 (2012). https:\/\/doi.org\/10.1109\/ICCITechn.2012.6509789","DOI":"10.1109\/ICCITechn.2012.6509789"},{"key":"530_CR159","doi-asserted-by":"publisher","unstructured":"Tao, K., Gao, X.: Research of secret data storage based on Asmuth\u2013Bloom threshold. In: 2012 IEEE Symposium on Electrical & Electronics Engineering (EEESYM), pp. 323\u2013325 (2012). https:\/\/doi.org\/10.1109\/EEESym.2012.6258655","DOI":"10.1109\/EEESym.2012.6258655"},{"key":"530_CR160","first-page":"33","volume":"5","author":"HEM Vissia","year":"2015","unstructured":"Vissia, H.E.M., Galibus, T.V., Gaufrov, S.V., Kaganovich, D.M., et al.: Mobile application security based on secret sharing. Vestn. Brest State Tech. Univ. Phisics Math. Inform. 5, 33\u201336 (2015). (in Russian)","journal-title":"Vestn. Brest State Tech. Univ. Phisics Math. Inform."},{"issue":"9","key":"530_CR161","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1080\/17517575.2015.1120347","volume":"10","author":"YI Muhammad","year":"2016","unstructured":"Muhammad, Y.I., Kaiiali, M., Habbal, A., Wazan, A.S., Ilyasu, A.S.: A secure data outsourcing scheme based on Asmuth\u2013Bloom secret sharing. Enterp. Inf. Syst. 10(9), 1001\u20131023 (2016). https:\/\/doi.org\/10.1080\/17517575.2015.1120347","journal-title":"Enterp. Inf. Syst."},{"key":"530_CR162","unstructured":"Galibus, T., Krasnoproshin, V., Freitas, E., Albuquerque, R., Sousa\u00a0Junior, R., Zaleski, A., Vissia, H.E.M.: Offline security for corporate mobile application. In: CSIST\u20192016. BSU, Minsk (2016)"},{"issue":"4","key":"530_CR163","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/s11036-017-0839-4","volume":"22","author":"T Galibus","year":"2017","unstructured":"Galibus, T., et al.: Offline mode for corporate mobile client security architecture. Mob. Netw. Appl. 22(4), 743\u2013759 (2017). https:\/\/doi.org\/10.1007\/s11036-017-0839-4","journal-title":"Mob. Netw. Appl."},{"issue":"218","key":"530_CR164","first-page":"218","volume":"1","author":"YN Kocherov","year":"2021","unstructured":"Kocherov, Y.N., Samoylenko, D.V.: Development of a reliable RTC communication method based on a group data separation method based on a residual class system. Izvest. SFedU. Eng. Sci. 1(218), 218\u2013235 (2021). (in Russian)","journal-title":"Izvest. SFedU. Eng. Sci."},{"key":"530_CR165","unstructured":"Shenets, N.N.: Modular secret sharing and electronic voting systems. Vestnik BSU. Seria 1, Phisics. Math. Inform. (1), 101\u2013104 (2011). (in Russian)"},{"key":"530_CR166","unstructured":"Shenets, N.N.: Modular secret sharing and its applications. Ph.D. thesis, Republic of Belarus (2011). (in Russian)"},{"key":"530_CR167","unstructured":"Galibus, T.V.: Modular secret sharing over Noetherian rings. Ph.D. thesis, Republic of Belarus (2012). (in Russian)"},{"key":"530_CR168","unstructured":"Dr\u0103gan, C.C.: Security of CRT-based secret sharing schemes. Ph.D. Thesis, Turkey (2013)"},{"key":"530_CR169","unstructured":"Munuera-Merayo, D.: Secret sharing schemes over Gaussian integers. Mr. Thesis, Spain (2021). https:\/\/uvadoc.uva.es\/handle\/10324\/49613. (in Spanish)"},{"key":"530_CR170","unstructured":"Chuang, T.C.: Implementation of image sharing based on Chinese remainder theorem. National Tsing Hua University, Hsinchu, Taiwan. Mr. Thesis (2015)"},{"key":"530_CR171","doi-asserted-by":"publisher","unstructured":"Simmons, G.J.: How to (really) share a secret. In: Goldwasser, S. (ed.) Advances in Cryptology\u2014CRYPTO\u2019 88, pp. 390\u2013448. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_30","DOI":"10.1007\/0-387-34799-2_30"},{"issue":"2","key":"530_CR172","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T Tassa","year":"2007","unstructured":"Tassa, T.: Hierarchical threshold secret sharing. J. Cryptol. 20(2), 237\u2013264 (2007). https:\/\/doi.org\/10.1007\/s00145-006-0334-8","journal-title":"J. Cryptol."},{"key":"530_CR173","doi-asserted-by":"publisher","unstructured":"Jafari, A., Khazaei, S.: Partial secret sharing schemes. IEEE Trans. Inf. Theory 69(8), 5364\u20135385 (2023). https:\/\/doi.org\/10.1109\/TIT.2023.3265093","DOI":"10.1109\/TIT.2023.3265093"},{"key":"530_CR174","doi-asserted-by":"publisher","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: Keeping shares of a secret secret (extended abstract). In: Odlyzko, A.M. (ed.) Advances in Cryptology\u2014CRYPTO\u2019 86, pp. 251\u2013260. Springer, Berlin (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_19","DOI":"10.1007\/3-540-47721-7_19"},{"key":"530_CR175","unstructured":"Martin, K.M.: Challenging the adversary model in secret sharing schemes. In: Coding and Cryptography II. Proceedings of the Royal Flemish Academy of Belgium for Science and the Arts, pp. 45\u201363 (2008). http:\/\/www.isg.rhul.ac.uk\/~martin\/files\/Brusselsfinal.pdf"},{"key":"530_CR176","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/3-540-48970-3_15","volume-title":"Information Security and Privacy","author":"KM Martin","year":"1999","unstructured":"Martin, K.M., Pieprzyk, J., Safavi-Naini, R., Wang, H.: Changing thresholds in the absence of secure channels. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds.) Information Security and Privacy, pp. 177\u2013191. Springer, Berlin (1999). https:\/\/doi.org\/10.1007\/3-540-48970-3_15"},{"key":"530_CR177","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-540-30564-4_22","volume-title":"Selected Areas in Cryptography","author":"V Nikov","year":"2005","unstructured":"Nikov, V., Nikova, S.: On proactive secret sharing schemes. In: Handschuh, H., Hasan, M.A. (eds.) Selected Areas in Cryptography, pp. 308\u2013325. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/978-3-540-30564-4_22"},{"issue":"4","key":"530_CR178","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00189262","volume":"9","author":"W-A Jackson","year":"1996","unstructured":"Jackson, W.-A., Martin, K.M., O\u2019Keefe, C.M.: Ideal secret sharing schemes with multiple secrets. J. Cryptol. 9(4), 233\u2013250 (1996). https:\/\/doi.org\/10.1007\/BF00189262","journal-title":"J. Cryptol."},{"issue":"9","key":"530_CR179","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/ecjc.4430720906","volume":"72","author":"M Ito","year":"1989","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. Part III Fundam. Electron. Sci. 72(9), 56\u201364 (1989). https:\/\/doi.org\/10.1002\/ecjc.4430720906","journal-title":"Electron. Commun. Jpn. Part III Fundam. Electron. Sci."},{"key":"530_CR180","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02945-9","volume-title":"A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics","author":"H Cohen","year":"1993","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics. Springer, Berlin (1993)"},{"key":"530_CR181","doi-asserted-by":"publisher","first-page":"366","DOI":"10.4236\/jis.2023.144021","volume":"14","author":"LFZ Zheng","year":"2023","unstructured":"Zheng, L.F.Z., Tian, K.: An unbounded fully homomorphic encryption scheme based on ideal lattices and Chinese remainder theorem. J. Inf. Secur. 14, 366\u2013395 (2023). https:\/\/doi.org\/10.4236\/jis.2023.144021","journal-title":"J. Inf. Secur."}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-024-00530-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-024-00530-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-024-00530-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T15:12:42Z","timestamp":1729005162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-024-00530-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,1]]},"references-count":181,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,11]]}},"alternative-id":["530"],"URL":"https:\/\/doi.org\/10.1007\/s11416-024-00530-4","relation":{},"ISSN":["2263-8733"],"issn-type":[{"value":"2263-8733","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,1]]},"assertion":[{"value":"14 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}