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

About three decades ago it was realized that implementing private channels between parties which can be adaptively corrupted requires an encryption scheme that is secure against selective opening attacks. Whether standard $${\mathsf {IND\text {-}CPA}}$$ security implies security against selective opening attacks has been a major open question since. The only known reduction from selective opening to $${\mathsf {IND\text {-}CPA}}$$ security loses an exponential factor. A polynomial reduction is only known for the very special case where the distribution considered in the selective opening security experiment is a product distribution, i.e., the messages are sampled independently from each other.  In this paper we give a reduction whose loss is quantified via the dependence graph where message dependencies correspond to edges of the underlying message distribution. In particular, for some concrete distributions including Markov distributions, our reduction is polynomial.

Standard Security Does Imply Security Against Selective Opening for Markov Distributions