What is security in graph analysis?
Scalable and High-speed Authentication Method for Distributed Random Walks @ kate
In recent years, the use of graph databases has expanded, with random walks (RW) proving particularly useful for analysis and recommendation systems. However, existing access control methods are designed for small-scale systems and are impractical in environments involving large-scale communication. Therefore, we are pursuing optimization by considering optimal control methods for integrating graphs with multiple owners under RW environments and by varying authentication methods based on specific conditions. Please note that the following information is intended for business purposes only.
Robust Graph Watermark Against Edge Rewiring Based on the Number of Motifs @ yuno
Providing graphs to third parties expands the possibilities of graph analysis. For example, it enables multiple graphs with different owners to be interconnected, broadening the scope of information exploration. However, there is a risk that the graph one provides could be leaked without permission, necessitating technology like digital watermarking to prevent such leaks when sharing graphs. This research proposes a graph digital watermarking technique that embeds information into the graph structure by making small modifications that do not affect analysis.