| 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 13:50 |
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)  ISEC2024-3 |
A Zero-Knowledge Proof (ZKP) is an interactive proof between a prover and a verifier, which aims to convince the verifie... [more] | ISEC2024-3 pp.13-19 |
| COMP | 2024-03-14 10:30 |
Tokyo | The University of Electro-Communications | Number of Solutions of Pentahex and Heptiamond Puzzles Toshihiro Shirakawa COMP2023-28 |
Packing puzzles, also known as plastic puzzles, have been considered difficult to calculate the total number of solution... [more] | COMP2023-28 pp.1-5 |
| COMP | 2024-03-14 11:00 |
Tokyo | The University of Electro-Communications | Proof of NP-completeness of Tasukuea Chiho Fukunaga, Seiya Okubo (Univ. of Shizuoka) COMP2023-29 |
In this study, we prove that the existence determination of a solution is NP-complete problem for Tasukuea, a kind of co... [more] | COMP2023-29 pp.6-13 |
| COMP | 2024-03-14 11:30 |
Tokyo | The University of Electro-Communications | Masyu is Constant-Time Testable Kotaro Kabutoishi, Hiro Ito (UEC) COMP2023-30 |
In this presentation, we provide a constant-time tester, or a tester for short, for a board puzzle “Masyu.” This puzzle... [more] |
COMP2023-30 pp.14-21 |
| RCC, ISEC, IT, WBS | 2024-03-13 - 2024-03-14 |
Osaka | Osaka Univ. (Suita Campus) | Reconstruction of Boyer quantum algorithm and its application to hash puzzles Chris Idota, Yuichi Kaji (Nagoya Univ.) IT2023-132 ISEC2023-131 WBS2023-120 RCC2023-114 |
This study investigates the computational complexity of solving hash puzzles using quantum algorithms. A hash puzzle is ... [more] | IT2023-132 ISEC2023-131 WBS2023-120 RCC2023-114 pp.358-365 |
| HCS | 2023-08-25 16:20 |
Hyogo | (Primary: On-site, Secondary: Online) |
Modeling of Expressed Emotions in Puzzle Tasks and Estimation of the Emotion based on Laban Movement Analysis Akari Kubota, Sota Fujiwara (Kwansei Gakuin Univ.), Saizo Aoyagi (Komazawa Univ.), MIchiya Yamamoto (Kwansei Gakuin Univ.) HCS2023-48 |
Research to recognize and estimate human emotions using such as facial expressions has been vigorously conducted. By foc... [more] | HCS2023-48 pp.29-34 |
| ET | 2023-07-14 13:35 |
Hokkaido | Muroran Institute of Technology / Online (Primary: On-site, Secondary: Online) |
Development of a learning support system of inference rules for solving Number Place puzzles for beginners Haruki Honaga, Hisayoshi Kunimune (Chiba Inst. of Tech.) ET2023-10 |
``Number Place'', also known as Sudoku, is a type of pencil puzzles in which the numbers 1 to 9 are to be filled on 9 x ... [more] | ET2023-10 pp.7-10 |
| SP, WIT, IPSJ-SLP, ASJ-H [detail] | 2021-10-19 14:35 |
Online | Online | Comparison of shape discriminability between raised-line drawings and puzzle pieces
-- Shapes of prefectures as stimuli and the sighted as participants -- Tetsuya watanabe (Niigata Univ.), Kouhei Ono (Hitachi Solutions East), Yuta Ezawa (Niigata Univ.) SP2021-32 WIT2021-25 |
In education for the blind, tactile maps with raised lines have been used. We introduced district maps made of puzzle pi... [more] | SP2021-32 WIT2021-25 pp.40-45 |
| ISEC | 2021-05-19 14:30 |
Online | Online | [Invited Talk]
Security Definitions on Time-Lock Puzzles (from ICISC 2020) Daiki Hiraga (Tokyo Tech), Keisuke Hara (Tokyo Tech/AIST), Masayuki Tezuka, Yusuke Yoshida, Keisuke Tanaka (Tokyo Tech) ISEC2021-7 |
Time-lock puzzles allow one to encapsulate a message for a pre-determined amount of time. The message is required to be... [more] |
ISEC2021-7 p.32 |
| COMP | 2020-10-23 14:30 |
Osaka | Osaka Univ. (Primary: On-site, Secondary: Online) |
Mathematical Characterization and Computational Complexity of Anti-Slide Puzzles Ko Minamisawa, Ryuhei Uehara (JAIST), Masao Hara (Tokai Univ.) COMP2020-13 |
For a given set of pieces, an anti-slide puzzle asks us to arrange the pieces so that none of the pieces can slide. In t... [more] | COMP2020-13 pp.10-17 |
| COMP, IPSJ-AL | 2019-05-10 15:40 |
Kumamoto | Kumamoto University | On the Complexity of Lattice Puzzle: Yasuaki Kobayashi, Koki Suetsugu, Hideki Tsuiki (Kyoto Univ), Ryuhei Uehara (JAIST) COMP2019-2 |
In this paper, we investigate the computational complexity of lattice puzzle, which is one of the traditional puzzles. ... [more] |
COMP2019-2 pp.15-22 |
| KBSE | 2018-03-01 11:30 |
Okinawa | Introduction of recursive description to Puzzle Programming System Taiki Minamino, Hirohide Haga (Doshisha Univ) KBSE2017-43 |
(To be available after the conference date) [more] | KBSE2017-43 pp.25-30 |
|
| ITS, IE, ITE-MMS, ITE-HI, ITE-ME, ITE-AIT [detail] | 2018-02-16 09:45 |
Hokkaido | Hokkaido Univ. | A novel dissimilarity measure between pieces for assembling jigsaw puzzles Shogo Mano, Fubito Toyama, Hiroshi Mori, Kenji Shoji (Utsunomiya Univ.) |
In jigsaw puzzle solvers, a definition of dissimilarity measure between pieces is important facter. In this paper, we pr... [more] | |
| EMM | 2017-03-06 15:40 |
Okinawa | Miyakojima Marin Terminal Building (Okinawa) | [Poster Presentation]
A Permutation-Based Image Encryption Scheme with Resistance against Some Attacks and Its Key Management Takeshi Ogasawara, Shoko Imaizumi (Chiba Univ), Hitoshi Kiya (TMU) EMM2016-91 |
This paper proposes a permutation-based image encryption scheme that improves resistance against brute force attacks and... [more] | EMM2016-91 pp.31-36 |
| IE, CS, IPSJ-AVM, ITE-BCT [detail] | 2016-12-09 15:15 |
Ishikawa | Extension of Jigsaw Puzzle Solvers and Its Attack on Permutation-Based Image Encryption Schemes Tatsuya Chuman, Kenta Kurihara, Sayaka Shiota, Hitoshi Kiya (Tokyo Metro. Univ.) CS2016-63 IE2016-99 |
Block-based scrambled image encryption schemes have superior features that are compressible and against noises to number... [more] | CS2016-63 IE2016-99 pp.115-120 |
|
| EA, EMM | 2016-11-17 16:40 |
Oita | Compal Hall (Oita) | An Extension of Block-Permutation-Based-Encryption Schemes for Lossless Image Compression Takeshi Ogasawara, Shoko Imaizumi (Chiba Univ.), Hitoshi Kiya (TMU) EA2016-55 EMM2016-61 |
This paper proposes a permutation-based image encryption scheme for lossless coded images. The conventional scheme gener... [more] | EA2016-55 EMM2016-61 pp.43-48 |
| COMP | 2016-09-06 10:30 |
Toyama | Toyama Prefectural University | Counting the number of solutions for peg solitaire Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.), Masashi Kiyomi (Yokohama City Univ.), Ryuhei Uehara (JAIST) COMP2016-14 |
Peg solitaire is one of the most popular classic puzzles around the world. The problem is NP-complete in general, which ... [more] | COMP2016-14 pp.1-5 |
| EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] | 2016-07-14 14:40 |
Yamaguchi | Safety Evaluation for Permutation-Based Image Encryption Schemes against Jigsaw Puzzle Solvers Tatsuya Chuman, Kenta Kurihara, Hitoshi Kiya (Tokyo Metro. Univ.) ISEC2016-17 SITE2016-11 ICSS2016-17 EMM2016-25 |
Block-based scrambled image encryption schemes have superior features that are compressible and against noises to number... [more] | ISEC2016-17 SITE2016-11 ICSS2016-17 EMM2016-25 pp.23-28 |
|
| COMP, IPSJ-AL | 2016-06-24 16:10 |
Ishikawa | Improving the lower bounds of the number of tilings for Ls in L and Sphinxes in Sphinx
-- Enumerating tilings by frontier-based search -- Itsuki Kanemoto, Toshiki Saitoh (Kobe Univ.) COMP2016-9 |
We treat with puzzles which are filled by copies of a polygon in the polygon enlarged in a certain scale. We call ... [more] | COMP2016-9 pp.41-47 |
|
| IT, ISEC, WBS | 2016-03-10 09:50 |
Tokyo | The University of Electro-Communications | Studies on Sudoku Puzzle Based on Coding Theory Nobumasa Nanami, Shinsuke Hirano, Kazuhiko Yamaguchi (UEC) IT2015-101 ISEC2015-60 WBS2015-84 |
Sudoku puzzle is popular in worldwide, and it has been discussed by wide variety of researchers. In the sense of coding ... [more] | IT2015-101 ISEC2015-60 WBS2015-84 pp.1-6 |
[Return to Top Page]