| Presentation | 2019-03-07 Identification Scheme Based on the Hardness of Ideal Lattice Problems in all Rings. Kaoru Takemure, Bagus Santoso, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Most identification schemes based on the hardness of ideal lattice problems are built upon the Ring-SIS or Ring-LWE problems. Most of these scheme are required to use a polynomial ring $mathbb{Z}_q[{bf x}]/langle {bf f} rangle$ with an explicitly specified monic, irreducible polynomial ${bf f}$. In this case, the security can only be proven for the specific polynomial ${bf f}$. The digital signature proposed by Lyubashevsky in 2016 does not need an explicit ${bf f}$ and the security depends on only the degree of ${bf f}$. In this work, we constructed an identification scheme by modifying Lyubashevsky's digital signature. Moreover, we introduce a new collision problem over $mathbb{Z}_q[{bf x}]$ for hardness assumption based on Ring-SIS over $mathbb{Z}_q[{bf x}]$ to prove the security of proposed scheme was proved security for impersonation under concurrent active attack. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Identification scheme / Ideal lattice problem / collision problem / RejectionSample |
| Paper # | IT2018-81,ISEC2018-87,WBS2018-82 |
| Date of Issue | 2019-02-28 (IT, ISEC, WBS) |
| Conference Information | |
| Committee | IT / ISEC / WBS |
|---|---|
| Conference Date | 2019/3/7(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | University of Electro-Communications |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | joint meeting of IT, ISEC, and WBS |
| Chair | Jun Muramatsu(NTT) / Atsushi Fujioka(Kanagawa Univ.) / Minoru Okada(NAIST) |
| Vice Chair | Tadashi Wadayama(Nagoya Inst. of Tech.) / Shiho Moriai(NICT) / Shoichi Hirose(Univ. of Fukui) / Koji Ohuchi(Shizuoka Univ.) / Kenichi Takizawa(NICT) |
| Secretary | Tadashi Wadayama(Nagano Pref Inst. of Tech.) / Shiho Moriai(UEC) / Shoichi Hirose(Tokai Univ.) / Koji Ohuchi(NICT) / Kenichi Takizawa(Ibaraki Univ.) |
| Assistant | Takahiro Yoshida(Yokohama College of Commerce) / Kazunari Omote(Tsukuba Univ.) / Yuuji Suga(IIJ) / Ryohei Nakamura(National Defense Academy) / Duong Quang Thang(NAIST) |
| Paper Information | |
| Registration To | Technical Committee on Information Theory / Technical Committee on Information Security / Technical Committee on Wideband System |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Identification Scheme Based on the Hardness of Ideal Lattice Problems in all Rings. |
| Sub Title (in English) | |
| Keyword(1) | Identification scheme |
| Keyword(2) | Ideal lattice problem |
| Keyword(3) | collision problem |
| Keyword(4) | RejectionSample |
| 1st Author's Name | Kaoru Takemure |
| 1st Author's Affiliation | University of Electro-Communications(UEC) |
| 2nd Author's Name | Bagus Santoso |
| 2nd Author's Affiliation | University of Electro-Communications(UEC) |
| Date | 2019-03-07 |
| Paper # | IT2018-81,ISEC2018-87,WBS2018-82 |
| Volume (vol) | vol.118 |
| Number (no) | IT-477,ISEC-478,WBS-479 |
| Page | pp.pp.39-44(IT), pp.39-44(ISEC), pp.39-44(WBS), |
| #Pages | 6 |
| Date of Issue | 2019-02-28 (IT, ISEC, WBS) |