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

Hiding a secret is needed in many situations. Secret sharing plays animportant role in protecting information from getting lost, stolen, ordestroyed and has been applicable in recent years. A secret sharing scheme is acryptographic protocol in which a dealer divides the secret into several piecesof share and one share is given to each participant. To recover the secret, thedealer requires a subset of participants called access structure. In thispaper, we present a multi-secret sharing scheme over a local ring based onlinear complementary dual codes using Blakley's method. We take a large secretspace over a local ring that is greater than other code-based schemes andobtain a perfect and almost ideal scheme.

Linear complementary dual code-based Multi-secret sharing scheme