A Generator Based Polynomial with Secret Encryption Scheme for Secure Data Sharing and Privacy in Multi-Party/Federated-Cloud Computation
V. Keerthi1, T. Anuradha2

1Mrs. V. Keerthi, Master of Computer Science from Sri Venkateswara University, Tirupathi.
2Prof. T. Anuradha, Master of Computer Applications from Sri Padmavathi Mahila Viswa Vidyalayam, Tirupati.

Manuscript received on November 13, 2020. | Revised Manuscript received on November 26, 2020. | Manuscript published on December 10, 2021. | PP: 78-82 | Volume-10 Issue-2, December 2020 | Retrieval Number: 100.1/ijitee.B82701210220| DOI: 10.35940/ijitee.B8270.1210220
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Now a days exploring and analyzing or mining data in various ways give insights into future for invention and plays a critical role in decision making. For accurate analytical assertion of data, accurate results is essential. So hiding data and at the same time preserving data privacy is necessary to protect externals from attacks. An successful process for sharing sensitive information for data processing, validation and publication should then be deducted. In this paper Polynomial Based Encryption Secret Sharing Scheme (PBESSS) for Multi-Party mechanism is proposed that allows multiple parties to exchange secret data between them at the same time secret data is encrypted so as to protect from untrusted parties. Each party will have stronger protection by selected own polynomial with primitive root number ‘generator’ and the secret data will be in cryptic form and it can be found by each party after final computation of polynomials. This multi-party mechanism can be applied to federated cloud for computation securely. 
Keywords: Multi-Party computation-secret data sharing scheme-polynomial- Galois-Field-cloud-federation.