Multi-owner Secure Encrypted Search Using Searching Adversarial Networks
원문 초록
Searchable symmetric encryption (SSE) for multi-owner model draws much attention as it enables data users to perform searches over encrypted cloud data outsourced by data owners. However, implementing secure and precise query, efficient search and flexible dynamic system maintenance at the same time in SSE remains a challenge. To address this, this paper proposes secure and efficient multi-keyword ranked search over encrypted cloud data for multi-owner model based on searching adversarial networks. We exploit searching adversarial networks to achieve optimal pseudo-keyword padding, and obtain the optimal game equilibrium for query precision and privacy protection strength. Maximum likelihood search balanced tree is generated by probabilistic learning, which achieves efficient search and brings the computational complexity close to $\mathcal{O}(\log N)$. In addition, we enable flexible dynamic system maintenance with balanced index forest that makes full use of distributed computing. Compared with previous works, our solution maintains query precision above 95% while ensuring adequate privacy protection, and introduces low overhead on computation, communication and storage.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Correlations Are Ruining Your Gradient Descent
SacFL: Self-Adaptive Federated Continual Learning for Resource-Constrained End Devices
Tree-Guided $L_1$-Convex Clustering
Distributed LLMs and Multimodal Large Language Models: A Survey on Advances, Challenges, and Future Directions
Benchmarking Dynamic SLO Compliance in Distributed Computing Continuum Systems
Distributed Mixture-of-Agents for Edge Inference with Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.