CryptoDB
Efficient Provably Secure Public Key Steganography
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2003-11870, title={Efficient Provably Secure Public Key Steganography}, booktitle={IACR Eprint archive}, keywords={foundation, steganography, public key, computational security, coding theory.}, url={http://eprint.iacr.org/2003/156}, note={ tll6935@garnet.acns.fsu.edu 12381 received 5 Aug 2003, last revised 24 Nov 2003}, author={Tri Van Le}, year=2003 }