| 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 # | |
| IT, ISEC, WBS | 2016-03-11 10:25 |
Tokyo | The University of Electro-Communications | Expressive Attribute-Based Encryption with Fast Decryption Tsuchida Hikaru, Kanayama Naoki, Nishide Takashi, Okamoto Eiji (Univ. of Tsukuba)  IT2015-132 ISEC2015-91 WBS2015-115 |
In recent years, cloud computing has property of cost savings and flexibility, but it does not seem to supply security. ... [more] | IT2015-132 ISEC2015-91 WBS2015-115 pp.189-195 |
| IT, ISEC, WBS | 2016-03-11 10:50 |
Tokyo | The University of Electro-Communications | Provable Secure Decentralized Multi-Authority Attribute-Based Encryption on Non-Programmable Random Oracle Model Tsuchida Hikaru, Kanayama Naoki, Nishide Takashi, Okamoto Eiji (Univ. of Tsukuba) IT2015-133 ISEC2015-92 WBS2015-116 |
In recent years, Attribute-Based Encryption (ABE) is the cryptosystem that is studied actively. Especially, an ABE syste... [more] | IT2015-133 ISEC2015-92 WBS2015-116 pp.197-204 |
| IA, ICSS | 2015-06-11 15:15 |
Fukuoka | Kyushu Institute of Technology Univ. | Implementation of a Pairing Library Using BN Elliptic Curve Yusuke Kanbara, Naoki Kanayama, Takashi Nishide, Eiji Okamoto (Univ. of Tsukuba) IA2015-5 ICSS2015-5 |
Bilinear mapping which called a pairing can realize high performance cryptographic protocols which could not be construc... [more] | IA2015-5 ICSS2015-5 pp.21-26 |
| ICSS | 2014-11-27 16:00 |
Miyagi | Tohoku Gakuin University (Tagajo Campus) | Efficient Computation of Weil Pairing over Supersingular Elliptic Curve and Its Evaluation Kazuma Tanaka (Univ. of Tsukuba), Tadanori Teruya (AIST), Naoki Kanayama, Takashi Nishide, Eiji Okamoto (Univ. of Tsukuba) ICSS2014-56 |
In SCIS 2014, the authors considered efficiency of computing symmetric parings on supersingular elliptic curves over fin... [more] | ICSS2014-56 pp.31-36 |
| ISEC | 2012-12-12 14:30 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Generating elliptic curves having efficient endomorphisms suitable for pairing computation and scalar multiplication Naoki Kanayama, Eiji Okamoto, Kazutaka Saito (Univ. of Tsukuba) ISEC2012-75 |
[more] | ISEC2012-75 pp.23-28 |
| ISEC, LOIS | 2012-11-22 15:10 |
Shizuoka | Shizuoka City Industry-University Exchange Center | A note on subgroup decision problem and pairing inversion problem Naoki Kanayama (Univ. of Tsukuba), Shigenori Uchiyama (Tokyo Metro. Univ.), Eiji Okamoto (Univ. of Tsukuba) ISEC2012-70 LOIS2012-45 |
[more] | ISEC2012-70 LOIS2012-45 pp.89-92 |
| ISEC | 2012-09-21 09:45 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Computation of pairings and scalar multiplication by using elliptic nets over small characteristic finite fields Naoki Kanayama, Yang Liu, Eiji Okamoto, Kazutaka Saito, Tadanori Teruya (Univ. of Tsukuba), Shigenori Uchiyama (Tokyo Metro Univ.) ISEC2012-44 |
[more] | ISEC2012-44 pp.7-13 |
| EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] | 2012-07-20 15:25 |
Hokkaido | Efficient elliptic curve scalar multiplication using an elliptic net algorithm Naoki Kanayama, Yang Liu, Eiji Okamoto, Kazutaka Saito, Tadanori Teruya (Univ. of Tsukuba), Shigenori Uchiyama (Tokyo Metro Univ.) ISEC2012-37 SITE2012-33 ICSS2012-39 EMM2012-29 |
[more] | ISEC2012-37 SITE2012-33 ICSS2012-39 EMM2012-29 pp.201-206 |
|
| ISEC | 2012-05-18 13:50 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A Note on Efficient Software Implementation of the Scalar Multiplication over Barreto-Naehrig Curves Tadanori Teruya, Naoki Kanayama, Eiji Okamoto (Univ. of Tsukuba) ISEC2012-3 |
In this paper, we describe a design of efficient software implementation of the scalar multiplication over the subgroup,... [more] | ISEC2012-3 pp.11-18 |
| ISEC | 2010-09-10 11:35 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Elliptic Net Based Ate Pairing And Its Variants Naoki Ogura (Tokyo Metropolitan Univ.), Naoki Kanayama (Univ. of Tsukuba), Shigenori Uchiyama (Tokyo Metropolitan Univ.), Eiji Okamoto (Univ. of Tsukuba) ISEC2010-40 |
[more] | ISEC2010-40 pp.13-19 |
| ISEC | 2009-09-25 15:45 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A note on pairing inversion problem Naoki Kanayama, Eiji Okamoto (Univ. of Tsukuba) ISEC2009-49 |
[more] | ISEC2009-49 pp.65-72 |
| ISEC | 2009-09-25 16:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A verifiable server-aided computation of scalar multiplication on elliptic curves Kouta Tamura, Naoki Kanayama, Akira Kanaoka, Tadahiko Ito, Masahiro Mambo, Eiji Okamoto (Univ. of Tsukuba) ISEC2009-50 |
Server-aided computation is the method which delegates computation to server side to execute heavy computation like a ... [more] |
ISEC2009-50 pp.73-78 |
| ISEC | 2007-05-18 15:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A multiplication formula on degenerate divisors of genus 4 hyperelliptic curves Naoki Kanayama, Takehiro Yamaguchi, Takeshi Okamoto, Eiji Okamoto (Tsukuba Univ.) ISEC2007-11 |
We show an pairing-friendly genus 4 hyperelliptic curve over finite fields of characteristic 2 and prove an scalar multi... [more] | ISEC2007-11 pp.69-76 |
| ISEC | 2006-12-13 13:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Proposal for an improvement of computing Twisted Ate pairing Seiichi Matsuda, Naoki Kanayama, Takeshi Okamoto, Eiji Okamoto (Tsukuba Univ.) |
[more] | ISEC2006-106 pp.29-34 |
| ISEC | 2005-09-16 16:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Generating Short Public-Keys for Factoring Based Cryptosytems and Their Cryptanalysis Naoki Kanayama (UEC), Shigenori Uchiyama (NTT) |
In 1995, Vanstone and Zuccherato proposed a novel method of generating RSA moduli having a predetermined set of bits ... [more] |
ISEC2005-86 pp.73-77 |
[Return to Top Page]