scholarly journals Enhance manet usability for encrypted data retrieval from cloud computing

2020 ◽  
Vol 18 (1) ◽  
pp. 64
Author(s):  
Fairouz Sher Ali ◽  
Hadeel Noori Saad ◽  
Falah Hassan Sarhan ◽  
Bushra Naaeem
Keyword(s):  
Cloud Computing ◽  
Mobile Networks ◽  
Resource Sharing ◽  
Keyword Search ◽  
Bloom Filter ◽  
Data Retrieval ◽  
Mobile Nodes ◽  
Sensitive Data ◽  
Privacy Concerns ◽  
Cloud Servers

<p>Cloud computing has become a revolutionary computing model which provides an economical and flexible strategy for resource sharing and data management. Due to privacy concerns, sensitive data has to be encrypted before being uploaded to the cloud servers. Over the last few years, several keyword searchable encryption works have been described in the literature. However, existing works mostly focus on secure searching using keyword and only retrieve Boolean results that are not yet adequate. On the other hand, poor-resources of mobile networks play an important role on all applications area nowadays. Mobile nodes mostly act as information retrieval end which make it important to address this problem. In this paper, we present a secure keyword search scheme based on the Bloom filter(SKS-BF), which enhances the system’s usability by allowing ranking based on the relevance score of the search results and retrieves the top most relevant files instead of retrieving all the files. Further, the Bloom filter (BFs) can accelerate a search process involving a large number of keywords. Extensive experiments and network simulation confirm the efficiency of our proposed schemes.</p>

scholarly journals A Secure Ciphertext Retrieval Scheme against Insider KGAs for Mobile Devices in Cloud Storage

2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Run Xie ◽  
Chanlian He ◽  
Dongqing Xie ◽  
Chongzhi Gao ◽  
Xiaojun Zhang
Keyword(s):  
Cloud Computing ◽  
Mobile Devices ◽  
Data Privacy ◽  
Security Analysis ◽  
Data Retrieval ◽  
Sensitive Data ◽  
Encrypted Data ◽  
Security Issues ◽  
Efficiency Comparison ◽  
Cloud Servers

With the advent of cloud computing, data privacy has become one of critical security issues and attracted much attention as more and more mobile devices are relying on the services in cloud. To protect data privacy, users usually encrypt their sensitive data before uploading to cloud servers, which renders the data utilization to be difficult. The ciphertext retrieval is able to realize utilization over encrypted data and searchable public key encryption is an effective way in the construction of encrypted data retrieval. However, the previous related works have not paid much attention to the design of ciphertext retrieval schemes that are secure against inside keyword-guessing attacks (KGAs). In this paper, we first construct a new architecture to resist inside KGAs. Moreover we present an efficient ciphertext retrieval instance with a designated tester (dCRKS) based on the architecture. This instance is secure under the inside KGAs. Finally, security analysis and efficiency comparison show that the proposal is effective for the retrieval of encrypted data in cloud computing.

scholarly journals A Multi-Keyword Searchable Encryption Scheme Based on Probability Trapdoor over Encryption Cloud Data

Information ◽  
2020 ◽  
Vol 11 (8) ◽  
pp. 394
Author(s):  
Yuan Ping ◽  
Wei Song ◽  
Zhili Zhang ◽  
Weiping Wang ◽  
Baocang Wang
Keyword(s):  
Keyword Search ◽  
Rapid Development ◽  
Data Retrieval ◽  
Computing Methods ◽  
Searchable Encryption ◽  
Encryption Scheme ◽  
Privacy Concerns ◽  
Cloud Data ◽  
And Performance ◽  
Cloud Servers

With the rapid development of cloud computing, massive data are transferred to cloud servers for storage and management savings. For privacy concerns, data should be encrypted before being uploaded. In the encrypted-domain (ED), however, many data computing methods working in the plain-domain are no longer applicable. Data retrieval has become a significant obstacle to cloud storage services. To break through this limitation, we propose a multi-keyword searchable encryption scheme by introducing probability trapdoors. Firstly, a keywords probability trapdoor is established to ensure that the scheme can resist indistinguishable attacks. Based on the keywords trapdoor, we present the keywords vector to make the scheme realize multi-keyword search in the process of data retrieval in the ED. Both security and performance analysis confirm the advantages of the proposed scheme in terms of search functionality and complexity.

