English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Secret sharing is a new alternative for outsourcing data in a secure way.Itavoids the need for time consuming encryption decryption process and also thecomplexity involved in key management.The data must also be protected fromuntrusted cloud service providers.Secret sharing based solution provides secureinformation dispersal by making shares of the original data and distribute themamong different servers.Data from the threshold number of servers can be usedto reconstruct the original data.It is often impractical to distribute dataamong large number of servers.We have to achieve a trade off between securityand efficiency.An optimal choice is to use a $(2,3)$ or $(2,4)$ thresholdsecret sharing scheme, where the data are distributed as shares among three orfour servers and shares from any two can be used to construct the originaldata.This provides both security,reliability and efficiency.We propose someefficient and easy to implement secret sharing schemes in this regard based onnumber theory and bitwise XOR.These schemes are also suitable for securesharing of images.Secret image sharing based on Shamir's schemes are lossy andinvolves complicated Lagrange interpolation.So the proposed scheme can also beeffectively utilized for lossless sharing of secret images.

Simple and Efficient Secret Sharing Schemes for Sharing Data and Image