1 / 8

Visual Secret Sharing Schemes for Plural Secret Images Allowing the Rotation of Shares

Visual Secret Sharing Schemes for Plural Secret Images Allowing the Rotation of Shares. Kazuki Yoneyama Wang Lei Mitsugu Iwamoto Noboru Kunihiro Kazuo Ohta The University of Electro-Communications. Basic VSS schemes V.S. Our scheme. Basic visual secret sharing schemes (VSS)

gladys
Télécharger la présentation

Visual Secret Sharing Schemes for Plural Secret Images Allowing the Rotation of Shares

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. Visual Secret Sharing Schemes for Plural Secret ImagesAllowing the Rotation of Shares Kazuki YoneyamaWang Lei Mitsugu Iwamoto Noboru Kunihiro Kazuo Ohta The University of Electro-Communications

  2. Basic VSS schemes V.S. Our scheme • Basic visual secret sharing schemes (VSS) • By stacking up shares, each secret image is decrypted. • VSS schemes for plural secret images with general access structures allowing the rotation (VSS-PI-R) • Moresecret images can be decrypted compared with the ordinal VSS. • We can construct any VSS-PI-R scheme for given access structure.

  3. In the case of (2, 2)-threshold Basic VSS Shares Decryption (Stacking up) One secret image VSS-PI-R Shares Decryption (Stacking up) Decryption (180 degrees Rotation and Stacking up) Two secret images

  4. Each code set Bp can be obtained from matrix Bpis called basis matrix s.t. Bp= . Construction of VSS-q-PI schemes Secret images A set of shares A combination of pixels in secret images p(1) V1 p(1)p(2)……p(q) p(2) A matrix representingn pixels with m subpixels V2 A code set Bp p(q) Vn

  5. SU1SU2 SL1R(SU2) SU1R(SL2) SL1SL2 Problem • Relation between shares and secret images The permutation of columns R is used in decryption. Share 1 Rotated Share 2 Share 2 SU2 SU1 R(SL2) R(SU2) SL2 SL1 Decrypted image 2 Decrypted image 1 A code set in VSS-q-PI-R schemes cannot be an equivalence class of some matrix .

  6. Main theorem • A new operation vn • The inverse of vn coincides with vn. [Theorem] (informal)Each code set Bp of the VSS-PI-R scheme can be obtained by Bp = {vn(B) : B }

  7. Conclusion • The proposed technique can easily be applied to VSS-PI schemes allowing to reverse the shares besides stacking in decryption. • We will soon submit the paper corresponding to this talk in Cryptology ePrint Archive!

More Related