Paper 2019/916

Multi-owner Secure Encrypted Search Using Searching Adversarial Networks

Kai Chen, Zhongrui Lin, Jian Wan, Lei Xu, and Chungen Xu.


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.

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

Available format(s)
-- withdrawn --
Publication info
Published elsewhere. Minor revision. The 18th International Conference on Cryptology and Network Security (CANS 2019)
Searchable Symmetric EncryptionMulti-ownerRanked SearchSearching Adversarial NetworksMaximum Likelihood.
Contact author(s)
kaichen @ njust edu cn
2019-08-22: withdrawn
2019-08-13: received
See all versions
Short URL
Creative Commons Attribution
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.