A Tree Based Recursive Information Hiding Scheme

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 p...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE International Conference on Communications pp. 1 - 5
Main Authors Parakh, A, Kak, S
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2010
Subjects
Authentication
Communications Society
Computer science
Costs
Cryptographic protocols
Cryptography
Information security
Secure storage
Steganography
Tree data structures
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:1424464021
9781424464029
ISSN:1550-3607
1938-1883
DOI:10.1109/ICC.2010.5502430