Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT |
2023-08-04 11:25 |
Kanagawa |
Shonan Institute of Technology (Primary: On-site, Secondary: Online) |
Constructing Visual Cryptography Schemes for Multiple Images Using SAT Technology Tako Hiroaki (Univ. Yamanashi), Xiao-Nan Lu (Gifu Univ.), Nabeshima Hidetomo (Univ. Yamanashi) IT2023-25 |
The visual cryptography scheme (VCS) is a type of secret sharing scheme for images.The VCS uses matrices called basis ma... [more] |
IT2023-25 pp.62-67 |
IT, ISEC, RCC, WBS |
2022-03-10 10:05 |
Online |
Online |
On the Optimal Construction of a Visual Cryptography Scheme with Multiple Access Structures Raiki Ioki, Hiroki Koga (Tsukuba Univ.) IT2021-84 ISEC2021-49 WBS2021-52 RCC2021-59 |
A visual cryptography scheme (VCS) is a secret sharing scheme for digital images. In a VCS, two $n×m$ Boolean matrices, ... [more] |
IT2021-84 ISEC2021-49 WBS2021-52 RCC2021-59 pp.7-12 |
IT |
2020-12-01 13:50 |
Online |
Online |
[Invited Talk]
Recent Progress in Visual Cryptography Hiroki Koga (Univ. Tsukuba) IT2020-25 |
Visual cryptography is one of secret sharing schemes for digital images. More than 25 years have passed from the proposa... [more] |
IT2020-25 pp.7-12 |
ISEC, SITE, ICSS, EMM, HWS, BioX, IPSJ-CSEC, IPSJ-SPT [detail] |
2019-07-23 14:25 |
Kochi |
Kochi University of Technology |
A simulation of a 3-D visual cryptography using holography Takumi Takazawa, Kazuhiro Suzuki, Naoki Takada (Kochi Univ.) ISEC2019-34 SITE2019-28 BioX2019-26 HWS2019-29 ICSS2019-32 EMM2019-37 |
With the development of technologies for acquiring and recording data of 3-D objects, their security and privacy protect... [more] |
ISEC2019-34 SITE2019-28 BioX2019-26 HWS2019-29 ICSS2019-32 EMM2019-37 pp.187-192 |
EMM |
2019-03-14 11:05 |
Okinawa |
TBD |
Improvement of the Quality of Visual Secret Sharing Schemes with Shares Containing Inconsistent Pixels Mariko Fujii, Tomoharu Shibuya (Sophia Univ.) EMM2018-114 |
(k, n)-visual secret sharing scheme ((k, n)-VSSS) is a method to divide a secret image into n images called shares that ... [more] |
EMM2018-114 pp.123-128 |
WBS, IT, ISEC |
2018-03-08 11:40 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Constructions of the (3,n) and (4,n) Threshold Visual Cryptography Using Combinatorial Designs and Their Performance Evaluation Kotaro Okada, Hiroki Koga (Univ. of Tsukuba) IT2017-109 ISEC2017-97 WBS2017-90 |
A $(t,n)$-threshold visual cryptography scheme ($(t,n)$-VCS) is a kind of secret sharing schemes for digital images.
In... [more] |
IT2017-109 ISEC2017-97 WBS2017-90 pp.37-42 |
EMM, IT |
2017-05-23 14:50 |
Yamagata |
Yamagata University(Yonezawa Campus) |
A Construction of a Progressive (3,n)-Threshold Visual Cryptography Scheme Using a BIBD and Its Optimality Koutaro Okada, Hiroki Koga (Univ. of Tsukuba) IT2017-15 EMM2017-15 |
In the $(t,n)$-threshold visual cryptography scheme ($(t,n)$-VCS for short), a secret black-white image is encoded to $n... [more] |
IT2017-15 EMM2017-15 pp.85-90 |
EMM |
2014-05-16 13:30 |
Tokyo |
|
[Tutorial Lecture]
Secret Sharing Schemes and Visual Secret Sharing Schemes
-- What is in common and what is different? -- Mitsugu Iwamoto (UEC) EMM2014-7 |
A Secret sharing scheme is one of the most fundamental primitives in cryptography and has a lot of applications. A visu... [more] |
EMM2014-7 pp.35-40 |
ISEC, IT, WBS |
2011-03-04 15:45 |
Osaka |
Osaka University |
Visual Card Games for Boys and Girls Miyuki Uno, Mikio Kano (Ibaraki Univ.) IT2010-103 ISEC2010-107 WBS2010-82 |
We propose a new visual card game for two parties
$\mathcal{X}$ and $\mathcal{Y}$ of boys and girls, respectively.
In ... [more] |
IT2010-103 ISEC2010-107 WBS2010-82 pp.227-234 |
ISEC |
2010-09-10 16:35 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A general construction method of visual secret sharing scheme with share rotations Mitsugu Iwamoto, Yang Li, Kazuo Sakiyama, Kazuo Ohta (Univ. of Electro-Comm.) ISEC2010-49 |
In this paper, we discuss a visual secret sharing scheme with multiple secret images including share rotation operations... [more] |
ISEC2010-49 pp.67-74 |
ISEC |
2007-09-07 10:15 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
visual cryptography schemes with tree access structure for many images Miyuki Uno, Mikio Kano (Ibaraki Univ.) ISEC2007-77 |
Let $T$ be a tree with order $n$ and maximum degree three.
We construct a
visual cryptography sharing scheme with $T$... [more] |
ISEC2007-77 pp.25-31 |
IT |
2007-07-20 09:30 |
Hyogo |
Kobe Univ. |
Proposal of a (2,2)-threshold visual secret sharing scheme for many images Taishi Sakamoto, Hiroki Koga (Univ. of Tsukuba) IT2007-15 |
The $(k,n)$-visual secret sharing scheme
(hereafter, the $(k,n)$-VSSS for short)
is a unconventional secret sharing ... [more] |
IT2007-15 pp.1-6 |
ISEC |
2007-05-18 15:35 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
Visual Cryptography Schemes with Cyclic Structure for Many Images Miyuki Uno, Mikio Kano (Ibaraki Univ.) ISEC2007-12 |
We consider a visual cryptography sharing scheme with
cyclic access structure
for $n$ secret images and $n$ shares,
... [more] |
ISEC2007-12 pp.77-84 |