Open AccessA Generator Based Polynomial with Secret Encryption Scheme for Secure Data Sharing and Privacy in Multi-Party/Federated-Cloud Computation
Author(s) -
V. Keerthi,
T. Anuradha Prof.
Publication year - 2020
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.b8270.1210220
Subject(s) - computer science , encryption , secure multi party computation , computer security , assertion , generator (circuit theory) , cloud computing , scheme (mathematics) , computation , secret sharing , theoretical computer science , polynomial , data sharing , cryptography , algorithm , mathematics , power (physics) , programming language , medicine , mathematical analysis , physics , alternative medicine , quantum mechanics , pathology , operating system
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.