Zero-Delay and Causal Secure Source Coding

Yonatan Kaspi, Neri Merhav

Research output: Contribution to journalArticlepeer-review

Abstract

We investigate the combination between causal/zero-delay source coding and information-theoretic secrecy. Two source coding models with secrecy constraints are considered. We start by considering zero-delay perfectly secret lossless transmission of a memoryless source. We derive bounds on the key rate and coding rate needed for perfect zero-delay secrecy. In this setting, we consider two models that differ by the ability of the eavesdropper to parse the bit-stream passing from the encoder to the legitimate decoder into separate messages. We also consider causal source coding with a fidelity criterion and side information at the decoder and the eavesdropper. Unlike the zero-delay setting where variable-length coding is traditionally used but might leak information on the source through the length of the codewords, in this setting, since delay is allowed, block coding is possible. We show that in this setting, a separation of encryption and causal source coding is optimal.

Original languageEnglish
Article number7185455
Pages (from-to)6238-6250
Number of pages13
JournalIEEE Transactions on Information Theory
Volume61
Issue number11
DOIs
StatePublished - 1 Nov 2015

Keywords

  • Causal source coding
  • Rate-Distortion
  • Secrecy
  • Side Information
  • Source coding
  • Zero-delay

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this