Abstract: Considering the information loss during sharing multiple secrets, a definition of (n, n) lossless multi- secret sharing visual cryptography is proposed. In addition, based on ring shares, an (n, n) multi-secret visual cryptography scheme, which shares secret images with no information loss, is designed. The experimental results show that in this scheme, not only multiple participants can share multiple secret images, but also secret images can be reconstructed perfectly.