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

A recent trend in cryptography is to protect data and computation againstvarious side-channel attacks. Dziembowski and Faust (TCC 2012) have proposed ageneral way to protect arbitrary circuits against any continual leakageassuming that: (i) the memory is divided into the parts, which leaksindependently (ii) the leakage in each observation is bounded (iii) the circuithas an access to a leak-free component, which samples random orthogonalvectors. The pivotal element of their construction is a protocol for refreshingthe so-called Leakage-Resilient Storage (LRS).  In this note, we present a more efficient and simpler protocol for refreshingLRS under the same assumptions. Our solution needs O(n) operations to fullyrefresh the secret (in comparison to {\Omega}(n^2) for a protocol ofDziembowski and Faust), where n is a security parameter that describes themaximal amount of leakage in each invocation of the refreshing procedure

Efficient Refreshing Protocol for Leakage-Resilient Storage Based on the Inner-Product Extractor