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 2025-07-31 15:55
Robust Graph Watermark Against Edge Rewiring Based on the Number of Motifs
Yufuko Kawabata, Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2025-17
Abstract (in Japanese) (See Japanese page) 
(in English) In the future, it is expected that graphs will be provided to third parties and used for various types of analysis.It is important to note that there are inherent risks associated with the dissemination of graphs by users, which may include the potential for their unauthorized disclosure to third parties.Watermarking, a technique that embeds information into the graph structure by adding or deleting edges, is a useful method to deter leakage.Existing methods have a problem: information cannot be extracted from a watermarked graph if the node labels are reassigned or a large number of edges are randomly updated (added or deleted).In this study, we propose a watermarking method for directed graphs that is robust to graph manipulations, such as node label reassignment and random edge updates, by embedding information in a specific number of motifs.Specifically, we select 4-node motifs that contain bi-directional edges and whose number of motifs changes little in response to random edge updates.Adding arbitrary edges to lower-order nodes increases the number of these motifs and embeds information.Information is extracted by counting the frequency of motifs in a watermarked graph.Evaluations demonstrated that for random edge additions equivalent to 1% of the entire graph, information can be extracted with a probability that is at least 100% higher than that of existing methods.
Keyword (in Japanese) (See Japanese page) 
(in English) graph / motif / watermark / / / / /  
Reference Info. IEICE Tech. Rep., vol. 125, no. 137, IN2025-17, pp. 37-42, July 2025.
Paper # IN2025-17 
Date of Issue 2025-07-24 (IN) 
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 IN2025-17

Conference Information
Committee CCS IN  
Conference Date 2025-07-31 - 2025-08-01 
Place (in Japanese) (See Japanese page) 
Place (in English) Global Research Center for Food & Medical Innovation, Hokkaido Univ 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Network Science, Future Network, Cloud/SDN/Virtualization, Contents Delivery/Contents Exchange, and others 
Paper Information
Registration To IN 
Conference Code 2025-07-CCS-IN 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Robust Graph Watermark Against Edge Rewiring Based on the Number of Motifs 
Sub Title (in English)  
Keyword(1) graph  
Keyword(2) motif  
Keyword(3) watermark  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Yufuko Kawabata  
1st Author's Affiliation Keio University (Keio Univ.)
2nd Author's Name Tsuyoshi Yamashita  
2nd Author's Affiliation Keio University (Keio Univ.)
3rd Author's Name Kunitake Kaneko  
3rd Author's Affiliation Keio University (Keio 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 2025-07-31 15:55:00 
Presentation Time 25 minutes 
Registration for IN 
Paper # IN2025-17 
Volume (vol) vol.125 
Number (no) no.137 
Page pp.37-42 
#Pages 6 
Date of Issue 2025-07-24 (IN) 

[Return to Top Page]

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