Secured secret sharing technique based on chaotic map and DNA encoding with application on secret image

Abstract

This paper shows a secured key-based (k, n) threshold cryptography scheme, where key as well as secret data is shared among set of participants. In this scheme, each share has some bytes missing and these missing bytes can be recovered from a set of exactly k shares, but not less than k. Therefore, each share contains partial secret information which is also encrypted by DNA encoding scheme. Additionally, this paper introduces a concept, where each share information size is varied. More precisely, each share contains a different percentage of secret information and which is strongly dependent on the key. Moreover key sensitivity analysis and statistical analysis prove the robustness against different cryptanalysis attacks and thus ensures high acceptability for information security requirements.

Keywords:

• Shared cryptography
• Logistic chaotic map
• DNA encoding
• Histogram analysis
• Entropy analysis

Acknowledgements

We are thankful to the Department of Computer Science and Engineering of Jadavpur University and Government College of Engineering & Textile Technology, Serampore for giving us the platform for planning and developing this work in the departmental laboratories.