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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In a verifiable secret sharing (VSS) scheme, each participant can check cheating by the dealer or the other participants. In this work, we construct a VSS scheme with the strongest level of computational security and prove its security in the standard model. This scheme is secure against active attack and does not use bilinear pairing and hash function.

Game-based security proofs for verifiable secret sharing schemes in the standard model