Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCC, ISEC, IT, WBS |
2024-03-14 09:05 |
Osaka |
Osaka Univ. (Suita Campus) |
IT2023-108 ISEC2023-107 WBS2023-96 RCC2023-90 |
In a secret sharing, a dealer generates n shares from a secret and random numbers and distributes the shares to each of ... [more] |
IT2023-108 ISEC2023-107 WBS2023-96 RCC2023-90 pp.220-225 |
RCC, ISEC, IT, WBS |
2024-03-14 09:30 |
Osaka |
Osaka Univ. (Suita Campus) |
Achievable Rate of Coded Caching Scheme with Cache Memories of Different Sizes Akihito Nagaya, Hiroki Koga (Univ. of Tsukuba) IT2023-109 ISEC2023-108 WBS2023-97 RCC2023-91 |
In the coded caching scheme proposed by Maddah-Ali and Niesen,
we usually consider the setup where $K$ users have resp... [more] |
IT2023-109 ISEC2023-108 WBS2023-97 RCC2023-91 pp.226-231 |
RCC, ISEC, IT, WBS |
2023-03-15 13:25 |
Yamaguchi |
(Primary: On-site, Secondary: Online) |
On the Optimal Construction of a Ramp Secret Sharing Scheme Realizing a General Access Structure Shugo Kurokawa, Hiroki Koga (Univ Tsukuba) IT2022-136 ISEC2022-115 WBS2022-133 RCC2022-133 |
[more] |
IT2022-136 ISEC2022-115 WBS2022-133 RCC2022-133 pp.433-438 |
RCC, ISEC, IT, WBS |
2023-03-15 13:50 |
Yamaguchi |
(Primary: On-site, Secondary: Online) |
Evaluation of the Optimal Relative Difference of Superimposed All the Shares for a (t,n)-Threshold Visual Cryptography Scheme Hiroki Koga (Univ. Tsuikuba) IT2022-137 ISEC2022-116 WBS2022-134 RCC2022-134 |
[more] |
IT2022-137 ISEC2022-116 WBS2022-134 RCC2022-134 pp.439-444 |
IT, ISEC, RCC, WBS |
2022-03-10 09:40 |
Online |
Online |
A New Necessary and Sufficient Condition for the Existence of a one-bit Secret Sharing Scheme and Its Applications Ryo Okamura, Hiroki Koga (Univ. Tsukuba) IT2021-83 ISEC2021-48 WBS2021-51 RCC2021-58 |
In a secret sharing scheme, a dealer generates $n$ shares from a secret and distributes the $n$ shares to respective par... [more] |
IT2021-83 ISEC2021-48 WBS2021-51 RCC2021-58 pp.1-6 |
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 |
WBS, IT, ISEC |
2021-03-04 14:55 |
Online |
Online |
An Optimal Construction of the Basis Matrices of a Visual Cryptography Scheme for Multiple Secret Images Allowing the Rotation of Shares Kyohei Sekine, Hiroki Koga (Tsukuba Univ.) IT2020-131 ISEC2020-61 WBS2020-50 |
[more] |
IT2020-131 ISEC2020-61 WBS2020-50 pp.117-122 |
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, IT, WBS |
2020-03-10 15:15 |
Hyogo |
University of Hyogo (Cancelled but technical report was issued) |
Coding Theorems on the Simple Capacity for Digital Fingerprinting Codes Hiroki Koga (Univ. Tsukuba) IT2019-107 ISEC2019-103 WBS2019-56 |
[more] |
IT2019-107 ISEC2019-103 WBS2019-56 pp.113-120 |
IT, ISEC, WBS |
2019-03-08 11:15 |
Tokyo |
University of Electro-Communications |
A Lower Bound of the Joint Capacity of Digital Fingerprinting Codes against a Mixed Attack Tatsuya Sekine, Hiroki Koga (U. Tsukuba) IT2018-119 ISEC2018-125 WBS2018-120 |
Digital fingerprinting codes are embedded in digital contents for protecting copyrights of the digital contents against m... [more] |
IT2018-119 ISEC2018-125 WBS2018-120 pp.269-274 |
IT, ISEC, WBS |
2019-03-08 11:40 |
Tokyo |
University of Electro-Communications |
On the Worst-Case Information Rates of Secret Sharing Schemes for Several Access Structures with Many Participants Takashi Hisatome, Hiroki Koga (U. Tsukuba) IT2018-120 ISEC2018-126 WBS2018-121 |
A secret sharing scheme is a method to share a secret S among participants. Secret sharing schemes are constructed in su... [more] |
IT2018-120 ISEC2018-126 WBS2018-121 pp.275-280 |
WBS, IT, ISEC |
2018-03-08 11:15 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Construction of Secret Sharing Schemes with Small Thresholds for Countably Infinite Participants Takashi Hisatome, Hiroki Koga (Univ. Tsukuba) IT2017-108 ISEC2017-96 WBS2017-89 |
In Shamir's (k, n)-threshold scheme, given a secret S
a dealer generates n shares by using a random polynomial
of de... [more] |
IT2017-108 ISEC2017-96 WBS2017-89 pp.31-36 |
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 |
WBS, IT, ISEC |
2018-03-08 13:50 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Optimal Coded Caching using Linear Programming Shota Kamiya, Hiroki Koga (Univ. Tsukuba) IT2017-112 ISEC2017-100 WBS2017-93 |
Caching is a method of reducing the network traffic by prefetching some part of contents into memories of users. In this... [more] |
IT2017-112 ISEC2017-100 WBS2017-93 pp.55-60 |
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 |
ISEC, WBS, IT |
2017-03-10 13:45 |
Tokyo |
TOKAI University |
Index Coding with Information-Theoretic Secrecy for Unintended Message Mami Takei, Hiroki Koga (Univ. Tsukuba) IT2016-130 ISEC2016-120 WBS2016-106 |
In this paper we consider the index coding problem, where multiple receivers decode respective intended messages from th... [more] |
IT2016-130 ISEC2016-120 WBS2016-106 pp.203-208 |
IT, EMM |
2016-05-19 14:05 |
Hokkaido |
Otaru Economic Center |
An Optimal Construction of Visual Secret Sharing Schemes for General Access Structures Using Integer Programming and its Application Kuya Nishizumi, Hiroki Koga (Univ. Tsukuba) IT2016-6 EMM2016-6 |
In a visual secret sharing scheme for black-white images, a secret image is encoded to $n$ shares by using $n times m$ B... [more] |
IT2016-6 EMM2016-6 pp.31-36 |
IT, ISEC, WBS |
2016-03-10 15:55 |
Tokyo |
The University of Electro-Communications |
Fundamental Properties on a Secret-key Cryptosystem with Guessing Secrecy for Plaintexts and Keys Shota Kamiya, Hiroki Koga (Tsukuba Unv.) IT2015-123 ISEC2015-82 WBS2015-106 |
In this paper we consider a secret-key cryptosystem with a wiretapper who tries to guess the plaintext corresponding to ... [more] |
IT2015-123 ISEC2015-82 WBS2015-106 pp.137-142 |
IT, ISEC, WBS |
2016-03-10 16:20 |
Tokyo |
The University of Electro-Communications |
Evaluation of the Joint Capacity of Digital Fingerprinting Codes against the Interleaving Attack Hiroki Koga, Kaoru Itabashi (Univ. Tsukuba) IT2015-124 ISEC2015-83 WBS2015-107 |
[more] |
IT2015-124 ISEC2015-83 WBS2015-107 pp.143-148 |
IT |
2015-09-04 11:15 |
Ishikawa |
Hakusan Shobutei |
Performance Evaluations of a Digital Watermarking Scheme for Recovery of Erasures in JPEG Images Mami Takei, Hiroki Koga (Tsukuba Univ.) IT2015-39 |
In this paper, we propose a digital watermarking scheme for recovery of erased regions in JPEG images using the LT code,... [more] |
IT2015-39 pp.31-36 |