Cryptology ePrint Archive: Report 2003/156

Efficient Provably Secure Public Key Steganography

Tri Van Le

Abstract: We construct \emph{efficient} public key steganographic schemes, without resort to any peculiar existence assumption such as unbiased functions. This is the first time such a construction is obtained. Not only our constructions are \emph{secure}, but also are essentially optimal and have \emph{no error} decoding. We achieve this by designing a new primitive called $\ch{P}$-codes.

Category / Keywords: foundation, steganography, public key, computational security, coding theory.

Date: received 5 Aug 2003, last revised 24 Nov 2003

Contact author: tll6935 at garnet acns fsu edu

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20031125:044803 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]