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

The problem of Private Information Retrieval (PIR) from coded storage systemswith colluding, byzantine, and unresponsive servers is considered. An explicitscheme using an $[n,k]$ Reed-Solomon storage code is designed, protectingagainst $t$-collusion and handling up to $b$ byzantine and $r$ unresponsiveservers, when $n>k+t+2b+r-1$. This scheme achieves a PIR rate of$\frac{n-r-(k+2b+t-1)}{n-r}$. In the case where the capacity is known, namelywhen $k=1$, it is asymptotically capacity-achieving as the number of filesgrows. Lastly, the scheme is adapted to symmetric PIR.

Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers