Open Access Open Access  Restricted Access Subscription or Fee Access

A Well-Organized Privacy Preserving Ordered Keyword Search on Mapreduce Processing

S. Aravindan, R. Venkatesh, D. Suganya


Cloud documents in an encrypted form for the purpose of privacy preserving. It is essential to develop the efficient and reliable cipher text search techniques. The volume of data in data centers has a dramatic growth. This make to design cipher text search that provide reliable online information retrieval on large volume of encrypted data. A hierarchical clustering method to support more search and meet the demand for fast cipher text search. The hierarchical approach clusters based on the minimum relevance threshold and then partitions resulting the clusters into sub-clusters until the maximum size of cluster is reached. In the search phase, this can reach a linear computational complexity that will size increase of document collection. To verify the search results, a structure called minimum hash sub-tree is designed. The results show that increase the documents in the dataset that search time method increases the linearly whereas the search time of the traditional method increases exponentially.. In this paper, this method increases linearly which shows increased performance in searching of data.


Cloud Computing, Cipher Text Search, Ranked Search, Multi-Keyword Search, Big Data.

Full Text:



C. Wang, N. Cao, J. Li, K. Ren, and W. J. Lou, ”Secure Ranked Keyword Search over Encrypted Cloud Data,” in Proc. ICDCS, Genova, ITALY, 2010.

N. Cao, C. Wang, M. Li, K. Ren, and W. J. Lou, ”Privacy Preserving Multi-keyword Ranked Search over Encrypted Cloud Data,” in Proc. IEEE INFOCOM, Shanghai, China, 2011, pp. 829-837.

S. Kamara, C. Papamanthou, T.Roeder. Dynamic searchable symmetric encryption[C].Proceedings of the 2012 ACM conference on Computer and communications security. ACM, 2012: 965-976.

W. Sun, B. Wang, N. Cao, M. Li, W. Lou, Y. T. Hou, and H. Li, ”Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking,” in Proc. ASIACCS, Hangzhou, China, 2013, pp. 71-82.

Cash, D., Jaeger, J., Jarecki, S., Jutla, C., Krawczyk, H., Rosu, M. C., and Steiner, M. (2014). Dynamic searchable encryption in very large databases: Data structures and implementation. In Proc. of NDSS (Vol. 14)

S. Grzonkowski, P. M. Corcoran, and T. Coughlin, ”Security analysis of authentication protocols for next-generation mobile and CE cloud services,” in Proc. ICCE, Berlin, Germany, 2011, pp. 83-87.

D. X. D. Song, D. Wagner, and A. Perrig, ”Practical techniques for searches on encrypted data,” in Proc. S & P, BERKELEY, CA, 2000, pp. 44-55.

D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, ”Public key encryption with keyword search,” in Proc. EUROCRYPT, Interlaken, SWITZERLAND, 2004, pp. 506-522.

Y. C. Chang, and M. Mitzenmacher, ”Privacy preserving keyword searches on remote encrypted data,” in Proc. ACNS, Columbia Univ, New York, NY, 2005, pp. 442-455.

R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, ”Searchable symmetric encryption: improved definitions and efficient constructions,” in Proc. ACM CCS, Alexandria, Virginia, USA, 2006, pp. 79-88.

M. Bellare, A. Boldyreva, and A. O’Neill, ”Deterministic and efficiently searchable encryption,” in Proc. CRYPTO, Santa Barbara, CA, 2007, pp. 535-552.

D. Boneh, and B. Waters, ”Conjunctive, subset, and range queries on encrypted data,” in Proc. TCC, Amsterdam, NETHERLANDS, 2007, pp. 535-554.

D. X. D. Song, D. Wagner, and A. Perrig, ”Practical techniques for searches on encrypted data,” in Proc. S & P 2000, BERKELEY, CA, 2000, pp. 44-55.

E.-J. Goh, Secure Indexes, IACR Cryptology ePrint Archive, vol. 2003, pp. 216. 2003.

C. Wang, N. Cao, K. Ren, and W. J. Lou, Enabling Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data, IEEE Trans. Parallel Distrib. Syst., vol. 23, no. 8, pp. 1467-1479, Aug. 2012.

A.Swaminathan,Y.Mao,G.M.Su,H.Gou,A.Varna,S.He,M. Wu, and D. Oard, ”Confidentiality-Preserving Rank-Ordered Search,” in Proc. ACM StorageSS, Alexandria, VA, 2007, pp. 7-12.

S. Zerr, D. Olmedilla, W. Nejdl, and W. Siberski, ”Zerber+R: top-k retrieval from a confidential index,” in Proc. EDBT, Saint Petersburg, Russia, 2009, pp. 439-449.

P. Golle, J. Staddon, and B. Waters, ”Secure conjunctive keyword search over encrypted data,” in Proc. ACNS, Yellow Mt, China, 2004, pp. 31-45.

L. Ballard, S. Kamara, and F. Monrose, ”Achieving efficient conjunctive keyword searches over encrypted data,” in Proc. ICICS, Beijing, China, 2005, pp. 414-426.

R. Brinkman, Searching in encrypted data: University of Twente, 2007.

Y. H. Hwang, and P. J. Lee, ”Public key encryption with conjunctive keyword search and its extension to a multi-user system,” in Proc. Pairing, Tokyo, JAPAN, 2007.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.