| Presentation | 2018-11-04 Pairing-based Zero-Knowledge Proof of Graph Information Hiromi Yoshino, Toru Nakanishi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A network provider needs to consider a method that can disclose correct information to the system user without disclosing all the information of the network graph. A previous research realizes the proofs of graph information and the connectivity based on RSA cryptography. On the other hand, a pairing cryptography has been proposed, where the data size is smaller than the RSA. Furthermore, in the previous system, the proof data increase for the size of the graph. In this research, we construct a proof scheme for graph information and the connectivity using the pairing-based encryption. As a result, the data size becomes smaller than the RSA-based. In addition, by using the bilinear accumulator, the data size of zero-knowledge proof does not depend on the number of vertexes and edges. Then, we evaluate the scheme by implementing it on a PC and measuring its processing times and data size. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | graph / pairing / zero-knowledge proof |
| Paper # | ISEC2018-79,SITE2018-57,LOIS2018-39 |
| Date of Issue | 2018-10-27 (ISEC, SITE, LOIS) |
| Conference Information | |
| Committee | SITE / ISEC / LOIS |
|---|---|
| Conference Date | 2018/11/3(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Tetsuya Morizumi(Kanagawa Univ.) / Atsushi Fujioka(Kanagawa Univ.) / Tomohiro Yamada(NTT) |
| Vice Chair | Masaru Ogawa(Kobe Gakuin Univ.) / Takushi Otani(Kibi International Univ.) / Shiho Moriai(NICT) / Shoichi Hirose(Univ. of Fukui) / Toru Kobayashi(Nagasaki Univ.) |
| Secretary | Masaru Ogawa(Tokyo Health Care Univ.) / Takushi Otani(Toyo Eiwa Univ.) / Shiho Moriai(Tokai Univ.) / Shoichi Hirose(NICT) / Toru Kobayashi(NTT) |
| Assistant | Hisanori Kato(KDDI Research) / Nobuyuki Yoshinaga(Yamaguchi Pref Univ.) / Daisuke Suzuki(Hokuriku Univ.) / Kazunari Omote(Tsukuba Univ.) / Yuuji Suga(IIJ) / Shinichiro Eitoku(NTT) |
| Paper Information | |
| Registration To | Technical Committee on Social Implications of Technology and Information Ethics / Technical Committee on Information Security / Technical Committee on Life Intelligence and Office Information Systems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Pairing-based Zero-Knowledge Proof of Graph Information |
| Sub Title (in English) | |
| Keyword(1) | graph |
| Keyword(2) | pairing |
| Keyword(3) | zero-knowledge proof |
| 1st Author's Name | Hiromi Yoshino |
| 1st Author's Affiliation | Hiroshima University(Hiroshima Univ.) |
| 2nd Author's Name | Toru Nakanishi |
| 2nd Author's Affiliation | Hiroshima University(Hiroshima Univ.) |
| Date | 2018-11-04 |
| Paper # | ISEC2018-79,SITE2018-57,LOIS2018-39 |
| Volume (vol) | vol.118 |
| Number (no) | ISEC-279,SITE-280,LOIS-281 |
| Page | pp.pp.87-93(ISEC), pp.87-93(SITE), pp.87-93(LOIS), |
| #Pages | 7 |
| Date of Issue | 2018-10-27 (ISEC, SITE, LOIS) |