An effective scheme for secret multimedia information sharing with data-hiding capability is pro-posed. Sharing is accomplished by transforming a set of secret data into an arbitrary number of sets of prede- signed camouflage data and a corresponding set of meaningless data. Based on the characteristic of visualiza-
tion, the scheme can be employed to share, e.g., a landscape image into several portraits and a meaningless image. The scheme can be applied to other types of multimedia data as well, such as voice, video, and so on. Thus, we can share a paragraph of words into several pleasant melodies or share a section of a cartoon movie into several sections of science fiction movies. When a set of secret data is shared, the effect of data hiding is achieved meanwhile because the shares, except the last one, can be meaningful camouflage data sets. For cases of small numbers of shares, a method for improving the scheme is proposed additionally to maintain the data hiding effect. An advantage of the proposed scheme is that only simple logic operations are used in creating the shares and recovering the secret data. Simple logic operations have the properties of fast computation and easy implementation, which make the scheme more practical for real applications. Security is also ensured. The secret data are distributed instead of being centralized. If not all shares are collected, no information about the original secret data can be gained.
Pattern Recognition and Image Analysis 14 (4): 594-600