| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| ISEC | 2024-05-15 14:15 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Single-Shuffle Physical Zero-Knowledge Proof for Sudoku using Interactive Inputs Tomoki Ono, Suthee Ruangwises (UEC), Yoshiki Abe (UEC/AIST), Kyosuke Hatsugai, Mitsugu Iwamoto (UEC) |
[more] | |
| AI, JSAI-SAI, JSAI-DOCMAS, IPSJ-ICS, JSAI-KBS (Joint) |
2024-03-03 18:30 |
Hokkaido | (Primary: On-site, Secondary: Online) |
Method for Generating Paths with Arbitrary Termination Probabilities Based on Pre-Executed Random Walk Paths Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.)  AI2023-48 |
In graph analysis, random walks can be sped up by using indices. A random walk is a sequence of transitions from a sourc... [more] | AI2023-48 pp.24-29 |
| NS, IN (Joint) |
2024-03-01 10:10 |
Okinawa | Okinawa Convention Center | A Performance Evaluation of Graph Cutting Methods that Maintain the Shortest Paths in Internet Topology Masatoshi Enomoto (YCC), Ken-ichi Chinen (TMCIT) IN2023-90 |
The Internet is operated in units of autonomous systems (AS). By interconnecting multiple ASes, the ASes maintain commu... [more] |
IN2023-90 pp.148-153 |
| ICTSSL, CAS | 2024-01-26 16:35 |
Kanagawa | (Primary: On-site, Secondary: Online) |
An approximate solution using Cutting Plane Method for a communication link load balancing problem Taizo Takeuchi, Himeno Takahashi, Norihiko Shinomiya (Soka Univ) CAS2023-110 ICTSSL2023-63 |
Addressing Congestion Risks Arising from Increased Data Traffic in Information and Communication Networks. In previous r... [more] | CAS2023-110 ICTSSL2023-63 pp.127-130 |
| IN, ICTSSL, IEE-SMF | 2023-10-20 13:40 |
Fukuoka | Fukuoka University | A study of graph cutting methods that maintain the shortest paths in Internet topology Masatoshi Enomoto (YCC), Ken-ichi Chinen (TMCIT) IN2023-38 |
According to the CAIDA Project survey, there are over 20,000 Autonomous Systems (AS), which are interconnected to form t... [more] | IN2023-38 pp.27-32 |
| IMQ, IE, MVE, CQ (Joint) [detail] |
2023-03-15 11:00 |
Okinawa | Okinawaken Seinenkaikan (Naha-shi) (Primary: On-site, Secondary: Online) |
Evaluating the Efficiency of Anomaly Detection Methods for Temporal Networks Using the Graph Spectrum Masataka Nagao, Eriko Segawa, Yusuke Sakumoto (Kwansei Gakuin Univ.) CQ2022-83 |
LAD (Laplacian Anomaly Detection) is a method for detecting anomalies in dynamic networks using the eigenvalues (the gra... [more] | CQ2022-83 pp.19-24 |
| VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] | 2022-11-30 10:45 |
Kumamoto | (Primary: On-site, Secondary: Online) |
Mask Optimization Using Voronoi Partition and Iterative Improvement Naoki Nonaka, Yukihide Kohira (Univ. of Aizu), Atsushi Takahashi (Tokyo Tech), Chikaaki Kodama (KIOXIA) VLD2022-41 ICD2022-58 DC2022-57 RECONF2022-64 |
To realize continuously scaling down technology node, progressing manufacturing process by optical lithography is requir... [more] | VLD2022-41 ICD2022-58 DC2022-57 RECONF2022-64 pp.127-132 |
| IN, CCS (Joint) |
2022-08-05 09:00 |
Hokkaido | Hokkaido University(Centennial Hall) (Primary: On-site, Secondary: Online) |
Autonomous Congestion Control Mechanism Using Random Early Detection in Asynchronous Random Walker Processing Shun Takizawa, Kunitake Kaneko (Keio Univ.) IN2022-18 |
In large-scale graph analysis, Random Walk (RW) is useful and has been implemented in both synchronous and asynchronous ... [more] | IN2022-18 pp.15-20 |
| NS | 2022-04-15 11:10 |
Tokyo | kikai shinkou kaikan + online (Primary: On-site, Secondary: Online) |
Service Chaining Based on Capacitated Shortest Path Tour Problem
-- Solution Based on Deep Reinforcement Learning and Graph Neural Network -- Takanori Hara, Masahiro Sasabe (NAIST) NS2022-2 |
The service chaining problem is one of the resource allocation problems in network functions virtualization (NFV) networ... [more] | NS2022-2 pp.7-12 |
| NS, IN (Joint) |
2022-03-11 14:20 |
Online | Online | A Method for Generating Random Walk Paths Focusing Only on Updates Near A Source Node in Dynamic Distributed Graphs Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2021-48 |
In graph calculations with a lot of random walks (RWs), some long RWs become bottlenecks, and thus pre-execution of RWs ... [more] | IN2021-48 pp.103-108 |
| VLD, DC, RECONF, ICD, IPSJ-SLDM (Joint) [detail] |
2021-12-02 15:35 |
Online | Online | Mask Optimization Method Using Simulated Quantum Annealing Yukihide Kohira, Haruki Nakayama, Naoki Nonaka (Univ. of Aizu), Tomomi Matsui, Atsushi Takahashi (Tokyo Tech), Chikaaki Kodama (KIOXIA Corporation) VLD2021-45 ICD2021-55 DC2021-51 RECONF2021-53 |
To realize continuously scaling down of technology node, progressing manufacturing process by optical lithography is req... [more] | VLD2021-45 ICD2021-55 DC2021-51 RECONF2021-53 pp.162-167 |
| COMP | 2021-10-23 14:30 |
Online | Online | Algorithms for Graph Class Identification Problems in the Population Protocol Model Hiroto Yasumi, Fukuhito Ooshita, Michiko Inoue (NAIST) COMP2021-17 |
In this paper, we focus on graph class identification problems in the population protocol model. A graph class identifi... [more] |
COMP2021-17 pp.20-27 |
| HWS, ICD [detail] | 2021-10-19 13:30 |
Online | Online | Design of NTT Hardware Based on K-RED for Lattice-Based Cryptography Yuma Itabashi, Rei Ueno, Naofumi Homma (Tohoku Univ.) HWS2021-46 ICD2021-20 |
This paper presents an efficient hardware that efficiently performs Number Theoretic Transform(NTT) which is a dominant ... [more] | HWS2021-46 ICD2021-20 pp.26-31 |
| IA, ICSS | 2021-06-21 13:30 |
Online | Online | secure isogeny-based cryptosystem CSIDH for side-channel attacks Hayato Arai, Atusko Miyaji (Osaka Univ.) IA2021-2 ICSS2021-2 |
CSIDH (Commutative Supersingular Isogeny Diffie Hellman) is a kind of post-quantum cryptography that uses isogenies to e... [more] | IA2021-2 ICSS2021-2 pp.8-13 |
| RCS, IN, NV (Joint) |
2021-05-28 11:45 |
Online | Online | An Evaluation of Tracking Performance of Personalized PageRank Using Random Walk in Dynamic Graphs Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2021-5 |
By combining graphs managed by multiple services, we can create an autonomous distributed graph that enables multiple se... [more] | IN2021-5 pp.25-30 |
| ISEC | 2021-05-19 10:00 |
Online | Online | Card-based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations Yoshifumi Manabe, Hibiki Ono (Kogakuin Univ) ISEC2021-1 |
This paper shows card-based cryptographic protocols that use a standard deck of cards. They are multi-party secure comp... [more] | ISEC2021-1 pp.1-8 |
| ISEC | 2021-05-19 11:05 |
Online | Online | [Invited Talk]
Six-Card Finite-Runtime XOR Protocol with Only Random Cut (from APKC 2020) Kodai Toyoda (Tohoku Univ.), Daiki Miyahara (Tohoku Univ./AIST), Takaaki Mizuki, Hideaki Sone (Tohoku Univ.) ISEC2021-3 |
In this invited talk, we introduce the paper ``Six-Card Finite-Runtime XOR Protocol with Only Random Cut'' by Kodai Toyo... [more] | ISEC2021-3 p.17 |
| WBS, IT, ISEC | 2021-03-04 11:45 |
Online | Online | Security analysis for the isogeny-based cryptography CSIDH Hayato Arai, Atsuko Miyaji, Kenta Kodera (Osaka Univ.) IT2020-123 ISEC2020-53 WBS2020-42 |
CSIDH (Commutative Supersingular Isogeny Diffie Hellman) is a kind of post-quantum cryptography that uses isogenies to e... [more] | IT2020-123 ISEC2020-53 WBS2020-42 pp.73-80 |
| NC, MBE (Joint) |
2021-03-03 09:25 |
Online | Online | Network cores of the human functional connectome Tomoya Taguchi, Jun Kitazono (Univ. of Tokyo), Shuntaro Sasai (Araya Inc.), Masafumi Oizumi (Univ. of Tokyo) NC2020-41 |
In order to understand the structure of large and complex neural networks in the brain, it is important to find the "cor... [more] | NC2020-41 pp.1-6 |
| LOIS, ISEC, SITE | 2020-11-06 10:30 |
Online | Online | Proposal of Optimal Curve Parameters for Pairing Computation on BLS12 Curve and Its Evaluation of Implementation Daichi Hattori, Yuto Takahashi, Tomoya Tatara, Yuki Nanjo, Yuta Kodera, Takuya Kusaka, Yasuyuki Nogami (Okayama Univ.) ISEC2020-32 SITE2020-29 LOIS2020-12 |
Pairing-based cryptography is one of the popular cryptographic techniques for achieving safety and usability. Since a pa... [more] | ISEC2020-32 SITE2020-29 LOIS2020-12 pp.1-6 |
[Return to Top Page]