Presentation 2007-09-07
Visual Cryptography Schemes with Tree Access Structure for Many Images
Miyuki UNO, Mikio KANO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Let T be a tree with order n and maximum degree three. We construct a visual cryptography sharing scheme with T access structure for n-1 secret images and n shares, where each vertex and each edge of T correspond to a share and a secret image, respectively, and two shares corresponding to two adjacent vertices of T decode the secret image corresponding to the edge joining them. This secret sharing scheme can be constructed by using Droste's method. However the contrast of its scheme is 1/(2(n-1)). In this paper, a new construction of such a secret sharing scheme with contrast 1/6 for all n is given. It is also shown that this contrast is sharp in some sense.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) visual cryptography / VCS / visual secret sharing / VSS / VCS for many secret images
Paper # ISEC2007-77
Date of Issue

Conference Information
Committee ISEC
Conference Date 2007/8/31(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Visual Cryptography Schemes with Tree Access Structure for Many Images
Sub Title (in English)
Keyword(1) visual cryptography
Keyword(2) VCS
Keyword(3) visual secret sharing
Keyword(4) VSS
Keyword(5) VCS for many secret images
1st Author's Name Miyuki UNO
1st Author's Affiliation Faculty of Engineering, Ibaraki University()
2nd Author's Name Mikio KANO
2nd Author's Affiliation Faculty of Engineering, Ibaraki University
Date 2007-09-07
Paper # ISEC2007-77
Volume (vol) vol.107
Number (no) 209
Page pp.pp.-
#Pages 7
Date of Issue