Skip Navigation

The Computer Journal 2003 46(2):202-212; doi:10.1093/comjnl/46.2.202
© 2003 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Blundo, C.
Right arrow Articles by Galdi, C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Hiding Information in Image Mosaics

Carlo Blundo1 and Clemente Galdi1,2

1 Dipartimento di Informatica ed Applicazioni, Cryptography and Network Security Group, Università di Salerno, 84081 Baronissi (SA), Italy Email: clegal@dia.unisa.it 2 Corresponding author.

Information hiding techniques allow a player to hide secret information in some innocent-looking document. In this paper we present a novel approach to information hiding. We investigate the possibility of embedding information using the intrinsic entropy of some classes of cover-documents. In particular we provide algorithms for embedding any binary string in an image mosaic (i.e. an image consisting of a mosaic of smaller images). The algorithms presented allow different levels of security for the information hidden in the cover-document. We also show some techniques to reduce the amount of information the users have to secretly store.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.