지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학위논문
- 저자정보
- 지도교수
- 유기영
- 발행연도
- 2015
- 저작권
- 경북대학교 논문은 저작권에 의해 보호받습니다.
이용수1
이 논문의 연구 히스토리 (2)
- 이 논문의 후속연구가 궁금하신가요?
- 연관 학술논문 또는 학술발표를 통해 보다 발전된 연구결과를 확인하실 수 있습니다.
- 이 논문의 연구 히스토리 확인하기
초록· 키워드
오류제보하기
In Shamir''s (t, n)-threshold based secret image sharing schemes, there exists a problem in that a secret image can be reconstructed when an arbitrary attacker becomes aware of the secret image pieces, or when participants operate in malicious collusion. It is called a ''cheating attack'' because it utilizes a polynomial arithmetic operation.
In this thesis, we propose a secret image sharing scheme using a system of polynomial and adversary structures. We prevent cheating attacks by using a system of polynomial arithmetic operations. This system can easily find an attacker''s intervention by using the verification of the duplicate polynomial arithmetic operations from the t polynomials. We reduce shared values by using the adversary structure concept. The system utilizes camouage values instead of real shared values in the sharing procedure. We also provide double authentication.
The experimental results demonstrate the efficiency and security of the proposed scheme. In these experiments, we show that both the performance of the embedding capacity and image distortion ratio of the proposed scheme are superior to previous schemes. In conclusion, we anticipate our scheme to be used efficiently in cloud computing environments in the future.
In this thesis, we propose a secret image sharing scheme using a system of polynomial and adversary structures. We prevent cheating attacks by using a system of polynomial arithmetic operations. This system can easily find an attacker''s intervention by using the verification of the duplicate polynomial arithmetic operations from the t polynomials. We reduce shared values by using the adversary structure concept. The system utilizes camouage values instead of real shared values in the sharing procedure. We also provide double authentication.
The experimental results demonstrate the efficiency and security of the proposed scheme. In these experiments, we show that both the performance of the embedding capacity and image distortion ratio of the proposed scheme are superior to previous schemes. In conclusion, we anticipate our scheme to be used efficiently in cloud computing environments in the future.
목차
표 목차 iii그림 목차 iv1 서론 12 사전 연구 92.1 ?행렬분해 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92.2 접근 구주와 공격자 구조 . . . . . . . . . . . . . . . . . . 102.3 Shamir의 (t, n)- threshold 비밀 공유 기법 . . . 142.3.1 초기화 과정 . . . . . . . . . . . . . . . . . . . . . 162.3.2 비밀 공유값 분배과정 . . . . . . . . . . . . . . . 162.3.3 비밀 복원과정 . . . . . . . . . . . . . . . . . . . 172.4 기존의 비밀이미지 공유 기법? . . . . . . . . . . . . . . . 173 제안 비밀 이미지 공유 기법 ? 243.1 용어의 정의 . . . . . . . . . . . . . . . . . . . . . . . 253.2 초기화 과정 . . . . . . . . . . . . . . . . . . . . . . . 273.3 비밀이미지 공유 과정 . . . . . . . . . . . . . . . . . 283.4 비밀이미지 복원 과정 . . . . . . . . . . . . . . . . . 394 실험 및 성능 평가 ? 464.1 실험 도구와 평가 기준 . . . . . . . . . . . . . . . . . 464.2 성능 분석 . . . . . . . . . . . . . . . . . . . . . . . . . . 504.2.1 삽입 용량에 대한 실험 결과 및 분석? . . . . . . . 504.2.2 이미지 품질에 대한 실혐 결과 및 분석 . . . . . . 534.3 보안 안정성 분석 . . . . . . . . . . . . . . . . . . . . . . 565 결론 60참고문헌 62영문초록 69
최근 본 자료
댓글(0)
0