scholarly journals A Generator Based Polynomial with Secret Encryption Scheme for Secure Data Sharing and Privacy in Multi-Party/Federated-Cloud Computation

2020 ◽  
Vol 10 (2) ◽  
pp. 78-82
Author(s):  
V. Keerthi ◽  
T. Anuradha
Keyword(s):  
Data Privacy ◽  
Primitive Root ◽  
Critical Role ◽  
Sensitive Information ◽  
Secret Sharing Scheme ◽  
Number Generator ◽  
Root Number ◽  
Secret Data ◽  
Sharing Scheme ◽  
Cloud Computation

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.

scholarly journals A Secret data sharing Model for Agriculture Experts in Federated Cloud based on Polynomial based Encrypted Scheme

2021 ◽  
Vol 10 (4) ◽  
pp. 160-167
Author(s):  
V. Keerthi ◽  
T. Anuradha
Keyword(s):  
Data Sharing ◽  
Private Information ◽  
Data Exchange ◽  
Sensitive Information ◽  
Security Threats ◽  
Application Development ◽  
Exchange System ◽  
Secret Data ◽  
Cloud Data ◽  
Sharing Scheme

A shift in computation from PC’s to Cloud allows more number of users to involve in cooperative computation on various categories of data wish to merge their expertise and thereby gain more useful information without leaking their own sensitive information. In the case of data collected from various sensors in an agricultural farm IoT device, the cloud and customers can cooperate to provide adequate services; benefits to experts, research stations related to agriculture. Enormous Agriculture Data generated is related to Soil, weather, Research, crop, farmers, Agriculture marketing, Agri-IOT, fertilizers and pesticide makes cloud as a centralized resource.The exchange of information and research will inculcate a healthy competitive atmosphere in the country in agriculture. Sharing of data, computation, services across cloud boundaries with different clients at different places will enhance expertise suggestions and results to farming field which benefit to improve countries economy. Federation of cloud will allow resource and data sharing, but the security threats severely limit the application development as the usage of data processing or sharing mechanisms will leak private information. So in this research paper, a Polynomial Based Encryption Secret Sharing Scheme (PBESSS)is proposed as Federated cloud data exchange system with multiple cloud instances of the same cloud host or separate computing hosts.

Secret sharing schemes on graphs

2007 ◽  
Vol 44 (3) ◽  
pp. 297-306 ◽  
Author(s):  
László Csirmaz
Keyword(s):  
Secret Sharing ◽  
Constant Factor ◽  
Information Rate ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
Secret Data ◽  
Sharing Scheme ◽  
Dimensional Cube ◽  
Average Size ◽  
Average Information

Given a graph G , a perfect secret sharing scheme based on G is a method to distribute a secret data among the vertices of G , the participants , so that a subset of participants can recover the secret if they contain an edge of G , otherwise they can obtain no information regarding the key. The average information rate is the ratio of the size of the secret and the average size of the share a participant must remember. The information rate of G is the supremum of the information rates realizable by perfect secret sharing schemes.Based on the entropy-theoretical arguments due to Capocelli et al [4], and extending the results of M. van Dijk [7] and Blundo et al [2], we construct a graph Gn on n vertices with average information rate below < 4/log n . We obtain this result by determining, up to a constant factor, the average information rate of the d -dimensional cube.

Withdrawn: A New Secret Sharing Scheme of Large-scale Electronic Voting

2019 ◽  
Vol 12 ◽  
Author(s):  
Ting Liu ◽  
Zhe Cui ◽  
Hongquan Pu ◽  
Jintao Rao
Keyword(s):  
Secret Sharing ◽  
Large Scale ◽  
Electronic Voting ◽  
Secret Sharing Scheme ◽  
Technical Errors ◽  
Electronic Engineering ◽  
Sharing Scheme ◽  
Recent Advances ◽  
Copyright Permission ◽  
Legal Right

The article for the journal Recent Advances in Electrical and Electronic Engineering has been withdrawn on the request of the authors due to some technical errors in the article. Bentham Science apologizes to the readers of the journal for any inconvenience this may cause. BENTHAM SCIENCE DISCLAIMER: It is a condition of publication that manuscripts submitted to this journal have not been published and will not be simultaneously submitted or published elsewhere. Furthermore, any data, illustration, structure or table that has been published elsewhere must be reported, and copyright permission for reproduction must be obtained. Plagiarism is strictly forbidden, and by submitting the article for publication the authors agree that the publishers have the legal right to take appropriate action against the authors, if plagiarism or fabricated information is discovered. By submitting a manuscript the authors agree that the copyright of their article is transferred to the publishers if and when the article is accepted for publication.

Sign in / Sign up

Export Citation Format

Share Document