| 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 # | |
| SITE, ISEC, HWS, EMM, BioX, IPSJ-CSEC, IPSJ-SPT, ICSS [detail] | 2020-07-20 16:10 |
Online | Online | Short Lattice Signatures in the Standard Model with Efficient Tag Generation and Its Implementation Kaisei Kajita, Go Ohtake, Kazuto Ogawa (NHK), Koji Nuida, Tsuyoshi Takagi (Univ. of Tokyo)  ISEC2020-22 SITE2020-19 BioX2020-25 HWS2020-15 ICSS2020-9 EMM2020-19 |
We propose new short signature schemes under the Ring-SIS assumption in the standard model by revisiting an existing con... [more] | ISEC2020-22 SITE2020-19 BioX2020-25 HWS2020-15 ICSS2020-9 EMM2020-19 pp.53-60 |
| ISEC | 2017-05-12 17:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | [Invited Talk]
How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones Yuyu Wang (Tokyo Tech/AIST), Zongyang Zhang (Beihang University), Takahiro Matsuda, Goichiro Hanaoka (AIST), Keisuke Tanaka (Tokyo Tech) ISEC2017-12 |
In this paper, we bridge the gap between structure-preserving signatures (SPSs) and fully structure-preserving signature... [more] | ISEC2017-12 p.63 |
| ISEC | 2015-05-15 16:35 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | [Invited Talk]
Black-Box Separations for One-More (Static) Problems and Its Generalization Jiang Zhang, Zhenfeng Zhang, Yu Chen, Yanfei Guo (CAS), Zongyang Zhang (AIST) ISEC2015-7 |
We will present our ASIACRYPT 2014 paper about the hardness of one-more problems. As previous works only deal with one-m... [more] | ISEC2015-7 p.41 |
| ISEC, LOIS | 2011-11-14 10:00 |
Osaka | Osaka Electro-Communication University | Evaluation and Improvement against a Lattice Trapdoor Function in the Alwen-Peikert Construction Yosuke Todo, Masakatu Morii (Kobe Univ.) ISEC2011-34 LOIS2011-28 |
In 2009, Peikert proposed a public-key cryptosystem that is secure against the chosen ciphertext attack. In this cryptos... [more] | ISEC2011-34 LOIS2011-28 pp.1-6 |
| WBS, IT, ISEC | 2009-03-09 11:15 |
Hokkaido | Hakodate Mirai Univ. | A Note on Security of Knapsack Type PKC with Random Sequence Yasuyuki Murakami (Osaka Electro-Comm Univ.) IT2008-48 ISEC2008-106 WBS2008-61 |
Present author proposed a new method for constructing knapsack PKC by using a random sequence. In this paper, we propo... [more] |
IT2008-48 ISEC2008-106 WBS2008-61 pp.35-40 |
| IT | 2008-10-07 13:30 |
Tochigi | Asaya Hotel(Kinugawa Onsen) | [Special Talk]
Capacity Problem of Finite States Channels Kingo Kobayashi (Univ. Electro-Commun.) IT2008-39 |
Over thirty five years have elapsed since the algorithm to compute the capacity of discrete memoryless channel was estab... [more] | IT2008-39 pp.1-6 |
| ISEC | 2008-09-12 13:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | New Trapdoors in Knapsack Public-Key Cryptosystem with Two Sequences as Public Key Yasuyuki Murakami, Takeshi Nasako (Osaka Electro-Comm. Univ.), Masao Kasahara (Osaka Gakuin Univ.) ISEC2008-64 |
Present authors proposed a new class of knasack PKC (KMN PKC) which uses two sequences as the public key. KMN PKC uses... [more] |
ISEC2008-64 pp.9-16 |
| ISEC | 2005-12-16 13:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Improvement of Subset Difference Method Using Commutative Function Mai Nakagawa, Wataru Kishimoto (Chiba Univ.) |
When we bradcast some kind of data such as music or movie, we employ a revocation scheme to protect its copyright. N... [more] |
ISEC2005-114 pp.23-29 |
[Return to Top Page]