Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SAT, MICT, WBS, RCC (Joint) [detail] |
2024-05-16 14:40 |
Miyazaki |
KITEN Convention hall (Miyazaki) (Primary: On-site, Secondary: Online) |
Illumination-light xASK-CodeSK System using (2,2)-Threshold Secret Sharing Scheme Junya Yada, Yusuke Kozawa, Hiromasa Habuchi (Ibaraki Univ.) |
(To be available after the conference date) [more] |
|
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 |
SIP, IT, RCS |
2024-01-18 09:30 |
Miyagi |
(Primary: On-site, Secondary: Online) |
A Fundamental Study on Group Key Distribution Using Error Correction Coding Based on Wireless Physical Layer Secret Key Agreement Seiju Yoshida, Hideichi Sasaoka, Hisato Iwai, Ibi Shinsuke (Doshisha) IT2023-30 SIP2023-63 RCS2023-205 |
Group secret key agreement methods in the wireless physical layer include group key distribution using a one-time pad ch... [more] |
IT2023-30 SIP2023-63 RCS2023-205 pp.1-6 |
SIP, IT, RCS |
2024-01-18 10:20 |
Miyagi |
(Primary: On-site, Secondary: Online) |
A quantum secret sharing scheme with a 4-qubit code Yuta Aoki, Mitsuru Tada (Chiba Univ.) IT2023-38 SIP2023-71 RCS2023-213 |
A Quantum secret sharing (QSS) is a cryptographic scheme in which a secret quantum state is converted into multiple quan... [more] |
IT2023-38 SIP2023-71 RCS2023-213 pp.45-50 |
ICSS |
2023-11-16 16:50 |
Ishikawa |
IT Business Plaza Musashi and Online (Primary: On-site, Secondary: Online) |
Improved Secret Key Transport mechanism using CSIDH Kodai Hayashida, Atsuko Miyaji (Osaka Univ.) ICSS2023-59 |
In order to achieve secure communication over public networks,it is common practice to share keys and communicate
confi... [more] |
ICSS2023-59 pp.57-63 |
LOIS, SITE, ISEC |
2023-11-09 13:05 |
Hiroshima |
Satellite Campus Hiroshima (Primary: On-site, Secondary: Online) |
An Optimization Method for Share Reconstruction in (k,n)-Threshold Secret Sharing Scheme Using Exclusive-OR Shogo Naganuma, Yutaro Taki, Shigeru Fujita (CIT) ISEC2023-56 SITE2023-50 LOIS2023-14 |
We propose a method to reduce the computational complexity of generating extended shares and regenerating lost shares in... [more] |
ISEC2023-56 SITE2023-50 LOIS2023-14 pp.10-17 |
IT |
2023-08-04 11:50 |
Kanagawa |
Shonan Institute of Technology (Primary: On-site, Secondary: Online) |
Mutually Orthogonal Latin Squares and Computational Complexity of the Secret Sharing Scheme Kouyou Nakamura, Shunpei Nishikawa, Tomoko Adachi (SIST) IT2023-26 |
The Secret Sharing Scheme proposed by Shamir in 1979, allows a secret to be shared among a set of participants. A Latin ... [more] |
IT2023-26 pp.68-73 |
QIT (2nd) |
2022-12-09 17:30 |
Kanagawa |
Keio Univ. (Primary: On-site, Secondary: Online) |
Advance Sharing of Quantum Shares for Classical Secrets Rina Miyajima, Ryutaroh Matsumoto (Tokyo Tech) |
Secret sharing schemes for classical secrets can be classified into classical secret sharing schemes and quantum secret ... [more] |
|
MICT, WBS |
2022-07-25 13:35 |
Okayama |
Okayama Prefectural University |
Illumination-light Communication System Using Three (2,2) Threshold Secret Sharing System Yuma Yamada, Ryohei Hazu, Yusuke Kozawa, Hiromasa Habuchi (Ibaraki Univ.) WBS2022-28 MICT2022-28 |
In this paper, a lightning optical communication system, that uses a frame consisting of three bits as a share of the se... [more] |
WBS2022-28 MICT2022-28 pp.65-69 |
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-11 15:35 |
Online |
Online |
Improvement of Evaluation Function for Unable Combine Portion in Transformation Protocol Ryunosuke Takita, Koichi Koizumi, Masanobu Ohtsuki (Fukushima KOSEN) IT2021-129 ISEC2021-94 WBS2021-97 RCC2021-104 |
In the conventional Transformation Protocol, the evaluation of the Unable Combine Portion, which is a set of cards conta... [more] |
IT2021-129 ISEC2021-94 WBS2021-97 RCC2021-104 pp.270-274 |
CQ, ICM, NS, NV (Joint) |
2021-11-26 14:50 |
Fukuoka |
JR Hakata Stn. Hakata EkiHigashi Rental Room (Primary: On-site, Secondary: Online) |
Data privacy protection method for blockchain by using secret sharing Jun Nakajima (Hitachi) ICM2021-27 |
As a form of blockchain(BC), permission-type BC that forms a BC network between specific organizations is attracting att... [more] |
ICM2021-27 pp.21-26 |
WBS, IT, ISEC |
2021-03-04 15:20 |
Online |
Online |
A Consideration on Evolving Secret Sharing Schemes using Linear Codes Hiroki Toriumi, Nozomi Miya, Hajime Jinushi (Aoyama Gakuin Univ.) IT2020-132 ISEC2020-62 WBS2020-51 |
Shamir's $(k, n)$ threshold scheme is realized by linear codes on a finite field. This scheme requires that an upper bou... [more] |
IT2020-132 ISEC2020-62 WBS2020-51 pp.123-127 |
IA |
2021-01-29 14:50 |
Online |
Online |
Retrieval in Confined Decodable Secret Sharing Scheme by Comparison of Difference in Coefficient between Shares and Its Security Evaluation Tomo Nakamura, Ryohei Yoshitomi, Eiji Fukutomi, Masahiro Fukumoto (KUT) IA2020-34 |
In Kochi Prefecture, an effort is underway to back up medical data such as electronic medical records to remote location... [more] |
IA2020-34 pp.21-26 |
QIT (2nd) |
2020-12-10 13:00 |
Online |
Online |
[Poster Presentation]
Efficient decoding of stabilizer code by local operations and classical communication Koki Shiraishi (The Univ. of Tokyo), Hayata Yamasaki (IQOQI Vienna), Mio Murao (The Univ. of Tokyo) |
We present protocols to decode one-qubit quantum information encoded in a multiple qubit state according to a stabilizer... [more] |
|
ISEC |
2020-05-20 13:30 |
Online |
Online |
[Invited Talk]
Almost Optimal Cheating-Detectable (2,2,n) Ramp Secret Sharing Scheme (from CANDAR 2019) Tomoki Agematsu (NEC), Satoshi Obana (Hosei univ) ISEC2020-6 |
In this research, we consider a strong ramp secret sharing scheme (SSS for short) that can detect cheating. A cheating-d... [more] |
ISEC2020-6 p.27 |
ICSS, IPSJ-SPT |
2020-03-02 10:40 |
Okinawa |
Okinawa-Ken-Seinen-Kaikan (Cancelled but technical report was issued) |
Information Rates for Multiple Assignment Schemes on Five Participants Yutaro Shimma, Kouya Tochikubo (Nihon Univ.) ICSS2019-70 |
In 1988, Ito et al. proposed a multiple assignment secret sharing scheme. Their scheme can realize an arbitrary access s... [more] |
ICSS2019-70 pp.13-18 |
WBS, MICT |
2019-07-16 12:30 |
Ibaraki |
Ibaraki University(Mito Campus) |
[Poster Presentation]
A Study of Data Transmission Scheme in Interference Area of VN-CSK Illumination Light Communication Keisuke Manaka, Liyuan Chen, Hiromasa Habuchi, Yusuke Kozawa (Ibaraki Univ.) WBS2019-13 MICT2019-14 |
The Variable N-parallel code-shift-keying (VN-CSK) system has been proposed for solving the dimming control problem and ... [more] |
WBS2019-13 MICT2019-14 pp.17-22 |
EA, SIP, SP |
2019-03-14 13:30 |
Nagasaki |
i+Land nagasaki (Nagasaki-shi) |
[Poster Presentation]
Steganographic Audio Secret Sharing Shu Noguchi, Kotaro Sonoda, Senya Kiyasu (Nagasaki Univ.) EA2018-108 SIP2018-114 SP2018-70 |
In the usual secret sharing scheme, one secret information is managed by distributing it amongst a group of shares of se... [more] |
EA2018-108 SIP2018-114 SP2018-70 pp.55-60 |
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 |