scholarly journals Efficient verifiable fuzzy keyword search over encrypted data in cloud computing

2013 ◽  
Vol 10 (2) ◽  
pp. 667-684 ◽  
Author(s):  
Jianfeng Wang ◽  
Hua Ma ◽  
Qiang Tang ◽  
Jin Li ◽  
Hui Zhu ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Keyword Search ◽  
Efficiency Analysis ◽  
Sensitive Data ◽  
Encrypted Data ◽  
Proposed Model ◽  
Cloud Server ◽  
Encryption Schemes ◽  
User Data ◽  
Fuzzy Keyword Search

As cloud computing becomes prevalent, more and more sensitive data is being centralized into the cloud by users. To maintain the confidentiality of sensitive user data against untrusted servers, the data should be encrypted before they are uploaded. However, this raises a new challenge for performing search over the encrypted data efficiently. Although the existing searchable encryption schemes allow a user to search the encrypted data with confidentiality, these solutions cannot support the verifiability of searching result. We argue that a cloud server may be selfish in order to save its computation ability or bandwidth. For example, it may execute only a fraction of the search and returns part of the searching result. In this paper, we propose a new verifiable fuzzy keyword search scheme based on the symbol-tree which not only supports the fuzzy keyword search, but also enjoys the verifiability of the searching result. Through rigorous security and efficiency analysis, we show that our proposed scheme is secure under the proposed model, while correctly and efficiently realizing the verifiable fuzzy keyword search. The extensive experimental results demonstrate the efficiency of the proposed scheme.

scholarly journals eHealth Cloud Security Challenges: A Survey

2019 ◽  
Vol 2019 ◽  
pp. 1-15 ◽  
Author(s):  
Yazan Al-Issa ◽  
Mohammad Ashraf Ottom ◽  
Ahmed Tamrawi
Keyword(s):  
Cloud Computing ◽  
Resource Sharing ◽  
Energy Savings ◽  
Service Providers ◽  
Healthcare Providers ◽  
Cloud Service ◽  
Cloud Security ◽  
Security And Privacy ◽  
Healthcare Industry ◽  
Sensitive Data

Cloud computing is a promising technology that is expected to transform the healthcare industry. Cloud computing has many benefits like flexibility, cost and energy savings, resource sharing, and fast deployment. In this paper, we study the use of cloud computing in the healthcare industry and different cloud security and privacy challenges. The centralization of data on the cloud raises many security and privacy concerns for individuals and healthcare providers. This centralization of data (1) provides attackers with one-stop honey-pot to steal data and intercept data in-motion and (2) moves data ownership to the cloud service providers; therefore, the individuals and healthcare providers lose control over sensitive data. As a result, security, privacy, efficiency, and scalability concerns are hindering the wide adoption of the cloud technology. In this work, we found that the state-of-the art solutions address only a subset of those concerns. Thus, there is an immediate need for a holistic solution that balances all the contradicting requirements.

Privacy-Preserving Outsourced Similarity Search

2014 ◽  
Vol 25 (3) ◽  
pp. 48-71 ◽  
Author(s):  
Stepan Kozak ◽  
David Novak ◽  
Pavel Zezula
Keyword(s):  
Similarity Search ◽  
Data Privacy ◽  
System Analysis ◽  
Keyword Search ◽  
Evaluation Criteria ◽  
Similarity Index ◽  
Data Retrieval ◽  
Privacy Preserving ◽  
Scientific Data ◽  
Sensitive Data

