IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 21  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
RCC, ISEC, IT, WBS 2024-03-13
- 2024-03-14
Osaka Osaka Univ. (Suita Campus) Consideration on Definition Field for Efficient Ring-LWE Problem
Rintaro Yamada, Shinya Okumura, Atsuko Miyaji (OU) IT2023-99 ISEC2023-98 WBS2023-87 RCC2023-81
Currently, as one of the candidates for the post-quantum cryptography, there are cryptosystems based on the difficulty o... [more] IT2023-99 ISEC2023-98 WBS2023-87 RCC2023-81
pp.158-165
QIT
(2nd)
2023-12-18
16:20
Okinawa OIST
(Primary: On-site, Secondary: Online)
Rewindable quantum computation and its equivalence to cloning and adaptive postselection
Yuki Takeuchi (NTT), Ryo Hiromasa (Mitsubishi Electric Corp.), Akihiro Mizutani (Univ. of Toyama), Seiichiro Tani (NTT)
We define rewinding operators that invert quantum measurements.
Then, we define complexity classes ${¥sf RwBQP}$, ${¥sf... [more]

RCC, ISEC, IT, WBS 2023-03-14
10:30
Yamaguchi
(Primary: On-site, Secondary: Online)
Security Analysis for Ring-LWE Problem over the Maximal Real and Complex Subfields in Cyclotomic Field
Satoshi Uesugi, Shinya Okumura, Miyaji Atsuko (Osaka Univ) IT2022-75 ISEC2022-54 WBS2022-72 RCC2022-72
The Learning With Errors problem (LWE) is a mathematical problem that supports the security of lattice based cryptograph... [more] IT2022-75 ISEC2022-54 WBS2022-72 RCC2022-72
pp.49-53
SeMI, IPSJ-UBI, IPSJ-MBL 2023-03-01
16:40
Aichi
(Primary: On-site, Secondary: Online)
Study of Deep Reinforcement Learning for Wireless Multihop Networks
Cui Zhihan, Khun Aung thura phyo, Lim Yuto, Tan Yasuo (JAIST) SeMI2022-113
In beyond 5G network, the device-to-device communications has been actively studied. These devices are wirelessly connec... [more] SeMI2022-113
pp.37-42
IT, ISEC, RCC, WBS 2022-03-10
14:40
Online Online Crypto Analysis for Ring-LWE Problem on Subfield in Cyclotomic Field
Satoshi Uesugi, Shinya Okumura, Atsuko Miyaji (OU) IT2021-106 ISEC2021-71 WBS2021-74 RCC2021-81
Since the proposal of the quantum computer, steady progress has been made toward its practical use. It has been reported... [more] IT2021-106 ISEC2021-71 WBS2021-74 RCC2021-81
pp.138-144
ICTSSL 2021-07-09
13:35
Online Online On vertex colorings maximizing the number of colors on lattice graphs
Hiroshi Tamura (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2021-13
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] ICTSSL2021-13
pp.27-30
WBS, IT, ISEC 2021-03-05
11:45
Online Online A Proposal of Decentralized Multi-authority Traceable Anonymous Credential Scheme and Its Generic Construction
Hiroaki Anada (Univ. of Nagasaki) IT2020-149 ISEC2020-79 WBS2020-68
We propose an anonymous credential scheme and its generic construction, where there are independent decentralized multi-... [more] IT2020-149 ISEC2020-79 WBS2020-68
pp.225-231
MI, IE, SIP, BioX, ITE-IST, ITE-ME [detail] 2020-05-29
14:10
Online Online Construction of Hidden Markov Models for Brain Tumor Segmentation
Takuya Honda, Yuta Nakahara, Matushima Toshiyasu (Waseda Univ.) SIP2020-13 BioX2020-13 IE2020-13 MI2020-13
Brain tumor segmentation is one of the systems that a computer, which has attracted attention in recent years, assists d... [more] SIP2020-13 BioX2020-13 IE2020-13 MI2020-13
pp.61-66
ISEC, SITE, LOIS 2019-11-01
14:00
Osaka Osaka Univ. Lattice basis reduction over projected lattices and its application to solving the LWE problem
Satoshi Nakamura, Nariaki Tateiwa (Kyushu Univ.), Koha Kinjo (NTT), Yasuhiko Ikematsu, Masaya Yasuda (Kyushu Univ.) ISEC2019-68 SITE2019-62 LOIS2019-27
The security of modern lattice-based schemes is based on the computational hardness of solving the learning with errors ... [more] ISEC2019-68 SITE2019-62 LOIS2019-27
pp.41-48
IT, ISEC, WBS 2019-03-07
12:10
Tokyo University of Electro-Communications Identification Scheme Based on the Hardness of Ideal Lattice Problems in all Rings.
Kaoru Takemure, Bagus Santoso (UEC) IT2018-81 ISEC2018-87 WBS2018-82
Most identification schemes based on the hardness of ideal lattice problems are built upon the Ring-SIS or Ring-LWE prob... [more] IT2018-81 ISEC2018-87 WBS2018-82
pp.39-44
R 2018-07-27
14:50
Hokkaido   Proposal of algorithm for optimal arrangement in connected-(r,s)-out-of-(m,n):F lattice system
Taishin Nakamura, Hisashi Yamamoto (Tokyo Met. Univ.), Takashi Shinzato (Tamagawa Univ.) R2018-13
One of the most significant problems in reliability theory is an optimal arrangement problem on the assumption that comp... [more] R2018-13
pp.13-18
SITE, EMM, ISEC, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] 2017-07-14
16:10
Tokyo   Report of solving SVP's by using DeepLLL
Junpei Yamaguchi, Masaya Yasuda (Kyushu Univ.) ISEC2017-23 SITE2017-15 ICSS2017-22 EMM2017-26
Lattice-based cryptography is based on the computational herdbess of lattice problems such as Shortest vector problem (S... [more] ISEC2017-23 SITE2017-15 ICSS2017-22 EMM2017-26
pp.115-122
QIT
(2nd)
2017-05-30
15:20
Kyoto Ritesumeikan University, Suzaku Campus [Invited Talk] Quantum Simulation with Optical Lattices -- Current Progress and Future Prospects --
Shintaro Taie (Kyoto Univ.)
In this talk, I introduce optical lattices as quantum simulators for solid electron systems. First, I review the entire ... [more]
PRMU, SP, WIT, ASJ-H 2016-06-13
09:30
Tokyo   Image recognition based on discriminative models using features generated from separable lattice HMMs
Yoshinari Tsuzuki, Kei Sawada, Kei Hashimoto, Yoshihiko Nankaku, Keiichi Tokuda (Nagoya Inst. of Tech.) PRMU2016-36 SP2016-2 WIT2016-2
One of the major problems in image recognition is degradation in the recognition performance caused by geometric variati... [more] PRMU2016-36 SP2016-2 WIT2016-2
pp.7-12
IT 2015-09-04
10:15
Ishikawa Hakusan Shobutei Nested Lattice Hashing Scheme for Similarity Search Applications
Thanh Xuan Nguyen, Ricardo Antonio Parrao Hernandez, Brian Michael Kurkoski (JAIST) IT2015-37
This research targets improving similarity search efficiency using a nested lattice hashing scheme. Similarity search ha... [more] IT2015-37
pp.19-24
ICSS, ISEC, SITE, EMM, IPSJ-CSEC, IPSJ-SPT [detail] 2014-07-03
14:15
Hokkaido San-Refure Hakodate Security of RSA with Many Decryption Exponents
Atsushi Takayasu, Noboru Kunihiro (Univ. of Tokyo) ISEC2014-19 SITE2014-14 ICSS2014-23 EMM2014-19
When we use small secret exponents, RSA becomes efficient for its decryption cost and signature generation cost. However... [more] ISEC2014-19 SITE2014-14 ICSS2014-23 EMM2014-19
pp.93-96
ISEC 2012-09-21
10:10
Tokyo Kikai-Shinko-Kaikan Bldg. Heuristic improvements of BKZ 2.0
Yoshinori Aono (NICT), Ken Naganuma (Hitachi) ISEC2012-45
It has been considered an important problem to figure out practical intractability of
the shortest (closest) vector pr... [more]
ISEC2012-45
pp.15-22
EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] 2012-07-20
14:20
Hokkaido   An Improved Algorithm for Approximate GCD Problems
Atsushi Takayasu, Noboru Kunihiro (UT) ISEC2012-35 SITE2012-31 ICSS2012-37 EMM2012-27
In this paper, we analyze multivariate approximate common divisor problem(ACDP), given approximate multiples of the inte... [more] ISEC2012-35 SITE2012-31 ICSS2012-37 EMM2012-27
pp.189-194
ISEC, LOIS 2011-11-14
10:25
Osaka Osaka Electro-Communication University A Lattice Attack against (u|u+v)ΣPKC
Atsushi Nagao, Yosuke Todo, Masakatu Morii (Kobe Univ.) ISEC2011-35 LOIS2011-29
In 2010, Kasahara et al. proposed a knapsack cryptosystem secure against a low-density attack.
The cryptosystem were a... [more]
ISEC2011-35 LOIS2011-29
pp.7-12
ISEC 2011-09-09
16:45
Tokyo Kikai-Shinko-Kaikan Bldg. On the security of the fully-homomorphic encryption scheme based on ideal lattices
Masaya Yasuda, Jun Yajima, Takeshi Shimoyama, Jun Kogure (Fujitsu Lab.) ISEC2011-33
A fully-homomorphic encryption is a public-key encryption that allows one to fully interact with encypted data without b... [more] ISEC2011-33
pp.43-50
 Results 1 - 20 of 21  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan