The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Glorified Secure Search Schema Over Encrypted Secure Cloud Storage With a Hierarchical Clustering Computation
Abstract
This chapter improves the SE scheme to grasp these contest difficulties. In the development, prototypical, hierarchical clustering technique is intended to lead additional search semantics with a supplementary feature of making the scheme to deal with the claim for reckless cipher text search in big-scale surroundings, such situations where there is a huge amount of data. Least relevance of threshold is considered for clustering the cloud document with hierarchical approach, and it divides the clusters into sub-clusters until the last cluster is reached. This method may affect the linear computational complexity versus the exponential growth of group of documents. To authenticate the validity for search, minimum hash sub tree is also implemented. This chapter focuses on fetching of cloud data of a subcontracted encrypted information deprived of loss of idea and of security and privacy by transmission attribute key to the information. In the next level, the typical is improved with a multilevel conviction privacy preserving scheme.
Related Content
Dina Darwish.
© 2024.
43 pages.
|
Kassim Kalinaki, Musau Abdullatif, Sempala Abdul-Karim Nasser, Ronald Nsubuga, Julius Kugonza.
© 2024.
23 pages.
|
Yogita Yashveer Raghav, Ramesh Kait.
© 2024.
17 pages.
|
Renuka Devi Saravanan, Shyamala Loganathan, Saraswathi Shunmuganathan.
© 2024.
21 pages.
|
Veera Talukdar, Ardhariksa Zukhruf Kurniullah, Palak Keshwani, Huma Khan, Sabyasachi Pramanik, Ankur Gupta, Digvijay Pandey.
© 2024.
30 pages.
|
Dharmesh Dhabliya, Sukhvinder Singh Dari, Nitin N. Sakhare, Anish Kumar Dhablia, Digvijay Pandey, Balakumar Muniandi, A. Shaji George, A. Shahul Hameed, Pankaj Dadheech.
© 2024.
9 pages.
|
Avtar Singh, Shobhana Kashyap.
© 2024.
11 pages.
|
|
|