(α, β)-Core Query on Structured Encrypted Bipartite Graph

This research proposes a method for performing (α, β)-core queries, which identify tightly connected groups of nodes in bipartite graphs (networks with two types of connected entities), while keeping the underlying data encrypted. The approach uses structured encryption (a technique that allows computations on encoded data without decoding it) and avoids processing the entire graph by using index tables and graph coloring to efficiently find relevant nodes, while supporting queries on both node and edge attributes with acceptable performance overhead.