Abstract: In view of the principles of image amalgamation and threshold sharing, a method based on multi-images amalgamation is put forward to deal with (m,n)-threshold image sharing. A sharing map composed of secret images and carrier images is obtained by a set of linearly independent Bernstein polynomial based on multi-image amalgamation. As constructing images, the sharing secret images were recovered by solving polynomial based on the given carrier images, sharing secret images and polynomial coefficient matrix. Experimental results and analysis reveal that this method can be used for hiding information of multiple digital images, and it also has the following characteristics: high efficiency of sub-storage and concealment, high flexibility of choosing sharing transformation matrix, carrier images and public images.