Secrecy in cascade networks

Paul Cuff

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We consider a cascade network where a sequence of nodes each send a message to their downstream neighbor to enable coordination, the first node having access to an information signal. An adversary also receives all the communication as well as additional side-information. The performance of the system is measured by a payoff function over all actions produced by the nodes as well as the adversary. The challenge is to maintain secrecy from the adversary in order thwart his attempt to reduce the payoff. We obtain inner and outer bounds on performance, and give examples where they are tight. From these bounds, we also derive the optimal equivocation that can be achieved in this setting, as a special case.

Original languageEnglish (US)
Title of host publication2013 IEEE Information Theory Workshop, ITW 2013
DOIs
StatePublished - Dec 1 2013
Event2013 IEEE Information Theory Workshop, ITW 2013 - Seville, Spain
Duration: Sep 9 2013Sep 13 2013

Publication series

Name2013 IEEE Information Theory Workshop, ITW 2013

Other

Other2013 IEEE Information Theory Workshop, ITW 2013
CountrySpain
CitySeville
Period9/9/139/13/13

All Science Journal Classification (ASJC) codes

  • Information Systems

Fingerprint Dive into the research topics of 'Secrecy in cascade networks'. Together they form a unique fingerprint.

  • Cite this

    Cuff, P. (2013). Secrecy in cascade networks. In 2013 IEEE Information Theory Workshop, ITW 2013 [6691233] (2013 IEEE Information Theory Workshop, ITW 2013). https://doi.org/10.1109/ITW.2013.6691233