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

This work addresses private communication with distributed systems in mind.We consider how to best use secret key resources and communication to transmitsignals across a system so that an eavesdropper is least capable to act on thesignals. One of the key assumptions is that the private signals are publiclyavailable with a delay---in this case a delay of one. We find that even if thesource signal (information source) is memoryless, the design and performance ofthe optimal system has a strong dependence on which signals are assumed to beavailable to the eavesdropper with delay.  Specifically, we consider a distributed system with two components whereinformation is known to only one component and communication resources arelimited. Instead of measuring secrecy by "equivocation," we define a valuefunction for the system, based on the actions of the system and the adversary,and characterize the optimal performance of the system, as measured by theaverage value obtained against the worst adversary. The resulting optimalrate-payoff region is expressed with information theoretic inequalities, andthe optimal communication methods are not standard source coding techniques butinstead are methods that stem from synthesizing a memoryless channel.

Using a Secret Key to Foil an Eavesdropper