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 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 Implementation of User Centric SSE for Privacy-Preserving and Enhancing Searching Efficiency in Cloud Environment

2019 ◽  
Vol 8 (10) ◽  
pp. 3093-3098
Keyword(s):  
Cloud Computing ◽  
Keyword Search ◽  
Financial Model ◽  
Encrypted Data ◽  
Searchable Symmetric Encryption ◽  
Cloud Server ◽  
User Data ◽  
And Storage ◽  
Cloud Users ◽  
Access Data

Cloud computing allows the users geographically located to access data and application from a cloud which follows the pay-as-you-go financial model. This technology provides a method to enhance the capabilities dynamically without having to spend in new infrastructure or training personnel. Cloud computing promises to offer reliable services to the customer through the construction of next-generation data centers and storage technology. With its wide advantages, cloud computing has emerged as fast emergent segments of the IT. Hence data security is a major concern for cloud users. One solution to this is that user can apply encryption techniques on data before sending it to the cloud server. But encrypted data limits the server’s capability to make plaintext keyword search. Keyword search functionality that can function over the encrypted data is desirable but no information about the searched keyword or the retrieved document should not compromise in this process. Our implementation of searchable symmetric encryption proves that it is not vulnerable to such things and preserves privacy of user data and query.

About Fully Homomorphic Encryption Improvement Techniques

2019 ◽  
Vol 10 (3) ◽  
pp. 1-20
Author(s):  
Ahmed El-Yahyaoui ◽  
Mohamed Daifr Ech-Cherif El Kettani
Keyword(s):  
Cloud Computing ◽  
Homomorphic Encryption ◽  
Quality Of Services ◽  
End User ◽  
Fully Homomorphic Encryption ◽  
Encrypted Data ◽  
Cloud Server ◽  
Encryption Schemes ◽  
Multiple Clients

Fully homomorphic encryption schemes (FHE) are a type of encryption algorithm dedicated to data security in cloud computing. It allows for performing computations over ciphertext. In addition to this characteristic, a verifiable FHE scheme has the capacity to allow an end user to verify the correctness of the computations done by a cloud server on his encrypted data. Since FHE schemes are known to be greedy in term of processing consumption and slow in terms of runtime execution, it is very useful to look for improvement techniques and tools to improve FHE performance. Parallelizing computations is among the best tools one can use for FHE improvement. Batching is a kind of parallelization of computations when applied to an FHE scheme, it gives it the capacity of encrypting and homomorphically processing a vector of plaintexts as a single ciphertext. This is used in the context of cloud computing to perform a known function on several ciphertexts for multiple clients at the same time. The advantage here is in optimizing resources on the cloud side and improving the quality of services provided by the cloud computing. In this article, the authors will present a detailed survey of different FHE improvement techniques in the literature and apply the batching technique to a promising verifiable FHE (VFHE) recently presented by the authors at the WINCOM17 conference.

scholarly journals EFFICIENT AND EXPRESSIVE KEYWORD SEARCH OVER ENCRYPTED DATA IN CLOUD

2020 ◽  
pp. 145-147
Author(s):  
Zeeshan Sharief
Keyword(s):  
Keyword Search ◽  
Bilinear Pairings ◽  
Searchable Encryption ◽  
Encrypted Data ◽  
Access Structures ◽  
Attribute Based Encryption ◽  
Cloud Server ◽  
Encryption Schemes ◽  
Boolean Formulas ◽  
Significant Performance

Searchable encryption allows a cloud server to conduct keyword search over encrypted data on behalf of the data users without learning the underlying plaintexts. However, most existing searchable encryption schemes only support single or conjunctive keyword search, while a few other schemes that can perform expressive keyword search are computationally inefficient since they are built from bilinear pairings over the composite-order groups. In this paper, we propose an expressive public-key searchable encryption scheme in the prime-order groups, which allows keyword search policies i.e., predicates, access structures to be expressed in conjunctive, disjunctive or any monotonic Boolean formulas and achieves significant performance improvement over existing schemes. We formally define its security and prove that it is selectively secure in the standard model. Also, we implement the proposed scheme using a rapid prototyping tool called Charm and conduct several experiments to evaluate it performance. The results demonstrate that our scheme is much more efficient than the ones built over the composite-order groups. INDEX TERMS - Searchable encryption, cloud computing, expressiveness, attribute-based encryption

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 Enabling Efficient Verifiable Fuzzy Keyword Search Over Encrypted Data in Cloud Computing

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 45725-45739 ◽  
Author(s):  
Xinrui Ge ◽  
Jia Yu ◽  
Chengyu Hu ◽  
Hanlin Zhang ◽  
Rong Hao
Keyword(s):  
Cloud Computing ◽  
Keyword Search ◽  
Encrypted Data ◽  
Fuzzy Keyword Search

scholarly journals Hybrid algorithm designed for handling remote integrity check mechanism over dynamic cloud environment

2018 ◽  
Vol 7 (2.4) ◽  
pp. 161
Author(s):  
Shakti Arora ◽  
Surjeet Dalal
Keyword(s):  
Cloud Computing ◽  
Low Cost ◽  
Remote Access ◽  
Communication Overhead ◽  
Security Model ◽  
Sensitive Data ◽  
Proposed Model ◽  
User Data ◽  
Result Analysis ◽  
Infrastructure Services

Cloud computing is the becoming the architecture information technology of next generation. Cloud computing provides dynamic set of resources for different category of users. Remote access of resources is available on the pay per basis. Cloud is using the storage, computing, infrastructure services according to the requirements. Cloud manages all the user data at distributed level and provides reliability, flexibility and on demand services to user with very low cost. In Now days scenario cloud applications and data over the cloud machines are increasing day by day which indirectly invites different threats for the crucial and sensitive data on cloud. In this paper, we proposed a security model that will give the computational enhancements in different modules data. The different proposed modules: 1) key generation 2) access control strong encryption 4) remote integrity checks. The proposed model enhances t confidentiality, authentication and integrity of data. From the result analysis, it has been concluded that computation and communication overhead are minimized as compared to previous model with higher efficiency achieved.  

Efficient fuzzy keyword search scheme over encrypted data in cloud computing based on Bed-tree index structure

2021 ◽  
pp. 1-13
Author(s):  
Dongping Hu ◽  
Aihua Yin
Keyword(s):  
Cloud Computing ◽  
Keyword Search ◽  
Hamming Distance ◽  
Security Analysis ◽  
Index Structure ◽  
Search Performance ◽  
Encrypted Data ◽  
Fuzzy Keyword Search ◽  
Work Security ◽  
And Performance

In cloud computing, enabling search directly over encrypted data is an important technique to effectively utilize encrypted data. Most of the existing techniques are focusing on fuzzy keyword search as it helps achieve more robust search performance by tolerating misspelling or typos of data users. Existing works always build index without classifying keywords in advance. They suffer from efficiency issue. Furthermore, Euclidean distance or Hamming distance is often chosen to evaluate strings’ similarity, ignoring prefixes matching and the influence of strings’ length on the accuracy. We propose an efficient fuzzy keyword search scheme with lower computation cost and higher accuracy to address the aforementioned problems. We employ the sub-dictionaries technique and the Bed-tree structure to build an index with three layers for achieving better search efficiency. With this index structure, the server could locate the keyword and could narrow the search scope quickly. The Jaro-Winkler distance is introduced to qualify the strings’ similarity by considering the prefixes matching and string length. The secure privacy mechanism is incorporated into the design of our work. Security analysis and performance evaluation demonstrate our scheme is more efficient compared to the existing one while guaranteeing security.

Sign in / Sign up

Export Citation Format

Share Document