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
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.9 No.2