{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T07:17:47Z","timestamp":1772695067859,"version":"3.50.1"},"reference-count":22,"publisher":"IGI Global","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,1,1]]},"abstract":"<p>Security is a crucial problem in Cloud computing. Storing and accessing the data in the Cloud is very popular nowadays but the security of data is still lagging behind. Secret sharing schemes are widely used to improve the security of data. In this article, a threshold secret sharing scheme using Newton divided difference interpolating polynomial (TSSNIP) is proposed in a distributed Cloud environment to enhance security of keys used for encryption. The proposed method uses a Newton divided difference interpolating polynomial for key splitting and key reconstruction. A threshold value is used to reconstruct the shares in secret sharing schemes. The proposed work made use of dynamic and random threshold generation method to ensure security of key. The experimental output shows reduced execution time, better security, efficiency, and robustness in the proposed scheme. Furthermore, the proposed scheme also outperformed other secret sharing schemes.<\/p>","DOI":"10.4018\/ijec.2020010101","type":"journal-article","created":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T15:31:41Z","timestamp":1575646301000},"page":"1-15","source":"Crossref","is-referenced-by-count":8,"title":["Secure and Effective Key Management Using Secret Sharing Schemes in Cloud Computing"],"prefix":"10.4018","volume":"16","author":[{"given":"Shahin","family":"Fatima","sequence":"first","affiliation":[{"name":"Integral University, India"}]},{"given":"Shish","family":"Ahmad","sequence":"additional","affiliation":[{"name":"Integral University, India"}]}],"member":"2432","reference":[{"key":"IJeC.2020010101-0","unstructured":"Alapati, K.K. (2018). Group-oriented secret sharing using Shamir\u2019s algorithm. The State University of New Jersey."},{"key":"IJeC.2020010101-1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502417715"},{"key":"IJeC.2020010101-2","doi-asserted-by":"crossref","unstructured":"Blakely, G. R. (1979). Safeguarding cryptographic keys. Proc. of the National Computer Conference (Vol. 48, pp. 313-317). Academic Press.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"IJeC.2020010101-3","doi-asserted-by":"crossref","unstructured":"Caliari, M. (2007). Accurate evaluation of divided differences for polynomial interpolation of exponential propagators. Computing, 80(2), 189-201.","DOI":"10.1007\/s00607-007-0227-1"},{"key":"IJeC.2020010101-4","doi-asserted-by":"crossref","unstructured":"Chen, X.B., Sun, Y.R., Xu, G., Yang, Y.X. (2019). Quantum homomorphic encryption scheme with flexible number of evaluator based on (k, n)-threshold quantum state sharing. Information Sciences, 172-181","DOI":"10.1016\/j.ins.2019.06.009"},{"key":"IJeC.2020010101-5","doi-asserted-by":"crossref","unstructured":"Das, B., & Chakrabarty., D. (2016). Newton\u2019s Divided Difference Interpolation formula: Representation of Numerical Data by a Polynomial curve. International Journal of Mathematics Trends and Technology, 35(3).","DOI":"10.14445\/22315373\/IJMTT-V35P528"},{"issue":"6","key":"IJeC.2020010101-6","article-title":"An Exhaustive Review on Security Issues in Cloud Computing.","volume":"13","author":"S.Fatima","year":"2019","journal-title":"Transactions on Internet and Information Systems"},{"key":"IJeC.2020010101-7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.4"},{"key":"IJeC.2020010101-8","article-title":"A multi-threshold secret image sharing scheme based on the generalized Chinese reminder theorem.","author":"C.Guo","year":"2015","journal-title":"Multimedia Tools and Applications"},{"key":"IJeC.2020010101-9","doi-asserted-by":"crossref","unstructured":"Harn, L., Fuyou., M., Chang., C. C. (2014). Verifiable secret sharing based on the Chinese remainder theorem. Security and Communication Networks, 7(6), 950-957.","DOI":"10.1002\/sec.807"},{"key":"IJeC.2020010101-10","doi-asserted-by":"publisher","DOI":"10.1088\/1755-1315\/81\/1\/012207"},{"issue":"8","key":"IJeC.2020010101-11","doi-asserted-by":"crossref","first-page":"1808","DOI":"10.1587\/transfun.E92.A.1808","article-title":"A Fast (k, L, n) Threshold Ramp Secret Sharing Scheme.","volume":"92","author":"J.Kurihara","year":"2009","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science"},{"key":"IJeC.2020010101-12","doi-asserted-by":"crossref","unstructured":"Kurihara, J., Kiyomoto, S., Fukushima, K., & Tanaka, T. (2008). A New (k, n)-Threshold Secret Sharing Scheme and Its Extension. In Proceedings of Information Security, Taiwan. Academic Press.","DOI":"10.1007\/978-3-540-85886-7_31"},{"key":"IJeC.2020010101-13","first-page":"9","article-title":"Pseudorandom Number Generators.","author":"J.Lehn","year":"1991","journal-title":"Operations Research"},{"key":"IJeC.2020010101-14","author":"P.Li","year":"2018","journal-title":"A construction method of (\ud835\udc61, \ud835\udc58, \ud835\udc5b)-essential secret image sharing scheme. In Signal Processing: Image Communication"},{"key":"IJeC.2020010101-15","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSE.2012.6295163"},{"key":"IJeC.2020010101-16","unstructured":"Mahajan, P., & Sachdeva, A. (2013). A Study of Encryption Algorithms AES, DES and RSA for Security. Global Journal of Computer Science and Technology Network, Web & Security, 13(15)."},{"key":"IJeC.2020010101-17","doi-asserted-by":"crossref","unstructured":"Mamun, A., Rahman. S. S. M., Shaon. T. A., Hossain. M. A. (2017). Security analysis of AES and enhancing its security by modifying s-box with an additional byte. International Journal of Computer Networks & Communications IJCNC, 9(2).","DOI":"10.5121\/ijcnc.2017.9206"},{"key":"IJeC.2020010101-18","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.04.011"},{"key":"IJeC.2020010101-19","doi-asserted-by":"crossref","unstructured":"Nakamura, W., Yamamoto, H., & Chan, T. (2017). A Cheating-Detectable (k, L, n) Ramp Secret Sharing Scheme. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 100(12), 2709-271.","DOI":"10.1587\/transfun.E100.A.2709"},{"key":"IJeC.2020010101-20","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"IJeC.2020010101-21","doi-asserted-by":"crossref","unstructured":"Shyu, S. J., Tsai, Y. Z., & Tsai, Y. T. (2018). Implementing Secret Sharing Scheme in Parallel. Proceedings of theInternational Symposium on Pervasive Systems, Algorithms and Networks. Academic Press.","DOI":"10.1109\/I-SPAN.2018.00068"}],"container-title":["International Journal of e-Collaboration"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=244177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T20:44:04Z","timestamp":1651869844000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJeC.2020010101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijec.2020010101","relation":{},"ISSN":["1548-3673","1548-3681"],"issn-type":[{"value":"1548-3673","type":"print"},{"value":"1548-3681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}