The general trend in data management is to outsource data to 3rd party systems that would provide data retrieval as a service. This approach naturally brings privacy concerns about the (potentially sensitive) data. Recently, quite extensive research has been done on privacy-preserving outsourcing of traditional exact-match and keyword search. However, not much attention has been paid to outsourcing of similarity search, which is essential in content-based retrieval in current multimedia, sensor or scientific data. In this paper, the authors propose a scheme of outsourcing similarity search. They define evaluation criteria for these systems with an emphasis on usability, privacy and efficiency in real applications. These criteria can be used as a general guideline for a practical system analysis and we use them to survey and mutually compare existing approaches. As the main result, the authors propose a novel dynamic similarity index EM-Index that works for an arbitrary metric space and ensures data privacy and thus is suitable for search systems outsourced for example in a cloud environment. In comparison with other approaches, the index is fully dynamic (update operations are efficient) and its aim is to transfer as much load from clients to the server as possible.

scholarly journals Secure Multi-keyword Similarity Search Over Encrypted Data With Security Improvement

2021 ◽  
Vol 17 (2) ◽  
pp. 1-10
Author(s):  
Hussein Mohammed ◽  
Ayad Abdulsada
Keyword(s):  
Real World ◽  
Similarity Search ◽  
Keyword Search ◽  
Bloom Filter ◽  
Locality Sensitive Hashing ◽  
Real World Data ◽  
Encrypted Data ◽  
Search Results ◽  
Security Properties ◽  
Cloud Servers

Searchable encryption (SE) is an interesting tool that enables clients to outsource their encrypted data into external cloud servers with unlimited storage and computing power and gives them the ability to search their data without decryption. The current solutions of SE support single-keyword search making them impractical in real-world scenarios. In this paper, we design and implement a multi-keyword similarity search scheme over encrypted data by using locality-sensitive hashing functions and Bloom filter. The proposed scheme can recover common spelling mistakes and enjoys enhanced security properties such as hiding the access and search patterns but with costly latency. To support similarity search, we utilize an efficient bi-gram-based method for keyword transformation. Such a method improves the search results accuracy. Our scheme employs two non-colluding servers to break the correlation between search queries and search results. Experiments using real-world data illustrate that our scheme is practically efficient, secure, and retains high accuracy.

scholarly journals USING DIFFERENT SEARCHING SCHEMAS FOR FUZZY KEYWORD SEARCH OVER CLOUD DATA

2013 ◽  
pp. 41-44
Author(s):  
SYEDA FARHA SHAZMEEN ◽  
RANGARAJU DEEPIKA
Keyword(s):  
Cloud Computing ◽  
Data Privacy ◽  
Keyword Search ◽  
Text Search ◽  
Sensitive Data ◽  
Cloud Data ◽  
Fuzzy Search ◽  
Wild Card ◽  
Fuzzy Keyword Search ◽  
Search And Retrieval

Cloud Computing is a construct that allows you to access applications that actually reside at a location other than our computer or other internet-connected devices, Cloud computing uses internet and central remote servers to maintain data and applications, the data is stored in off-premises and accessing this data through keyword search. So there comes the importance of encrypted cloud data search Traditional keyword search was based on plaintext keyword search, but for protecting data privacy the sensitive data should be encrypted before outsourcing. Fuzzy keyword search greatly enhances system usability by returning the matching files; Fuzzy technique uses approximate full text search and retrieval. Three different Fuzzy Search Schemas, The wild card method, gram based method and tree traverse search scheme, are dicussed and also the efficiency of these algorithms is analyzed.

scholarly journals Verifying Fuzzy Keyword Search Over Cipher Text in Cloud Computing

2019 ◽  
Vol 9 (1) ◽  
pp. 3252-3257
Keyword(s):  
Cloud Computing ◽  
Keyword Search ◽  
Searchable Encryption ◽  
Knowledge User ◽  
Cloud Server ◽  
Encryption Schemes ◽  
Fuzzy Keyword Search ◽  
Word Search ◽  
To Come ◽  
Cloud Servers

