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/

Zendy Plus

Presents the zaia usage as premium feature

ZAIA

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the access of premium content as premium feature

Premium Content

Zendy Tools

Zendy Open

We consider the problem of detecting and locating modifications in signeddata to ensure partial data integrity. We assume that the data is divided into$n$ blocks (not necessarily of the same size) and that a threshold $d$ is givenfor the maximum amount of modified blocks that the scheme can support. Wepropose efficient algorithms for signature and verification steps which providea reasonably compact signature size, for controlled sizes of $d$ with respectto $n$. For instance, for fixed $d$ the standard signature size gets multipliedby a factor of $O(\log n)$, while allowing the identification of up to $d$modified blocks. Our scheme is based on nonadaptive combinatorial group testingand cover-free families.

Locating modifications in signed data for partial data integrity