A tree based recursive information hiding scheme

Abhishek Parakh, Subhash Kak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

This paper presents a k-out-of-n recursive information hiding scheme based on an n-ary tree data structure. In recursive hiding of information, the user encodes additional information in the shares of the secret, intended to be originally shared, without an expansion in the size of the latter. The proposed scheme has applications in secure distributed storage and information dispersal protocols. It may be used as a steganographic channel to transmit hidden information, which may be used for authentication and verification of shares and the reconstructed secret itself.

Original languageEnglish (US)
Title of host publication2010 IEEE International Conference on Communications, ICC 2010
DOIs
StatePublished - 2010
Event2010 IEEE International Conference on Communications, ICC 2010 - Cape Town, South Africa
Duration: May 23 2010May 27 2010

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Conference

Conference2010 IEEE International Conference on Communications, ICC 2010
CountrySouth Africa
CityCape Town
Period5/23/105/27/10

Keywords

  • Recursive hiding of information
  • Secret sharing
  • Visual cryptography

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A tree based recursive information hiding scheme'. Together they form a unique fingerprint.

  • Cite this

    Parakh, A., & Kak, S. (2010). A tree based recursive information hiding scheme. In 2010 IEEE International Conference on Communications, ICC 2010 [5502430] (IEEE International Conference on Communications). https://doi.org/10.1109/ICC.2010.5502430