Secure coordination with a two-sided helper

Sanket Satpathy, Paul Cuff

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

8 Scopus citations

Abstract

We investigate the problem of secure source coding with a two-sided helper in a game-theoretic framework. Alice (A) and Helen (H) view iid correlated information sequences Xn and Yn respectively. Alice communicates to Bob (B) at rate R, while H broadcasts a message to both A and B at rate RH. Additionally, A and B share secret key K at rate R 0 that is independent of (Xn, Yn). An active adversary, Eve (E) sees all communication links while having access to a (possibly degraded) version of the past information. We characterize the rate-payoff region for this problem. We also solve the problem when the link from A to B is private. Our work recovers previous results of Schieler-Cuff and Kittichokechai et al.

Original languageEnglish (US)
Title of host publication2014 IEEE International Symposium on Information Theory, ISIT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages406-410
Number of pages5
ISBN (Print)9781479951864
DOIs
StatePublished - 2014
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: Jun 29 2014Jul 4 2014

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/TerritoryUnited States
CityHonolulu, HI
Period6/29/147/4/14

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Secure coordination with a two-sided helper'. Together they form a unique fingerprint.

Cite this