The Secure Storage Capacity of a DNA Wiretap Channel Model

  title={The Secure Storage Capacity of a DNA Wiretap Channel Model},
  author={Praneeth Kumar Vippathalla and Navin Kashyap},
  journal={2022 IEEE International Symposium on Information Theory (ISIT)},
In this paper, we propose a strategy for making DNA-based data storage information-theoretically secure through the use of wiretap channel coding. This motivates us to extend the shuffling-sampling channel model of Shomorony and Heckel (2021) to include a wiretapper. Our main result is a characterization of the secure storage capacity of our DNA wiretap channel model, which is the maximum rate at which data can be stored within a pool of DNA molecules so as to be reliably retrieved by an… 

Figures from this paper



DNA-Based Storage: Models and Fundamental Limits

This work introduces a new channel model, which it is called the noisy shuffling-sampling channel, which captures three key distinctive aspects of DNA storage systems: (1) the data is written onto many short DNA molecules; (2) the molecules are corrupted by noise during synthesis and sequencing and (3) theData is read by randomly sampling from the DNA pool.

Private DNA Sequencing: Hiding Information in Discrete Noise

Upper and lower bounds to the solution of the problem of hiding a binary random variable X (a genetic marker) with the additive noise provided by mixing DNA samples are characterized, using mutual information as a privacy metric.

Strong Secrecy From Channel Resolvability

It is shown that at least for symmetric wiretap channels, random capacity- based constructions fail to achieve the strong secrecy capacity, while channel-resolvability-based constructions achieve it.

The DNA Storage Channel: Capacity and Error Probability Bounds

The lower bound on the reliability function is achieved under a universal decoder, and reveals that the dominant error event is that of outage – the event in which the capacity of the channel induced by the DNA molecule sampling operation does not support the target rate.

Coding Theorems for Noisy Permutation Channels

  • A. Makur
  • Computer Science, Mathematics
    IEEE Transactions on Information Theory
  • 2020
The achievability proof yields a conceptually simple, computationally efficient, and capacity achieving coding scheme for such DMCs, and the results suggest that noisy permutation channel capacities are generally quite agnostic to the parameters that define the D MCs.

An Upper Bound on the Capacity of the DNA Storage Channel

An information theoretic study of the storage channel-the entity that formulates the relation between stored and sequenced strands is conducted, and an upper bound on the Shannon capacity of the channel is derived.

The Bee-Identification Problem: Bounds on the Error Exponent

It is proved that joint decoding of barcodes provides a significantly better exponent compared to separate decoding followed by permutation inference and the upper bound on the bee-identification exponent meets the lower bound obtained using TRC with joint barcode decoding.

Information-Spectrum Methods in Information Theory

This paper presents a meta-analyses of source and channel coding for multi-Terminal Information Theory, which aims to clarify the role of symbols in the development of information theory.

Hiding messages in DNA microdots

This work has developed a DNA-based, doubly steganographic technique for sending secret messages that is first camouflaged within the enormous complexity of human genomic DNA and then further concealed by confining this sample to a microdot.

A Characterization of the DNA Data Storage Channel

It is found that errors within molecules are mainly due to synthesis and sequencing, while imperfections in handling and storage lead to a significant loss of sequences.