SHARING SECRECT DATA USING SUPERVISED LEARNING ALGORITHM ON BIG DATA

Article Sidebar

PDF
Published: Apr 24, 2021
Keywords:
Secret Sharing, Big Data Security, Adaptive Optimization Technique, Distributed Storage, Data Leakage, Prevention, Key Management Systems, Slepian-Wolf Coding

Main Article Content

Dr. M. Prabakaran,
Assistant Professor, PG & Research Department of Computer Science, Government Arts College, Ariyalur-621713

Abstract

Secret sharing plan has been applied ordinarily in appropriated capacity for Big Data. It is a technique for securing revaluated information against information spillage and for getting key administration frameworks. The mystery is dispersed among a gathering ofmembers where every member holds a portion of the mystery. The mystery can be possibly remade when an adequate number ofshares are reconstituted. Albeit numerous mystery sharing plans have been proposed, they are as yet wasteful as far as offer size,correspondence cost and capacity cost; and furthermore need strength as far as precise offer fix. In this paper, interestingly, wepropose another mystery sharing plan in view of Slepian-Wolf coding. Our plan can accomplish an ideal offer size using the straightforward binning thought of the coding. It additionally improves the specific offer fix highlight by which the offers stay predictable regardless of whether theyare adulterated. We show, through tests, how our plan can fundamentally decrease the correspondence and capacity cost while stillhaving the option to help direct offer fix utilizing lightweight selective OR (XOR) activity for quick calculation.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
Prabakaran, , D. M. (2021). SHARING SECRECT DATA USING SUPERVISED LEARNING ALGORITHM ON BIG DATA. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(8), 3302–3311. Retrieved from https://turcomat.org/index.php/turkbilmat/article/view/14308
Issue
Vol. 12 No. 8 (2021)
Section
Research Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

You are free to:

  1. Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
  2. Adapt — remix, transform, and build upon the material for any purpose, even commercially.
  3. The licensor cannot revoke these freedoms as long as you follow the license terms.

Under the following terms:

  1. Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  2. No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

Notices:

You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .

No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.

References

Z. Yu, Y. Wei, B. Ramkumar, and Y. Guan, “An Efficient Schemefor Securing XOR Network Coding against

Pollution Attacks”, 28thConf. on Computer Communication (INFOCOM’09), pp. 406-414, 2009.

R. Matsumoto, “Strong Security of the Strongly MultiplicativeRamp Secret Sharing Based on Algebraic

Curves”, IEICE Trans. OnFundamentals, vol. E98-A, no. 7, pp.1576-1578, 2015.

O. Farras, T. Hansen, T. Kaced, and C. Padro, “Optimal Non-perfectUniform Secret Sharing Schemes”, 34th

Cryptology Conf. on Advancesin Cryptology (CRYPTO’14), pp. 217-234, 2014.

J. Li, X. Chen, M. Li, J. Li, P.P.C. Lee, and W. Lou, “Secure Deduplicationwith Efficient and Reliable

Convergent Key Management”,IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 6, pp. 1615-1625, 2014.

Y. Wang, “Privacy-Preserving Data Storage in Cloud Using ArrayBP-XOR Codes”, IEEE Trans. Cloud

Comput., vol. 3, no. 4, pp. 425-435, 2015.

J. Kurihara, S. Kiyomoto, K. Fukushima, and T. Tanaka, “A fast(3,n)-threshold secret sharing scheme using

exclusive-OR operations”,IEICE Trans. on Fundamentals, vol. E91-A, no. 1, pp. 127-138,2008.

J. Kurihara, S. Kiyomoto, K. Fukushima, and T. Tanaka, “A new(k; n)-threshold secret sharing scheme and

its extension”, 11th conf.on Information Security (ISC’08), pp. 455-470, 2008.

L. Chunli, X. Jia, L. Tian, J. Jing, and M. Sun, “Efficient IdealThreshold Secret Sharing Schemes Based on

EXCLUSIVE-OR Operations”,4th Conf. on Network and System Security (NSS’10), pp.136-143, 2010.

Y. Wang, and Y. Desmedt, “Efficient Secret Sharing SchemesAchieving Optimal Information Rate”, Inf.

Theory Workshop (ITW),pp. 516-520, 2014.

J. Kurihara, S. Kiyomoto, K. Fukushima, and T. Tanaka, “A fast(k-L-N)-Threshold Ramp secret sharing

scheme”, IEICE Trans. Onfundamentals, doi:10.1587/transfun.E92.A.1808, 2009.

M. Kurihara, and H. Kuwakado, “Secret Sharing Schemes Basedon Minimum Bandwidth Regenerating

Codes”, Symposium on Inf.Theory and its Applications (ISITA’12), pp. 255-259, 2012.

J. Liu, H. Wang, M. Xian, and K. Huang, “A Secure and EfficientScheme for Cloud Storage against

Eavesdropper”, 15th Conf. OnInformation and Communication Security (ICICS’13), pp. 75-89, 2013.

N. Cai, and W. Raymond, “Secure network coding”, IEEE Int.Symposium Inf. Theory, 2002.

S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft,“XORs in the air: practical wireless

network coding”, IEEE Trans.Netw., vol. 16, no. 3, pp. 497-510, 2008.