Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCC, ISEC, IT, WBS |
2024-03-13 - 2024-03-14 |
Osaka |
Osaka Univ. (Suita Campus) |
New Algorithms for Computing a Correct Decoding Probability Exponent and an Error Decoding Probability Exponent with Cost Constraints and their Equivalency Koki Kazama (Waseda Univ.), Akira Kamatsuka (Shonan Institute of Technology), Takahiro Yoshida (Nihon Univ.) IT2023-110 ISEC2023-109 WBS2023-98 RCC2023-92 |
In channel coding, there are two representative previous algorithms for computing cost-constrained correct decoding prob... [more] |
IT2023-110 ISEC2023-109 WBS2023-98 RCC2023-92 pp.232-237 |
ISEC, IT, WBS |
2020-03-10 13:50 |
Hyogo |
University of Hyogo (Cancelled but technical report was issued) |
A Statistical Decision-Theoretic Approach for Measuring Privacy Risk in Information Disclosure Problem Alisa Miyashita, Akira Kamatsuka (Waseda Univ.), Takahiro Yoshida (Yokohama College of Commerce), Toshiyasu Matsushima (Waseda Univ.) IT2019-104 ISEC2019-100 WBS2019-53 |
In this paper, we deal with the problem of database statistics publishing with privacy and utility guarantees. While var... [more] |
IT2019-104 ISEC2019-100 WBS2019-53 pp.95-100 |
ISEC, IT, WBS |
2020-03-11 11:45 |
Hyogo |
University of Hyogo (Cancelled but technical report was issued) |
A Note on the Relationship between Smooth Locally Decodable Codes and Private Information Retrieval Koki Kazama, Akira Kamatsuka (Waseda Univ.), Takahiro Yoshida (Yokohama Col. of Commerce), Toshiyasu Matsushima (Waseda Univ.) IT2019-120 ISEC2019-116 WBS2019-69 |
We focus on smooth locally decodable codes (SLDC) and Private Information Retrieval (PIR).
Recently, the relationship b... [more] |
IT2019-120 ISEC2019-116 WBS2019-69 pp.201-206 |
EMM, IT |
2019-05-23 15:05 |
Hokkaido |
Asahikawa International Conference Hall |
Gradient Coding based on LDGM Codes and Stochastic Gradient Descent Shunsuke Horii (Waseda Univ.), Takahiro Yoshida (Yokohama Col. of Commerce), Manabu Kobayashi, Toshiyasu Matsushima (Waseda Univ.) IT2019-3 EMM2019-3 |
[more] |
IT2019-3 EMM2019-3 pp.13-18 |
EMM, IT |
2019-05-24 09:30 |
Hokkaido |
Asahikawa International Conference Hall |
A Consideration on Extended Ternary Memoryless Sources with a Simple Construction of Binary Compact Codes Nozomi Miya (Aoyama Gakuin Univ.), Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.) IT2019-7 EMM2019-7 |
The complexity of Huffman procedure grows with exponential order of $n$ for the $n$-th degree extended memoryless source... [more] |
IT2019-7 EMM2019-7 pp.31-36 |
SIP, IT, RCS |
2018-01-22 11:15 |
Kagawa |
Sunport Hall Takamatsu |
A Consideration on Conditions of Extended Binary Memoryless Sources where Different Huffman Codes are Constructed
-- A Case that Combined Symbols Belong to the Same Group in the First and Second Steps of the Reduction -- Nozomi Miya (Aoyama Gakuin Univ.), Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.) IT2017-61 SIP2017-69 RCS2017-275 |
Different Huffman codes, i.e., different codeword sets constructed in Huffman coding are given for $n$-th degree extende... [more] |
IT2017-61 SIP2017-69 RCS2017-275 pp.37-42 |
IT, EMM |
2016-05-19 13:40 |
Hokkaido |
Otaru Economic Center |
A Consideration on Relationships between Correlation of Information Stored on Nodes and Coding Efficiency for Cooperative Regenerating Codes Takahiro Yoshida (Yokohama College of Commerce), Toshiyasu Matsushima (Waseda Univ.) IT2016-5 EMM2016-5 |
In this study, we consider cooperative regenerating codes for distributed storage systems.
Cooperative regenerating cod... [more] |
IT2016-5 EMM2016-5 pp.25-30 |
IT |
2013-07-25 15:30 |
Tokyo |
Nishi-Waseda campus, Waseda University |
A Consideration on Modeling and Optimality of Regenerating Codes Considering Security of Shares Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2013-16 |
e consider regenerating codes. Regenerating codes are a class of codes for distributed storage systems that enable a dat... [more] |
IT2013-16 pp.27-32 |
IT, ISEC, WBS |
2013-03-07 14:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
A consideration on minimum storage regenerating codes for functions Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2012-78 ISEC2012-96 WBS2012-64 |
We consider regenerating codes for functions. Regenerating codes are a class of codes for distributed storage systems th... [more] |
IT2012-78 ISEC2012-96 WBS2012-64 pp.107-112 |
IT |
2012-05-25 14:00 |
Fukuoka |
|
A consideration on characteristics of Huffman codes for binary memoryless sources Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.) IT2012-1 |
We consider characteristics of Huffman codes for extended binary memoryless sources. The construction of Huffman codes c... [more] |
IT2012-1 pp.1-6 |
IT |
2011-07-21 15:15 |
Okayama |
Okayama University |
A study of statistical modeling of authentication using PUF Satoru Ishii (Waseda Univ.), Takahiro Yoshida (Aoyama Univ.), Shunsuke Horii, Toshiyasu Matsushima (Waseda Univ.) IT2011-13 |
Nowadays, it is pointed out that storing the secret in nonvolatile memory of the device has a chance to leak the secret ... [more] |
IT2011-13 pp.19-24 |
ISEC, IT, WBS |
2011-03-04 13:50 |
Osaka |
Osaka University |
A consideration on unconditionally secure key distribution schemes considering leakage of secret information of key distribution centers Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2010-112 ISEC2010-116 WBS2010-91 |
A key distribution scheme (KDS) is a method of distributing secret keys in the network. In the conventional KDS, the sec... [more] |
IT2010-112 ISEC2010-116 WBS2010-91 pp.289-294 |
IT |
2011-01-18 11:40 |
Nara |
|
Lower bounds on the memory size of entities for a ramp key distribution scheme and an optimal construction Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2010-57 |
The security notion of conventional ramp key distribution scheme (KDS) is that fraudulent centers and users can get part... [more] |
IT2010-57 pp.19-24 |
VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2010-12-01 11:05 |
Fukuoka |
Kyushu University |
A study of the success rate of MIA under various probability density function estimations Yohei Hori (AIST), Takahiro Yoshida (Aoyama Univ.), Toshihiro Katashita, Akashi Satoh (AIST) RECONF2010-48 |
The pfrobability density function (PDF) of voltage of AES hardware
module is estimated in various ways and applied to ... [more] |
RECONF2010-48 pp.55-60 |
RECONF |
2010-09-17 13:15 |
Shizuoka |
Shizuoka University (Faculty of Eng., Hall 2) |
Quantitative Performance Evaluation of Arbiter PUFs on FPGAs Yohei Hori (AIST), Takahiro Yoshida (Chuo Univ.), Toshihiro Katashita, Akashi Satoh (AIST) RECONF2010-37 |
The quantitative performance indicators of Physical Unclonable
Functions (PUFs)---Randomness, Steadiness, Correctness,... [more] |
RECONF2010-37 pp.115-120 |
WBS, IT, ISEC |
2009-03-10 15:15 |
Hokkaido |
Hakodate Mirai Univ. |
Multi-receiver Authentication Codes with Secrecy and Revocation Capability for Multiple Message Transmissions Shinpei Chiba, Takahiro Yoshida (Chuo Univ), Nuttapong Attrapadung (AIST), Hideki Imai (Chuo Univ/AIST) IT2008-90 ISEC2008-148 WBS2008-103 |
In this paper,we consider an extension of Multi-receiver Authentication Codes for Multiple Message Transmissions(MRA-MMT... [more] |
IT2008-90 ISEC2008-148 WBS2008-103 pp.301-306 |
ISEC |
2007-09-07 09:50 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
A Study on Hierarchical Secret Sharing Schemes Using Product and Concatenated Codes Chigusa Kawashima (Polytechnic Univ.), Takahiro Yoshida (Waseda Univ.), Tomoko K. Matsushima (Polytechnic Univ.) ISEC2007-76 |
In this paper, two secret sharing schemes with a hierarchical access structure are investigated. One scheme is based on ... [more] |
ISEC2007-76 pp.17-23 |