You are looking at a specific version 20031125:044803 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- PDF PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- foundationsteganographypublic keycomputational securitycoding theory.
- Contact author(s)
- tll6935 @ garnet acns fsu edu
- History
- 2003-11-25: last of 6 revisions
- 2003-08-06: received
- See all versions
- Short URL
- https://ia.cr/2003/156
- License
-
CC BY