Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2021-11-12 13:25
Zero-Knowledge Proof of Isolation in Graph with Strong Secrecy
Tomoki Murakami, Toru Nakanishi, Katsunobu Imai (Hiroshima Univ.) ISEC2021-42 SITE2021-36 LOIS2021-25
Abstract (in Japanese) (See Japanese page) 
(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) 
(in English) zero-knowledge proof / graphs / accumulator / pairing / / / /  
Reference Info. IEICE Tech. Rep., vol. 121, no. 239, ISEC2021-42, pp. 7-12, Nov. 2021.
Paper # ISEC2021-42 
Date of Issue 2021-11-05 (ISEC, SITE, LOIS) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF ISEC2021-42 SITE2021-36 LOIS2021-25

Conference Information
Committee SITE ISEC LOIS  
Conference Date 2021-11-12 - 2021-11-12 
Place (in Japanese) (See Japanese page) 
Place (in English) Online 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To ISEC 
Conference Code 2021-11-SITE-ISEC-LOIS 
Language Japanese 
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  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
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.)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2021-11-12 13:25:00 
Presentation Time 25 minutes 
Registration for ISEC 
Paper # ISEC2021-42, SITE2021-36, LOIS2021-25 
Volume (vol) vol.121 
Number (no) no.239(ISEC), no.240(SITE), no.241(LOIS) 
Page pp.7-12 
#Pages 6 
Date of Issue 2021-11-05 (ISEC, SITE, LOIS) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan