Ensuring Authentication Server Based Load Balancing Technique in Private Cloud System
Cloud computing has been considered as a new model of enterprise IT infrastructure, which can organize huge resource of computing, storage and applications, and enable users to enjoy ubiquitous, convenient and on-demand network access to a shared pool of configurable computing resources with great efficiency and minimal economic overhead. Attracted by these appealing features, both individuals and enterprises are motivated to contract out their data to the cloud, instead of purchasing software and hardware to manage the data themselves. So far, abundant works have been proposed under different threat models to achieve various search functionality, such as single keyword search, similarity search, multikeyword boolean search, ranked search, multi-keyword ranked search, etc. Among them, multi-keyword ranked search achieves more and more attention for its practical applicability. In this project, we propose a secure and ranked multi-keyword search protocol in a multi-owner cloud model over encrypted cloud data, which simultaneously supports dynamic update operations like deletion and insertion of documents. A special tree-based index structure is constructed and efficient multikeyword ranked search is proposed. Due to the use of the special tree-based index structure, the proposed scheme can achieve sub-linear search time and deal with the deletion and insertion of documents flexibly. As a result, different data owners use different keys to encrypt their files and keywords. Authenticated data users can issue a query without knowing secret keys of these different data owners. Extensive experiments on realworld datasets confirm the efficacy and efficiency of our proposed schemes.
. K. Ren, C. Wang, and Q. Wang, “Security challenges for the public
cloud,” IEEE Internet Comput., vol. 16, no. 1, pp. 69–73, Jan-Feb. 2012.
. S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Proc.
Financ. Cryptography Data Secur., 2010, pp. 136–149.
. C. Gentry, “A fully homomorphic encryption scheme,” Ph.D.
dissertation, Stanford Univ., Stanford, CA, USA, 2009.
. O. Goldreich and R. Ostrovsky, “Software protection and simulation on
oblivious rams,” J. ACM, vol. 43, no. 3, pp. 431–473, 1996.
. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key
encryption with keyword search,” in Proc. Adv. Cryptol.-Eurocrypt,
, pp. 506–522.
. D. Boneh, E. Kushilevitz, R. Ostrovsky, and W. E. Skeith III, “Public
key encryption that allows pir queries,” in Proc. Adv. Cryptol., 2007, pp.
. D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for
searches on encrypted data,” in Proc. IEEE Symp. Secur. Privacy, 2000,
. E.-J. Goh, “Secure indexes,” IACR Cryptol. ePrint Archive, vol. 2003,
p. 216, 2003.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.