• DocumentCode
    1780465
  • Title

    Secure successive refinement with degraded side information

  • Author

    Xu, D. ; Kittichokechai, Kittipong ; Oechtering, Tobias J. ; Skoglund, Mikael

  • Author_Institution
    Sch. of Electr. Eng., R. Inst. of Technol. (KTH), Stockholm, Sweden
  • fYear
    2014
  • fDate
    June 29 2014-July 4 2014
  • Firstpage
    2674
  • Lastpage
    2678
  • Abstract
    In this paper, we investigate the problem of successive refinement with side information (SI) under secrecy constraint. In particular, under classical successive refinement coding scheme, there are degraded SI sequences Yn and Zn at two decoders and En at the eavesdropper. Based on the status of two switches, three different cases are investigated. In case 1 and 3, the eavesdropper only observes output of encoder 1 and 2, respectively, while in case 2, the eavesdropper observes outputs of both encoder 1 and 2. The Markov chain X - Y - (Z, E) holds in all cases. The equivocation is measured by the normalized entropy of source sequence conditioned on the observation of eavesdropper. We completely characterize the rate-distortion-equivocation regions for all three cases, and show that layered coding is optimal. Finally, a binary source example is given.
  • Keywords
    Markov processes; binary codes; decoding; entropy codes; rate distortion theory; source coding; Markov chain; SI; binary source; decoders; degraded side information; eavesdropper; layered coding; rate-distortion-equivocation regions; secrecy constraint; secure successive refinement; source sequence entropy; successive refinement coding scheme; switches status; Decoding; Encoding; Markov processes; Random variables; Silicon; Zinc;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ISIT), 2014 IEEE International Symposium on
  • Conference_Location
    Honolulu, HI
  • Type

    conf

  • DOI
    10.1109/ISIT.2014.6875319
  • Filename
    6875319