Efficient Provably Secure Public Key Steganography

Tri Van Le

Paper 2003/156 Original: eprint.iacr.org/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
Publication info: Preprint.
History: 2003-11-25: last updated; 2003-08-06: published
Short URL: https://ia.cr/2003/156
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2003/156,
      author = {Tri Van Le},
      title = {Efficient Provably Secure Public Key Steganography},
      howpublished = {Cryptology {ePrint} Archive, Paper 2003/156},
      year = {2003},
      url = {https://eprint.iacr.org/2003/156}
}