To see the other types of publications on this topic, follow the link: Ranked Multi-keyword Search and Tree Based Indexing.
Journal articles on the topic 'Ranked Multi-keyword Search and Tree Based Indexing'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 21 journal articles for your research on the topic 'Ranked Multi-keyword Search and Tree Based Indexing.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Bhavya, M*, J. Thriveni, and K. R. Venugopal. "EFURMS: An Efficient Scheme for File Upload and Ranked M ulti Keyword Search over Encrypted Data in Cloud." International Journal of Innovative Technology and Exploring Engineering (IJITEE) 10, no. 4 (2021): 224–31. https://doi.org/10.35940/ijitee.D8464.0210421.
Full textAbstract:
Cloud based services provide scalable storage capacities and enormous computing capability to enterp r ises and individuals to support big data operations in different sectors like banking, scientific research and health care. Therefore many data owners are interested to outsource their data to cloud storage servers due to their huge advantage in data proc e ssing. However, as the banking and health records usually contain sensitive data, there are privacy concerns if the data gets leaked to un trusted third parties in cloud storage. To protect data from leakage, the widely used technique is to encrypt the da t a before uploading into cloud storage servers. The traditional methods implemented by many authors consumes more time to outsource the data and searching for a document is also time consuming. Sometimes there may be chances of data leakage due to insuffic i ent security. To resolve these issues, in the current VPSearch(VPS) scheme is implemented, which provides features like verifiability of search results and privacy preservation. With its features the current system consumes more time for file uploading an d index generation, which slows down the searching process. In the existing VPS scheme time minimization to efficiently search for a particular document is a challenging task on the cloud. To resolve all the above drawbacks, we have designed an index gene r ation scheme using a tree structure along with a search algorithm using Greedy Depth first technique, that reduces the time for uploading files and file searching time. The newly implemented scheme minimizes the time required to form the index tree file f o r set of files in the document which are to be uploaded and helps in storing the files in a index tree format. These techniques result in reducing the document upload time and speeding up the process of accessing data efficiently using multi keyword searc h with top --'K' value.
2
Gaikwad, Suchetadevi M., and Sanjay B. Thakare. "Enhanced Crawler with Multiple Search Techniques using Adaptive Link-Ranking and Pre-Query Processing." Circulation in Computer Science 1, no. 1 (2016): 40–44. http://dx.doi.org/10.22632/ccs-2016-251-24.
Full textAbstract:
As deep web enlarges; there has been increased interest in methods which help efficiently trace deep-web interfaces. However, because of huge volume and varying nature of deep-web, achieving wide coverage and high efficiency is difficult issue. We proposed a three stage framework, an Enhanced Crawler, for efficiently gathering deep web interfaces. In first stage, enhanced crawler performs site based searching of center pages using automated search engines, avoiding visiting an oversized variety of pages and consuming time. In second stage, enhanced crawler achieves quick in site browsing by fetching most relevant links with associate degree of reconciling link ranking. For further enhancement, our system ranks and priorities websites and also uses a link tree data structure to achieve deep coverage. In third stage, our system provides pre-query processing mechanism so as to help users to write their search query easily by providing char by char keyword search with ranked indexing.
3
CHI, PIN-HAO, GRANT SCOTT, and CHI-REN SHYU. "A FAST PROTEIN STRUCTURE RETRIEVAL SYSTEM USING IMAGE-BASED DISTANCE MATRICES AND MULTIDIMENSIONAL INDEX." International Journal of Software Engineering and Knowledge Engineering 15, no. 03 (2005): 527–45. http://dx.doi.org/10.1142/s0218194005002439.
Full textAbstract:
Indexing protein tertiary structures has been shown to provide a scalable solution for structure-to-structure comparisons in large protein structure retrieval systems. To conduct similarity searches against 53,356 polypeptide chains in a database with real-time responses, two critical issues must be addressed, information extraction and suitable indexing. In this paper, we apply computer vision techniques to extract the predominant information encoded in each 2D distance matrix, generated from 3D coordinates of protein chains. Distance matrices are capable of representing specific protein structural topologies, and similar proteins will generate similar matrices. Once meaningful features are extracted from distance images, an advanced indexing structure, Entropy Balanced Statistical (EBS) k-d tree, can be utilized to index the multidimensional data. With a limited amount of training data from domain experts, namely structural classification of a subset of available protein chains, we apply various techniques in the pattern recognition field to determine clusters of proteins in the multi-dimensional feature space. Our system is able to recall search results in a ranked order from the protein database in seconds, exhibiting a reasonably high degree of precision.
4
Renugha, K., P. Shanthi, and A. Umamakeswari. "Multi-Keyword Ranked Search in Cloud Storage using Homomorphic Indexing." International Journal of Engineering & Technology 7, no. 2.24 (2018): 243. http://dx.doi.org/10.14419/ijet.v7i2.24.12057.
Full textAbstract:
In the cloud environment, the main issue is outsourcing of the information to the cloud service provider and outsider. Consider this, the cloud tenant store data in an encrypted form to achieve data security and privacy. The data owner needs the secure information sharing from the cloud and without leak of access pattern to the eavesdroppers. XOR homomorphic encryption searchable algorithm along with ranking is proposed to provide the security over the network. In addition our scheme provides secure Multi-keyword ranked search over encrypted data. Efficient ranked search algorithm returns the relevant document based on the results for the given multiple keywords. The experimental results prove that the system is efficient.
5
Dai, Hua, Xuelong Dai, Xiao Li, Xun Yi, Fu Xiao, and Geng Yang. "A Multibranch Search Tree-Based Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data." Security and Communication Networks 2020 (January 23, 2020): 1–15. http://dx.doi.org/10.1155/2020/7307315.
Full textAbstract:
In the interest of privacy concerns, cloud service users choose to encrypt their personal data before outsourcing them to cloud. However, it is difficult to achieve efficient search over encrypted cloud data. Therefore, how to design an efficient and accurate search scheme over large-scale encrypted cloud data is a challenge. In this paper, we integrate bisecting k-means algorithm and multibranch tree structure and propose the α-filtering tree search scheme based on bisecting k-means clusters. The novel index tree is built from bottom-up, and a greedy depth first algorithm is used for filtering the nonrelevant document cluster by calculating the relevance score between the filtering vector and the query vector. The α-filtering tree can improve the efficiency without the loss of search accuracy. The experiment on a real-world dataset demonstrates the effectiveness of our scheme.
6
Shanthi, P., and A. Umamakeswari. "Efficient top representative for multi-authorship encrypted cloud data to assist cognitive search." Journal of Intelligent & Fuzzy Systems 39, no. 6 (2020): 8079–89. http://dx.doi.org/10.3233/jifs-189130.
Full textAbstract:
Cloud computing is gaining ground in the digital and business world. It delivers storage service for user access using Internet as a medium. Besides the numerous benefits of cloud services, migrating to public cloud storage leads to security and privacy concerns. Encryption method protects data privacy and confidentiality. However, encrypted data stored in cloud storage reduces the flexibility in processing data. Therefore, the development of new technologies to search top representatives from encrypted public storage is the current requirement. This paper presents a similarity-based keyword search for multi-author encrypted documents. The proposed Authorship Attribute-Based Ranked Keyword Search (AARKS) encrypts documents using user attributes, and returns ranked results to authorized users. The scheme assigns weight to index vectors by finding the dominant keywords of the specific authority document collection. Search using the proposed indexing prunes away branches and processes only fewer nodes. Re-weighting documents using the relevant feedback also improves user experience. The proposed scheme ensures the privacy and confidentiality of data supporting the cognitive search for encrypted cloud data. Experiments are performed using the Enron dataset and simulated using a set of queries. The precision obtained for the proposed ranked retrieval is 0.7262. Furthermore, information leakage to a cloud server is prevented, thereby proving its suitability for public storage.
7
Dr.K.V.Ranga, Rao*1 &. Dr.B.Vijayakumar2. "MULTIKEYWORD SEARCH SCHEMA FOR CLOUD DATA." GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES 5, no. 4 (2018): 21–30. https://doi.org/10.5281/zenodo.1216749.
Full textAbstract:
Due to the increasing popularity of cloud computing, more and more data owners are motivated to outsource their data to cloud servers for great convenience and reduced cost in data management. However, sensitive data should be encrypted before outsourcing for privacy requirements, which obsoletes data utilization like keyword-based document retrieval. In this paper, we present a secure multi-keyword ranked search scheme over encrypted cloud data, which simultaneously supports dynamic update operations like deletion and insertion of documents. Specifically, the vector space model and the widely-used TF IDF model are combined in the index construction and query generation. We construct a special tree-based index structure and propose a Greedy Depth-first Search algorithm to provide efficient multi-keyword ranked search. The secure KNN algorithm is utilized to encrypt the index and query vectors, and meanwhile ensure accurate relevance score calculation between encrypted index and query vectors. In order to resist statistical attacks, phantom terms are added to the index vector for blinding search results. Due to the use of our special tree-based index structure, the proposed scheme can achieve sub-linear search time and deal with the deletion and insertion of documents flexibly. Extensive experiments are conducted to demonstrate the efficiency of the proposed scheme
8
Hu, Zheng, Hua Dai, Geng Yang, Xun Yi, and Wenjie Sheng. "Semantic-Based Multi-Keyword Ranked Search Schemes over Encrypted Cloud Data." Security and Communication Networks 2022 (April 29, 2022): 1–15. http://dx.doi.org/10.1155/2022/4478618.
Full textAbstract:
Traditional searchable encryption schemes construct document vectors based on the term frequency-inverse document frequency (TF-IDF) model. Such vectors are not only high-dimensional and sparse but also ignore the semantic information of the documents. The Sentence Bidirectional Encoder Representations from Transformers (SBERT) model can be used to train vectors containing document semantic information to realize semantic-aware multi-keyword search. In this paper, we propose a privacy-preserving searchable encryption scheme based on the SBERT model. The SBERT model is used to train vectors containing the semantic information of documents, and these document vectors are then used as input to the Hierarchical Density-Based Spatial Clustering of Applications with Noise (HDBSCAN) clustering algorithm. The HDBSCAN algorithm generates a soft cluster membership vector for each document. We treat each cluster as a topic, and the vector represents the probability that the document belongs to each topic. According to the clustering process in the schemes, the topic-term frequency-inverse topic frequency (TTF-ITF) model is proposed to generate keyword topic vectors. Through the SBERT model, searchable encryption scheme can achieve more precise semantic-aware keyword search. At the same time, the special index tree is used to improve search efficiency. The experimental results on real datasets prove the effectiveness of our scheme.
9
Kuldeep P. Sambrekar, Narendra Shyam Joshi ,. "Privacy-Preserving and Ranked Search Using Advanced Multi-Keyword Scheme Over the Encrypted Cloud Environment." Journal of Electrical Systems 20, no. 1s (2024): 353–65. http://dx.doi.org/10.52783/jes.776.
Full textAbstract:
In order to enable users to extract useful insights on demand, this paper presents a unique approach for secure and privacy-preserving ranked search in cloud environments. There is a rising need for strong systems that strike a balance between data utility and individual privacy as cloud-based data processing and storage become more and more prevalent. Our suggested methodology makes use of sophisticated multi-keyword operators and encryption methods to offer a safe and effective solution for cloud-based ranked search that protects privacy. Our methodology's essential component is the combination of a safe encryption technique and sophisticated multi-keyword search operators. With this combination, users can do ranked searches on encrypted data while maintaining the privacy of the underlying data. Our approach leverages strong cryptography protocols and an advanced indexing mechanism to provide rapid retrieval of relevant results while protecting confidential information from unauthorized individuals. Secure query processing techniques and encryption are added for added privacy protection. This guarantees that throughout the ranking search operations, the decrypted data cannot be accessed by the cloud service provider or any other parties participating in the data processing pipeline. Users don't have to compromise the privacy of their stored data or expose the exact text of their queries to obtain ranked results based on several keywords. Our technology is especially useful in situations when customers need instantaneous insights from data stored in the cloud without compromising privacy. Our technology protects the secrecy of the underlying datasets while enabling customers to obtain secure insights on demand in a variety of sensitive sectors, including financial analysis and medical research. The suggested method offers a strong and adaptable way to achieve privacy-preserving ranked search in cloud environments. Through the incorporation of sophisticated multi-keyword operators and encryption strategies, our approach guarantees users may effectively obtain pertinent data while maintaining personal privacy. With its ability to provide safe, anytime access to insights stored in cloud-based data repositories, this breakthrough has enormous potential for a variety of applications.
10
Lin, Je-Kuan, Wun-Ting Lin, and Ja-Ling Wu. "Flexible and Efficient Multi-Keyword Ranked Searchable Attribute-Based Encryption Schemes." Cryptography 7, no. 2 (2023): 28. http://dx.doi.org/10.3390/cryptography7020028.
Full textAbstract:
Currently, cloud computing has become increasingly popular and thus, many people and institutions choose to put their data into the cloud instead of local environments. Given the massive amount of data and the fidelity of cloud servers, adequate security protection and efficient retrieval mechanisms for stored data have become critical problems. Attribute-based encryption brings the ability of fine-grained access control and can achieve a direct encrypted data search while being combined with searchable encryption algorithms. However, most existing schemes only support single-keyword or provide no ranking searching results, which could be inflexible and inefficient in satisfying the real world’s actual needs. We propose a flexible multi-keyword ranked searchable attribute-based scheme using search trees to overcome the above-mentioned problems, allowing users to combine their fuzzy searching keywords with AND–OR logic gates. Moreover, our enhanced scheme not only improves its privacy protection but also goes a step further to apply a semantic search to boost the flexibility and the searching experience of users. With the proposed index-table method and the tree-based searching algorithm, we proved the efficiency and security of our schemes through a series of analyses and experiments.
11
Gampala, Veerraju, and Sreelatha Malempati. "EMSRSE: Efficient Multi-Keyword Synonym Based Ranked Search Technique Over Outsourced Encrypted Cloud Data." International Journal of Engineering & Technology 7, no. 4.36 (2018): 736. http://dx.doi.org/10.14419/ijet.v7i4.36.24232.
Full textAbstract:
Recently, searching over encrypted cloud-data outsourcing has attracted the current researcher. Using cloud computing (CC), individuals and organizations are motivated to outsource their private and sensitive data onto the cloud service provider (CSP) due to less maintenance cost, great flexibility, and ease of access. However, the data should be encrypted using encryption techniques such as DES and AES before uploading to the CSP in order to provide data privacy and protection, which obsolete plaintext searching techniques over encrypted cloud data. Thus, this article proposes an efficient multi-keyword synonym-based ranked searching technique over encrypted cloud data (EMSRSE), which supports dynamic insertion and deletion of documents. The main objectives of EMSRSE are 1. To build an index search tree in order to store encrypted index vectors of documents and 2. To achieve better searching efficiency, a searching technique over the encrypted index tree is proposed. An extensive research and empirical result analysis show that the proposed EMSRSE scheme achieves better efficiency in comparison with other existing methods.
12
Shen, Huanglin, Linlin Xue, Haijiang Wang, Lei Zhang, and Jinying Zhang. "B+-Tree Based Multi-Keyword Ranked Similarity Search Scheme Over Encrypted Cloud Data." IEEE Access 9 (2021): 150865–77. http://dx.doi.org/10.1109/access.2021.3125729.
Full text
13
M, Bhavya, Thriveni J, and Venugopal K R. "EFURMS: An Efficient Scheme for File Upload and Ranked Multi-Keyword Search over Encrypted Data in Cloud." International Journal of Innovative Technology and Exploring Engineering 10, no. 4 (2021): 224–31. http://dx.doi.org/10.35940/ijitee.d8464.0210421.
Full textAbstract:
Cloud based services provide scalable storage capacities and enormous computing capability to enterprises and individuals to support big data operations in different sectors like banking, scientific research and health care. Therefore many data owners are interested to outsource their data to cloud storage servers due to their huge advantage in data processing. However, as the banking and health records usually contain sensitive data, there are privacy concerns if the data gets leaked to un-trusted third parties in cloud storage. To protect data from leakage, the widely used technique is to encrypt the data before uploading into cloud storage servers. The traditional methods implemented by many authors consumes more time to outsource the data and searching for a document is also time consuming. Sometimes there may be chances of data leakage due to insufficient security. To resolve these issues, in the current VPSearch(VPS) scheme is implemented, which provides features like verifiability of search results and privacy preservation. With its features the current system consumes more time for file uploading and index generation, which slows down the searching process. In the existing VPS scheme time minimization to efficiently search for a particular document is a challenging task on the cloud. To resolve all the above drawbacks, we have designed an index generation scheme using a tree structure along with a search algorithm using Greedy Depth-first technique, that reduces the time for uploading files and file searching time. The newly implemented scheme minimizes the time required to form the index tree file for set of files in the document which are to be uploaded and helps in storing the files in a index tree format. These techniques result in reducing the document upload time and speeding up the process of accessing data efficiently using multi-keyword search with top-'K' value.
14
Rani, Katari Pushpa, L. Lakshmi, Ch Sabitha, B. Dhana Lakshmi, and S. Sreeja. "Top-K search scheme on encrypted data in cloud." International Journal of Advances in Applied Sciences 9, no. 1 (2020): 67. http://dx.doi.org/10.11591/ijaas.v9.i1.pp67-69.
Full textAbstract:
<span>A Secure and Effective Multi-keyword Ranked Search Scheme on Encrypted Cloud Data. Cloud computing is providing people a very good knowledge on all the popular and relevant domains which they need in their daily life. For this, all the people who act as Data Owners must possess some knowledge on Cloud should be provided with more information so that it will help them to make the cloud maintenance and administration easy. And most important concern these days is privacy. Some sensitive data exposed in the cloud these days have security issues. So, sensitive information ought to be encrypted earlier before making the data externalized for confidentiality, which makes some keyword-based information retrieval methods outdated. But this has some other problems like the usage of this information becomes difficult and also all the ancient algorithms developed for performing search on these data are not so efficient now because of the encryption done to help data from breaches. In this project, we try to investigate the multi- keyword top-k search problem for encryption against privacy breaks and to establish an economical and secure resolution to the present drawback. we have a tendency to construct a special tree-based index structure and style a random traversal formula, which makes even identical question to supply totally different visiting ways on the index, and may additionally maintain the accuracy of queries unchanged below stronger privacy. For this purpose, we take the help of vector area models and TFIDF. The KNN set of rules are used to develop this approach.</span>
15
K., Pushpa Rani, Lakshmi L., Sabitha Ch., Dhana Lakshmi B., and Sreeja S. "Top-K search scheme on encrypted data in cloud." International Journal of Advances in Applied Sciences (IJAAS) 9, no. 1 (2020): 67–69. https://doi.org/10.11591/ijaas.v9.i1.pp67-69.
Full textAbstract:
A Secure and Effective Multi-keyword Ranked Search Scheme on Encrypted Cloud Data. Cloud computing is providing people a very good knowledge on all the popular and relevant domains which they need in their daily life. For this, all the people who act as Data Owners must possess some knowledge on Cloud should be provided with more information so that it will help them to make the cloud maintenance and administration easy. And most important concern these days is privacy. Some sensitive data exposed in the cloud these days have security issues. So, sensitive information ought to be encrypted earlier before making the data externalized for confidentiality, which makes some keyword-based information retrieval methods outdated. But this has some other problems like the usage of this information becomes difficult and also all the ancient algorithms developed for performing search on these data are not so efficient now because of the encryption done to help data from breaches. In this project, we try to investigate the multi- keyword top-k search problem for encryption against privacy breaks and to establish an economical and secure resolution to the present drawback. we have a tendency to construct a special tree-based index structure and style a random traversal formula, which makes even identical question to supply totally different visiting ways on the index, and may additionally maintain the accuracy of queries unchanged below stronger privacy. For this purpose, we take the help of vector area models and TFIDF. The KNN set of rules are used to develop this approach.
16
Baby, Bibin, and Sharmila Banu. "Enhanced Security for Dynamic Multi Keyword Ranked Search Using Greedy Best First Search." International Journal of Scientific Research in Computer Science, Engineering and Information Technology, January 5, 2019, 74–78. http://dx.doi.org/10.32628/cseit1838111.
Full textAbstract:
Today, due to the enormous growth of data technology in cloud computing, the data owners are stimulated to outsource their data in data management to reduce cost and for the convenient. Data confidentiality, in general, can be obtained by encrypting the data before it is outsourced. The client stores the encrypted data to the cloud using Searchable encryption schemes and applies keyword search techniques over cipher text domain. But the main problem in outsourcing is the lack of security and privacy for the sensitive data. So, to overcome this, for privacy requirement, the sensitive data can be encrypted before it is outsourced. Various methods were proposed to preserve the privacy and to provide security to the cloud data which are encrypted. Here in this paper, we proposed a tree-based search method over the encrypted datain the cloud that supports dynamic operation and multi-keyword ranked search. Clearly, the commonly used “inverse document frequency (IDF) term frequency (TF)” model and the vector space method are joined in the query generation and index creation to give multi-keyword ranked search. To get high search efficiency, a tree-type index structure, “Greedy Best-first Search” algorithm is proposed based on the tree- index.
17
PARADESI, SUBBA RAO. "Encrypted Cloud Data Based Secure and Dynamic Multi-Keyword Ranked Search Scheme." April 16, 2021. https://doi.org/10.5281/zenodo.7375460.
Full textAbstract:
Abstract: Due to the increasing popularity of cloud computing, more and more data owners are motivated to outsource their data to cloud servers for great convenience and reduced cost in data management. However, sensitive data should be encrypted before outsourcing for privacy requirements, which obsoletes data utilization like keyword-based document retrieval. In this paper, we present a secure multi-keyword ranked search scheme over encrypted cloud data, which simultaneously supports dynamic update operations like deletion and insertion of documents. Specifically, the vector space model and the widely-used TF IDF model are combined in the index construction and query generation. We construct a special tree-based index structure and propose a “Greedy Depth-first Search” algorithm to provide efficient multikeyword ranked search. The secure kNN algorithm is utilized to encrypt the index and query vectors, and meanwhile ensure accurate relevance score calculation between encrypted index and query vectors. In order to resist statistical attacks, phantom terms are added to the index vector for blinding search results. Due to the use of our special tree-based index structure, the proposed scheme can achieve sub-linear search time and deal with the deletion and insertion of documents flexibly. Extensive experiments are conducted to demonstrate the efficiency of the proposed scheme. Index Terms—Searchable encryption, multikeyword ranked search, dynamic update, cloud computing
18
Jawale, Tarika P., and R. B. Mapari. "Secure and Dynamic Multi-Keyword Ranked Search Scheme Over Encrypted Cloud Data Using K-Means Clustering." International Journal of Scientific Research in Science and Technology, March 8, 2019, 230–35. http://dx.doi.org/10.32628/ijsrst196238.
Full textAbstract:
A Secure and Dynamic Multi-keyword graded Search theme over Encrypted Cloud information attributable to the increasing fame of cloud computing, a lot of information homeowners are spurred to source their information to cloud servers for unimaginable accommodation and diminished expense in information management can also perform information dynamic operations on files. On the opposite hand, sensitive information needs to be encrypted before outsourcing for security conditions, that obsoletes information use like keyword-based document retrieval. A protected multi-keyword graded search theme over encrypted cloud information, that all the whereas underpins part update operations like deletion and insertion of documents. Especially, the vector area model and therefore the usually utilised TF_IDF model are consolidated as a neighbourhood of the index development and question generation. A unique tree-based index structure employing a "K-means Clustering" formula to provide practiced multi-keyword graded search. The secure KNN formula is employed to cipher the index and question vectors, so guarantee precise importance score calculation between encrypted index and question vectors. With a selected finish goal to oppose measurable attacks, phantom terms are accessorial to the index vector for glaring search results. Due to the employment of our exceptional tree-based index structure. Keyword: Reduplication, Authorized duplicate check, public auditing, shared data, Cloud computing.
19
Indhuja, A., T.P.Udaya shankar, Mastan Vali Shaik R.M Balajee, and P. Sujatha. "A MULTI-KEYWORD RANKED SEARCH SCHEME OVER ENCRYPTED BASED ON HIERARCHICAL CLUSTERING INDEX." International Journal on Smart Sensing and Intelligent Systems 10, no. 4 (2017). https://doi.org/10.21307/ijssis-2017-269.
Full textAbstract:
A Secure and Dynamic Multi-keyword Ranked Search Scheme over Encrypted Cloud Data Due to the increasing popularity of cloud computing, more and more data owners are motivated to outsource their data to cloud servers for great convenience and reduced cost in data management. In this project, present a secure multi-keyword ranked search scheme over encrypted cloud data, which simultaneously supports dynamic update operations like deletion and insertion of documents. Specifically, the vector space model and the widely-used TFIDF model are combined in the index construction and query generation. The proposed hierarchical approach clusters the documents based on the minimum relevance threshold, and then partitions the resulting clusters into sub-clusters until the constraint on the maximum size of cluster is reached. In the search phase, this approach can reach a linear computational complexity against an exponential size increase of document collection. In order to verify the authenticity of search results, a structure called minimum hash sub-tree is designed in this paper. Due to the use of our special tree-based index structure, the proposed scheme can achieve sub-linear search time and deal with the deletion and insertion of documents flexibly. Extensive experiments are conducted to demonstrate the efficiency of the proposed scheme.
20
"Secure Ranked Multi-Keyword Search based on Modified Blowfish Algorithm and AVL Tree in Untrusted Cloud Environment." International Journal of Engineering and Advanced Technology 9, no. 1 (2019): 6738–44. http://dx.doi.org/10.35940/ijeat.a2041.109119.
Full textAbstract:
Advancement in cloud services growing day by day motivates a huge number of data proprietors to store their valuable data in cloud servers. For privacy issue, datasets that contain sensitive information are encrypted first and then outsourced into the cloud server. In this paper, ranked multi keyword search based on AVL tree, especially for several data owners, has been proposed. To avoid unauthorized access, the proposed work encrypts the data using a Modified Blowfish (MB) algorithm before outsourcing. MB algorithm introduces # operation instead of normal OR operation in conventional blowfish algorithm. This MB algorithm provides robustness against any intruding whereas the conventional blowfish algorithm insecure for many applications. To achieve a proficient search, every data owner’s index based on AVL tree is encrypted by way of additive order and the privacy-preserving family is formed. The cloud server is then permitted to combine these indexes effectually without knowing the index content. An Iterative Deepening Depth First Search (IDDFS) procedure is used to discover the matching file for the data user request. Finally, our proposed work provides secure data outsourcing to cloud server compared to the other existing methods. The proposed work considers three metrics for the performance evaluation process, viz. precision, index construction time and search time.
21
Uday, Prasad, Lakshmi Durga G, Thriveni U, Mounika M, and Yamini K. "Semantic Searching Scheme over Encrypted Data by Applying Optimal Matching in Technique in Cloud." June 7, 2024. https://doi.org/10.5281/zenodo.13764127.
Full textAbstract:
With the increasing adoption of cloud computing, a developing number of users re-appropriatetheir datasets to cloud. To protect the privacy, the datasets are usually encrypted prior to reappropriating. Be that as it may, the normal practice of encryption makes the successfulutilization of the data troublesome. For example, it is hard to search the given keywords inencrypted datasets. Many plans are proposed to make encrypted data searchable based onkeywords. Be that as it may, watchword based search plans overlook the semantic representationinformation of users retrieval, and cannot totally meet with users search aim. Accordingly, howto plan a substance based search plan and make semantic search more successful and settingaware is a troublesome challenge. In this paper, we propose ECSED, a novel semantic searchconspire based on the idea hierarchy and the semantic relationship between ideas in theencrypted datasets. ECSED utilizes two cloud servers. One is utilized to store the reevaluateddatasets and return the ranked outcomes to data users. The other one is utilized to process thesimilarity scores between the records and the inquiry and send the scores to the primary server.To additionally improve the search proficiency, we use a tree-based file construction to organizeall the record list vectors. We utilize the multi keyword ranked search over encrypted cloud dataas our basic frame to propose two secure plans. The test results based on the real world datasetsshow that the plan is more proficient than past plans. We also demonstrate that our plans aresecure under the known ciphertext model and the realized background model.