1 / 8

Image Sharing By Chinese Remainder Theorem

Image Sharing By Chinese Remainder Theorem. Group S: S1, S2, S3 Institute of Information Systems & Applications National Tsing Hua University Hsinchu 30013, Taiwan E-mail: 104062613@m104.nthu.edu.tw. Abstract ( 摘要 ).

josefaj
Télécharger la présentation

Image Sharing By Chinese Remainder Theorem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Image Sharing By Chinese Remainder Theorem Group S: S1, S2, S3 Institute of Information Systems & Applications National Tsing Hua University Hsinchu 30013, Taiwan E-mail: 104062613@m104.nthu.edu.tw

  2. Abstract (摘要) Due to the rapid growth of informationacquisition in the era of the Internet ofThings (IoT) and Cloud Computing, the concernabout the security of private informationraises a lot of interests. This proposal aims to investigateimage sharing based on the concept of(k,n)-threshold strategy according to the Chineseremainder theorem (CRT). A secret imageis distributed into n noise-like shadow imagespreserved by n participants instead of asingle carrier. Collecting at least k out of nshadows can reveal the secret image, but fewerthan k shadow images could not. We’ll discussexisting CRT-based sharing methods, proposes asimple CRT-based method and illustrates (3,5)-threshold results for RGB color images.

  3. Motivation and Problem Statement • To avoid the information is carried by only a single individual • Secret data are partitioned into n shadows which are distributed to n participants • By collecting at least k out of n shadows, we can completely recover the original data (information) • A (k,n)-threshold technique based on Chinese Remainder Theorem is adopted and implemented.

  4. Background Review • The secret value S is used to generate n shadows • Any k or more shadows can recover the secret value S • Fewer than k shadows cannot reveal the secret value S • Commonly used (k,n)-threshold schemes for sharing • (1) Shamir [Sham1979] • (2) Blakley [Blak1979] • (3) Asmuth and Bloom [Asmu1983]

  5. Chinese Remainder Theorem

  6. Solution for Chinese Remainder Theorem

  7. Expected Experimental Results Original image Shadow image3 Shadow image1 Shadow image2 Shadow image4 Shadow image5 Revealed image

  8. Major References [1] C.C. Thien and J.C. Lin, ”Secret image sharing,” Compuers & Graphics, vol. 26, no. 1, 765-771, 2002. [2] M.H. Tsai and C.C. Chen, ”A Study on Secret Image Sharing,” The Sixth International Workshop on Image Media Quality and Its Applications, 135-139, Tokyo, Japan, September 12-13, 2013. [3] M. Ulutas, V.V. Nabiyev, and G. Ulutas, ”A New Secret Sharing Technique Based on Asmuth Bloom’s Scheme,” IEEE International Conference on Application of Information and Communication Technologies, 1-5, Baku, Oct. 14-16, 2009. [4]https://en.wikipedia.org/wiki/Secret_sharing_using_the_Chinese_remainder_theorem

More Related