Presentation | 2021-11-12 Zero-Knowledge Proof of Isolation in Graph with Strong Secrecy Tomoki Murakami, Toru Nakanishi, Katsunobu Imai, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Network systems can be represented using graphs. What is important for a tenant is that his system is well connected (connectivity) and that his system is separated from other tenants (isolation). There is a demand for a method of confirming the connectivity and isolation to tenants without disclosing the network topology. As a solution, an RSA-based zero-knowledge proof scheme for a graph has been proposed. On the other hand, a scheme using a pairing-based accumulator has been proposed, where the proof size and the verification time do not depend on the total number of all vertexes and edges. However, in the scheme, the number of connected components was disclosed in the proof of isolation. Therefore, in this study, we propose a zero-knowledge proof scheme for isolation with the stronger secrecy by extending the previous pairing-based scheme. Then we implement the proposed scheme on a PC and evaluate it by measuring the processing time. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | zero-knowledge proof / graphs / accumulator / pairing |
Paper # | ISEC2021-42,SITE2021-36,LOIS2021-25 |
Date of Issue | 2021-11-05 (ISEC, SITE, LOIS) |
Conference Information | |
Committee | SITE / ISEC / LOIS |
---|---|
Conference Date | 2021/11/12(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | Online |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | Masaru Ogawa(Kobe Gakuin Univ.) / Tetsuya Izu(Fujitsu Labs.) / Toru Kobayashi(Nagasaki Univ.) |
Vice Chair | Takushi Otani(Kibi International Univ.) / Takeo Tatsumi(Open Univ. of Japan) / Noboru Kunihiro(Tsukuba Univ.) / Goichiro Hanaoka(AIST) / Hiroyuki Toda(NTT) |
Secretary | Takushi Otani(Yamaguchi Pref Univ.) / Takeo Tatsumi(Hokuriku Univ.) / Noboru Kunihiro(Fujitsu Labs.) / Goichiro Hanaoka(Ibaraki Univ.) / Hiroyuki Toda(Nagasaki Univ.) |
Assistant | Hideyuki Fujii(NRI-Secure) / Yusuke Tachibana(Fukuoka Inst. of Tech.) / Takahiro Matsuda(AIST) / Kazuki Fukae(Nagasaki Univ.) |
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) | Zero-Knowledge Proof of Isolation in Graph with Strong Secrecy |
Sub Title (in English) | |
Keyword(1) | zero-knowledge proof |
Keyword(2) | graphs |
Keyword(3) | accumulator |
Keyword(4) | pairing |
1st Author's Name | Tomoki Murakami |
1st Author's Affiliation | Hiroshima University(Hiroshima Univ.) |
2nd Author's Name | Toru Nakanishi |
2nd Author's Affiliation | Hiroshima University(Hiroshima Univ.) |
3rd Author's Name | Katsunobu Imai |
3rd Author's Affiliation | Hiroshima University(Hiroshima Univ.) |
Date | 2021-11-12 |
Paper # | ISEC2021-42,SITE2021-36,LOIS2021-25 |
Volume (vol) | vol.121 |
Number (no) | ISEC-239,SITE-240,LOIS-241 |
Page | pp.pp.7-12(ISEC), pp.7-12(SITE), pp.7-12(LOIS), |
#Pages | 6 |
Date of Issue | 2021-11-05 (ISEC, SITE, LOIS) |