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

Building upon previous work on the relation between secrecy and channelresolvability, we revisit a secrecy proof for the multiple-access channel (MAC)from the perspective of resolvability. In particular, we refine and extend theproof to obtain novel results on the second-order achievable rates. Then wecharacterize the resolvability region of the memoryless MAC by establishing aconceptually simple converse proof for resolvability that relies on the uniformcontinuity of Shannon's entropy with respect to the variational distance. Wediscuss the operational meaning of the information theoretic concept ofsemantic security from the viewpoint of Ahlswede's General Theory ofInformation Transfer and show interesting implications on the resilienceagainst a large class of attacks even if no assumption can be made about thedistributions of the transmitted messages. Finally we provide details on howthe resolvability results can be used to construct a wiretap code that achievessemantic security.

The MAC Resolvability Region, Semantic Security and Its Operational Implications