Skip to main content
  • Min Huang - Secret Sharing with Synthetic Steganography

  • Tuesday, November 15, 2011 12:30 PM - 1:30 PM EST
    HAAS Hall Rm. 111
    Purdue University

    A novel secret sharing scheme, called the ( k , n ) threshold scheme, divides secret datainto n separate shares in such a way that knowledge of at least any k of these n sharesmay be used to reconstruct the secret; using any fewer than k pieces will not allow thereconstruction. The shares are distributed to n distinct parties. Share exchanges amongparties for the reconstruction of the secret data may be carried out over insecure publicchannels. To build covert channels for share passing, steganographic methods with theLSB ( least significant bit ) replacement are commonly used. But stego objects generatedfrom these embedding methods may be easily detected by existing advanced steganalyticmethods. We consider synthetic steganography for the purpose of secretly exchangingshares. The basic idea of synthetic steganography is to construct/define stego objectsusing secret information which is quite different from embedding-based steganography.As an example of synthetic steganography, a steganographic tiling system is shown whichis based on a context-sensitive grammar.


    A. Shamir, How to share a secret , Communications of the ACM, Vol. 22, No. 11, pp.363-373, 1979.

    C. C. Thien and J. C. Lin, An image-sharing method with user-friendly shadow images ,IEEE Transactions on Circuits Systems for Video Technology, Vol 13, No. 12, pp. 1161-1169, 2003.

    Y. Y. Lin and R. Z. Wang, Scalable secret image sharing with smaller shadow images , IEEESignal Precessing Letters, Vol. 17, No. 3, pp. 316-319, 2010.

Copyright © Purdue University, all rights reserved. Purdue University is an equal access/equal opportunity university.

Contact the College of Science at for trouble accessing this page. Made possible by grant NSF CCF-0939370