Distortion-free steganography for polygonal meshes

Alexander Bogomjakov, Craig Gotsman, Martin Isenburg

Research output: Contribution to journalConference articlepeer-review

50 Scopus citations


We present a technique for steganography in polygonal meshes. Our method hides a message in the indexed representation of a mesh by permuting the order in which faces and vertices are stored. The permutation is relative to a reference ordering that encoder and decoder derive from the mesh connectivity in a consistent manner. Our method is distortion-free because it does not modify the geometry of the mesh. Compared to previous stegano-graphic methods for polygonal meshes our capacity is up to an order of magnitude better. Our steganography algorithm is universal and can be used instead of the standard permutation steganography algorithm on arbitrary datasets. The standard algorithm runs in Ω(n2 log2 nloglogn) time and achieves optimal O(nlogn) bit capacity on datasets with n elements. In contrast, our algorithm runs in O(n) time, achieves a capacity that is only one bit per element less than optimal, and is extremely simple to implement.

Original languageEnglish (US)
Pages (from-to)637-642
Number of pages6
JournalComputer Graphics Forum
Issue number2
StatePublished - 2008
Externally publishedYes
Event29th Annual Conference on European Association for Computer Graphics, EUROGRAPHICS 2008 - Crete, Greece
Duration: Apr 14 2008Apr 18 2008

All Science Journal Classification (ASJC) codes

  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Distortion-free steganography for polygonal meshes'. Together they form a unique fingerprint.

Cite this