Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
WBS, IT, ISEC |
2018-03-08 11:40 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Reply analysis between Twitter users using machine learning
-- Distinguish real-life/online friends -- Takakuwa Ranka, Sasaki Taroh, Fujioka Atsushi (KU) IT2017-123 ISEC2017-111 WBS2017-104 |
[more] |
IT2017-123 ISEC2017-111 WBS2017-104 pp.115-119 |
WBS, IT, ISEC |
2018-03-08 13:00 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
On the Number of Rounds by Card-based Cryptographic Protocols Using Private Operations Hibiki Ono, Yoshifumi Manabe (Kogakuin Univ.) IT2017-124 ISEC2017-112 WBS2017-105 |
This paper discusses the number of rounds by card-based cryptographic protocols using private operations. Operations tha... [more] |
IT2017-124 ISEC2017-112 WBS2017-105 pp.121-128 |
WBS, IT, ISEC |
2018-03-08 13:25 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Card-Based Cryptographic Protocols with Private Operations which can Prevent Malicious Behaviors Youhei Shimizu, Yuki Kishi, Taroh Sasaki, Atsushi Fujioka (Kanagawa Univ) IT2017-125 ISEC2017-113 WBS2017-106 |
This paper considers malicious behaviors in card-based cryptographic protocols with private operations.
Most of card-ba... [more] |
IT2017-125 ISEC2017-113 WBS2017-106 pp.129-135 |
WBS, IT, ISEC |
2018-03-09 09:25 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
A study on segmented deletion error correction using polar code Hikari Koremura, Haruhiko Kaneko (Tokyo Tech) IT2017-126 ISEC2017-114 WBS2017-107 |
While it has been proved that polar code, proposed by Arıkan, achieves the capacity of any discrete memoryless channel, ... [more] |
IT2017-126 ISEC2017-114 WBS2017-107 pp.137-141 |
WBS, IT, ISEC |
2018-03-09 09:50 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Bayes Optimal AMP Decoder for Sparse Superposition Codes Yuwa Hatae (Kyushu Univ.), Kazushi Mimura (Hiroshima City Univ.), Masanori Kawakita, Jun'ichi Takeuchi (Kyushu Univ.) IT2017-127 ISEC2017-115 WBS2017-108 |
Sparse superposition codes (SS codes), proposed by Barron and Joseph
in 2010, are
a class of error-correcting codes f... [more] |
IT2017-127 ISEC2017-115 WBS2017-108 pp.143-148 |
WBS, IT, ISEC |
2018-03-09 10:15 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Ordered Shuffle-BP Decoding Based on the Loops of LDPC Code Ryoma Sakai, Kazuhiko Yamaguchi (UEC) IT2017-128 ISEC2017-116 WBS2017-109 |
In the Shuffle-BP decoding of LDPC codes, the decoding order has a large influence on BER performance. Previous research... [more] |
IT2017-128 ISEC2017-116 WBS2017-109 pp.149-154 |
WBS, IT, ISEC |
2018-03-09 10:50 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Efficient Scheduling of Serial Iterative Decoding for Zigzag Decodable Fountain Codes Yoshihiro Murayama, Takayuki Nozaki (Yamaguchi Univ.) IT2017-129 ISEC2017-117 WBS2017-110 |
Fountain codes are erasure correcting codes realizing reliable communication systems for the multicast in the Internet.
... [more] |
IT2017-129 ISEC2017-117 WBS2017-110 pp.155-160 |
WBS, IT, ISEC |
2018-03-09 11:15 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Non-binary codes correcting a burst of deletions or insertions Toyohiko Saeki, Takayuki Nozaki (Yamaguchi Univ.) IT2017-130 ISEC2017-118 WBS2017-111 |
This report investigates codes correcting a burst of deletions or insersions.
Levenshtein derived an asymptotic upper b... [more] |
IT2017-130 ISEC2017-118 WBS2017-111 pp.161-166 |
WBS, IT, ISEC |
2018-03-09 11:40 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Asymptotic Analysis of LDPC Codes for Two-Way Relay Channels Yuta Ishimatsu, Satoshi Takabe, Tadashi Wadayama (NITech), Masahito Hayashi (Nagoya Univ.) IT2017-131 ISEC2017-119 WBS2017-112 |
Compute-and-forward relaying is a relaying scheme to improve bandwidth efficiency of wireless two-way relay channels.
R... [more] |
IT2017-131 ISEC2017-119 WBS2017-112 pp.167-172 |
WBS, IT, ISEC |
2018-03-09 12:05 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Consideration of error correction code suitable for WBAN Akihiro Yamada, Hiroyoshi Morita, Akiko Manada (The Univ. of Electro-Communications) IT2017-132 ISEC2017-120 WBS2017-113 |
(To be available after the conference date) [more] |
IT2017-132 ISEC2017-120 WBS2017-113 pp.173-177 |
WBS, IT, ISEC |
2018-03-09 13:30 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
On the Generalization of Fano's Inequality for Countably Infinite Alphabets, List-Decoding, and General Conditional Information Measures Yuta Sakai (Univ. Fukui) IT2017-133 ISEC2017-121 WBS2017-114 |
Analogues of Fano's inequality are investigated under the following settings:
Firstly, the alphabet $mathcal{X}$ of a d... [more] |
IT2017-133 ISEC2017-121 WBS2017-114 pp.179-184 |
WBS, IT, ISEC |
2018-03-09 13:55 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Parameter orthogonalization method in quantum parameter estimation problem Jun Suzuki (UEC) IT2017-134 ISEC2017-122 WBS2017-115 |
Parameter orthogonalization method in classical statistics is a well-established method, and it has been used when deali... [more] |
IT2017-134 ISEC2017-122 WBS2017-115 pp.185-190 |
WBS, IT, ISEC |
2018-03-09 14:20 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Improved Lossless Compression by Substring Enumeration Using Sorting Takahiro Ota (NPIT), Akiko Manada (UEC) IT2017-135 ISEC2017-123 WBS2017-116 |
This paper proposes an improved compression by substring enumeration (CSE) with a finite alphabet. For an input string, ... [more] |
IT2017-135 ISEC2017-123 WBS2017-116 pp.191-196 |
WBS, IT, ISEC |
2018-03-09 14:45 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
The Error Performance Analysis of the K-best Viterbi Decoding Algorithm Hideki Yoshikawa (Tohoku Gakuin Univ.) IT2017-136 ISEC2017-124 WBS2017-117 |
[more] |
IT2017-136 ISEC2017-124 WBS2017-117 pp.197-200 |
WBS, IT, ISEC |
2018-03-09 15:45 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Quantum &Classical Radar Camera for Automotive and Effect of Fog-2
-- Sparse Modeling -- Osamu Hirota (Tamagawa Univ.) IT2017-137 ISEC2017-125 WBS2017-118 |
In 40th SITA, we have reported the theory of dynamic fog which is
the most important subject to sensors of self drivin... [more] |
IT2017-137 ISEC2017-125 WBS2017-118 pp.201-206 |
WBS, IT, ISEC |
2018-03-09 16:10 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Attacks on several Multivariate PKCs
-- Attack on K(AVII)MVPKC -- Ryuichi Sakai (Osaka Electro-Communication Univ.), Masao Kasahara (Waseda Univ.) IT2017-138 ISEC2017-126 WBS2017-119 |
One of the anthers, Kasahara, have been proposed several public key cryptosystems based on multivariate polynomials wit... [more] |
IT2017-138 ISEC2017-126 WBS2017-119 pp.207-212 |
WBS, IT, ISEC |
2018-03-09 09:00 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
A Note on Security Notions of Anonymity in Identity-Based Encryption
-- Case of ID-CCA2 Security -- Honomu Ohtomo, Taroh Sasaki, Atsushi Fujioka (Kanagawa Univ.) IT2017-139 ISEC2017-127 WBS2017-120 |
Identity-Based Encryption (IBE) is a type of Public-Key Encryption. The IND security (indistinguishability) and the ANO ... [more] |
IT2017-139 ISEC2017-127 WBS2017-120 pp.213-218 |
WBS, IT, ISEC |
2018-03-09 09:25 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
On Confirming Ciphertext Update in Key-Updatable Public-key Encryption with Keyword Search Yuka Sakoda, Honomu Ohtomo, Naoki Matsunaga, Taroh Sasaki, Atsushi Fujioka (Kanagawa Univ.) IT2017-140 ISEC2017-128 WBS2017-121 |
A public-key encryption with keyword search (PEKS) scheme is applicable to safe cloud services as a user can search a ke... [more] |
IT2017-140 ISEC2017-128 WBS2017-121 pp.219-223 |
WBS, IT, ISEC |
2018-03-09 09:50 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
On (Un)Deniability of Plausible Deniability Atsushi Waseda, Ryo Nojima (NICT) IT2017-141 ISEC2017-129 WBS2017-122 |
Recently a new security definition for synthetic datasets is roposed.
This definition requires each synthetic record ha... [more] |
IT2017-141 ISEC2017-129 WBS2017-122 pp.225-230 |
WBS, IT, ISEC |
2018-03-09 10:15 |
Tokyo |
Katsusika Campas, Tokyo University of Science |
Information-Theoretically Secure Authentication Codes with Arbitration using Non-Uniformly Random Keys Miho Ishikawa, Junji Shikata (Yokohama National Univ.) IT2017-142 ISEC2017-130 WBS2017-123 |
The authentication code (A-code) is an information-theoretically secure authentication system which detects messages for... [more] |
IT2017-142 ISEC2017-130 WBS2017-123 pp.231-236 |