To enhance the potency of knowledge looking out, most knowledge house owners store their knowledge files in numerous cloud servers within the kind of ciphertext. Thus, economical search victimization fuzzy keywords become a vital issue in such a cloud computing atmosphere. Searchable cryptography will support knowledge user to select and retrieve the cipher documents over encrypted cloud knowledge by keyword-based search. Most of the prevailing searchable encryption schemes solely specialize in the precise keyword search. When knowledge user makes writing system errors, these schemes fail to come to the results of interest. In searchable encryption, the cloud server may come to the invalid result to knowledge user for saving the computation price or alternative reasons. Therefore, these precise keyword search schemes notice very little sensible significance in real-world applications. So as to deal with these problems, we tend to propose unique verifiable fuzzy keyword search theme over encrypted cloud knowledge. We tend to propose a verifiable precise keyword search theme which extend this theme to the fuzzy keyword search theme. Here we tend to thus propose a system for fuzzy keyword sets rather than precise word search. This will help us drastically to reduce the costs and it also allows to have multi-users using the system simultaneously.

scholarly journals Variable Techniques for Ciphertext Retrieval through Encrypted Data

2019 ◽  
Vol 8 (12) ◽  
pp. 3477-3479
Keyword(s):  
Cloud Storage ◽  
Data Privacy ◽  
Large Scale ◽  
Keyword Search ◽  
Maximum Size ◽  
Data Retrieval ◽  
Sensitive Data ◽  
Data Utilization ◽  
Encrypted Data ◽  
Cloud Data

In recent years, Cloud computing provides strong grip and flexible access on outsource data, cloud storage, data privacy is major concern from to outsource their data, authenticated users are allowed to access this storage to prevent important and sensitive data. For data protection and utilization, we encrypt our sensitive data before outsourced our data because cannot trust storage server, are un-trusty but on other hand, data retrieval in encrypted format from cloud, is challenging task for data utilization, was encrypted from plaintext to ciphertext, when retrieves from cloud storage. However, searchable encryption schemes used Boolean search but they are unable to make data utilization for huge data and failed to handle multi-users access to retrieve ciphertext from cloud and user’s authentication. In this paper, we are using ranked keyword search over encrypted data by going k-documents at storage and using a Hierarchical Clustering Method is designed to guide more search semantics with an additional feature of making the system to cope the demand for fast ciphertext k-search in large scale environments explored the relevance score such as massive and big cloud data. This threshold splits the consequential clusters into sub-clusters until the necessity on the maximum size of cluster is reached. To make fetching search to be secure and privacy-preserving, it is built an index for searching on cloud data and retrieve the most relevant files from cloud. To defending privacy breaches from unauthorized users, users will go through authentication process and data retrieval time as well.

A Novel Proxy Re-Encryption with Keyword Search

2014 ◽  
Vol 631-632 ◽  
pp. 897-901
Author(s):  
Xian Yong Meng ◽  
Zhong Chen ◽  
Xiang Yu Meng
Keyword(s):  
Cloud Computing ◽  
Keyword Search ◽  
Privacy Preserving ◽  
Public Key ◽  
Sensitive Data ◽  
Private Key ◽  
Identity Based ◽  
Computing Environments

In this paper, a novel proxy re-encryption (PRE) scheme with keyword search is proposed, where only the ciphertext containing the keyword set by the delegator can be transformed by the semi-trusted proxy and then decrypted by delegatee. In the proposed scheme, the semi-trusted proxy can convert the ciphertext encrypted under the delegator’s public key into the ciphertext encrypted under the delegatee’s public key. In addition, only the delegatee’s email gateway with a trapdoor can test whether or not a given cipheretext containing some keyword, but can learn nothing else about the sensitive data of email. We proposed an identity-based proxy re-encryption with keyword search scheme, where the delegator and the delegatee extract keys from a trusted party called the key generator center (KGC), who generates public-private key pair for delegator and delegatee based on their identities. Meanwhile, the identity-based proxy re-encryption with keyword search scheme satisfies the properties of PRE including unidirectionality, multi-use and transparency. Additionally, the proposed scheme is efficient in terms of both computation and communication, and can realize security privacy preserving in cloud computing environments.

Sign in / Sign up

Export Citation Format

Share Document