Cryptology ePrint Archive: Report 2019/916

Multi-owner Secure Encrypted Search Using Searching Adversarial Networks

Kai Chen; Zhongrui Lin; Jian Wan; Lei Xu; Chungen Xu.

Abstract: 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.

Category / Keywords: applications / Searchable Symmetric Encryption; Multi-owner; Ranked Search; Searching Adversarial Networks; Maximum Likelihood.

Original Publication (with minor differences): The 18th International Conference on Cryptology and Network Security (CANS 2019)

Date: received 11 Aug 2019, withdrawn 22 Aug 2019

Contact author: kaichen at njust edu cn

Available format(s): (-- withdrawn --)

Note: Fixed details of the meeting version, such as spelling errors and ambiguities in the content description.

Version: 20190822:171017 (All versions of this report)

Short URL: ia.cr/2019/916


[ Cryptology ePrint archive ]