Prakash, V.S. and Karthikeyan, N and Kanagaraj, A. and P J, Shriidhar and Viiayakumar, P. (2024) Maximizing Data Privacy: Empirical Analysis of Multi-Keyword Data Search and Privacy Protection over Cloud Computing Paradigm. In: UNSPECIFIED.
Full text not available from this repository.Abstract
In the realm of cloud computing, querying on secured information has emerged as a technology of critical importance. These kinds of searches make it possible for the owner of the data to search through encrypted data that is kept in the cloud without revealing any pertinent information. Numerous strategies, the most of which concentrate on conjunctive and disjunctive keyword searches, have been presented by researchers in an effort to improve the quality of the search experience. On the other hand, a disjunction will provide an excessive number of results, but a conjunction of all the keywords could only produce a small number of results. It is tough to customize the relevance of the keywords given the present schemes, which makes it difficult to acquire the results that are required. For the purpose of resolving these issues, we offer a unique technique that we name the Secured Multiple Keyword Searching Scheme (SMKSS). This scheme allows for the search to be conducted with the user specifying the amount of keywords that are included in the search result. A cross-validation is performed between the proposed scheme and the traditional Ranked Keyword Searching Model (RKSM) in order to determine how effective the novel scheme is. This particular quantity, n, can be utilized to personalize the relevance of the term. Furthermore, as a consequence of this, the owner of the data might acquire the desired search results that include any n terms from a keyword collection. Not only does the proposed system allow the conventional disjunctive and conjunctive keyword searches, but it also supports these searches when n equals one or the size of the keyword collection, respectively. There is a possibility that the keyword will be critical. Initially, we provide a formal definition of its security, and then we demonstrate that the proposed scheme is safe against the adaptive selected keyword attack in the standard model, and that it is also capable of providing some degree of defense towards the traditional keywords determining operation. In addition to this, we give a theoretical assessment of performance against various methods, as well as practical evaluations on the scheme that has been deployed. © 2024 Elsevier B.V., All rights reserved.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Computer Science > Computer Networks and Communications |
| Divisions: | Arts and Science > Vinayaka Mission's Kirupananda Variyar Arts & Science College, Salem > Computer Science |
| Depositing User: | Unnamed user with email techsupport@mosys.org |
| Last Modified: | 27 Nov 2025 06:56 |
| URI: | https://vmuir.mosys.org/id/eprint/1936 |
Dimensions
Dimensions