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

Since the concept of locally decodable codes was introduced by Katz andTrevisan in 2000, it is well-known that information the-oretically secureprivate information retrieval schemes can be built using locally decodablecodes. In this paper, we construct a Byzantine ro-bust PIR scheme using themultiplicity codes introduced by Kopparty et al. Our main contributions are onthe one hand to avoid full replica-tion of the database on each server; thissignificantly reduces the global redundancy. On the other hand, to have a muchlower locality in the PIR context than in the LDC context. This shows thatthere exists two different notions: LDC-locality and PIR-locality. This is madepossible by exploiting geometric properties of multiplicity codes.

A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers