Information Hiding in Noncoding DNA for DNA Steganography

Kevin Nathanael SANTOSO; Suk-Hwan LEE; Won-Joo HWANG; Ki-Ryong KWON

doi:10.1587/transfun.E98.A.1529

Information Hiding in Noncoding DNA for DNA Steganography

Kevin Nathanael SANTOSO, Suk-Hwan LEE, Won-Joo HWANG, Ki-Ryong KWON

Full Text Views

0

Share
Cite this

Summary :

This paper presents an information hiding method for DNA steganography with which a massive amount of data can be hidden in a noncoding strand. Our method maps the encrypted data to the DNA sequence using a numerical mapping table, before concealing it in the noncoding sequence using a secret key comprising sector length and the random number generator's seed. Our encoding algorithm is sector-based and reference dependent. Using modular arithmetic, we created a unique binary-base translation for every sector. By conducting a simulation study, we showed that our method could preserve amino acid information, extract hidden data without reference to the host DNA sequence, and detect the position of mutation error. Experimental results verified that our method produced higher data capacity than conventional methods, with a bpn (bit-per-nucleotide) value that ranged from approximately 1-2, depending on the selected sector length. Additionally, our novel method detected the positions of mutation errors by the presence of a parity base in each sector.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E98-A No.7 pp.1529-1536

Publication Date: 2015/07/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E98.A.1529

Type of Manuscript: PAPER

Category: Cryptography and Information Security

Authors

Kevin Nathanael SANTOSO
  Pukyong National University
Suk-Hwan LEE
  Tongmyong University
Won-Joo HWANG
  Inje University
Ki-Ryong KWON
  Pukyong National University

Keyword

DNA steganography, noncoding DNA, secret communication, DNA storage, information hiding

Cite this

Copy

Kevin Nathanael SANTOSO, Suk-Hwan LEE, Won-Joo HWANG, Ki-Ryong KWON, "Information Hiding in Noncoding DNA for DNA Steganography" in IEICE TRANSACTIONS on Fundamentals, vol. E98-A, no. 7, pp. 1529-1536, July 2015, doi: 10.1587/transfun.E98.A.1529.
Abstract: This paper presents an information hiding method for DNA steganography with which a massive amount of data can be hidden in a noncoding strand. Our method maps the encrypted data to the DNA sequence using a numerical mapping table, before concealing it in the noncoding sequence using a secret key comprising sector length and the random number generator's seed. Our encoding algorithm is sector-based and reference dependent. Using modular arithmetic, we created a unique binary-base translation for every sector. By conducting a simulation study, we showed that our method could preserve amino acid information, extract hidden data without reference to the host DNA sequence, and detect the position of mutation error. Experimental results verified that our method produced higher data capacity than conventional methods, with a bpn (bit-per-nucleotide) value that ranged from approximately 1-2, depending on the selected sector length. Additionally, our novel method detected the positions of mutation errors by the presence of a parity base in each sector.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E98.A.1529/_p

Copy

@ARTICLE{e98-a_7_1529,
author={Kevin Nathanael SANTOSO, Suk-Hwan LEE, Won-Joo HWANG, Ki-Ryong KWON, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Information Hiding in Noncoding DNA for DNA Steganography},
year={2015},
volume={E98-A},
number={7},
pages={1529-1536},
abstract={This paper presents an information hiding method for DNA steganography with which a massive amount of data can be hidden in a noncoding strand. Our method maps the encrypted data to the DNA sequence using a numerical mapping table, before concealing it in the noncoding sequence using a secret key comprising sector length and the random number generator's seed. Our encoding algorithm is sector-based and reference dependent. Using modular arithmetic, we created a unique binary-base translation for every sector. By conducting a simulation study, we showed that our method could preserve amino acid information, extract hidden data without reference to the host DNA sequence, and detect the position of mutation error. Experimental results verified that our method produced higher data capacity than conventional methods, with a bpn (bit-per-nucleotide) value that ranged from approximately 1-2, depending on the selected sector length. Additionally, our novel method detected the positions of mutation errors by the presence of a parity base in each sector.},
keywords={},
doi={10.1587/transfun.E98.A.1529},
ISSN={1745-1337},
month={July},}

Copy

TY - JOUR
TI - Information Hiding in Noncoding DNA for DNA Steganography
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1529
EP - 1536
AU - Kevin Nathanael SANTOSO
AU - Suk-Hwan LEE
AU - Won-Joo HWANG
AU - Ki-Ryong KWON
PY - 2015
DO - 10.1587/transfun.E98.A.1529
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E98-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2015
AB - This paper presents an information hiding method for DNA steganography with which a massive amount of data can be hidden in a noncoding strand. Our method maps the encrypted data to the DNA sequence using a numerical mapping table, before concealing it in the noncoding sequence using a secret key comprising sector length and the random number generator's seed. Our encoding algorithm is sector-based and reference dependent. Using modular arithmetic, we created a unique binary-base translation for every sector. By conducting a simulation study, we showed that our method could preserve amino acid information, extract hidden data without reference to the host DNA sequence, and detect the position of mutation error. Experimental results verified that our method produced higher data capacity than conventional methods, with a bpn (bit-per-nucleotide) value that ranged from approximately 1-2, depending on the selected sector length. Additionally, our novel method detected the positions of mutation errors by the presence of a parity base in each sector.
ER -