| 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 # | |
| NLP, CAS | 2023-10-07 13:00 |
Gifu | Work plaza Gifu | An algorithm for finding regular graphs that maximize algebraic connectivity under a specified number of vertices and degree Masashi Kurahashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  CAS2023-54 NLP2023-53 |
Algebraic connectivity is a measure of network robustness, and defined by the second smallest eigenvalue of the Laplacia... [more] | CAS2023-54 NLP2023-53 pp.106-110 |
| ISEC | 2023-05-17 15:55 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | [Invited Talk]
An Efficient Strategy to Construct a Better Differential on Multiple-Branch-Based Designs: Application to Orthros (from CT-RSA 2023) Kazuma Taka, Kosei Sakamoto (Hyogo Univ.), Tatsuya Ishikawa (WDB KOUGAKU Co.,Ltd.), Takanori Isobe (Hyogo Univ.) ISEC2023-12 |
As low-latency designs tend to have a small number of rounds to decrease latency, the differential-type cryptanalysis ca... [more] | ISEC2023-12 p.65 |
| IT, ISEC, RCC, WBS | 2022-03-10 14:15 |
Online | Online | Reconsideration of Attacks on the Search Ring-LWE Problem by Trace Map on Finite Field Tomoka Takahashi, Shinya Okumura, Atsuko Miyaji (Osaka Univ.) IT2021-105 ISEC2021-70 WBS2021-73 RCC2021-80 |
Lattice-based cryptography has attracted a great deal of attention due to the standardization of Post-Quantum Cryptograp... [more] | IT2021-105 ISEC2021-70 WBS2021-73 RCC2021-80 pp.130-137 |
| QIT (2nd) |
2021-11-30 13:30 |
Online | Online | [Poster Presentation]
Attacks on Search Ring-LWE Problem by Trace Map on Finite Field Tomoka Takahashi, Sinya Okumura, Atsuko Miyaji (Osaka Univ.) |
The Ring-Learning with Error (Ring-LWE) has attracted a great deal of attention because it is quantum-resistant and can ... [more] | |
| BioX, ISEC, SITE, ICSS, EMM, HWS, IPSJ-CSEC, IPSJ-SPT [detail] | 2021-07-20 14:50 |
Online | Online | Differential Path Search Using MILP against ForkSkinny Masaya Okazaki (Nagoya Univ.), Yu Sasaki (NTT), Tetsu Iwata (Nagoya Univ.) ISEC2021-35 SITE2021-29 BioX2021-36 HWS2021-35 ICSS2021-40 EMM2021-40 |
ForkSkinny is a symmetric key primitive desgined based on a tweakable block cipher called SKINNY, and it outputs two cip... [more] | ISEC2021-35 SITE2021-29 BioX2021-36 HWS2021-35 ICSS2021-40 EMM2021-40 pp.153-160 |
| EMM, IT | 2019-05-24 10:35 |
Hokkaido | Asahikawa International Conference Hall | Searchable Image Encryption using Secret Sharing Scheme Mohd Kamal Ahmad Akmal Aminuddin, Iwamura Keiichi (Tokyo University of Science) IT2019-9 EMM2019-9 |
Using the method of secrecy computation based on secret sharing scheme, Aminuddin et al. had introduced an image searchi... [more] | IT2019-9 EMM2019-9 pp.43-48 |
| IT, ISEC, WBS | 2019-03-08 16:45 |
Tokyo | University of Electro-Communications | [Invited Talk]
Exceptional Experiences of my Research Activities on Modern Cryptography Kazuo Ohta (UEC) IT2018-115 ISEC2018-121 WBS2018-116 |
As a fellow receiving a prize commemorative lecture, I look back on 36-year research and education experiences on modern... [more] | IT2018-115 ISEC2018-121 WBS2018-116 p.249 |
| IT, ISEC, WBS | 2013-03-08 14:45 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Security Definitions for Public Key Encryption with Keyword Search Revisited Hirokazu Tagai, Junji Shikata (Yokohama National Univ.) IT2012-104 ISEC2012-122 WBS2012-90 |
Public Key Encryption with Keyword Search (PEKS) is a cryptographic primitive imparting the keyword search function with... [more] | IT2012-104 ISEC2012-122 WBS2012-90 pp.263-270 |
| IT, ISEC, WBS | 2013-03-08 15:35 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Toward Practical Application of Searchable Encryption Takashi Ito, Takato Hirano, Takumi Mori, Mitsuhiro Hattori, Nori Matsuda (Mitsubishi Electric) IT2012-106 ISEC2012-124 WBS2012-92 |
Searchable encryption is a scheme that enables keyword search over encrypted data without revealing private information ... [more] | IT2012-106 ISEC2012-124 WBS2012-92 pp.279-283 |
| ISEC, IT, WBS | 2011-03-03 10:00 |
Osaka | Osaka University | Efficient Searchable Encryption Schemes Against Frequency Analysis Takashi Ito, Mitsuhiro Hattori, Nori Matsuda (Mitsubishi Electric Corp.), Yusuke Sakai, Kazuo Ohta (Univ. of Electro-Communications) IT2010-68 ISEC2010-72 WBS2010-47 |
Searchable encryption is a scheme that enables keyword search over encrypted data without revealing private information ... [more] | IT2010-68 ISEC2010-72 WBS2010-47 pp.1-6 |
| ISEC, IPSJ-CSEC, SITE, ICSS [detail] | 2010-07-01 13:25 |
Aomori | Hirosaki University | Evaluating Destination Hosts of Malware Based on Search Engine Results Kazufumi Aoki, Mitsuaki Akiyama, Makoto Iwamura, Mitsutaka Itoh (NTT) ISEC2010-18 SITE2010-14 ICSS2010-24 |
Malware dynamic analysis using isolated environment couldn't obtain enough results because existing malwares (e.g., Bots... [more] | ISEC2010-18 SITE2010-14 ICSS2010-24 pp.75-80 |
| IA, SITE | 2009-03-05 14:20 |
Kumamoto | Entropy Study on A Resource Record DNS Query Traffic from the Campus Network Kazuya Takemori, Wei Juan Kong, Dennis Arturo Ludena Romana, Shinichiro Kubota, Kenichi Sugitani, Yasuo Musashi (Kumamoto Univ.) SITE2008-61 IA2008-84 |
We investigated the source IP address (SIP)- and query keyword (QK)-based entropy changes in the A and PTR resource reco... [more] | SITE2008-61 IA2008-84 pp.101-106 |
|
| SITE | 2007-11-02 15:05 |
Tokyo | University of Electro-Communications | Legal consideration on cryptographic research-groups' actions in case of finding vulnerability Yusuke Inomata, Kazuo Ohta, Noboru Kunihiro (UEC) SITE2007-42 |
We consider a research-group’s action in a case of finding a vulnerability of cryptographic protocol and/or products. W... [more] | SITE2007-42 pp.15-20 |
| DE | 2007-07-04 09:55 |
Miyagi | Akiu hot springs (Sendai) | Application of relationships derived from access logs to retrieve files Tetsutaro Watanabe (Tokyo Tech), Takashi Kobayashi (Nagoya Univ), Haruo Yokota (Tokyo Tech) DE2007-106 |
Since the number of files in a file system explosively increase in recent years, it becomes very hard for users to find ... [more] | DE2007-106 pp.503-508 |
[Return to Top Page]