earticle

논문검색

Lossless Recovery of Multiple Decryption Capability and Progressive Visual Secret Sharing

초록

영어

In order to solve the problem of non-restoration of PVSS, in this paper, we propose a method to recover the secret image without using the Boolean operation of the matrix matrix. In the lossless recovery process, each column base matrix will be "and" and "exclusive or" operation to get the original image anti-color image, and then the image can be obtained by the lossless secret image, this method can be applied to the general ( k, n ) threshold lossless recovery. In the absence of a computing device, it can be decrypted by superimposing, in the XOR computing device, it can realize lossless recovery. Experimental results show that the proposed algorithm can guarantee the gradual visual secret sharing, complete the restoration of the secret image, the operation is simple and efficient, and has a strong practicability.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Digital Image
 4. Lossless Recovery
  4.1. Theorem 1
  4.2. ( 2, n ) Threshold Lossless Recovery
  4.3. Simulation Results
 5. ( k,n ) Lossless Recovery of Threshold
  5.1. General Threshold Expansion Method
  5.2. ( k,n ) Simulation Results
 6. Conclusion
 References

저자정보

  • Xin Qi Modern Educational Technology Center, Harbin University of Science and Technology, Harbin, China

참고문헌

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.